Related papers: Block decomposition of permutations and Schur-posi…
We study sorting by queues that can rearrange their content by applying permutations from a predefined set. These new sorting devices are called shuffle queues and we investigate those of them corresponding to sets of permutations defining…
A di-sk tree is a rooted binary tree whose nodes are labeled by $\oplus$ or $\ominus$, and no node has the same label as its right child. The di-sk trees are in natural bijection with separable permutations. We construct a combinatorial…
A permutation is said to be a square if it can be obtained by shuffling two order-isomorphic patterns. The definition is intended to be the natural counterpart to the ordinary shuffle of words and languages. In this paper, we tackle the…
We revisit a double-scaled limit of the superconformal index of ${\cal N}=2$ superconformal field theories (SCFTs) which generalizes the Schur index. The resulting partition function, $\hat {\cal Z}(q,\alpha)$, has a standard $q$-expansion…
In this article, we discuss the notion of partition of elements in an arbitrary Coxeter system $(W,S)$: a partition of an element $w$ is a subset $\mathcal P\subseteq W$ such that the left inversion set of $w$ is the disjoint union of the…
We consider symmetric (under the action of products of finite symmetric groups) real algebraic varieties and semi-algebraic sets, as well as symmetric complex varieties in affine and projective spaces, defined by polynomials of degrees…
We introduce a real-parameter refinement of the classical integer hierarchies underlying Schmidt number, block-positivity, and $k$-positivity for maps between matrix algebras. Starting from a compact family of $\alpha$-admissible unit…
We observe that certain numbers occurring in Schubert calculus for SL_n also occur as entries in intersection forms controlling decompositions of Soergel bimodules and parity sheaves in higher rank. These numbers grow exponentially. This…
We construct an encoding of finite strings over a fixed finite alphabet as natural numbers, based on a block partition of the Fibonacci sequence. Each position in the string selects one Fibonacci number from a dedicated block, with unused…
We initiate the study of sorting permutations using prefix block-interchanges, which exchange any prefix of a permutation with another non-intersecting interval. The goal is to transform a given permutation into the identity permutation…
We present an involution on set partitions that interchanges two statistics related to relative size of block entries and use it to establish an equidistribution on objects counted by the Bessel numbers.
We prove a large deviations principle for the empirical law of the block sizes of a uniformly distributed non-crossing partition. As an application we obtain a variational formula for the maximum of the support of a compactly supported…
We derive a generating function for the number of integer compositions of $n$ into $k$ parts (i.e., $k$-compositions of $n$) with a given number of inversions, and obtain similar results for $k$-compositions of $n$ with a given number of…
The decomposition matrix of a finite group in prime characteristic p records the multiplicities of its p-modular irreducible representations as composition factors of the reductions modulo p of its irreducible representations in…
We determine the decomposition numbers of the partition algebra when the characteristic of the ground field is zero or larger than the degree of the partition algebra. This will allow us to determine for which exact values of the parameter…
For a positive integer $n$, a collection $S$ of subsets of $[n]=\{1,\ldots,n\}$ is called symmetric if $X\in S$ implies $X^\ast\in S$, where $X^\ast:=\{i\in [n]\colon n-i+1\notin X\}$ (the involution $\ast$ was introduced by Karpman).…
We introduce block maps for subfactors and study their dynamic systems. We prove that the limit points of the dynamic system are positive multiples of biprojections and zero. For the Z2 case, the asymptotic phenomenon of the block map…
A classical result of MacMahon states that inversion number and major index have the same distribution over permutations of a given multiset. In this work we prove a strengthening of this theorem originally conjectured by Haglund. Our…
Let $\mathcal I_n$ and $\mathcal J_n$ denote the set of involutions and fixed-point free involutions of $\{1, \dots, n\}$, respectively, and let $\text{des}(\pi)$ denote the number of descents of the permutation $\pi$. We prove a conjecture…
We prove the conjecture of A. Postnikov that (A) the number of regions in the inversion hyperplane arrangement associated with a permutation $w\in \Sn$ is at most the number of elements below $w$ in the Bruhat order, and (B) that equality…