Related papers: The depth of a permutation

We refine a conjecture by Lehrer and Solomon on the structure of the Orlik-Solomon algebra of a finite Coxeter group $W$ and relate it to the descent algebra of $W$. As a result, we claim that both the group algebra of $W$, as well as the…

Let $d, n \in \mathbb{Z}^+$ such that $1\leq d \leq n$. A $d$-code $\mathcal{C} \subset \mathbb{F}_q^{n \times n}$ is a subset of order $n$ square matrices with the property that for all pairs of distinct elements in $\mathcal{C}$, the rank…

Let X be a building of uniform thickness q+1. L^2-Betti numbers of X are reinterpreted as von-Neumann dimensions of weighted L^2-cohomology of the underlying Coxeter group. The dimension is measured with the help of the Hecke algebra. The…

Let $S_{\rm lcm}(n)$ denote the set of permutations $\pi$ of $[n]=\{1,2,\dots,n\}$ such that ${\rm lcm}[j,\pi(j)]\le n$ for each $j\in[n]$. Further, let $S_{\rm div}(n)$ denote the number of permutations $\pi$ of $[n]$ such that…

This is an introduction to the group algebras of the symmetric groups, written for a quarter-long graduate course. After recalling the definition of group algebras (and monoid algebras) in general, as well as basic properties of…

We develop sharp bounds on the statistical distance between high-dimensional permutation mixtures and their i.i.d. counterparts. Our approach establishes a new geometric link between the spectrum of a complex channel overlap matrix and the…

The peak set of a permutation records the indices of its peaks. These sets have been studied in a variety of contexts, including recent work by Billey, Burdzy, and Sagan, which enumerated permutations with prescribed peak sets. In this…

Given a finite group $G$ and a set $A$ of generators, the diameter diam$(\Gamma(G,A))$ of the Cayley graph $\Gamma(G,A)$ is the smallest $\ell$ such that every element of $G$ can be expressed as a word of length at most $\ell$ in $A \cup…

The reflections in a Coxeter group are defined as conjugates of a single generator, and thus admit palindromic expressions as products of generators. Our main result gives closed formulas providing a palindromic reduced expression for each…

The boolean elements of a Coxeter group have been characterized and shown to possess many interesting properties and applications. Here we introduce "prism permutations," a generalization of those elements, characterizing the prism…

Superpermutations are words over a finite alphabet containing every permutation as a factor. Finding the minimal length of a superpermutation is still an open problem. In this article, we introduce superpermutations matrices. We establish a…

The dead-end depth of an element g of a group G, with respect to a generating set A is the distance from g to the complement of the radius $d_A(1,g)$ closed ball, in the word metric $d_A$ defined with respect to A. We exhibit a finitely…

We study the variation of the dimension of the Bloch-Kato Selmer group of a p-adic Galois representation of a number field that varies in a refined family. We show that, if one restricts ourselves to representations that are, at every place…

We give uniform formulas for the number of full reflection factorizations of a parabolic quasi-Coxeter element in a Weyl group or complex reflection group, generalizing the formula for the genus-0 Hurwitz numbers. This paper is the…

In a previous work, B\'ona and Pantone studied permutations that avoided all but one pattern of length $k$ that began with a length $k-1$ increasing subsequence. We draw the connection between that idea and distant patterns, first discussed…

We determine the scaling limit for permutations conditioned to have longest decreasing subsequence of length at most $d$. These permutations are also said to avoid the pattern $(d+1)d \cdots 2 1$ and they can be written as a union of $d$…

In 1990, Backelin showed that the number of numerical semigroups with Frobenius number $f$ approaches $C_i \cdot 2^{f/2}$ for constants $C_0$ and $C_1$ depending on the parity of $f$. In this paper, we generalize this result to semigroups…

In comparison to graphs, combinatorial methods for the isomorphism problem of finite groups are less developed than algebraic ones. To be able to investigate the descriptive complexity of finite groups and the group isomorphism problem, we…

Babson and Steingr\'{\i}msson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. Claesson presented a complete solution for the number of…

Nondegenerate covariance, correlation and spectral density matrices are necessarily symmetric or Hermitian and positive definite. The main contribution of this paper is the development of statistical data depths for collections of Hermitian…