Related papers: Quantitative Combinatorial Nullstellensatz

The Alon-Tarsi number of a polynomial is a parameter related to the exponents of its monomials. For graphs, their Alon-Tarsi number is the Alon-Tarsi number of their graph polynomials. As such, it provides an upper bound on their choice and…

We establish a quantitative version of Oppenheim's conjecture for generic ternary indefinite quadratic forms using an analytic number theory approach. The statements come with power gains and in some cases are essentially optimal

We generalize our puzzle formula for ordinary Schubert calculus on Grassmannians, to a formula for the T-equivariant Schubert calculus. The structure constants to be calculated are polynomials in {y_{i+1} - y_i}; they were shown…

We extend the construction of generalized fixed point algebras to the setting of locally compact quantum groups - in the sense of Kustermans and Vaes - following the treatment of Marc Rieffel, Ruy Exel and Ralf Meyer in the group case. We…

We consider the graph $k$-colouring problem encoded as a set of polynomial equations in the standard way over $0/1$-valued variables. We prove that there are bounded-degree graphs that do not have legal $k$-colourings but for which the…

The generalised colouring numbers $\mathrm{adm}_r(G)$, $\mathrm{col}_r(G)$, and $\mathrm{wcol}_r(G)$ were introduced by Kierstead and Yang as generalisations of the usual colouring number, also known as the degeneracy of a graph, and have…

By using combinatorics, we give a new proof for the recurrence relations of the characteristic polynomial coefficients, and then we obtain an explicit expression for the generic term of the coefficient sequence, which yields the trace…

We study cluster algebras with principal coefficient systems that are associated to unpunctured surfaces. We give a direct formula for the Laurent polynomial expansion of cluster variables in these cluster algebras in terms of perfect…

We give a short and elementary proof of a theorem of Procesi, Schacher and (independently) Gondard, Ribenboim that generalizes a famous result of Artin. Let $A$ be an $n \times n$ symmetric matrix with entries in the polynomial ring…

As one of the first applications of the polynomial method in combinatorics, Alon and Tarsi gave a way to prove that a graph is choosable (colorable from any lists of prescribed size). We describe an efficient way to implement this approach,…

Let $\mathcal A$ be an $\mathbb F$-algebra and $\omega \in \mathcal A\langle x_1, \ldots, x_m \rangle$ which defines a map $\mathcal A^m \rightarrow \mathcal A$ by evaluation, called a polynomial map with constant. We consider $\mathcal {A}…

We begin by explaining how arguments used by R. Wilson to give an elementary proof of the $\mathbb F_p$ case for the Ax-Katz Theorem can also be used to prove the following generalization of the Chevalley-Warning and Ax-Katz Theorems for…

In his solution of Hilbert's 17th problem Artin showed that any positive definite polynomial in several variables can be written as the quotient of two sums of squares. Later Reznick showed that the denominator in Artin's result can always…

The great innovation of the Generalized Theorem is that it gives us the philosophy to work out the knowledge that the number of roots of an equation depends on the subfields of the functional terms of the equation they generate. Thus, the…

A partial complement of the graph $G$ is a graph obtained from $G$ by complementing all the edges in one of its induced subgraphs. We study the following algorithmic question: for a given graph $G$ and graph class $\mathcal{G}$, is there a…

In this paper we characterize real bivariate polynomials which have a small range over large Cartesian products. We show that for every constant-degree bivariate real polynomial $f$, either $|f(A,B)|=\Omega(n^{4/3})$, for every pair of…

Coupled cluster theory produced arguably the most widely used high-accuracy computational quantum chemistry methods. Despite the approach's overall great computational success, its mathematical understanding is so far limited to results…

We consider several notions of genericity appearing in algebraic geometry and commutative algebra. Special emphasis is put on various stability notions which are defined in a combinatorial manner and for which a number of equivalent…

We consider the algebraic K-theory of a truncated polynomial algebra in several commuting variables, K(k[x_1, ..., x_n]/(x_1^a_1, ..., x_n^a_n)). This naturally leads to a new generalization of the big Witt vectors. If k is a perfect field…

Let $p$ be a polynomial in several non-commuting variables with coefficients in a field $K$ of arbitrary characteristic. It has been conjectured that for any $n$, for $p$ multilinear, the image of $p$ evaluated on the set $M_n(K)$ of $n$ by…