Related papers: Combinatorial Nullstellensatz modulo prime powers …

In a seminal paper, De Loera et. al introduce the algorithm NulLA (Nullstellensatz Linear Algebra) and use it to measure the difficulty of determining if a graph is not 3-colorable. The crux of this relies on a correspondence between…

We consider symmetric partial exclusion and inclusion processes in a general graph in contact with reservoirs, where we allow both for edge disorder and well-chosen site disorder. We extend the classical dualities to this context and then…

So-called separation automata are in the core of several recently invented quasi-polynomial time algorithms for parity games. An explicit $q$-state separation automaton implies an algorithm for parity games with running time polynomial in…

One of the most basic results concerning the number-theoretic properties of the partition function $p(n)$ is that $p(n)$ takes each value of parity infinitely often. This statement was first proved by Kolberg in 1959, and it was…

P\'olya's Positivstellensatz and Handelman's Positivstellensatz are known to be concrete instances of the abstract Archimedean Representation Theorem for (commutative unital) rings. We generalise the Archimedean Representation Theorem to…

Determining which bipartite graphs can be principal graphs of subfactors is an important and difficult question in subfactor theory. Using only planar algebra techniques, we prove a triple point obstruction which generalizes all known…

We give formulas for the multiplicity of any affine isolated zero of a generic polynomial system of n equations in n unknowns with prescribed sets of monomials. First, we consider sets of supports such that the origin is an isolated root of…

Let ${{\overline{p}}_{3}}(n)$ be the number of overpartition triples of $n$. By elementary series manipulations, we establish some congruences for ${\overline{p}}_{3}(n)$ modulo small powers of 2, such as…

Suppose X is the complex zero set of a finite collection of polynomials in Z[x_1,...,x_n]. We show that deciding whether X contains a point all of whose coordinates are d_th roots of unity can be done within NP^NP (relative to the sparse…

The partition problem is a well-known basic NP-complete problem. We mainly consider the optimization version of it in this paper. The problem has been investigated from various perspectives for a long time and can be solved efficiently in…

The main result of the paper is motivated by the following two, apparently unrelated graph optimization problems: (A) as an extension of Edmonds' disjoint branchings theorem, characterize digraphs comprising $k$ disjoint branchings $B_i$…

State minimization of combinatorial filters is a fundamental problem that arises, for example, in building cheap, resource-efficient robots. But exact minimization is known to be NP-hard. This paper conducts a more nuanced analysis of this…

We reconsider the theory of Lagrange interpolation polynomials with multiple interpolation points and apply it to linear algebra. For instance, $A$ be a linear operator satisfying a degree $n$ polynomial equation $P(A)=0$. One can see that…

We examine applications of polynomial Lie algebras $sl_{pd}(2)$ to solve physical tasks in $G_{inv}$-invariant models of coupled subsystems in quantum physics. A general operator formalism is given to solve spectral problems using…

In this note we give an extended version of Combinatorial Nullstellensatz, with weaker assumption on nonvanishing monomial. We also present an application of our result in a situation where the original theorem does not seem to work.

In this work, we refine recent results on the explicit construction of polynomial algebras associated with commutants of subalgebras in enveloping algebras of Lie algebras by considering an additional grading with respect to the subalgebra.…

We introduce and investigate generalizations of interval and proper interval graphs to simplicial complexes, including strong interval, unit interval, and under closed variants. Through equivalent combinatorial and algebraic…

Two decades ago P. Martin and D. Woodcock made a surprising and prophetic link between statistical mechanics and representation theory. They observed that the decomposition numbers of the blob algebra (that appeared in the context of…

We prove an algebraic ``no-go theorem'' to the effect that a nontrivial Poisson algebra cannot be realized as an associative algebra with the commutator bracket. Using this, we show that there is an obstruction to quantizing the Poisson…

The question if a given partial solution to a problem can be extended reasonably occurs in many algorithmic approaches for optimization problems. For instance, when enumerating minimal dominating sets of a graph $G=(V,E)$, one usually…