Related papers: Shelling the Coset Poset
Simplicial arrangements are classical objects in discrete geometry. Their classification remains an open problem but there is a list conjectured to be complete at least for rank three. A further important class in the theory of hyperplane…
This work regards the order polytopes arising from the class of generalized snake posets and their posets of meet-irreducible elements. Among generalized snake posets of the same rank, we characterize those whose order polytopes have…
We study the partially ordered set $P(a_1,\ldots, a_n)$ of all multidegrees $(b_1,\dots,b_n)$ of monomials $x_1^{b_1}\cdots x_n^{b_n}$ which properly divide $x_1^{a_1}\cdots x_n^{a_n}$. We prove that the order complex…
This paper describes the use of simple lattice models for studying the properties of structurally disordered systems like glasses and granulates. The models considered have crystalline states as ground states, finite connectivity, and are…
We construct a metrizable semitopological semilattice $X$ whose partial order $P=\{(x,y)\in X\times X:xy=x\}$ is a non-closed dense subset of $X\times X$. As a by-product we find necessary and sufficient conditions for the existence of a…
A hierarchy of a group is a rooted tree of groups obtained by iteratively passing to vertex groups of graphs of groups decompositions. We define a (relative) slender JSJ hierarchy for (almost) finitely presented groups and show that it is…
By imposing conditions upon the index of a self-centralizing subgroup of a group, and upon the index of the center of the group, we are able to classify the Chermak-Delgado lattice of the group. This is our main result. We use this result…
Given a presilting object in a triangulated category, we find necessary and sufficient conditions for the existence of a complement. This is done both for classic (pre)silting objects and for large (pre)silting objects. The key technique is…
A covering of a group is a finite set of proper subgroups whose union is the whole group. A covering is minimal if there is no covering of smaller cardinality, and it is nilpotent if all its members are nilpotent subgroups. We complete a…
Ordering theorems, characterizing when partial orders of a group extend to total orders, are used to generate hypersequent calculi for varieties of lattice-ordered groups (l-groups). These calculi are then used to provide new proofs of…
For a poset $(P;\leq)$, the quasiorders (AKA preorders) extending the poset order "$\leq$" form a complete lattice $F$, which is a filter in the lattice of all quasiorders of the set $P$. We prove that if the poset order "$\leq$" is small,…
The rational homology group of the order complex of non-even partitions of a finite set is calculated. A twisted version of the Goresky-MacPherson approach to similar homology calculations is proposed.
In this note we study the finite groups whose subgroup lattices are dismantlable.
What are simplest ways to construct a finite group from its atomic constituents? To understand part-whole relations between finite simple groups and the global structure of finite groups, we axiomatize complexity measures on finite groups.…
We characterize when a finite lattice is distributive by the existences of some particular classes of Koszul filtrations.
We define a new lattice structure on the elements of a finite Coxeter group W. This lattice, called the shard intersection order, is weaker than the weak order and has the noncrossing partition lattice NC(W) as a sublattice. The new…
If $L$ is a finite lattice, we show that there is a natural topological lattice structure on the geometric realization of its order complex $\Delta(L)$ (definition recalled). Lattice-theoretically, the resulting object is a subdirect…
In the paper it is proven that Carter subgroups of a finite group are conjugate. A complete classification of Carter subgroups in finite almost simple groups is also obtained.
We initiate the study of model structures on (categories induced by) lattice posets, a subject we dub homotopical combinatorics. In the case of a finite total order $[n]$, we enumerate all model structures, exhibiting a rich combinatorial…
We prove that, except for a few cases, stable linearizability of finite subgroups of the plane Cremona group implies linearizability.