Related papers: Combinatorics of canonical bases revisited: String…
Let $R$ be a unital $*$-ring. For any $a,w,b\in R$, we apply the defined $w$-core inverse to define a new class of partial orders in $R$, called the $w$-core partial order. Suppose $a,b\in R$ are $w$-core invertible. We say that $a$ is…
Conditional preference statements have been used to compactly represent preferences over combinatorial domains. They are at the core of CP-nets and their generalizations, and lexicographic preference trees. Several works have addressed the…
The tensor powers of the vector representation associated to an infinite rank quantum group decompose into irreducible components with multiplicities independant of the infinite root system considered. Although the irreducible modules…
We generalize the brick polytope of V. Pilaud and F. Santos to spherical subword complexes for finite Coxeter groups. This construction provides polytopal realizations for a certain class of subword complexes containing all cluster…
The reductions of a square complex matrix A to its canonical forms under transformations of similarity, congruence, or *congruence are unstable operations: these canonical forms and reduction transformations depend discontinuously on the…
In 1976, King defined certain tableaux model, called King tableaux in this paper, counting weight multiplicities of irreducible representation of the symplectic group $Sp(2m)$ for a given dominant weight. Since Kashiwara defined crystals,…
Quantum physics has revealed many interesting formal properties associated with the algebra of two operators, A and B, satisfying the partial commutation relation AB-BA=1. This study surveys the relationships between classical combinatorial…
In this paper, we continue the development of a new combinatorial model for the irreducible characters of a complex semisimple Lie group. This model, which will be referred to as the alcove path model, can be viewed as a discrete…
Starting with an algorithm to turn lists into full trees which uses non-obvious invariants and partial functions, we progressively encode the invariants in the types of the data, removing most of the burden of a correctness proof. The…
This article is based on a talk given at the ``Strings'97'' conference. It discusses the search for the universality class of confining strings. The key ingredients include the loop equations, the zigzag symmetry, the non-linear…
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…
Using the Baum-Connes conjecture with coefficients, we develop a K-theory formula for reduced C*-algebras of strongly $0$-$E$-unitary inverse semigroups, or equivalently, for certain reduced partial crossed products. In the case of…
We study the asymptotics and fine-scale behavior of quantitative combinatorial measures of infinite words and related dynamical and algebraic structures. We construct infinite recurrent words $w$ whose complexity functions $p_w(n)$ are…
We confront the problem of giving a fundamental definition to perturbative string theory in spacetimes with totally compact space (taken to be a torus for simplicity, though the nature of the problem is very general) and non-compact time.…
In the recent papers with Masaki Kashiwara, the author introduced the notion of symmetric crystals and presented the Lascoux-Leclerc-Thibon-Ariki type conjectures for the affine Hecke algebras of type $B$. Namely, we conjectured that…
Kitaev, Potapov, and Vajnovszki [On shortening u-cycles and u-words for permutations, Discrete Appl. Math, 2019] described how to shorten universal words for permutations, to length $n!+n-1-i(n-1)$ for any $i \in [(n-2)!]$, by introducing…
This paper investigates the connections between combinatorial design theory and the creation of new forms of poetry through a specific combinatorial structure called Steiner triple systems. We introduce five original poems constructed using…
Inhomogeneous lattice paths are introduced as ordered sequences of rectangular Young tableaux thereby generalizing recent work on the Kostka polynomials by Nakayashiki and Yamada and by Lascoux, Leclerc and Thibon. Motivated by these works…
In the context of varieties of representations of arbitrary quivers, possibly carrying loops, we define a generalization of Lusztig Lagrangian subvarieties. From the combinatorial study of their irreducible components arises a structure…
A reformulation of the path length of binary search trees is given in terms of permutations, allowing to extend the definition to the instance of words, where the letters are obtained by independent geometric random variables (with…