Related papers: Colorful combinatorics and Macdonald polynomials

Let $\k$ be a field and let $A$ be a standard $\mathbb{N}$-graded $\k$-algebra. Using numerical information of some invariants in the primary decomposition of $0$ in $A$, namely the so called dimension filtration, we associate a bivariate…

George Andrews and Mohamed El Bachraoui recently explored identities for two-color partitions. In particular, they studied the connection between two-colored partitions and overpartitions. Their proofs were analytical, but they conjectured…

Monads play an important role in both the syntax and semantics of modern functional programming languages. The problem of combining them has been of profound interest at least since the 90s, and different approaches have been employed to…

A paper of the first author and Zilke proposed seven combinatorial problems around formulas for the characteristic polynomial and the exponents of an isolated quasihomogeneous singularity. The most important of them was a conjecture on the…

Stanley associated with a graph G a symmetric function X_G which reduces to G's chromatic polynomial under a certain specialization of variables. He then proved various theorems generalizing results about the chromatic polynomial, as well…

Motivated by a connection between the topology of (generalized) configuration spaces and chromatic polynomials, we show that generating functions of Hodge-Deligne polynomials of quasiprojective varieties and colorings of acyclic directed…

We generalize a formula due to Macdonald that relates the singular Betti numbers of $X^{n}/G$ to those of $X$, where $X$ is a compact manifold and $G$ is any subgroup of the symmetric group $S_{n}$ acting on $X^{n}$ by permuting…

We use mixed Hodge theory to show that the functor of singular chains with rational coefficients is formal as a lax symmetric monoidal functor, when restricted to complex schemes whose weight filtration in cohomology satisfies a certain…

Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of…

In this paper we consider the following question in the spirit of Ramsey theory: Given $x\in A^\omega,$ where $A$ is a finite non-empty set, does there exist a finite coloring of the non-empty factors of $x$ with the property that no…

Combinatorial objects called rigged configurations give rise to q-analogues of certain Littlewood-Richardson coefficients. The Kostka-Foulkes polynomials and two-column Macdonald-Kostka polynomials occur as special cases. Conjecturally…

This is a sequel to our paper "Permute, Graph, Map, Derange", involving decomposable combinatorial labeled structures in the exp-log class of type a=1/2, 1, 3/2, 2. As before, our approach is to establish how well existing theory matches…

In [2], while studying a relevant class of polyominoes that tile the plane by translation, i.e., double square polyominoes, the authors found that their boundary words, encoded by the Freeman chain coding on a four letters alphabet, have…

A well-known and fundamental property of the Macdonald polynomials $P_\lambda(x;q,t)$ is their invariance under the transformation sending $(q,t)$ to $(q^{-1},t^{-1})$. Recently, Concha and Lapointe showed that this property extends in an…

Using the definition of colouring of $2$-edge-coloured graphs derived from $2$-edge-coloured graph homomorphism, we extend the definition of chromatic polynomial to $2$-edge-coloured graphs. We find closed forms for the first three…

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 combinatorics of a subcomplex of the Bloch-Kriz cycle complex [4] used to construct the category of mixed Tate motives. The algebraic cycles we consider properly contain the subalgebra of cycles that correspond…

We show that a finite coloring of an amenable group contains `many' monochromatic sets of the form $\{x,y,xy,yx\},$ and natural extensions with more variables. This gives the first combinatorial proof and extensions of Bergelson and…

Kostka functions $K^{\pm}_{\lambda, \mu}(t)$ associated to complex reflection groups are a generalization of Kostka polynomials, which are indexed by a pair $\lambda, \mu$ of $r$-partitions and a sign $+, -$. It is expected that there…

In this paper, we consider multivariate hyperedge elimination polynomials and multivariate chromatic polynomials for hypergraphs. The first set of polynomials is defined in terms of a deletion-contraction-extraction recurrence, previously…