Related papers: On piecewise-linear homeomorphisms between distrib…
Richard P. Stanley conjectured that finite trees can be distinguished by their chromatic symmetric functions. In this paper, we prove an analogous statement for posets: Finite rooted trees can be distinguished by their order quasisymmetric…
Let S denote a Steiner triple system on an n-element set. An orientation of S is an assignment of a cyclic ordering to each of the triples in S. From an oriented Steiner triple system, one can define an anticommutative bilinear operation on…
Conformation-dependent design of polymer sequences can be considered as a tool to control macromolecular self-assembly. We consider the monomer unit sequences created via the modification of polymers in a homogeneous melt in accordance with…
The concept of assignments was introduced in [GGK99] as a method for extracting geometric information about group actions on manifolds from combinatorial data encoded in the infinitesimal orbit-type stratification. In this paper we will…
In this paper we address the characterization of the structure of condensed materials, periodic and non-periodic. Carrying out an extensive study of over 7000 different groundstate structures of a 2D lattice model of binary packing, we find…
Phylogenetic networks are generalizations of trees that allow for the modeling of non-tree like evolutionary processes. Split networks give a useful way to construct networks with intuitive distance structures induced from the associated…
We continue the study on sheaves of rings on finite posets. We present examples where the ring of global sections coincide with toric faces rings, quotients of a polynomial ring by a monomial ideal and algebras with straightening laws. We…
We introduce a partition of (coweight) lattice points inside the dilated fundamental parallelepiped into those of partially closed simplices. This partition can be considered as a generalization and a lattice points interpretation of the…
The polygonal distributions are a class of distributions that can be defined via the mixture of triangular distributions over the unit interval. The class includes the uniform and trapezoidal distributions, and is an alternative to the beta…
Finite smooth digraphs, that is, finite directed graphs without sources and sinks, can be partially ordered via pp-constructability. We give a complete description of this poset and, in particular, we prove that it is a distributive…
An alternative and combinatorial proof is given for a connection between a system of Hahn polynomials and identities for symmetric elements in the Heisenberg algebra, which was first observed by Bender, Mead, and Pinsky [Phys. Rev. Lett. 56…
The s-lecture hall polytopes P_s are a class of integer polytopes defined by Savage and Schuster which are closely related to the lecture hall partitions of Eriksson and Bousquet-M\'elou. We define a half-open parallelopiped Par_s…
Bj\"orner and Wachs introduced CL-shellability as a technique for studying the topological structure of order complexes of partially ordered sets (posets). They also introduced the notion of recursive atom ordering, and they proved that a…
For any lattice polytope $P$, we consider an associated polynomial $\bar{\delta}_{P}(t)$ and describe its decomposition into a sum of two polynomials satisfying certain symmetry conditions. As a consequence, we improve upon known…
A well-known open problem in graph theory asks whether Stanley's chromatic symmetric function, a generalization of the chromatic polynomial of a graph, distinguishes between any two non-isomorphic trees. Previous work has proven the…
This paper introduces a partial order on the maximal chains of any finite bounded poset $P$ which has a CL-labeling $\lambda$. We call this the maximal chain descent order induced by $\lambda$, denoted $P_{\lambda}(2)$. As a first example,…
The importance of classifying connections in large graphs has been the motivation for a rich line of work on distributed subgraph finding that has led to exciting recent breakthroughs. A crucial aspect that remained open was whether…
We give the first data structure for the problem of maintaining a dynamic set of n elements drawn from a partially ordered universe described by a tree. We define the Line-Leaf Tree, a linear-sized data structure that supports the…
In this paper we solve an open problem on distributive lattices, which was proposed by Stanley in 1998. This problem was motivated by a conjecture due to Griggs, which equivalently states that the incomparability graph of the boolean…
We describe some open problems related to homology representations of subposets of the partition lattice, beginning with questions first raised in Stanley's work on group actions on posets.