English
Related papers

Related papers: Poset subdivisions and the mixed cd-index

200 papers

It is noted that using complex Hessian equations and the concavity inequalities for elementary symmetric polynomials implies a generalized form of Hodge index inequality. Inspired by this result, using G{\aa}rding's theory for hyperbolic…

Algebraic Geometry · Mathematics 2018-10-11 Jian Xiao

The interval poset of a permutation is the set of intervals of a permutation, ordered with respect to inclusion. It has been introduced and studied recently in [B. Tenner, arXiv:2007.06142]. We study this poset from the perspective of the…

Combinatorics · Mathematics 2024-06-11 Mathilde Bouvel , Lapo Cioni , Benjamin Izart

The algebraic variety defined by the idempotents of an incidence monoid is investigated. Its irreducible components are determined. The intersection with an antichain submonoid is shown to be the union of these irreducible components. The…

Combinatorics · Mathematics 2022-08-03 Mahir Bilen Can , Ana Casimiro , Antonio Malheiro

The invariants of finite-dimensional representations of simple Lie algebras, such as even-degree indices and anomaly numbers, are considered in the context of the non-crystallographic finite reflection groups $H_2$, $H_3$ and $H_4$. Using a…

Mathematical Physics · Physics 2021-01-28 Mariia Myronova , Jiri Patera , Marzena Szajewska

Let $P\subset\mathbb R^n$ be a convex polytope and let $\ell$ be a linear functional which is nonconstant on every edge of $P$. The induced acyclic orientation determines positive and negative Bia{\l}ynicki-Birula type partitions of $P$…

Combinatorics · Mathematics 2026-05-01 Mateusz Michałek , Leonid Monin , Botong Wang

We prove a simple formula for arbitrary cluster variables in the marked surfaces model. As part of the formula, we associate a labeled poset to each tagged arc, such that the associated $F$-polynomial is a weighted sum of order ideals. Each…

Combinatorics · Mathematics 2024-04-19 Vincent Pilaud , Nathan Reading , Sibylle Schroll

A well-known conjecture of McMullen, proved by Billera, Lee and Stanley, describes the face numbers of simple polytopes. The necessary and sufficient condition is that the toric g-vector of the polytope is an M-vector, that is, the vector…

Combinatorics · Mathematics 2014-12-19 Kalle Karu

One of the main objectives of topological data analysis is the study of discrete invariants for persistence modules, in particular when dealing with multiparameter persistence modules. In many cases, the invariants studied for these…

Algebraic Topology · Mathematics 2026-05-20 Claire Amiot , Thomas Brüstle , Eric J. Hanson

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…

Combinatorics · Mathematics 2025-10-21 Luis Ferroni , Roberto Riccardi

We generalize chain enumeration in graded partially ordered sets by relaxing the graded, poset and Eulerian requirements. The resulting balanced digraphs, which include the classical Eulerian posets having an $R$-labeling, imply the…

Combinatorics · Mathematics 2019-09-25 Richard Ehrenborg , Margaret Readdy

We investigate the existence of sufficient local conditions under which poset representations decompose as direct sums of indecomposables from a given class. In our work, the indexing poset is the product of two totally ordered sets,…

Representation Theory · Mathematics 2022-12-13 Magnus Bakke Botnan , Vadim Lebovici , Steve Oudot

We introduce and study additive posets. We show that the top homology group (with coefficients in Z/2Z) of a finite dimensional CW-complex carries a structure of an additive poset invariant under subdivisions. Applications to CW-complexes…

Combinatorics · Mathematics 2017-09-25 Vladimir Turaev

Kamiya, Takemura, and Terao introduced a characteristic quasi-polynomial which enumerates the numbers of elements in the complement of hyperplane arrangements modulo positive integers. In this paper, we compute the characteristic…

Combinatorics · Mathematics 2026-03-03 Yusuke Mori , Norihiro Nakashima

We introduce Lehmer codes, with immersions in the Bruhat order, for several finite Coxeter groups, including all the classical Weyl groups. This allows to associate to each lower Bruhat interval of these groups a multicomplex whose…

Combinatorics · Mathematics 2025-09-09 Davide Bolognini , Paolo Sentinelli

In 1920s R. L. Moore introduced \emph{upper semicontinuous} and \emph{lower semicontinuous} decompositions in studying decomposition spaces. Upper semicontinuous decompositions were studied very well by himself and later by R.H. Bing in…

Algebraic Topology · Mathematics 2020-06-23 Shoji Yokura

Coxeter polynomials are important homological invariants that are defined for a large class of finite-dimensional algebras. It is of particular interest to develop methods to compute these polynomials. We define the notion of insertion of a…

Representation Theory · Mathematics 2024-12-10 Sefi Ladkani

We consider the problem of complex root classification, i.e., finding the conditions on the coefficients of a univariate polynomial for all possible multiplicity structures on its complex roots. It is well known that such conditions can be…

Symbolic Computation · Computer Science 2024-09-11 Hoon Hong , Jing Yang

There is a natural notion of a subdivision of a lower Eulerian poset called a strong formal subdivision, which abstracts the notion of a polyhedral subdivision of a polytope, or a proper, surjective morphism of fans. We show that there is a…

Combinatorics · Mathematics 2025-11-21 Alan Stapledon

The usual univariate interpolation problem of finding a monic polynomial f of degree n that interpolates n given values is well understood. This paper studies a variant where f is required to be composite, say, a composition of two…

Algebraic Geometry · Mathematics 2021-03-31 Joachim von zur Gathen , Guillermo Matera

The notion of level posets is introduced. This class of infinite posets has the property that between every two adjacent ranks the same bipartite graph occurs. When the adjacency matrix is indecomposable, we determine the length of the…

Combinatorics · Mathematics 2014-06-10 Richard Ehrenborg , Gábor Hetyei , Margaret Readdy