Related papers: Affine Standard Lyndon words: A-type
The Chen-Fox-Lyndon theorem states that every finite word over a fixed alphabet can be uniquely factorized as a lexicographically nonincreasing sequence of Lyndon words. This theorem can be used to define the family of Lyndon words in a…
A foundational result in the theory of Lyndon words (words that are strictly earlier in lexicographic order than their cyclic permutations) is the Chen-Fox-Lyndon theorem which states that every word has a unique non-increasing…
The elementary affine lambda-calculus was introduced as a polyvalent setting for implicit computational complexity, allowing for characterizations of polynomial time and hyperexponential time predicates. But these results rely on type…
The Z-grading determined by a long simple root of an affine or finite type Lie algebra arises from an adjoint or cominuscule representation of a lower rank semi-simple complex Lie algebra. Analysis of the relationship between the grading…
We give Andrews-Gordon type series for the principal characters of the level 5 and 7 standard modules of the affine Lie algebra $A^{(2)}_{2}$. We also give conjectural series for some level 2 modules of $A^{(2)}_{13}$.
An infinite word is an infinite Lyndon word if it is smaller, with respect to the lexicographic order, than all its proper suffixes, or equivalently if it has infinitely many finite Lyndon words as prefixes. A characterization of binary…
Candelas and Font introduced the notion of a `top' as half of a three dimensional reflexive polytope and noticed that Dynkin diagrams of enhanced gauge groups in string theory can be read off from them. We classify all tops satisfying a…
In this paper we give a combinatorial parametrization of leading terms of defining relations for level $k$ standard modules for affine Lie algebra of type $C_{n}\sp{(1)}$. Using this parametrization we conjecture colored Rogers-Ramanujan…
We give an algebraic characterization of the tree languages that are defined by logical formulas using certain Lindstr\"om quantifiers. An important instance of our result concerns first-order definable tree languages. Our characterization…
We give another proof of a theorem of Fife - understood broadly as providing a finite automaton that gives a complete description of all infinite binary overlap-free words. Our proof is significantly simpler than those in the literature. As…
We consider the problem of classifying gradings by groups on a finite-dimensional algebra $A$ (with any number of multilinear operations) over an algebraically closed field. We introduce a class of gradings, which we call almost fine, such…
We introduce the notion of extended affine Lie superalgebras and investigate the properties of their root systems. Extended affine Lie algebras, invariant affine reflection algebras, finite dimensional basic classical simple Lie…
In this paper we describe a variation of the classical permutation decoding algorithm that can be applied to any affine-invariant code with respect to certain type of information sets. In particular, we can apply it to the family of…
In the present paper, we study a purely inseparable counterpart of Abhyankar's conjecture for the affine line in positive characteristic, and prove its validity for all the finite local non-abelian simple group schemes in characteristic…
Let $k$ be a field. In this paper, we introduce the notions of $\textit{reduction order}$ and $\textit{reduction-factorization}$ on words, and use them to show that any right or left Noetherian pointed Hopf algebra over $k$ is affine. This…
We propose a new type system for lambda-calculus ensuring that well-typed programs can be executed in polynomial time: Dual light affine logic (DLAL). DLAL has a simple type language with a linear and an intuitionistic type arrow, and one…
By affine arithmetic is meant the set of affine consequences of Peano arithmetic. This is a continuous theory which is studied in the framework of affine logic, a sublogic of continuous logic. Affine arithmetic is undecidable. Also, its…
The process of sorting the suffixes of a text plays a fundamental role in Text Algorithms. They are used for instance in the constructions of the Burrows-Wheeler transform and the suffix array, widely used in several fields of Computer…
Given a totally finite ordered alphabet $ A $, endowing the set of words over $ A $ with the alternating lexicographic order, we define a new class of Lyndon words. We study the fundamental properties of the associated symbolic dynamical…
We introduce new partial orders on the set $S^+_n$ of positive-definite matrices of dimension $n$ derived from the homogeneous geometry of $S^+_n$ induced by the natural transitive action of the general linear group $GL(n)$. The orders are…