Related papers: Intervals and factors in the Bruhat order
We prove the analog of Cram\'er's short intervals theorem for primes in arithmetic progressions and prime ideals, under the relevant Riemann Hypothesis. Both results are uniform in the data of the underlying structure. Our approach is based…
We investigate decomposable combinatorial labeled structures more fully, focusing on the exp-log class of type a=1 or 1/2. For instance, the modal length of the second longest cycle in a random n-permutation is (0.2350...)n, whereas the…
We present a two term formula for the M\"obius function of intervals in the poset of all permutations, ordered by pattern containment. The first term in this formula is the number of so called normal occurrences of one permutation in…
We prove a common generalization of the fact that the weighted number of maximal chains in the strong Bruhat order on the symmetric group is ${n \choose 2}!$ for both the code weights and the Chevalley weights. We also define weights which…
Given a finite group with a generating subset there is a well-established notion of length for a group element given in terms of its minimal length expression as a product of elements from the generating set. Recently, certain quantities…
We consider the questions connected with the Hamiltonian properties of the Whitham equations in case of several spatial dimensions. An essential point of our approach here is a connection of the Hamiltonian structure of the Whitham system…
The W-set of an element of a weak order poset is useful in the cohomological study of the closures of spherical subgroups in generalized flag varieties. We explicitly describe in a purely combinatorial manner the W-sets of the weak order…
We study decomposable combinatorial labeled structures in the exp-log class, specifically, two examples of type a=1 and two examples of type a=1/2. Our approach is to establish how well existing theory matches experimental data. For…
The length is(w) of the longest increasing subsequence of a permutation w in the symmetric group S_n has been the object of much investigation. We develop comparable results for the length as(w) of the longest alternating subsequence of w,…
This paper initiates the study of shortening universal cycles (u-cycles) and universal words (u-words) for permutations either by using incomparable elements, or by using non-deterministic symbols. The latter approach is similar in nature…
We consider uniform random permutations in classes having a finite combinatorial specification for the substitution decomposition. These classes include (but are not limited to) all permutation classes with a finite number of simple…
We study three aspects of commutation classes of reduced decompositions: the number of commutation classes, the structures of their corresponding graphs, and the enumeration of subnetworks, a concept recently introduced by Warrington [21].…
To any saturated chain in the affine Weyl group whose translation parts are sufficiently regular, we associate a near path and a far path in the quantum Bruhat graph. Using this, working in the Bruhat order on the minimal-length…
Every isometry of a finite dimensional euclidean space is a product of reflections and the minimum length of a reflection factorization defines a metric on its full isometry group. In this article we identify the structure of intervals in…
In this paper, we give the decomposition into irreducible characters of the restriction to the wreath product $\mathbb{Z}_{p-1} \wr \mathfrak{S}_w$ of any irreducible character of $(\mathbb{Z}_p \rtimes \mathbb{Z}_{p-1}) \wr…
The extended commutation relations for a generalized uncertainty principle have been based on the assumption of the minimal length in position. Instead of this assumption, we start with a constrained Hamiltonian system described by the…
Hultman, Linusson, Shareshian, and Sj\"ostrand gave a pattern avoidance characterization of the permutations for which the number of chambers of its associated inversion arrangement is the same as the size of its lower interval in Bruhat…
For $(W,S)$ an arbitrary Coxeter system and any $y \in W$, we investigate the condition that the Bruhat graph for the interval $[1,y]$ can be cubulated, meaning roughly that this graph can be spanned by a product of subintervals of…
An arbitrary homomorphism between groups is nonincreasing for stable commutator length, and there are infinitely many (injective) homomorphisms between free groups which strictly decrease the stable commutator length of some elements.…
Each element of the commutator subgroup of a group can be represented as a product of commutators. The minimal number of factors in such a product is called the commutator length of the element. The commutator length of a group is defined…