Related papers: Combinatorial Nullstellensatz modulo prime powers …
Symmetries occur naturally in CSP or SAT problems and are not very difficult to discover, but using them to prune the search space tends to be very challenging. Indeed, this usually requires finding specific elements in a group of…
We introduce a new division formula on projective space which provides explicit solutions to various polynomial division problems with sharp degree estimates. We consider simple examples as the classical Macaulay theorem as well as a quite…
Fagin defined the class $NP$ by the means of Existential Second-Order logic. Feder and Vardi expressed it (up to polynomial equivalence) by special fragments of Existential Second-Order logic (SNP), while the authors used forbidden expanded…
Poisson superpair is a pair of Poisson superalgebra structures on a super commutative associative algebra, whose any linear combination is also a Poisson superalgebra structure. In this paper, we first construct certain linear and quadratic…
We show that several online combinatorial optimization problems that admit efficient no-regret algorithms become computationally hard in the sleeping setting where a subset of actions becomes unavailable in each round. Specifically, we show…
We consider the problem of interpolating functions partially defined over a distributive lattice, by means of lattice polynomial functions. Goodstein's theorem solves a particular instance of this interpolation problem on a distributive…
Recent research has examined algorithms to minimize robots' resource footprints. The class of combinatorial filters (discrete variants of widely-used probabilistic estimators) has been studied and methods for reducing their space…
The generalization of the Oberwolfach Problem, proposed by J. Liu in 2000, asks for a uniform $2$-factorization of the complete multipartite graph $K_{m\times n}$. Here we focus our attention on $2$-factorizations regular under the cyclic…
We give a new, systematic proof for a recent result of Larry Guth and thus also extend the result to a setting with several families of varieties: For any integer $D\geq 1$ and any collection of sets $\Gamma_1,\ldots,\Gamma_j$ of low-degree…
We consider the task of detecting a hidden bipartite subgraph in a given random graph. This is formulated as a hypothesis testing problem, under the null hypothesis, the graph is a realization of an Erd\H{o}s-R\'{e}nyi random graph over $n$…
While the P vs NP problem is mainly approached form the point of view of discrete mathematics, this paper proposes reformulations into the field of abstract algebra, geometry, fourier analysis and of continuous global optimization - which…
Recently, Grynkiewicz et al. [{\it Israel J. Math.} {\bf 193} (2013), 359--398], using tools from additive combinatorics and group theory, proved necessary and sufficient conditions under which the linear congruence $a_1x_1+\cdots…
We give, using higher Bernstein polynomials defined in our paper [2], a stronger version of our previous result in [1] whose converse is proved in [2] and we give some complements to the results in [2] which help to compute these higher…
As it follows from G\"odel's incompleteness theorems, any consistent formal system of axioms and rules of inference should imply a true unprovable statement. Actually, this fundamental principle can be efficiently applicable in…
We consider Upper Domination, the problem of finding the minimal dominating set of maximum cardinality. Very few exact algorithms have been described for solving Upper Domination. In particular, no binary programming formulations for Upper…
We consider finding a zero point of the maximally monotone operator $T$. First, instead of using the proximal point algorithm (PPA) for this purpose, we employ PPA to solve its Yosida regularization $T_{\lambda}$. Then, based on an…
In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of $n$ definable sets belonging to some fixed definable family of sets in an o-minimal structure. This generalizes the…
We find a relation between the vanishing of a globally defined residue current on $\P^n$ and solution of the membership problem with control of the polynomial degrees. Several classical results appear as special cases, such as Max…
We consider the number of various partitions of $n$ with parts separated by parity and prove combinatorially several inequalities between these numbers. For example, we show that for $n\geq 5$ we have $p_{od}^{eu}(n)<p_{ed}^{ou}(n)$, where…
We study the problem of generating monomials of a polynomial in the context of enumeration complexity. In this setting, the complexity measure is the delay between two solutions and the total time. We present two new algorithms for…