Related papers: Affine Standard Lyndon words: A-type
We construct certain Steinberg groups associated to extended affine Lie algebras and their root systems. Then by the integration methods of Kac and Peterson for integrable Lie algebras, we associate a group to every tame extended affine Lie…
$F-$Lie algebras are natural generalisations of Lie algebras (F=1) and Lie superalgebras (F=2). When $F>2$ not many finite-dimensional examples are known. In this paper we construct finite-dimensional $F-$Lie algebras $F>2$ by an inductive…
Motivated by applications to string processing, we introduce variants of the Lyndon factorization called inverse Lyndon factorizations. Their factors, named inverse Lyndon words, are in a class that strictly contains anti-Lyndon words, that…
Affine type systems are substructural type systems where copying of information is restricted, but discarding of information is permissible at all types. Such type systems are well-suited for describing quantum programming languages,…
System F, the polymorphic lambda calculus, features the principle of impredicativity: polymorphic types may be (explicitly) instantiated at other types, enabling many powerful idioms such as Church encoding and data abstraction.…
We introduce and begin to study Lie theoretical analogs of symplectic reflection algebras for a finite cyclic group, which we call "cyclic double affine Lie algebra". We focus on type A : in the finite (resp. affine, double affine) case, we…
Recursive algebraic construction of two infinite families of polynomials in $n$ variables is proposed as a uniform method applicable to every semisimple Lie group of rank $n$. Its result recognizes Chebyshev polynomials of the first and…
The fine abelian group gradings on the simple classical Lie algebras (including D4) over algebraically closed fields of characteristic 0 are determined up to equivalence. This is achieved by assigning certain invariant to such gradings that…
Affine difference algebraic groups are a generalization of affine algebraic groups obtained by replacing algebraic equations with algebraic difference equations. We show that the isomorphism theorems from abstract group theory have…
Consider a polynomial $F$ in $m$ variables and a finite point ensemble $S=S_1 \times ... \times S_m$. When given the leading monomial of $F$ with respect to a lexicographic ordering we derive improved information on the possible number of…
Selman and Kautz's work on ``knowledge compilation'' established how approximation (strengthening and/or weakening) of a propositional knowledge-base can be used to speed up query processing, at the expense of completeness. In this…
A Lyndon word is a non-empty word strictly smaller in the lexicographic order than any of its suffixes, except itself and the empty word. In this paper, we show how Lyndon words can be used in the distributed control of a set of n weak…
This paper has two main purposes. Firstly we generalise Ram's explicit construction of calibrated representations of the affine Hecke algebra to the multi-parameter case (including the non-reduced $BC_n$ case). We then derive the Plancherel…
Fomin and Zelevinsky show that a certain two-parameter family of rational recurrence relations, here called the (b,c) family, possesses the Laurentness property: for all b,c, each term of the (b,c) sequence can be expressed as a Laurent…
In this paper, we present a categorical approach to learning automata over words, in the sense of the $L^*$-algorithm of Angluin. This yields a new generic $L^*$-like algorithm which can be instantiated for learning deterministic automata,…
We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…
We prove that many sequences of positive numbers $(a_n)$ defined by finite linear difference equations $a_{n+k}=c_{k-1}a_{n+k-1}+...+c_0a_n$ with suitable non negative reals coefficients $c_i$ satisfy Bendford's Law on the first digit in…
We initiate a systematic study of the perfection of affine group schemes of finite type over fields of positive characteristic. The main result intrinsically characterises and classifies the perfections of reductive groups, and obtains a…
In the present note we suggest an affinization of a theorem by Kostrikin et.al. about the decomposition of some complex simple Lie algebras ${\cal G}$ into the algebraic sum of pairwise orthogonal Cartan subalgebras. We point out that the…
We describe a new algorithm for computing Whitney stratifications of complex projective varieties. The main ingredients are (a) an algebraic criterion, due to L\^e and Teissier, which reformulates Whitney regularity in terms of conormal…