Related papers: Super RSK-algorithms and super plactic monoid
For a reductive group over a $p$-adic field, DeBacker gives a paramaterization of the conjugacy classes of maximal unramified tori using Bruhat-Tits theory. On the other hand, for unramified classical groups, Waldspurger gives a…
This paper proves that a plactic monoid of any finite rank will have decidable first order theory. This resolves other open decidability problems about the finite rank plactic monoids, such as the Diophantine problem and identity checking.…
This paper belongs to a group of work in the intersection of symbolic computation and group analysis aiming for the symbolic analysis of differential equations. The goal is to extract important properties without finding the explicit…
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 show how to construct a family of groups with simple commutator subgroups from aperiodic 1-vertex, finitely aligned higher rank graphs (which are, in fact, a class of cancellative monoids). Inverse semigroups form the intermediary…
We characterize compatible families of real-rooted polynomials, allowing both positive and negative leading coefficients. Our characterization naturally generalizes the same-sign characterization used by Chudnovsky and Seymour in their…
We establish a direct connection between the representation theories of Lie algebras and Lie superalgebras (of type A) via Fock space reformulations of their Kazhdan-Lusztig theories. As a consequence, the characters of finite-dimensional…
New bispectral polynomials orthogonal on a quadratic bi-lattice are obtained from a truncation of Wilson polynomials. Recurrence relation and difference equation are provided. The recurrence coefficients can be encoded in a perturbed…
The syntactic monoid of a language is generalized to the level of a symmetric monoidal closed category D. This allows for a uniform treatment of several notions of syntactic algebras known in the literature, including the syntactic monoids…
In this manuscript we show that two partial orders defined on the set of standard Young tableaux of shape $\alpha$ are equivalent. In fact, we give two proofs for the equivalence of the box order and the dominance order for {tableaux}. Both…
Let $\Lambda^{\ast}$ be the free monoid of (finite) words over a not necessarily finite alphabet $\Lambda$, which is equipped with some (partial) order. This ordering lifts to $\Lambda^{\ast}$, where it extends the divisibility ordering of…
We construct a relative version of the Crane-Yetter topological quantum field theory in four dimensions, from non-semisimple data. Our theory is defined relative to the classical $G$-gauge theory in five dimensions -- this latter theory…
We explicitly construct cut-and-join operators and their eigenfunctions -- the Super-Schur functions -- for the case of the affine super-Yangian $\mathsf{Y}(\widehat{\mathfrak{gl}}_{1|1})$. This is the simplest non-trivial (semi-Fock)…
In this paper we develop a Young diagram approach to constructing higher dimensional operators formed from massless superfields and their superderivatives in $\mathcal{N}=1$ supersymmetry. These operators are in one-to-one correspondence…
We study a general ansatz for an odd supersymmetric version of the Kronecker elliptic function, which satisfies the genus one Fay identity. The obtained result is used for construction of the odd supersymmetric analogue for the classical…
We propose a consistently algebraic formulation of the extended KP (supersymmetric) integrable -hierarchy systems. We exploit the results already established in [14] and which consist in a framework suspected to unify in a fascinating way…
We use Young's raising operators to give short and uniform proofs of several well known results about Schur polynomials and symmetric functions, starting from the Jacobi-Trudi identity.
Consider the lattice of all Young diagrams ordered by inclusion, and denote by Y its Hasse graph. Using the Pieri formula for Jack symmetric polynomials, we endow the edges of the graph Y with formal multiplicities depending on a real…
Previous constructions of supersymmetry for double field theory have relied on the so called strong constraint. In this paper, the strong constraint is relaxed and the theory is shown to possess supersymmetry once the generalised…
A result for subadditive ergodic cocycles is proved that provides more delicate information than Kingman's subadditive ergodic theorem. As an application we deduce a multiplicative ergodic theorem generalizing an earlier result of…