Related papers: Informative Words and Discreteness
Let (\Pi,\Sigma) be a Coxeter system. An ordered list of elements in \Sigma and an element in \Pi determine a {\em subword complex}, as introduced in our paper on Gr\"obner geometry of Schubert polynomials (math.AG/0110058). Subword…
This paper studies decision problems for semigroups that are word-hyperbolic in the sense of Duncan & Gilman. A fundamental investigation reveals that the natural definition of a `word-hyperbolic structure' has to be strengthened slightly…
We prove a variety results on tensor product factorizations of finite dimensional Hopf algebras (more generally Hopf algebras satisfying chain conditions in suitable braided categories). The results are analogs of well-known results on…
We obtain a criterion for quasiconvexity of a subgroup of an amalgamated free product of two word hyperbolic groups along a virtually cyclic subgroup. The result provides a method of constructing new word hyperbolic group in class (Q), that…
We define for a topological group G and a family of subgroups F two versions for the classifying space for the family F, the G-CW-version E_F(G) and the numerable G-space version J_F(G). They agree if G is discrete, or if G is a Lie group…
In [2], while studying a relevant class of polyominoes that tile the plane by translation, i.e., double square polyominoes, the authors found that their boundary words, encoded by the Freeman chain coding on a four letters alphabet, have…
We investigate for which linear-algebraic groups (over the complex numbers or any local field) there exists subgroups which are dense in the Zariski topology, but discrete in the Hausdorff topology. For instance, such subgroups exist for…
We study the girth of Cayley graphs of finite classical groups G on random sets of generators. Our main tool is an essentially best possible bound we obtain on the probability that a given word w takes the value 1 when evaluated in G in…
Given a finite group with a generating subset there is a well-established notion of length for a group element given in terms of its minimal length expression as a product of elements from the generating set. Recently, certain quantities…
This paper studies the classes of semigoups and monoids with context-free and deterministic context-free word problem. First, some examples are exhibited to clarify the relationship between these classes and their connection with the…
Let $G$ be a compact Lie group. Suppose $g_1, \dots, g_k$ are chosen independently from the Haar measure on $G$. Let $\mathcal{A} = \cup_{i \in [k]} \mathcal{A}_i$, where, $\mathcal{A}_i := \{g_i\} \cup \{g_i^{-1}\}$. Let…
We survey a few of the many results now known about the self-distributivity law and selfdistributive structures, with a special emphasis on the associated word problems and the algorithms solving them in good cases.
We explore some connections between vectors of integers and integer partitions seen as bi-infinite words. This methodology enables us to give a combinatorial interpretation of the Macdonald identities for affine root systems of the seven…
In the paper we characterize the class of finite solvable groups by two-variable identities in a way similar to the characterization of finite nilpotent groups by Engel identities. More precisely, a sequence of words $u_1,...,u_n,... $ is…
Kac-Moody groups $G$ over $\mathbb{R}$ have been conjectured to occur as symmetry groups of supergravities in dimensions less than 3, and their integer forms $G(\mathbb{Z})$ are conjecturally U-duality groups. Mathematical descriptions of…
It is well known that every finite simple group can be generated by two elements and this leads to a wide range of problems that have been the focus of intensive research in recent years. In this survey article we discuss some of the…
We find generating functions for the number of words avoiding certain patterns or sets of patterns on at most 2 distinct letters and determine which of them are equally avoided. We also find the exact number of words avoiding certain…
We review some recent results in digital geometry obtained by using a combinatorics on words approach to discrete geometry. Motivated on the one hand by the well-known theory of Sturmian words which model conveniently discrete lines in the…
The word inference problem is to determine languages such that the information on the number of occurrences of those subwords in the language can uniquely identify a word. A considerable amount of work has been done on this problem, but the…
The main goal of this work is to establish a bijection between Dyck words and a family of Eulerian digraphs. We do so by providing two algorithms implementing such bijection in both directions. The connection between Dyck words and Eulerian…