Related papers: Super RSK-algorithms and super plactic monoid
Let the sign of a standard Young tableau be the sign of the permutation you get by reading it row by row from left to right, like a book. A conjecture by Richard Stanley says that the sum of the signs of all SYTs with n squares is 2^[n/2].…
We present a formula for trigonometric orthosymplectic $R$-matrices associated with any parity sequence, and establish their factorization into the ordered product of $q$-exponents parametrized by positive roots in the corresponding reduced…
For $i=1,\ldots,k$, let $\mathbf{G}_i$ be a connected, simply connected, semisimple algebraic group over some local field $\kappa_i$ of characteristic zero. Let $G_i=\mathbf{G}_i(\kappa_i)$ be the $\kappa_i$-points of $\mathbf{G}_i$ and…
A new and extensive formalism is developed for monads and galaxies in non-standard enlargements. It is shown that monads and galaxies can be manipulated using order-preserving and order-reversing set-to-set maps, and that set properties…
The vertices of a $k$-token graph of a graph $G$ correspond to $k$ indistinguishable tokens placed on $k$ different vertices of $G$. Changing some conditions on both the nature of the tokens and the number of tokens allowed in each vertex…
In this paper we develop techniques that eliminate the need of the Generalized Riemann Hypothesis (GRH) from various (almost all) known results about deterministic polynomial factoring over finite fields. Our main result shows that given a…
In the constrained planarity setting, we ask whether a graph admits a planar drawing that additionally satisfies a given set of constraints. These constraints are often derived from very natural problems; prominent examples are Level…
Coherent analyses of experimental results from LHC and ILC will allow us to draw a comprehensive and precise picture of the supersymmetric particle sector. Based on this platform the fundamental supersymmetric theory can be reconstructed at…
Arithmetical invariants---such as sets of lengths, catenary and tame degrees---describe the non-uniqueness of factorizations in atomic monoids. We study these arithmetical invariants by the monoid of relations and by presentations of the…
The Drinfeld-Sokolov construction of integrable hierarchies, as well as its generalizations, may be extended to the case of loop superalgebras. A sufficient condition on the algebraic data for the resulting hierarchy to be invariant under…
We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…
The groups G_{k,1} of Richard Thompson and Graham Higman can be generalized in a natural way to monoids, that we call M_{k,1}, and to inverse monoids, called Inv_{k,1}; this is done by simply generalizing bijections to partial functions or…
We generalize the supersymmetry method in Random Matrix Theory to arbitrary rotation invariant ensembles. Our exact approach further extends a previous contribution in which we constructed a supersymmetric representation for the class of…
We extend Grood's tableau construction of irreducible representations of the rook monoid and Steinberg's analogous result for the full transformation monoid. Our approach is characteristic-free and applies to any submonoid $\mathcal{M}(n)$…
In 2010, B. Rhoades proved that promotion together with the fake-degree polynomial associated with rectangular standard Young tableaux give an instance of the cyclic sieving phenomenon. We extend this result to all skew standard Young…
The syntactic monoid of a language is generalized to the level of a symmetric monoidal closed category $\mathcal D$. This allows for a uniform treatment of several notions of syntactic algebras known in the literature, including the…
The main result of this article is that we show that from supersymmetry we can generate new superintegrable Hamiltonians. We consider a particular case with a third order integral and apply the Mielnik's construction in supersymmetric…
We investigate the monoid of transformations that are induced by sequences of writing to and reading from a queue storage. We describe this monoid by means of a confluent and terminating semi-Thue system and study some of its basic…
Our main result is a limit shape theorem for the two-dimensional surface defined by a uniform random n-by-n square Young tableau. The analysis leads to a calculus of variations minimization problem that resembles the minimization problems…
In the paper we introduce a notion of the Bruck-Reilly $\lambda$-polycyclic extension of a monoid $S$ with a homomorphism $\theta$ which is an analogue of the Bruck-Reilly extension of a monoid $S$. We describe idempotens of the semigroup…