Related papers: Combinatorial Nullstellensatz modulo prime powers …
In this paper, we review the problem of matrix completion and expose its intimate relations with algebraic geometry, combinatorics and graph theory. We present the first necessary and sufficient combinatorial conditions for matrices of…
We prove lower bounds of order $n\log n$ for both the problem to multiply polynomials of degree $n$, and to divide polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbers. These lower…
We study the problem of computing the parity of the number of homomorphisms from an input graph $G$ to a fixed graph $H$. Faben and Jerrum [ToC'15] introduced an explicit criterion on the graph $H$ and conjectured that, if satisfied, the…
Submodular functions are an important class of functions in combinatorial optimization which satisfy the natural properties of decreasing marginal costs. The study of these functions has led to strong structural properties with applications…
The Olson constant $\mathcal{O}L(\mathbb{F}_{p}^{d})$ represents the minimum positive integer $t$ with the property that every subset $A\subset \mathbb{F}_{p}^{d}$ of cardinality $t$ contains a nonempty subset with vanishing sum. The…
The coalition structure formation problem represents an active research area in multi-agent systems. A coalition structure is defined as a partition of the agents involved in a system into disjoint coalitions. The problem of finding the…
We present a class of linear programming approximations for constrained optimization problems. In the case of mixed-integer polynomial optimization problems, if the intersection graph of the constraints has bounded tree-width our…
We prove a theorem on distortion of cross ratio of four points under the mapping effected by a complex polynomial with restricted critical values. Its corollaries include inequalities involving the absolute value and certain coefficients of…
The arithmetic properties of the ordinary partition function $p(n)$ have been the topic of intensive study for the past century. Ramanujan proved that there are linear congruences of the form $p(\ell n+\beta)\equiv 0\pmod\ell$ for the…
Recently, Pasarkar, Papadimitriou, and Yannakakis (ITCS 2023) have introduced the new TFNP subclass called PLC that contains the class PPP; they also have proven that several search problems related to extremal combinatorial principles…
It is known that point searching in basic semialgebraic sets and the search for globally minimal points in polynomial optimization tasks can be carried out using $(s\,d)^{O(n)}$ arithmetic operations, where $n$ and $s$ are the numbers of…
We present a new data structure to approximate accurately and efficiently a polynomial $f$ of degree $d$ given as a list of coefficients. Its properties allow us to improve the state-of-the-art bounds on the bit complexity for the problems…
We pose and solve the equivalence problem for subspaces of ${\mathcal P}_n$, the $(n+1)$ dimensional vector space of univariate polynomials of degree $\leq n$. The group of interest is ${\rm SL}_2$ acting by projective transformations on…
We explore the connection between two seemingly distant fields: the set of cyclic functions $f$ in a Hilbert space of analytic functions over the unit disc $\D$, on the one hand, and the families of orthogonal polynomials for a weight on…
Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of $P(x)^k Q(x)$, for some Laurent polynomials $P(x)$ and $Q(x)$ in the variable $x$ with integer coefficients. Denoting such…
We compute the combinatorial Aomoto-Betti numbers $\beta_p(\mathcal{A})$ of a complex reflection arrangement. When $\mathcal{A}$ has rank at least $3$, we find that $\beta_p(\mathcal{A})\le 2$, for all primes $p$. Moreover,…
In order to understand the parameter space of monic and centered complex polynomial vector fields of degree d in the complex plane, decomposed by the combinatorial classes of the vector fields, it is interesting to know the number of loci…
We examine the behavior of the coefficients of powers of polynomials over a finite field of prime order. Extending the work of Allouche-Berthe, 1997, we study a(n), the number of occurring strings of length n among coefficients of any power…
Covering ill-posed problems with compact and non-compact operators regarding the degree of ill-posedness is a never ending story written by many authors in the inverse problems literature. This paper tries to add a new narrative and some…
In the first part of this paper we consider a general stationary subcritical cluster model in $\mathbb{R}^d$. The associated pair-connectedness function can be defined in terms of two-point Palm probabilities of the underlying point…