Related papers: The f-vector of the descent polytope
Given a subset $S=\{s_0, s_1\}$ of the complex plane with two points and an infinite subset ${\mathscr S}$ of $S\times {\mathbb N}$, where ${\mathbb N}=\{0,1,2,\dots\}$ is the set of nonnegative integers, we ask for a lower bound for the…
The order and chain polytopes are two 0/1-polytopes constructed from a finite poset. In this paper, we study the $f$-vectors of these polytopes. We investigate how the order and chain polytopes behave under disjoint unions and ordinal sums…
Let $P_n$ be an $n$-dimensional regular polytope from one of the three infinite series (regular simplices, regular crosspolytopes, and cubes). Project $P_n$ onto a random, uniformly distributed linear subspace of dimension $d\geq 2$. We…
For $\ba \in \R_{\geq 0}^{n}$, the Tesler polytope $\tes_{n}(\ba)$ is the set of upper triangular matrices with non-negative entries whose hook sum vector is $\ba$. Motivated by a conjecture of Morales', we study the questions of whether…
New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…
Let n be a positive integer. We consider the Sylvester Resultant of f and g, where f is a generic polynomial of degree 2 or 3 and g is a generic polynomial of degree n. If f is a quadratic polynomial, we find the resultant's height. If f is…
The main contribution of this paper is to find a representation of the class $\mathcal{F}_d(p)$ of multivariate Bernoulli distributions with the same mean $p$ that allows us to find its generators analytically in any dimension. We map…
Let $D$ be a digraph, let $p \geq 1$ be an integer, and let $f: V(D) \to \mathbb{N}_0^p$ be a vector function with $f=(f_1,f_2,\ldots,f_p)$. We say that $D$ has an $f$-partition if there is a partition $(D_1,D_2,\ldots,D_p)$ into induced…
The profile vector of a family $\mathcal{F}$ of subsets of an $n$-element set is $(f_0,f_1, \ldots, f_n)$ where $f_i$ denotes the number of the $i$-element members of $\mathcal{F}$. In this paper we determine the extreme points of the set…
The fact that Schubert polynomials are the weighted counting functions for reduced RC-graphs, also known as reduced pipe dreams, was established using their generating functions inside an appropriate Demazure algebra. Here we investigate…
We present a formula for a generalisation of the Eulerian polynomial, namely the generating polynomial of the joint distribution of major index and descent statistic over the set of signed multiset permutations. It has a description in…
We study the number of lattice points in integer dilates of the rational polytope $P = (x_1,...,x_n) \in \R_{\geq 0}^n : \sum_{k=1}^n x_k a_k \leq 1$, where $a_1,...,a_n$ are positive integers. This polytope is closely related to the linear…
The $f$-vector of a polytope consists of the numbers of its $i$-dimensional faces. An open field of study is the characterization of all possible $f$-vectors. It has been solved in three dimensions by Steinitz in the early 19th century. We…
For a poset whose Hasse diagram is a rooted plane forest $F$, we consider the corresponding tree descent polynomial $A_F(q)$, which is a generating function of the number of descents of the labelings of $F$. When the forest is a path,…
For an arbitrary finite set S of natural numbers greater 1, we construct an integer-valued polynomial f, whose set of lengths in Int(Z) is S. The set of lengths of f is the set of all natural numbers n, such that f has a factorization as a…
Let $\Phi$ be an irreducible (possibly noncrystallographic) root system of rank $l$ of type $P$. For the corresponding cluster complex $\Delta(P)$, which is known as pure $(l-1)$-dimensional simplicial complex, we define the generating…
We investigate polynomial sets {P n } n$\ge$0 with generating power series of the form F (xt -- R(t)) and satisfying, for n $\ge$ 0, the (d + 1)-order recursion xP\_ n (x) = P\_{ n+1 }(x) +\sum\_{ l=0}^{d} \gamma^{l}\_{n} P\_{ n--l} (x),…
Let $f\in\mathbb{Z}[T]$ be any polynomial of degree $d>1$ and $F\in\mathbb{Z}[X_{0},...,X_{n}]$ an irreducible homogeneous polynomial of degree $e>1$ such that the projective hypersurface $V(F)$ is smooth. In this paper we give a bound for…
Given a numerical semigroup S = <a_0, a_1, a_2,..., a_t> and n in S, we consider the factorization n = c_0 a_0 + c_1 a_1 + ... + c_t a_t where c_i >= 0. Such a factorization is maximal if c_0 + c_1 + ... + c_t is a maximum over all such…
In this paper, we present a new method for computing the f-vector of a marked order polytope. Namely, given an arbitrary (polyhedral) subdivision of an arbitrary convex polytope, we construct a cochain complex (over the two-element field…