Related papers: About almost covering subsets of the hypercube

Let k >= 2 and F be a linear k-uniform hypergraph with v vertices. We prove that if n is sufficiently large and v|n, then every quasirandom k-uniform hypergraph on n vertices with constant edge density and minimum degree $\Omega(n^{k-1})$…

Let $f,g_1,\dots,g_m$ be polynomials with real coefficients in a vector of variables $x=(x_1,\dots,x_n)$. Denote by $\text{diag}(g)$ the diagonal matrix with coefficients $g=(g_1,\dots,g_m)$ and denote by $\nabla g$ the Jacobian of $g$. Let…

In this note we connect Sobolev estimates in the context of polynomial averages e.g. \[ \| \int_0^1 \prod_{k=1}^m f_k(x-t^k) \|_{1} \leq \text{Const} \cdot 2^{-\text{const} \cdot l} \prod_{i=1}^m \| f_k \|_m \] whenever some $f_i$ vanishes…

In this paper we find the number of homogeneous polynomials of degree d such that they vanish on cuspidal modular forms of even weight $m\geq 2$ that form a basis for $S_m(\Gamma_0(N))$. We use these cuspidal forms to embedd $X_0(N)$ to…

Extending the work of Bell, Matsuzawa and Satriano, we consider a finite set of polynomials $S$ over a number field $K$ and give a necessary and sufficient condition for the existence of a $N \in \mathbb{N}_{> 0}$ and a finite set $Z…

For a large class (heuristically most) of irreducible binary cubic forms $F(x,y) \in \mathbb Z[x,y]$, Bennett and Dahmen proved that the generalized superelliptic equation $F(x,y)=z^l$ has at most finitely many solutions in $x,y \in \mathbb…

We show an equivalence between 1-query quantum algorithms and representations by degree-2 polynomials. Namely, a partial Boolean function $f$ is computable by a 1-query quantum algorithm with error bounded by $\epsilon<1/2$ iff $f$ can be…

Let H be the supremum of finitely many real polynomials of degree d and assume that H has a strict local minimum at 0. We prove a \L ojasiewicz-type inequality $H(x_1,...,x_n) > ||(x_1,...,x_n)||^s$ where s depends only on d and n. This…

Polynomials with coefficients in $\{-1,1\}$ are called Littlewood polynomials. Using special properties of the Rudin-Shapiro polynomials and classical results in approximation theory such as Jackson's Theorem, de la Vall\'ee Poussin sums,…

We generalize the Bernstein-Walsh-Siciak theorem on polynomial approximation in $\mathbb{C}^n$ to the case where the polynomial ring $\mathcal{P}(\mathbb{C}^n)$ is replaced by a subring $\mathcal{P}^S(\mathbb{C}^n)$ consisting of all…

We prove the classical result, which goes back at least to Fourier, that a polynomial with real coefficients has all zeros real and distinct if and only if the polynomial and also all of its nonconstant derivatives have only negative minima…

In contrast to the univariate case, interpolation with polynomials of a given maximal total degree is not always possible even if the number of interpolation points and the space dimension coincide. Due to that, numerous constructions for…

The probability for two monic polynomials of a positive degree n with coefficients in the finite field F_q to be relatively prime turns out to be identical with the probability for an n x n Hankel matrix over F_q to be nonsingular.…

Strong asymptotics of polynomials orthogonal on the unit circle with respect to a weight of the form $$ W(z) = w(z) \prod_{k=1}^m |z-a_k|^{2\beta_k}, \quad |z|=1, \quad |a_k|=1, \quad \beta_k>-1/2, \quad k=1, ..., m, $$ where $w(z)>0$ for…

Very recently, Green and Sawhney obtained a quasipolynomial bound in the Furstenberg--S\'ark\"ozy theorem for square differences by proving an ''arithmetic level-$d$'' inequality, thereby yielding a greatly improved density increment…

Building upon recent work by the author, we prove that multivariate integration in the following subspace of the Wiener algebra over $[0,1)^d$ is strongly polynomially tractable: \[ F_d:=\left\{ f\in C([0,1)^d)\:\middle| \:…

Let q be an odd power of a prime p and let A/Fq be a supersingular abelian variety of dimension g. We show that if p>2g+1, then the characteristic polynomial of the q-Frobenius is an even polynomial. This generalizes the well-known result…

The polynomial method has been used recently to obtain many striking results in combinatorial geometry. In this paper, we use affine Hilbert functions to obtain an estimation theorem in finite field geometry. The most natural way to state…

We introduce quasi-invariant polynomials for an arbitrary finite complex reflection group W. Unlike in the Coxeter case, the space Q_k of quasi-invariants of a given multiplicity is not, in general, an algebra but a module over the…

In this paper we prove several theorems about abelian varieties over finite fields by studying the set of monic real polynomials of degree 2n all of whose roots lie on the unit circle. In particular, we consider a set V_n of vectors in R^n…