相关论文: Arithmetic of marked order polytopes, monotone tri…

It is consistent that there is a partial order (P,<) of size aleph_1 such that every monotone (unary) function from P to P is first order definable in (P,<). The partial order is constructed in an extension obtained by finite support…

The problem is considered as to whether a monotone function defined on a subset P of a Euclidean space can be strictly monotonically extended to the whole space. It is proved that this is the case if and only if the function is {\em…

A common theme of enumerative combinatorics is formed by counting functions that are polynomials evaluated at positive integers. In this expository paper, we focus on four families of such counting functions connected to hyperplane…

Motivated by Dohmen-P\"onitz-Tittmann's bivariate chromatic polynomial $\chi_G(x,y)$, which counts all $x$-colorings of a graph $G$ such that adjacent vertices get different colors if they are $\le y$, we introduce a bivarate version of…

P\'olya's enumeration theorem is concerned with counting labeled sets up to symmetry. Given a finite group acting on a finite set of labeled elements it states that the number of labeled sets up to symmetry is given by a polynomial in the…

Given a pair of finite posets $A \subseteq P$, the function counting integer-valued order preserving extensions of an order preserving map $\lambda : A\rightarrow \mathbb{Z}$ from $A$ to $P$ is given by a piecewise polynomial in $\lambda$.…

We study the problem of extending an order-preserving real-valued Lipschitz map defined on a subset of a partially ordered metric space without increasing its Lipschitz constant and preserving its monotonicity. We show that a certain type…

For a convex polytope P with rational vertices, we count the number of integer points in integral dilates of P and its interior. The Ehrhart-Macdonald reciprocity law gives an intimate relation between these two counting functions. A…

Every generic linear functional $f$ on a convex polytope $P$ induces an orientation on the graph of $P$. From the resulting directed graph one can define a notion of $f$-arborescence and $f$-monotone path on $P$, as well as a natural graph…

Let G be a graph, and let $\chi$G be its chromatic polynomial. For any non-negative integers i, j, we give an interpretation for the evaluation $\chi$ (i) G (--j) in terms of acyclic orientations. This recovers the classical interpretations…

In this paper, we study the graph polynomial that counts spanning rooted forests f_g of a given graph. This polynomial has a remarkable reciprocity property. We give a new bijective proof for this theorem which has Prufer coding as a…

There are many variations on partition functions for graph homomorphisms or colorings. The case considered here is a counting or hard constraint problem in which the range or color graph carries a free and vertex transitive Abelian group…

We revisit the problem of enumeration of vertex-tricolored planar random triangulations solved in [Nucl. Phys. B 516 [FS] (1998) 543-587] in the light of recent combinatorial developments relating classical planar graph counting problems to…

We examine the lattice of all order congruences of a finite poset from the viewpoint of combinatorial algebraic topology. We will prove that the order complex of the lattice of all nontrivial order congruences (or order-preserving…

In arXiv:1709.07504 Aguiar and Ardila give a Hopf monoid structure on hypergraphs as well as a general construction of polynomial invariants on Hopf monoids. Using these results, we define in this paper a new polynomial invariant on…

The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values…

A \emph{mixed graph} is a graph with directed edges, called arcs, and undirected edges. A $k$-coloring of the vertices is proper if colors from ${1,2,...,k}$ are assigned to each vertex such that $u$ and $v$ have different colors if $uv$ is…

In this paper we describe a novel a procedure to build a linear order from an arbitrary poset which (i) preserves the original ordering and (ii) allows to extend monotonic and antitonic mappings defined over the original poset to monotonic…

Generalized permutahedra are a class of polytopes with many interesting combinatorial subclasses. We introduce pruned inside-out polytopes, a generalization of inside-out polytopes introduced by Beck--Zaslavsky (2006), which have many…

Raimi's theorem guarantees the existence of a partition of $\mathbb{N}$ into two parts with an unavoidable intersection property: for any finite coloring of $\mathbb{N}$, some color class intersects both parts infinitely many times, after…