Related papers: Shuffling matrices, Kronecker product and Discrete…
Consider a finite sequence of permutations of the elements 1,...,n, with the property that each element changes its position by at most 1 from any permutation to the next. We call such a sequence a tangle, and we define a move of element i…
We define and study the shuffle algebra $Sh_{m|n}$ of the quantum toroidal algebra $\mathcal E_{m|n}$ associated to Lie superalgebra $\mathfrak{gl}_{m|n}$. We show that $Sh_{m|n}$ contains a family of commutative subalgebras $\mathcal…
Let $\Gamma$ be a finite, undirected, connected, simple graph. We say that a matching $\mathcal{M}$ is a \textit{permutable $m$-matching} if $\mathcal{M}$ contains $m$ edges and the subgroup of $\text{Aut}(\Gamma)$ that fixes the matching…
In 2005 J.L. Waldspurger proved the following theorem: given a finite real reflection group $W$, the closed positive root cone is tiled by the images of the open weight cone under the action of the linear transformations $id-w$. Shortly…
This article is devoted to the study of monoids which can be endowed with a shuffle product with coefficients in a semiring. We show that, when the multiplicities do not belong to a ring with prime characteristic, such a monoid is a monoid…
We present a novel class of real symmetric matrices in arbitrary dimension $d$, linearly dependent on a parameter $x$. The matrix elements satisfy a set of nontrivial constraints that arise from asking for commutation of pairs of such…
In card-based cryptography, a deck of physical cards is used to achieve secure computation. A shuffle, which randomly permutes a card-sequence along with some probability distribution, ensures the security of a card-based protocol. The…
We undertake a detailed investigation into the structure of permutations in monotone grid classes whose row-column graphs do not contain components with more than one cycle. Central to this investigation is a new decomposition, called the…
We study a commutation pattern in which two affine families commute completely across the two families while each family retains internal noncommutativity. For one-dimensional affine groups over finite commutative rings, we prove a…
If every element of a matrix group is similar to a permutation matrix, then it is called a permutation-like matrix group. References [4] and [5] showed that, if a permutation-like matrix group contains a maximal cycle of length equal to a…
We find a non-trivial representation of the symmetric group $S_n$ on the $n$-fold Deligne product $\mathcal{C}^{\boxtimes n}$ of a modular tensor category $\mathcal{C}$ for any $n \geq 2$. This is accomplished by checking that a particular…
Kronecker sequences $(k \alpha \mod 1)_{k=1}^{\infty}$ for some irrational $\alpha > 0$ have played an important role in many areas of mathematics. It is possible to associate to each finite segment $(k \alpha \mod 1)_{k=1}^{n}$ a…
This is a note for constructing fundamental invariants and computing the Hilbert series of the invariant subalgebras of tensor products of polynomial rings under the action by a direct product of symmetric groups. Our computation relies on…
We construct a categorification of the modular data associated with every family of unipotent characters of the spetsial complex reflection group $G(d,1,n)$. The construction of the category follows the decomposition of the Fourier matrix…
The second author had previously obtained explicit generating functions for moments of characteristic polynomials of permutation matrices (n points). In this paper, we generalize many aspects of this situation. We introduce random shifts of…
We study a class of matrices with noncommutative entries, which were first considered by Yu. I. Manin in 1988 in relation with quantum group theory. They are defined as "noncommutative endomorphisms" of a polynomial algebra. More explicitly…
Deligne's category $\underline{{\rm Rep}}(S_t)$ is a tensor category depending on a parameter $t$ "interpolating" the categories of representations of the symmetric groups $S_n$. We construct a family of categories $\mathcal{C}_\lambda$…
A matrix group is said to be permutation-like if any matrix of the group is similar to a permutation matrix. G. Cigler proved that, if a permutation-like matrix group contains a normal cyclic subgroup which is generated by a maximal cycle…
Shuffle algebras are monoids for an unconvential monoidal category structure on graded vector spaces. We present two homological results on shuffle algebras with monomial relations, and use them to prove exact and asymptotic results on…
We apply symmetric function theory to study random processes formed by singular values of products of truncations of Haar distributed symplectic and orthogonal matrices. These product matrix processes are degenerations of Macdonald…