Related papers: Combinatorics of canonical bases revisited: String…
This text is a detailed overview of the theories of W*-algebras and noncommutative integration, up to the Falcone-Takesaki theory of noncommutative Lp spaces over arbitrary W*-algebras, and its extension to noncommutative Orlicz spaces. The…
The generalized quantum group of type $A$ is an affine analogue of quantum group associated to a general linear Lie superalgebra, which appears in the study of solutions to the tetrahedron equation or the three-dimensional Yang-Baxter…
One cannot yet point to any firm string prediction. While many approximate string ground states are known with interesting properties, we do not have any argument that one or another describes what we observe around us, and for reasons…
The problem of reconstructing strings from substring information has found many applications due to its importance in genomic data sequencing and DNA- and polymer-based data storage. One practically important and challenging paradigm…
In this paper we develop combinatorial techniques for the case of string algebras with the aim to give a characterization of string complexes with infinite minimal projective resolution. These complexes will be called \textit{periodic…
This paper is motivated by a conjecture that BPP can be characterized in terms of polynomial-time nonadaptive reductions to the set of Kolmogorov-random strings. In this paper we show that an approach laid out in [Allender et al] to settle…
We study word reconstruction problems. Improving a previous result by P. Fleischmann, M. Lejeune, F. Manea, D. Nowotka and M. Rigo, we prove that, for any unknown word $w$ of length $n$ over an alphabet of cardinality $k$, $w$ can be…
We investigate the structure and reconstruction complexity of Manacher arrays. First, we establish a combinatorial lower bound, proving that the number of rooted tandem repeat trees with $n+1$ genes exceeds the number of distinct Manacher…
The set of permutations on a finite set can be given a lattice structure (known as the weak Bruhat order). The lattice structure is generalized to the set of words on a fixed alphabet $\Sigma = \{ x, y, z, ... \}$, where each letter has a…
In this paper convolutional codes with cyclic structure will be investigated. These codes can be understood as left principal ideals in a suitable skew-polynomial ring. It has been shown in [3] that only certain combinations of the…
Level-restricted paths play an important role in crystal theory. They correspond to certain highest weight vectors of modules of quantum affine algebras. We show that the recently established bijection between Littlewood--Richardson…
A typical crystal is a finite piece of a material which may be invariant under some point symmetry group. If it is a so-called intrinsic higher-order topological insulator or superconductor, then it displays boundary modes at hinges or…
We study the following rearrangement problem: Given $n$ words, rearrange and concatenate them so that the obtained string is lexicographically smallest (or largest, respectively). We show that this problem reduces to sorting the given words…
The solution term by term to the scattering of all consistent string theories is given. The moduli space of M-theory is derived and connects the various string theories. The solutions contain both the perturbative and non-perturbative…
We study the Ehrhart theory of hypersimplices of type C, as introduced by Lam and Postnikov for general crystallographic root systems. The $h^*$-polynomials of classical hypersimplices are known to relate to various Eulerian statistics on…
It is well known that many interesting realisations of string theories can be obtained via hamiltonian reduction from WZW models. I want to point out that string theories do in certain cases also provide the recipe to reconstruct the…
In this paper, we explore applications of combinatorics on words across various domains, including data compression, error detection, cryptographic protocols, and pseudorandom number generation. The examination of the theoretical…
We describe a general parameterized scheme of program and constraint analyses allowing us to specify both the program specialization method known as Turchin's supercompilation and Hmelevskii's algorithm solving the quadratic word equations.…
Moddings by cyclic permutation symmetries are performed in 4-dimensional strings, built up from N=2 coset models of the type $CP_m=SU(m+1)/SU(m)\times U(1)$. For some exemplifying cases, the massless chiral and antichiral states of $E_6$…
The mathematical idea of resurgence allows one to obtain nonperturbative information from the large-order behavior of perturbative expansions. This idea can be very fruitful in physics applications, in particular if one does not have access…