English
Related papers

Related papers: Counting faces of nestohedra

200 papers

We obtain a recurrence relation for the f-polynomial of Gelfand-Zetlin polytopes by analyzing geometric properties of a linear projection of the Gelfand-Zetlin polytope onto a cube. We apply this recurrence relation to find explicit…

Combinatorics · Mathematics 2025-07-21 Ekaterina V. Melikhova

The aim of the paper is to calculate face numbers of simple generalized permutohedra, and study their f-, h- and gamma-vectors. These polytopes include permutohedra, associahedra, graph-associahedra, simple graphic zonotopes, nestohedra,…

Combinatorics · Mathematics 2007-05-23 Alexander Postnikov , Victor Reiner , Lauren Williams

For each poset $P$, we construct a polytope $A(P)$ called the $P$-associahedron. Similarly to the case of graph associahedra, the faces of $A(P)$ correspond to certain nested collections of subsets of $P$. The Stasheff associahedron is a…

Combinatorics · Mathematics 2023-11-09 Pavel Galashin

We use the stabilization functors to study the combinatorial aspects of the $F$-polynomial of a representation of any finite-dimensional basic algebra. We characterize the vertices of their Newton polytopes. We give an explicit formula for…

Representation Theory · Mathematics 2021-08-04 Jiarui Fei

The {\it profile} of a relational structure $R$ is the function $\phi_R$ which counts for every integer $n$ the number of its $n$-element substructures up to an isomorphism. Many counting functions are profiles. Interesting examples come…

Combinatorics · Mathematics 2007-05-23 Maurice Pouzet

In this paper we study the ring $\mathcal{P}$ of combinatorial convex polytopes. We introduce the algebra of operators $\mathcal{D}$ generated by the operators $d_k$ that send an $n$-dimensional polytope $P^n$ to the sum of all its…

Combinatorics · Mathematics 2010-02-04 Victor M. Buchstaber , Nickolai Erokhovets

Let $f(x_1,...,x_k)$ be a polynomial over a field $K$. This paper considers such questions as the enumeration of the number of nonzero coefficients of $f$ or of the number of coefficients equal to $\alpha\in K^*$. For instance, if $K=\ff_q$…

Combinatorics · Mathematics 2008-11-25 Tewodros Amdeberhan , Richard P. Stanley

We extend the notion of parking function polytopes and study their geometric and combinatorial structure, including normal fans, face posets, and $h$-polynomials, as well as their connections to other classes of polytopes. To capture their…

Combinatorics · Mathematics 2025-12-17 Fu Liu , Warut Thawinrak

We show that the cyclohedron (Bott-Taubes polytope) $W_n$ arises as the dual of a Kantorovich-Rubinstein polytope $KR(\rho)$, where $\rho$ is a quasi-metric (asymmetric distance function) satisfying strict triangle inequality. From a…

Combinatorics · Mathematics 2018-04-20 Filip D. Jevtić , Marija Jelić , Rade T. Živaljević

We show that with the appropriate choice of coproduct, the type B quasisymmetric functions form a Hopf algebra, and the recently introduced type B peak functions form a Hopf subalgebra.

Combinatorics · Mathematics 2007-05-23 Samuel K. Hsiao , T. Kyle Petersen

This paper initiates the explicit study of face numbers of matroid polytopes and their computation. We prove that, for the large class of split matroid polytopes, their face numbers depend solely on the number of cyclic flats of each rank…

Combinatorics · Mathematics 2025-07-02 Luis Ferroni , Benjamin Schröter

Nestohedra are a family of convex polytopes that includes permutohedra, associahedra, and graph associahedra. In this paper, we study an extension of such polytopes, called extended nestohedra. We show that these objects are indeed the…

Combinatorics · Mathematics 2019-12-17 Quang Dao , Christina Meng , Julian Wellman , Zixuan Xu , Calvin Yost-Wolff , Teresa Yu

We consider graded representations of the algebra NC of noncommutative symmetric functions on the Z-linear span of a graded poset P. The matrix coefficients of such a representation give a Hopf morphism from a Hopf algebra HP generated by…

Combinatorics · Mathematics 2016-11-08 Nantel Bergeron , Stefan Mykytiuk , Frank Sottile , Stephanie van Willigenburg

The number of linear independent algebraic relations among elementary symmetric polynomial functions over finite fields is computed. An algorithm able to find all such relations is described. It is proved that the basis of the ideal of…

Symbolic Computation · Computer Science 2023-09-26 Mihai Prunescu

We study symmetric function analogues of the higher order Bell numbers. Their construction involves iterated plethystic exponential towers mimicking the single variable exponential generating functions for the higher order Bell numbers. We…

Combinatorics · Mathematics 2025-09-23 Milo Bechtloff Weising

We introduce a collection of polynomials $F_N$, associated to each positive integer $N$, whose divisibility properties yield a reformulation of the Goldbach conjecture. While this reformulation certainly does not lead to a resolution of the…

Number Theory · Mathematics 2014-08-22 Peter B. Borwein , Stephen K. K. Choi , Greg Martin , Charles L. Samuels

We prove a result that relates the number of homomorphisms from the fundamental group of a compact nonorientable surface to a finite group $G$, where conjugacy classes of the boundary components of the surface must map to prescribed…

Group Theory · Mathematics 2025-02-19 Michael R. Klug

Let W be a finite Coxeter group. In this paper, we show that the properties of the Solomon algebra homomorphism Phi (from the Solomom descent algebra to the algebra of class functions) are strongly related to enumerative results: certain…

Representation Theory · Mathematics 2007-05-23 Christophe Hohlweg

We describe the cone of deformations of a Coxeter permutahedron, or equivalently, the nef cone of the toric variety associated to a Coxeter complex. This family of polytopes contains polyhedral models for the Coxeter-theoretic analogs of…

Combinatorics · Mathematics 2020-03-03 Federico Ardila , Federico Castillo , Christopher Eur , Alexander Postnikov

We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…

Combinatorics · Mathematics 2008-01-19 Milan Janjic