Related papers: Word reading is a crystal morphism
We study cells in generalised Bott-Samelson varieties for type C. These cells are parametrised by certain galleries in the affine building. We define a set of readable galleries - we show that the closure in the affine Grassmannian…
A graph $G=(V,E)$ is word-representable if and only if there exists a word $w$ over the alphabet $V$ such that letters $x$ and $y$, $x\neq y$, alternate in $w$ if and only if $xy\in E$. A split graph is a graph in which the vertices can be…
Morphisms are homomorphisms under the concatenation operation of the set of words over a finite set. Changing the elements of the finite set does not essentially change the morphism. We propose a way to select a unique representing member…
We define the notion of a sheaf over a complex of groups. As an application, we give a criterion for the developability of a complex of groups. When the developability is witnessed by a morphism to $\mathrm{GL}(V)$ for some $V$, our…
Crystals are paradigms of ordered structures. While order was once seen as synonymous with lattice periodic arrangements, the discoveries of incommensurate crystals and quasicrystals led to a more general perception of crystalline order,…
Elements of the free group define interesting maps, known as word maps, on groups. It was previously observed by Lubotzky that every subset of a finite simple group that is closed under endomorphisms occurs as the image of some word map. We…
We associate each endomorphism of a finite cyclic group with a digraph and study many properties of this digraph, including its adjacent matrix and automorphism group.
The family of graphs of reduced words of a certain subcollection of permutations in the union $\cup_{n\geq 4}\frak{S}_{n}$ of symmetic groups is investigated. The subcollection is characterised by the hook cycle type $(n-2,1,1)$ with…
This paper was motivated by the articles "Same or different - that is the question" in CrystEngComm (July 2020) and "Change to the definition of a crystal" in the IUCr newsletter (June 2021). Experimental approaches to crystal comparisons…
A morphic word is obtained by iterating a morphism to generate an infinite word, and then applying a coding. We characterize morphic words with polynomial growth in terms of a new type of infinite word called a $\textit{zigzag word}$. A…
We characterize the words that can be mapped to arbitrarily high powers by injective morphisms. For all other words, we prove a linear upper bound for the highest power that they can be mapped to, and this bound is optimal up to a constant…
In this article we give two different ways of representations of circular words. Representations with tuples are intended as a compact notation, while representations with trees give a way to easily process all conjugates of a word. The…
A subset of a group is characteristic if it is invariant under every automorphism of the group. We study word length in fundamental groups of closed hyperbolic surfaces with respect to characteristic generating sets consisting of a finite…
The paper presents a linguistic and computational model aiming at making the morphological structure of the lexicon emerge from the formal and semantic regularities of the words it contains. The model is word-based. The proposed…
We characterize words which cluster under the Burrows-Wheeler transform as those words $w$ such that $ww$ occurs in a trajectory of an interval exchange transformation, and build examples of clustering words.
We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…
We introduce the notion of unavoidable (complete) sets of word patterns, which is a refinement for that of words, and study certain numerical characteristics for unavoidable sets of patterns. In some cases we employ the graph of pattern…
A classical result by K.B. Lee states that every group morphism between almost crystallographic groups is induced by an affine map on the nilpotent Lie group whereon these groups by definition act. It is the main technique for studying…
We say $x \in \{0,1,2 \}^{\NN}$ is a word with Sturmian erasures if for any $a\in \{0,1,2 \}$ the word obtained erasing all $a$ in $x$ is a Sturmian word. A large family of such words is given coding trajectories of balls in the game of…
This survey paper aims at providing a "literary" anthology of mathematical morphology on graphs. It describes in the English language many ideas stemming from a large number of different papers, hence providing a unified view of an active…