Related papers: Word reading is a crystal morphism
In data dominated systems and applications, a concept of representing words in a numerical format has gained a lot of attention. There are a few approaches used to generate such a representation. An interesting issue that should be…
Morphic words are letter-to-letter images of fixed points $x$ of morphisms on finite alphabets. There are situations where these letter-to-letter maps do not occur naturally, but have to be replaced by a morphism. We call this a decoration…
By a covering of a group G we mean an epimorphism from a group F to G. Introducing the notion of strong covering as a covering pi:F-->G such that every automorphism of G is a projection via pi of an automorphism of F, the main aim of this…
Crystals form regular and robust structures that under extreme conditions can melt and recrystallize into different arrangements in a process that is called crystal metamorphism. While crystals exist due to the breaking of a continuous…
A morphism h is unambiguous with respect to a word w if there is no other morphism g that maps w to the same image as h. In the present paper we study the question of whether, for any given word, there exists an unambiguous 1-uniform…
Topological groupoids admit various types of morphisms. We push these notions to the level of continuous groupoid actions to obtain various types of groupoid action morphisms. Some dynamical properties and their relation to these morphisms…
In this paper, we give the rigidity theorem for a log morphism as an extension of a fixed scheme morphism. We also give several applications of the rigidity theorem.
We define a set of operations called crystal operations on matrices with entries either in {0,1} or in N. There are horizontal and vertical crystal operations, giving rise to two commuting structures of a crystal graph on these matrices.…
We present a new combinatorial and conjectural algorithm for computing the Mullineux involution for the symmetric group and its Hecke algebra. This algorithm is built on a conjectural property of crystal isomorphisms which can be rephrased…
This paper provides results on the modular representation theory of the supergroup $GL(m|n).$ Working over a field of arbitrary characteristic, we prove that the explicit combinatorics of certain crystal graphs describe the representation…
Dictionary learning is a versatile method to produce an overcomplete set of vectors, called atoms, to represent a given input with only a few atoms. In the literature, it has been used primarily for tasks that explore its powerful…
We count the number of occurrences of certain patterns in given words. We choose these words to be the set of all finite approximations of a sequence generated by a morphism with certain restrictions. The patterns in our considerations are…
A combinatorial code $\mathcal{C}$ is a collection of subsets of $[n]$, or equivalently a set of points in $\{0,1\}^n$. A morphism of codes is a map from one combinatorial code to another such that the coordinates of points in the image can…
We equip the categorified quantum group attached to a KLR algebra and an arbitrary choice of scalars with duality functor which is cyclic, that is, such that f=f^** for all 2-morphisms f. This is accomplished via a modified diagrammatic…
The word problem of a group is a very important question. The word problem in the braid group is of particular interest for topologists, algebraists and geometers. In previouse article we have looked at the braid group from a topological…
We study automorphism groups of formal matrix algebras. We also consider automorphisms of ordinary matrix algebras (in particular, triangular matrix algebras).
The free $\mathbb{Z}$-module generated from the set of non-trivial homotopy classes of closed curves on an oriented surface has the structure of Lie bialgebra by two operations, the Goldman bracket and Turaev cobracket. M. Chas gave a…
We give criteria for certain morphisms from an algebraic stack to a (not necessarily algebraic) stack to admit an (appropriately defined) scheme-theoretic image. We apply our criteria to show that certain natural moduli stacks of local…
Functor morphing provides a method to translate complex representations of automorphism groups of finite modules over finite rings to representations of automorphism groups of functors in some abelian category. In this paper we give an…
Weyl group multiple Dirichlet series and metaplectic Whittaker functions can be described in terms of crystal graphs. We present crystals as parameterized by Littelmann patterns and we give a survey of purely combinatorial constructions of…