Related papers: A Poset Structure on the Alternating Group Generat…
We study block designs which admit an automorphism group that is transitive on blocks and points, and leaves invariant every partition in a given finite poset of partitions of the point set. The full stabiliser $G$ of all the partitions in…
We define combinatorially a partial order on the set partitions and show that it is equivalent to the Bruhat-Chevalley-Renner order on the upper triangular matrices. By considering subposets consisting of set partitions with a fixed number…
This paper provides a bridge between two active areas of research, the spectrum (set of element orders) and the power graph of a finite group. The order sequence of a finite group $G$ is the list of orders of elements of the group, arranged…
Toric posets are cyclic analogues of finite posets. They can be viewed combinatorially as equivalence classes of acyclic orientations generated by converting sources into sinks, or geometrically as chambers of toric graphic hyperplane…
Motivated by recent work on mixtures of classical and free probabilities, we introduce and study the notion of $\epsilon$-noncrossing partitions. It is shown that the set of such partitions forms a lattice, which interpolates as a poset…
A finite transitive permutation group is elusive if it contains no derangements of prime order. These groups are closely related to a longstanding open problem in algebraic graph theory known as the Polycirculant Conjecture, which asserts…
We apply the homomorphism complex construction to partially ordered sets, introducing a new topological construction based on the set of maximal chains in a graded poset. Our primary objects of study are distributive lattices, with special…
Introduced by Reading, the shard intersection order of a finite Coxeter group $W$ is a lattice structure on the elements of $W$ that contains the poset of noncrossing partitions $NC(W)$ as a sublattice. Building on work of Bancroft in the…
The study of geometric group theory has suggested several theorems related to subdivision tilings that have a natural hyperbolic structure. However, few examples exist. We construct subdivision tilings for the complement of every…
We show that every finite simple group is generated invariably by a Sylow subgroup and a cyclic group. It follows that that the order complex of the coset poset of an arbitrary finite group has nontrivial reduced rational homology.
We consider three notions of connectivity and their interactions in partially ordered sets coming from reduced factorizations of an element in a generated group. While one form of connectivity essentially reflects the connectivity of the…
We examine properties of generic automorphisms of the random poset, with the goal of explicitly characterizing them. We associate to each automorphism an auxiliary first-order structure, consisting of the random poset equipped with an…
In this paper, we investigate the higher-group symmetry structure of a five-dimensional topological theory, which is described by a 3-crossed module. The model is obtained by a five-dimensional extension of topological axion electrodynamics…
From a group action on a space, define a variant of the configuration space by insisting that no two points inhabit the same orbit. When the action is almost free, this "orbit configuration space" is the complement of an arrangement of…
Based on the paper "Fourier formula for quantum partition functions", arXiv:2106.10032 [math-ph], we show that in an infinite system of identical bosons interacting via a positive-type pair potential there is off-diagonal long-range order…
This paper studies a partial order on the general linear group GL(V) called the absolute order, derived from viewing GL(V) as a group generated by reflections, that is, elements whose fixed space has codimension one. The absolute order on…
A partial order $\prec$ on $[n]$ is naturally labelled (NL) if $x\prec y$ implies $x<y$. We establish a bijection between {3, 2+2}-free NL posets and 12-34-avoiding permutations, determine functional equations satisfied by their generating…
We show that for all $n\leq X$ apart from $O(X\exp(-c(\log X)^{1/2}(\log \log X)^{1/2}))$ exceptions, the alternating group $A_n$ is invariably generated by two elements of prime order. This answers (in a quantitative form) a question of…
For a given permutation or set partition there is a natural way to assign a genus. Counting all permutations or partitions of a fixed genus according to cycle lengths or block sizes, respectively, is the main content of this article. After…
Although the alternating group is an index 2 subgroup of the symmetric group, there is no generating set that gives a Coxeter structure on it. Various generating sets were suggested and studied by Bourbaki, Mitsuhashi, Regev-Roichman,…