Related papers: The canonical join complex for biclosed sets
We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…
The extended weak order on a Coxeter group $W$ is the poset of biclosed sets in its root system. In (Barkley-Speyer 2024), it was shown that when $W=\widetilde{S}_n$ is the affine symmetric group, then the extended weak order is a quotient…
We characterize the seminormality of an affine semigroup ring in terms of the dualizing complex, and the normality of a Cohen-Macaulay semigroup ring by the "shape" of the canonical module. We also characterize the seminormality of a toric…
Let the finite distributive lattice $D$ be isomorphic to the congruence lattice of a finite lattice $L$. Let $Q$ denote those elements of $D$ that correspond to principal congruences under this isomorphism. Then $Q$ contains $0,1 \in D$ and…
Motivated by Gr\"obner basis theory for finite point configurations, we define and study the class of "standard complexes" associated to a matroid. Standard complexes are certain subcomplexes of the independence complex that are invariant…
We develop a canonical pairing between trees and graphs, which passes to their quotients by Jacobi identities. This pairing is an effective and simple tool for understanding the Lie and Poisson operads, providing canonical duals. In the…
Combinatorics of biopolymer structures, especially enumeration of various RNA secondary structures and protein contact maps, is of significant interest for communities of both combinatorics and computational biology. However, most of the…
We introduce a class of combinatorial singularities of Lagrangian skeleta of symplectic manifolds. The link of each singularity is a finite regular cell complex homotopy equivalent to a bouquet of spheres. It is determined by its face poset…
Two arrangements with the same combinatorial intersection lattice but whose complements have different fundamental groups are called a Zariski pair. This work finds that there are at most nine such pairs amongst all ten line arrangements…
We study the topological structure of the quotient of $SU(3)\times SU(3)$ by diagonal conjugation. This is the simplest nontrivial example for the classical reduced configuration space of chromodynamics on a spatial lattice in the…
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…
It is well known that not every combinatorial configuration admits a geometric realization with points and lines. Moreover, some of them do not even admit realizations with pseudoline arrangements, i.e., they are not topological. In this…
We consider the features of multiparticle tree cross sections in scalar theories in the framework of a semiclassical approach. These cross sections at large multiplicities have exponential form, and the properties of the exponent in…
Dilworth's theorem. Every finite distributive lattice $D$ can be represented as the congruence lattice of a finite lattice $L$. We want: Every finite distributive lattice $D$ can be represented as the congruence lattice of a nice finite…
A classical tensor product $A \,\otimes\, B$ of complete lattices $A$ and $B$, consisting of all down-sets in $A \times B$ that are join-closed in either coordinate, is isomorphic to the complete lattice $Gal(A,B)$ of Galois maps from $A$…
We prove the finiteness of log pluricanonical representations for projective log canonical pairs with semi-ample log canonical divisor. As a corollary, we obtain that the log canonical divisor of a projective semi log canonical pair is…
For an $n$-tuple $s$ of non-negative integers, the $s$-weak order is a lattice structure on $s$-trees, generalizing the weak order on permutations. We first describe the join irreducible elements, the canonical join representations, and the…
Disjoint union is a partial binary operation returning the union of two sets if they are disjoint and undefined otherwise. A disjoint-union partial algebra of sets is a collection of sets closed under disjoint unions, whenever they are…
The proper parts of face lattices of convex polytopes are shown to satisfy a strong form of the Cohen--Macaulay property, namely that removing from their Hasse diagram all edges in any closed interval results in a Cohen--Macaulay poset of…
Structures involving a lattice and join-endomorphisms on it are ubiquitous in computer science. We study the cardinality of the set $\mathcal{E}(L)$ of all join-endomorphisms of a given finite lattice $L$. In particular, we show for…