Related papers: Affine Standard Lyndon words: A-type
Splint of root system of simple Lie algebra appears naturally in the study of (regular) embeddings of reductive subalgebras. It can be used to derive branching rules. Application of splint properties drastically simplifies calculations of…
Difference-difference systems are suggested corresponding to the Cartan matrices of any simple or affine Lie algebra. In the cases of the algebras $A_N$, $B_N$, $C_N$, $G_2$, $D_3$, $A_1^{(1)}$, $A_2^{(2)}$, $D^{(2)}_N$ these systems are…
We give manifestly positive Andrews-Gordon type series for the level 3 standard modules of the affine Lie algebra of type $A^{(1)}_2$. We also give corresponding bipartition identities, which have representation theoretic interpretations…
We say that an indecomposable Cartan matrix A with entries in the ground field of characteristic 0 is almost affine if the Lie sub(super)algebra determined by it is not finite dimensional or affine but the Lie (super)algebra determined by…
We demonstrate how formulas that express Hecke-type double-sums in terms of theta functions and Appell--Lerch functions -- the building blocks of Ramanujan's mock theta functions -- can be used to give general string function formulas for…
Classification of curves up to affine transformation in a finite dimensional space was studied by some different methods. In this paper, we achieve the exact formulas of affine invariants via the equivalence problem and in the view of…
In this paper, we establish a bijection between the infinite reduced words of an affine Weyl group and certain biclosed sets of its positive system and determine all finitely generated biclosed sets in the positive system of an affine Weyl…
We introduce the affine Vogan diagrams of complex simple Lie algebras. These are generalizations of Vogan diagrams, and we study the involutions represented by them. We apply these diagrams to study the symmetric pairs, in particular the…
We classify $n$-representation infinite algebras $\Lambda$ of type \~A. This type is defined by requiring that $\Lambda$ has higher preprojective algebra $\Pi_{n+1}(\Lambda) \simeq k[x_1, \ldots, x_{n+1}] \ast G$, where $G \leq…
We classify gradings by arbitrary abelian groups on the classical simple Lie superalgebras $P(n)$, $n \geq 2$, and on the simple associative superalgebras $M(m,n)$, $m, n \geq 1$, over an algebraically closed field: fine gradings up to…
In a previous paper {GN2} an effective solution of the lattice point counting problem in general domains in semisimple S-algebraic groups and affine symmetric varieties was established. The method relies on the mean ergodic theorem for the…
We give criteria for finite dimensionality or infinite dimensionality of the polynomial centralizer of the Lie algebra of a linear Lie group, in terms of invariants and relative invariants of the group. In the finite dimensional scenario…
In the present paper, we study the finite type invariants of Gauss words. In the Polyak algebra techniques, we reduce the determination of the group structure to transformation of a matrix into its Smith normal form and we give the…
We show that the Young tableaux theory and constructions of the irreducible representations of the Weyl groups of type A, B and D, Iwahori-Hecke algebras of types A, B, and D, the complex reflection groups G(r,p,n) and the corresponding…
We define a notion which contains numerous basic notions of Analysis as special cases, for example limit, continuity, differential, Riemann and Lebesgue integral, root and exponential functions. Properties like additivity or linearity of…
We study the sequences of numbers corresponding to lambda terms of given sizes, where the size is this of lambda terms with de Bruijn indices in a very natural model where all the operators have size 1. For plain lambda terms, the sequence…
We introduce a new combinatorial object called tower diagrams and prove fundamental properties of these objects. We also introduce an algorithm that allows us to slide words to tower diagrams. We show that the algorithm is well-defined only…
A standard assumption in the study of logarithmic structures is "fineness", but this assumption is not preserved by intersections, fiber products, and more general limits. We explain how a coherent logarithmic scheme $X$ has a natural…
We consider grammar-restricted exact learning of formulas and terms in finite variable logics. We propose a novel and versatile automata-theoretic technique for solving such problems. We first show results for learning formulas that…
We give a comprehensive survey of the theory of finite dimensional Lie algebras over an algebraically closed field of characteristic p>0 and announce that for p>3 the classification of finite dimensional simple Lie algebras is complete. Any…