相关论文: Counting linear extensions of posets with determin…

Examples of exact categories in representation theory are given by the category of Delta-filtered modules over quasi-hereditary algebras, but also by various categories related to matrix problems, such as poset representations or…

We find two new hook length formulas for binary trees. The particularity of our formulas is that the hook length $h_v$ appears as an exponent.

In this paper, we present, for any integer d, a description of the set of hooks in a d-symbol. We then introduce generalized hook length functions for a d-symbol, and prove a general result about them, involving the core and quotient of the…

We consider extensions of non-singular maps which are exact, respectively K-mixing, or at least have a decomposition into positive-measure exact, respectively K-mixing, components. The fibers of the extension spaces have countable (finite…

We extend the existing skew polynomial representations of matrix algebras which are direct sum of matrix spaces over division rings. In this representation, the sum-rank distance between two tuples of matrices is captured by a weight…

In this paper, we provide an overview of Ehrhart polynomials associated with order polytopes of finite posets, a concept first introduced by Stanley. We focus on their combinatorial interpretations for many sequences listed on the OEIS. We…

Generalized Pl\"ucker numbers are defined to count certain types of tangent lines of generic degree $d$ complex projective hypersurfaces. They can be computed by identifying them as coefficients of GL(2)-equivariant cohomology classes of…

In this article we investigate a class of linear error correcting codes in relation with the order polytopes. In particular we consider the order polytopes of tree posets and bipartite posets. We calculate the parameters of the associated…

We prove for finite, graded, bounded posets, that the Poincar\'e-extended ab-index is obtained from the ab-index via the omega-transformation. This proves a conjecture by Dorpalen-Barry, Maglione, and the second author, and provides a more…

We introduce higher Specht polynomials - analogs of Specht polynomials in higher degrees - in two sets of variables $x_1,\ldots,x_n$ and $y_1,\ldots,y_n$ under the diagonal action of the symmetric group $S_n$. This generalizes the classical…

Define an expansion poset to be the poset of monomials of a cluster variable attached to an arc in a polygon, where each monomial is represented by the corresponding combinatorial object from some fixed combinatorial cluster expansion…

The Rees product of partially ordered sets was introduced by Bj\"orner and Welker. Using the theory of lexicographic shellability, Linusson, Shareshian and Wachs proved formulas, of significance in the theory of gamma-positivity, for the…

We introduce the generic Lah polynomials $L_{n,k}(\phi)$, which enumerate unordered forests of increasing ordered trees with a weight $\phi_i$ for each vertex with $i$ children. We show that, if the weight sequence $\phi$ is…

We present an efficient algorithm to compute permanents, mixed discriminants and hyperdeterminants of structured matrices and multidimensional arrays (tensors). We describe the sparsity structure of an array in terms of a graph, and we…

A natural construction due to K. Ding yields Schubert varieties from Ferrers boards. The poset structure of the Schubert cells in these varieties is equal to the poset of maximal rook placements on the Ferrers board under the Bruhat order.…

Motivated by the properties of the descent polynomials, which enumerate permutations of $S_n$ with a fixed descent set, we define descent polynomials for labeled rooted trees. We give recursive and explicit formulas for these polynomials…

We present a version of the weighted cellular matrix-tree theorem that is suitable for calculating explicit generating functions for spanning trees of highly structured families of simplicial and cell complexes. We apply the result to give…

We define a family of combinatorial objects, which we call Baxter posets. We prove that Baxter posets are counted by the Baxter numbers by showing that they are the adjacency posets of diagonal rectangulations. Given a diagonal…

In this paper we introduce the notion of {\it core} for two specific classes of boolean maps on finite involution posets (which are a generalization of the boolean lattices) and we prove some extension results for such families of boolean…

We say a finite poset $P$ is a tree poset if its Hasse diagram is a tree. Let $k$ be the length of the largest chain contained in $P$. We show that when $P$ is a fixed tree poset, the number of $P$-free set systems in $2^{[n]}$ is…