相关论文: Hyperarbres, arbres enracin\'{e}s et partitions po…

We consider hyperplane arrangements generated by generic points and study their intersection lattices. These arrangements are known to be equivalent to discriminantal arrangements. We show a fundamental structure of the intersection…

We consider actions, similar to those of Haglund, Rhoades, and Shimozono on ordered partitions, and their basis in terms of the higher Specht polynomials of Ariki, Terasoma, and Yamada, as carried out by Gillespie and Rhoades. By allowing…

We reduce the calculation of the simplest Hodge integrals to some sums over decorated trees. Since Hodge integrals are already calculated, this gives a proof of a rather interesting combinatorial theorem and a new representation of…

Relatively prime pairs of integers can be represented as nodes in three way branching trees. We construct trees of B\'ezout coefficients which correspond to the relatively prime pairs in the aforementioned trees. As one application, we…

This is both an expository and research paper where we advocate a systematic study of continuous analogues of finite partially ordered sets, convex polytopes, oriented matroids, arrangements of subspaces, finite simplicial complexes, and…

Csikv\'{a}ri constructed a poset on trees to prove that several graph functions attain extreme values at the star and the path among the trees on a fixed number of vertices. Reiner and Smith proved that the Tutte polynomials $T(1,y)$ of…

Given a Polish space X and a countable family of analytic hypergraphs on X, I consider the sigma-ideal generated by Borel sets which are anticliques in at least one hypergraph in the family. It turns out that many of the quotient posets are…

We present a matrix-theoretic approach for studying and enumerating finite posets through their incidence representations, referred to as poset matrices. Naturally labelled posets are encoded as Boolean lower triangular matrices, allowing a…

We consider the generating polynomial of the number of rooted trees on the set $\{1,2,\dots,n\}$ counted by the number of descending edges (a parent with a greater label than a child). This polynomial is an extension of the descent…

This work addresses an enumeration problem on weighted bi-colored plane trees with prescribed vertex data, with all vertices labeled distinctly. We give a bijection proof of the enumeration formula originally due to Kochetkov, hence…

We develop a combinatorial model of the associated Hermite polynomials and their moments, and prove their orthogonality with a sign-reversing involution. We find combinatorial interpretations of the moments as complete matchings, connected…

The Interval poset of a permutation is an effective way of capturing all the intervals of the permutation and the inclusions between them and was introduced recently by Tenner. Thi paper explores the geometric interpretation of interval…

Let $T$ be a tree on $n$ vertices with Laplacian $L_T$ and let $GTS_n$ be the generalized tree shift poset on the set of unlabelled trees on $n$ vertices. Inequalities are known for coefficients of the characteristic polynomial of $L_T$ as…

Given a symmetric monoidal category $C$ with product $\sqcup$, where the neutral element for the product is an initial object, we consider the poset of $\sqcup$-complemented subobjects of a given object $X$. When this poset has finite…

Let $P$ be a finite partially ordered set. In a recent series of works, Proudfoot introduced the notion of $Z$-polynomials associated with $P$-kernels, providing a unified framework for various intersection cohomology Poincar\'e polynomials…

The class of self-nested trees presents remarkable compression properties because of the systematic repetition of subtrees in their structure. In this paper, we provide a better combinatorial characterization of this specific family of…

For each composition $\vec{c}$ we show that the order complex of the poset of pointed set partitions $\Pi^{\bullet}_{\vec{c}}$ is a wedge of spheres of the same dimension with the multiplicity given by the number of permutations with…

In this paper, we will show dichotomy theorems for the computation of polynomials corresponding to evaluation of graph homomorphisms in Valiant's model. We are given a fixed graph $H$ and want to find all graphs, from some graph class,…

We apply spectral graph theory and a theorem of A'Campo to express the first and second coefficients of the Coxeter polynomials associated with certain bipartite quivers in terms of the degrees of the vertices in their underlying graphs. As…

Stanley's theory of $(P,\omega)$-partitions is a standard tool in combinatorics. It can be extended to allow for the presence of a restriction, that is a given maximal value for partitions at each vertex of the poset, as was shown by Assaf…