Related papers: A refinement of weak order intervals into distribu…
In certain finite posets, the expected down-degree of their elements is the same whether computed with respect to either the uniform distribution or the distribution weighting an element by the number of maximal chains passing through it.…
We consider the distributions of the lengths of the longest weakly increasing and strongly decreasing subsequences in words of length N from an alphabet of k letters. We find Toeplitz determinant representations for the exponential…
Let $G$ be a transitive permutation group on $\Omega$. The $G$-invariant partitions form a sublattice of the lattice of all partitions of $\Omega$, having the further property that all its elements are uniform (that is, have all parts of…
For a finite real reflection group $W$ with Coxeter element $\gamma$ we give a uniform proof that the closed interval, $[I, \gamma]$ forms a lattice in the partial order on $W$ induced by reflection length. The proof involves the…
The Bernoulli sieve is a random allocation scheme obtained by placing independent points with the uniform [0,1] law into the intervals made up by successive positions of a multiplicative random walk with factors taking values in the…
In this note, an intrinsic description of some families of linear codes with symmetries is given, showing that they can be described more generally as quasi group codes, that is, as linear codes allowing a group of permutation automorphisms…
Permutation Matrices are a well known class of matrices which encode the elements of the symmetric group on $d$ elements as a square $d\times d$ matrix. Motivated by [4], we define a similar class of matrices which are a generalization of…
For L a finite lattice, let C(L) denote the set of pairs g = (g_0,g_1) such that g_0 is a lower cover of g_1 and order it as follows: g <= d iff g_0 <= d_0, g_1 <= d_1, but not g_1 <= d_0. Let C(L,g) denote the connected component of g in…
We conjecture that the category of permutation-twisted modules for a multi-fold tensor product vertex operator superalgebra and a cyclic permutation of even order is isomorphic to the category of parity-twisted modules for the underlying…
We show that, if $M$ is a subspace lattice with the property that the rank one subspace of its operator algebra is weak* dense, $L$ is a commutative subspace lattice and $P$ is the lattice of all projections on a separable infinite…
We consider two related problems arising from a question of R. Graham on quasirandom phenomena in permutation patterns. A ``pattern'' in a permutation $\sigma$ is the order type of the restriction of $\sigma : [n] \to [n]$ to a subset $S…
We consider a special class of weak dependent random variables with control on covariances of Lipschitz transformations. This class includes, but is not limited to, positively, negatively associated variables and a few other classes of…
We initiate the study of subpolytopes of the permutahedron that arise as the convex hulls of stack-sorting on permutations. We primarily focus on $Ln1$ permutations, i.e., permutations of length $n$ whose penultimate and last entries are…
Let S_n denote the symmetric group on n letters. We consider the S_n-root lattice A_{n-1} = {(z1,...,zn) in Z^n | z1+...+zn = 0}, where S_n acts on Z^n by permuting the coordinates, and its tensor, symmetric, and exterior squares. For odd…
In this article we introduce the study of the number of pairs of non-comparable elements in a distributive lattice $\L$. We give several tight lower and upper bounds for the number and give as an application the lattices precisely for which…
Given two linear codes, the Linear Equivalence Problem (LEP) asks to find (if it exists) a linear isometry between them; as a special case, we have the Permutation Equivalence Problem (PEP), in which isometries must be permutations. LEP and…
We study the statistical distribution of primitive sublattices in the space of lattices $\mathrm{SL}(n,\mathbb Z)\backslash\mathrm{SL}(n,\mathbb R)$. A central difficulty in this area is that the second moment of the counting function for…
Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. We give a representation of directed graphs by k-posets; this provides a new proof of the universality of the homomorphism order of k-posets. This…
Based on a study of the 2-category of weak distributive laws, we describe a method of iterating Street's weak wreath product construction. That is, for any 2-category K and for any non-negative integer n, we introduce 2-categories…
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…