相关论文: A New Bound on Cofactors of Sparse Polynomials

Let $g(X)$ be a polynomial over a finite field ${\mathbb F}_q$ with degree $o(q^{1/2})$, and let $\chi$ be the quadratic residue character. We give a polynomial time algorithm to recover $g(X)$ (up to perfect square factors) given the…

We study the Excluded Grid Theorem of Robertson and Seymour. This is a fundamental result in graph theory, that states that there is some function $f: Z^+\rightarrow Z^+$, such that for all integers $g>0$, every graph of treewidth at least…

We prove upper and lower bounds for all the coefficients in the Hilbert Polynomial of a graded Gorenstein algebra $S=R/I$ with a quasi-pure resolution over $R$. The bounds are in terms of the minimal and the maximal shifts in the resolution…

We show that, for $n\geq 3$, $\lim_{t \to 0} e^{it\Delta}f(x) = f(x)$ holds almost everywhere for all $f \in H^s (\mathbb{R}^n)$ provided that $s>\frac{n}{2(n+1)}$. Due to a counterexample by Bourgain, up to the endpoint, this result is…

Let $\R(\cdot)$ stand for the bounded-error randomized query complexity. We show that for any relation $f \subseteq \{0,1\}^n \times \mathcal{S}$ and partial Boolean function $g \subseteq \{0,1\}^n \times \{0,1\}$, $\R_{1/3}(f \circ g^n) =…

We introduce sufficient conditions on discrete singular integral operators for their maximal truncations to satisfy a sparse bound. The latter imply a range of quantitative weighted inequalities, which are new. As an application, we prove…

The following problem is studied: describe the triplets $(\Omega,g,\mu)$, $\mu=\rho\,dx$, where $g= (g^{ij}(x))$ is the (co)metric associated with the symmetric second order differential operator $L(f) = \frac{1}{\rho}\sum_{ij} \partial_i…

A classical result of Steinitz from 1913 \cite{Ste13}, answering an earlier question of Riemann and L\'evy (e.g., \cite{Lev05}), states that for any norm $\|\cdot\|$ in $\mathbb{R}^d$ and any set of vectors $v_1, \cdots, v_n \in \R^d$…

The Euler genus of a graph is a fundamental and well-studied parameter in graph theory and topology. Computing it has been shown to be NP-hard by [Thomassen '89 & '93], and it is known to be fixed-parameter tractable. However, the…

We reveal a complexity chasm, separating the trinomial and tetranomial cases, for solving univariate sparse polynomial equations over certain local fields. First, for any fixed field $K\in\{\mathbb{Q}_2,\mathbb{Q}_3,\mathbb{Q}_5,\ldots\}$,…

We show that the greatest prime factor of $n^2+h$ is at least $n^{1.312}$ infinitely often. This gives an unconditional proof for the range previously known under the Selberg eigenvalue conjecture. Furthermore, we get uniformity in $h \leq…

In prior work, we showed that subsets of $\mathbb{F}_{p}^{n}$ of $\mathrm{VC_{2}}$-dimension at most $k$ are well approximated by a union of atoms of a quadratic factor of complexity $(\ell,q)$, where the complexity $\ell$ of the linear…

The motivation of this work stems from the numerical approximation of bounded functions by polynomials satisfying the same bounds. The present contribution makes use of the recent algebraic characterization found in [B. Despr\'es, Numer.…

Baader, J\"org, and Parlier recently established an upper bound for the crossing number of curve systems of size $m\asymp g^{1+\alpha}$ on a genus $g$ surface, obtaining a leading coefficient of $9/4=2.25$. Their construction relies on…

We consider a \emph{family} $(P_\omega)_{\omega \in \Omega}$ of elliptic second order differential operators on a domain $U_0 \subset \mathbb{R}^m$ whose coefficients depend on the space variable $x \in U_0$ and on $\omega \in \Omega,$ a…

The \emph{Chow parameters} of a Boolean function $f: \{-1,1\}^n \to \{-1,1\}$ are its $n+1$ degree-0 and degree-1 Fourier coefficients. It has been known since 1961 (Chow, Tannenbaum) that the (exact values of the) Chow parameters of any…

We present a new effective Nullstellensatz with bounds for the degrees which depend not only on the number of variables and on the degrees of the input polynomials but also on an additional parameter called the {\it geometric degree of the…

The Bohnenblust--Hille inequality says that the $\ell^{\frac{2m}{m+1}}$-norm of the coefficients of an $m$-homogeneous polynomial $P$ on $\C^n$ is bounded by $\| P\|_\infty$ times a constant independent of $n$, where $\|\cdot \|_\infty$…

For polynomial $ P (x,y)$, and any Calder\'{o}n-Zygmund kernel, $K$, the operator below satisfies a $ (1,r)$ sparse bound, for $ 1< r \leq 2$. $$ \sup _{\epsilon >0} \Bigl\lvert \int_{|y| > \epsilon} f (x-y) e ^{2 \pi i P (x,y) } K(y) \; dy…

In this work we study convergence properties of sparse polynomial approximations for a class of affine parametric saddle point problems. Such problems can be found in many computational science and engineering fields, including the Stokes…