Search results for "Combinatorics"
showing 10 items of 1770 documents
r-Indexing the eBWT
2021
The extended Burrows Wheeler Transform (\(\mathrm {eBWT}\)) was introduced by Mantaci et al. [TCS 2007] to extend the definition of the \(\mathrm {BWT}\) to a collection of strings. In our prior work [SPIRE 2021], we give a linear-time algorithm for the \(\mathrm {eBWT}\) that preserves the fundamental property of the original definition (i.e., the independence from the input order). The algorithm combines a modification of the Suffix Array Induced Sorting (SAIS) algorithm [IEEE Trans Comput 2011] with Prefix Free Parsing [AMB 2019; JCB 2020]. In this paper, we show how this construction algorithm leads to r-indexing the \(\mathrm {eBWT}\), i.e., run-length encoded \(\mathrm {eBWT}\) and \(…
Color Image Segmentation: The Hypergraph Framework
2006
International audience; Color Image Segmentation: The Hypergraph Framework
On complete metric spaces containing the Sierpinski curve
1998
It is proved that a complete metric space topologically contains the Sierpiński universal plane curve if and only if it has a subset with so-called bypass property, i.e. it has a subset K K containing an arc such that for each a ∈ K a\in K and for each open arc A ⊂ K A\subset K with a ∈ A a\in A , there exists an arbitrary small arc in K ∖ { a } K\setminus \{a\} joining the two components of A ∖ { a } A\setminus \{a\} .
A Common Characterization of Finite Projective Spaces and Affine Planes
1981
Let S be a finite linear space for which there is a non-negative integer s such that for any two disjoint lines L, L' of S and any point p outside L and L' there are exactly s lines through p intersecting the two lines L and L'. We prove that one of the following possibilities occurs: (i) S is a generalized projective space, and if the dimension of S is at least 4, then any line of S has exactly two points. (ii) S is an affine plane, an affine plane with one improper point, or a punctured projective plane. (iii) S is the Fano-quasi -plane.
Presentations for the punctured mapping class groups in terms of Artin groups
1999
Consider an oriented compact surface F of positive genus, possibly with boundary, and a finite set P of punctures in the interior of F, and define the punctured mapping class group of F relatively to P to be the group of isotopy classes of orientation-preserving homeomorphisms h: F-->F which pointwise fix the boundary of F and such that h(P) = P. In this paper, we calculate presentations for all punctured mapping class groups. More precisely, we show that these groups are isomorphic with quotients of Artin groups by some relations involving fundamental elements of parabolic subgroups.
Weighted pointwise Hardy inequalities
2009
We introduce the concept of a visual boundary of a domain �¶ �¼ Rn and show that the weighted Hardy inequality �¶ |u|pd�¶ �A.p C �¶ |�Þu|pd�¶ �A, where d�¶(x) = dist(x, �Ý�¶), holds for all u �¸ C �� 0 (�¶) with exponents �A < �A0 when the visual boundary of �¶ is sufficiently large. Here �A0 = �A0(p, n, �¶) is explicit, essentially sharp, and may even be greater than p . 1, which is the known bound for smooth domains. For instance, in the case of the usual von Koch snowflake domain the sharp bound is shown to be �A0 = p . 2 + �E, with �E = log 4/ log 3. These results are based on new pointwise Hardy inequalities.
Pointwise characterizations of Hardy-Sobolev functions
2006
We establish simple pointwise characterizations of functions in the Hardy-Sobolev spaces within the range n/(n+1)<p <=1. In addition, classical Hardy inequalities are extended to the case p <= 1.
A pointwise selection principle for metric semigroup valued functions
2008
Abstract Let ∅ ≠ T ⊂ R , ( X , d , + ) be an additive commutative semigroup with metric d satisfying d ( x + z , y + z ) = d ( x , y ) for all x , y , z ∈ X , and X T the set of all functions from T into X . If n ∈ N and f , g ∈ X T , we set ν ( n , f , g , T ) = sup ∑ i = 1 n d ( f ( t i ) + g ( s i ) , g ( t i ) + f ( s i ) ) , where the supremum is taken over all numbers s 1 , … , s n , t 1 , … , t n from T such that s 1 ⩽ t 1 ⩽ s 2 ⩽ t 2 ⩽ ⋯ ⩽ s n ⩽ t n . We prove the following pointwise selection theorem: If a sequence of functions { f j } j ∈ N ⊂ X T is such that the closure in X of the set { f j ( t ) } j ∈ N is compact for each t ∈ T , and lim n → ∞ ( 1 n lim N → ∞ sup j , k ⩾ N , j…
Minimal Absent Words in Rooted and Unrooted Trees
2019
We extend the theory of minimal absent words to (rooted and unrooted) trees, having edges labeled by letters from an alphabet \(\varSigma \) of cardinality \(\sigma \). We show that the set \(\text {MAW}(T)\) of minimal absent words of a rooted (resp. unrooted) tree T with n nodes has cardinality \(O(n\sigma )\) (resp. \(O(n^{2}\sigma )\)), and we show that these bounds are realized. Then, we exhibit algorithms to compute all minimal absent words in a rooted (resp. unrooted) tree in output-sensitive time \(O(n+|\text {MAW}(T)|)\) (resp. \(O(n^{2}+|\text {MAW}(T)|)\) assuming an integer alphabet of size polynomial in n.
On Codimensions of Algebras with Involution
2020
Let A be an associative algebra with involution ∗ over a field F of characteristic zero. One associates to A, in a natural way, a numerical sequence \(c^{\ast }_n(A),\)n = 1, 2, …, called the sequence of ∗-codimensions of A which is the main tool for the quantitative investigation of the polynomial identities satisfied by A. In this paper we focus our attention on \(c^{\ast }_n(A),\)n = 1, 2, …, by presenting some recent results about it.