相关论文: $k$-Independent Gaussians Fool Polynomial Threshol…

This work is a thorough investigation of skew-orthogonal polynomials with respect to a quartic Freud weight. We provide an explicit method to evaluate skew-orthogonal polynomials of any degree as linear combinations of orthogonal…

We prove the following statement. Let $f\in\mathbb{R}[x_1,\ldots,x_d]$, for some $d\ge 3$, and assume that $f$ depends non-trivially in each of $x_1,\ldots,x_d$. Then one of the following holds. (i) For every finite sets…

The classic Gauss-Lucas Theorem for complex polynomials of degree $d\ge2$ has a natural reformulation over quaternions, obtained via rotation around the real axis. We prove that such a reformulation is true only for $d=2$. We present a new…

We study de la Vall\'ee Poussin means of Walsh--Fourier series associated with a nondecreasing window sequence. We establish a sharp criterion for almost everywhere convergence for integrable functions. We further show that, when this…

We prove that every 3-regular, n-vertex simple graph with sufficiently large girth contains an independent set of size at least 0.4361n. (The best known bound is 0.4352n.) In fact, computer simulation suggests that the bound our method…

We obtain asymptotics of polynomials satisfying the orthogonality relations $$ \int_{\mathbb{R}} z^k P_n(z; t , N) \mathrm{e}^{-N \left(\frac{1}{4}z^4 + \frac{t}{2}z^2 \right)} \mathrm{d} z = 0 \quad \text{ for } \quad k = 0, 1, ..., n-1,…

In this work, we show that the class of multivariate degree-$d$ polynomials mapping $\{0,1\}^{n}$ to any Abelian group $G$ is locally correctable with $\widetilde{O}_{d}((\log n)^{d})$ queries for up to a fraction of errors approaching half…

The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in…

Let $A_n$ denote the height of cyclotomic polynomial $\Phi_n$, where $n$ is a product of $k$ distinct odd primes. We prove that $A_n \le \epsilon_k\phi(n)^{k^{-1}2^{k-1}-1}$ with $-\log\epsilon_k\sim c2^k$, $c>0$. The same statement is true…

We consider the family of real (generalized) eigenfunctions of the adjacency operator on $T_d$ - the $d$-regular tree. We show the existence of a unique invariant Gaussian process on the ensemble and derive explicitly its covariance…

We study a family of "classical" orthogonal polynomials which satisfy (apart from a 3-term recurrence relation) an eigenvalue problem with a differential operator of Dunkl-type. These polynomials can be obtained from the little $q$-Jacobi…

Skew stable Grothendieck polynomials are $K$-theoretic analogues of skew Schur polynomials. We give a free-fermionic presentation of skew stable Grothendieck polynomials and their dual symmetric functions. By using our presentation, we…

We introduce a new family of special functions, namely $q$-Charlier multiple orthogonal polynomials. These polynomials are orthogonal with respect to $q$-analogues of Poisson distributions. We focus our attention on their structural…

We analyze the Fourier growth, i.e. the $L_1$ Fourier weight at level $k$ (denoted $L_{1,k}$), of various well-studied classes of "structured" $\mathbb{F}_2$-polynomials. This study is motivated by applications in pseudorandomness, in…

We find a formula, in terms of n, d and p, for the value of the F-pure threshold for the generic homogeneous polynomial of degree d in n variables over an algebraically closed field of characteristic p. We also show that, in every…

Let $N_n(a, b)$ denote the number of real zeros of Gaussian elliptic polynomials of degree $n$ on the interval $(a, b)$, where $a$ and $b$ may vary with $n$. We obtain a precise formula for the variance of $N_n(a, b)$ and utilize this…

We prove the hardness of weakly learning halfspaces in the presence of adversarial noise using polynomial threshold functions (PTFs). In particular, we prove that for any constants $d \in \mathbb{Z}^+$ and $\varepsilon > 0$, it is NP-hard…

The threshold degree of a Boolean function f:{0,1}^n->{-1,+1} is the least degree of a real polynomial p such that f(x)=sgn p(x). We construct two halfspaces on {0,1}^n whose intersection has threshold degree Theta(sqrt n), an exponential…

Using the concept of $\mathcal{D}$-operator and the classical discrete family of dual Hahn, we construct orthogonal polynomials $(q_n)_n$ which are also eigenfunctions of higher order difference operators.

Let $\chi$ be an order $c$ multiplicative character of a finite field and $f(x)=x^d+\lambda x^e$ a binomial with $(d,e)=1$. We study the twisted classical and $T$-adic Newton polygons of $f$. When $p>(d-e)(2d-1)$, we give a lower bound of…