Related papers: Word reading is a crystal morphism
We study infinite words fixed by a morphism and their derived words. A derived word is a coding of return words to a factor. We exhibit two examples of sets of morphisms which are closed under derivation --- any derived word with respect to…
The Mullineux map is a combinatorial function on partitions which describes the effect of tensoring a simple module for the symmetric group in characteristic $p$ with the one-dimensional sign representation. It can also be interpreted as an…
The avoidability, or unavoidability of patterns in words over finite alphabets has been studied extensively. A word (pattern) over a finite set is said to be unavoidable if, for all but finitely many words, there exists a morphism mapping…
Word clouds are a popular tool for visualizing documents, but they are not a good tool for comparing documents, because identical words are not presented consistently across different clouds. We introduce the concept of word storms, a…
We consider word maps and word maps with constants on a simple algebraic group. We present results on the images of such maps, in particular, we prove a theorem on the dominance of general word maps with constants, which can be viewed as an…
We reformulate Fourier-space crystallography in the language of cohomology of groups. Once the problem is understood as a classification of linear functions on the lattice, restricted by a particular group relation, and identified by gauge…
We study possibilities for semantic and syntactic rigidity, i.e., the rigidity with respect to automorphism group and with respect to definable closure. Variations of rigidity and their degrees are studied in general case, for special…
In this paper, we analyze the density of the Fibonacci word and its derived forms by examining the morphisms associated with each. It offers a comparative analysis of the density of Fibonacci numbers alongside other words derived from…
Morphisms, structure preserving maps, are everywhere in Mathematics as useful tools for thinking and problem solving, or as objects to study. Here, we argue that the idea of operations being compatible across two domains goes beyond its…
Given a category, one may construct slices of it. That is, one builds a new category whose objects are the morphisms from the category with a fixed codomain and morphisms certain commutative triangles. If the category is a groupoid, so that…
According to classical nucleation theory, a crystal grows from a small nucleus that already bears the symmetry of its end phase - but experiments with colloids now reveal that, from an amorphous precursor, crystallites with different…
Perfectly clustering words are one of many possible generalizations of Christoffel words. In this article, we propose a factorization of a perfectly clustering word on a $n$ letters alphabet into a product of $n-1$ palindromes with a letter…
Crystallization is a key step in macromolecular structure determination by crystallography. While a robust theoretical treatment of the process is available, due to the complexity of the system, the experimental process is still largely one…
Let $f:X \to Y$ be a proper morphism of normal varieties with $f_*\mathcal{O}_X = \mathcal{O}_Y$. If $X$ is toric, then $Y$ is toric and $f$ is a toric morphism for some toric structures on $X$ and $Y$.
Nucleation is an activated process in which the system has to overcome a free energy barrier in order for a first-order phase transition between the metastable and the stable phases to take place. In the liquid-to-solid transition the…
We say that a family $\mathcal{W}$ of strings over $\Sigma^+$ forms a Unique Maximal Factorization Family (UMFF) if and only if every $w \in \mathcal{W}$ has a unique maximal factorization. Further, an UMFF $\mathcal{W}$ is called a…
We study word maps with constants on symmetric groups. Even though there are mixed identities of bounded length that are valid for all symmetric groups, we show that no such identities hold in a metric sense. Moreover, we prove that word…
It is shown that the big free group (the set of countably-long words over a countable alphabet) is almost free, in the sense that any function from the alphabet to a compact topological group factors through a homomorphism. This statement…
Visualization refers to our ability to create an image in our head based on the text we read or the words we hear. It is one of the many skills that makes reading comprehension possible. Convolutional Neural Networks (CNN) are an excellent…
We prove that there exists a functorial correspondence between MV-algebras and partially cyclically ordered groups which are wound round of lattice-ordered groups. It follows that some results about cyclically ordered groups can be stated…