Related papers: Combinatorics of canonical bases revisited: String…
General revision. In particular the parts concerning involutive bases over rings have been significantly changed. In addition some proofs have been improved.
A certain topological field theory is shown to be equivalent to the compactified c=1 string. This theory is described in both Kazama-Suzuki coset and Landau-Ginzburg formulations. The genus-g partition function and genus-0 multi-tachyon…
A closed formula for the structure constants in the SL(2,C)/SU(2) WZNW model is derived by a method previously used in Liouville theory. With the help of a reflection amplitude that follows from the structure constants one obtains a…
Reduction trees are a way of encoding a substitution procedure dictated by the relations of an algebra. We use reduction trees in the subdivision algebra to construct canonical triangulations of flow polytopes which are shellable. We…
We study some reduced free products of C*-algebras with amalgamations. We give sufficient conditions for the positive cone of the K_0 group to be the largest possible. We also give sufficient conditions for simplicity and uniqueness of…
By requiring invariance directly under the Yangian symmetry, we rederive Beisert's quantum R-matrix, in a form that carries explicit dependence on the representation labels, the braiding factors, and the spectral parameters u_i. In this…
1. The 2-Toda lattice and its generic symmetries 2. A Larger class of symmetries for special initial conditions 3. Borel decomposition of Moment matrices, tau-functions and string-orthogonal polynomials 4. From string-orthogonal Polynomials…
We describe the embedding from the crystal of Kashiwara-Nakashima tableaux in type $D$ of an arbitrary shape into that of $\mathbf{i}$-Lusztig data associated to a family of reduced expressions $\mathbf{i}$ which are compatible with the…
Kolmogorov complexity of a finite binary word reflects both algorithmic structure and the empirical distribution of symbols appearing in the word. Words with symbol frequencies far from one half have smaller combinatorial richness and…
Kanerva's Binary Spatter Codes are reformulated in terms of geometric algebra. The key ingredient of the construction is the representation of XOR binding in terms of geometric product.
This work originates from the observation that today's state-of-the-art statistical language models are impressive not only for their performance, but also - and quite crucially - because they are built entirely from correlations in…
There is a natural analogue of weak Bruhat order on the involutions in any Coxeter group. The saturated chains of intervals in this order correspond to reduced words for a certain set of group elements called atoms. Brion gives a general…
The study of string models including both unoriented closed strings and open strings presents a number of new features when compared to the standard case of models of oriented closed strings only. We review some basic features of the…
The problem of string reconstruction from substring information has found many applications due to its relevance in DNA- and polymer-based data storage. One practically important and challenging paradigm requires reconstructing mixtures of…
Generalising a recent work of Dequ\^ene et al. on the connection between perfectly clustering words and band bricks over a particular family of gentle algebras, we characterise band bricks over string algebras whose underlying quiver is…
We review reformulation of the map from tensor product of crystals to the rigged configurations in terms of the energy function of affine crystals. Especially, we give intuitive picture of the inverse scattering formalism for the periodic…
Okounkov [Oko03] conjectured the log-concavity about the structure constants for many interesting basis from representation theory. For the cluster algebra, Gross, Hacking, Keel, Kontsevich [GHKK18] introduced the atomic theta basis. We…
The crystals for finite dimensional representations of sl(n+1) can be realized using Young tableaux. The infinity crystal on the other hand is naturally realized using multisegments, and there is a simple description of the embedding of…
We give a purely combinatorial proof of the positivity of the stabilized forms of the generalized exponents associated to each classical root system. In finite type A_{n-1}, we rederive the description of the generalized exponents in terms…
This paper introduces an algebraic combinatorial approach to simplicial cone decompositions, a key step in solving inhomogeneous linear Diophantine systems and counting lattice points in polytopes. We use constant term manipulation on the…