相关论文: Descent sets of cyclic permutations in types B and…

Let $H$ be a permutation group on a set $\Lambda$, which is permutationally isomorphic to a finite alternating or symmetric group $A_n$ or $S_n$ acting on the $k$-element subsets of points from $\{1,\ldots,n\}$, for some arbitrary but fixed…

The large Schroder numbers are known to count several classes of permutations avoiding two 4-letter patterns. Here we show they count another family of permutations, those whose left to right minima decomposition, when reversed, is…

We show that the \s{\phi}-labeled Thompson groups and the twisted Brin--Thompson groups are boundedly acyclic. This allows us to prove several new embedding results for groups. First, every group of type $F_n$ embeds quasi-isometrically…

The subject of pattern avoiding permutations has its roots in computer science, namely in the problem of sorting a permutation through a stack. A formula for the number of permutations of length n that can be sorted by passing it twice…

We study the factorizations of the permutation $(1,2,...,n)$ into $k$ factors of given cycle types. Using representation theory, Jackson obtained for each $k$ an elegant formula for counting these factorizations according to the number of…

We define a notion of vexillary signed permutation in types B, C, and D, corresponding to natural degeneracy loci for vector bundles with symmetries of those types. We show that the classes of these loci are given by explicit Pfaffian…

Here we give a combinatorial interpretation of Solomon's rule for multiplication in the descent algebra of Weyl groups of type $D$, $\Sigma D_n$. From here we show that $\Sigma D_n$ is a homomorphic image of the descent algebra of the…

Recursive permutations whose cycles are the classes of a decidable equivalence relation are studied; the set of these permutations is called $\mathrm{Perm}$, the group of all recursive permutations $\mathcal{G}$. Multiple equivalent…

Let $k$ be a field of characteristic $p$, let $P$ be a finite $p$- group, where $p$ is an odd prime, and let $D(P)$ be the Dade group of endo-permutation $kP$-modules. It is known that $D(P)$ is detected via deflation--restriction by the…

Elizalde (2011) characterized which permutations can be obtained by ordering consecutive elements in the trajectories of (positive) beta-transformations and beta-shifts. We prove similar results for negative bases beta.

We establish a bijection between the set of rigged configurations and the set of tensor products of Kirillov--Reshetikhin crystals of type $D^{(1)}_n$ in full generality. We prove the invariance of rigged configurations under the action of…

Let $R$ be a commutative ring with unity. Consider the twisted Chevalley group $G_{\pi, \sigma} (\Phi, R)$ of type $\phi$ over $R$ and its elementary subgroup $E'_{\pi, \sigma} (\Phi, R)$. This paper investigates the normalizers of…

We examine the large $N$ 1/4-BPS spectrum of the symmetric orbifold CFT Sym$^N(M)$ deformed to the supergravity point in moduli space for $M= K3$ and $T^4$. We consider refinement under both left- and right-moving $SU(2)_R$ symmetries of…

A family F of permutations of the vertices of a hypergraph H is called "pairwise suitable" for H if, for every pair of disjoint edges in H, there exists a permutation in F in which all the vertices in one edge precede those in the other.…

We describe the discrete Fourier transform (DFT) for a cyclic group when $p|N$ by factoring $x^N-1$ over finite fields and constructing the Fourier transform and its inverse using B\'{e}zout's identity for polynomials. For the symmetric…

The Eulerian idempotents, first introduced for the symmetric group and later extended to all reflection groups, generate a family of representations called the Eulerian representations that decompose the regular representation. In Type $A$,…

We show that the Cayley graph of the symmetric group $Sym_n$ generated by the cycle $(123...n)$ and the transposition $(12)$ embeds into $L_1$ with bi-Lipschitz distortion $O(1)$. This answers a question of Ostrovskii, and along with…

In this paper, we are interested in the combinatorial analysis of the whole genome duplication - random loss model of genome rearrangement initiated in a paper of Chaudhuri, Chen, Mihaescu, and Rao in SODA 2006 and continued by Bouvel and…

An acyclic mapping from an $n$ element set into itself is a mapping $\phi$ such that if $\phi^k(x) = x$ for some $k$ and $x$, then $\phi(x) = x$. Equivalently, $\phi^\ell = \phi^{\ell+1} = ...$ for $\ell$ sufficiently large. We investigate…

The involution Stanley symmetric functions $\hat{F}_y$ are the stable limits of the analogues of Schubert polynomials for the orbits of the orthogonal group in the flag variety. These symmetric functions are also generating functions for…