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

Dillon-like Boolean functions are known, in the literature, to be those trace polynomial functions from $\mathbb{F}_{2^{2n}}$ to $\mathbb{F}_{2}$, with all the exponents being multiples of $2^n-1$ often called Dillon-like exponents. This…

Consider the following truncated Freud linear functional $\mathbf{u}_z$ depending on a parameter $z$, $$\langle\mathbf{u}_z,p\rangle=\int_0^\infty p(x)e^{-zx^4}dx,\quad z>0.$$ The aim of this work is to analyze the properties of the…

In the previous paper, we showed that the Riley polynomial $\mathcal{R}_K(\lambda)$ of each 2-bridge knot $K$ is split into $\mathcal{R}_K(-u^2)=\pm g(u)g(-u)$, for some integral coefficient polynomial $g(u)\in \mathbb Z[u]$. In this paper,…

We give a remarkable additional orthogonality property of the classical Legendre polynomials on the real interval $[-1,1]$: polynomials up to degree $n$ from this family are mutually orthogonal under the arcsine measure weighted by the…

A classic result by Carbery and Wright states that a polynomial of Gaussian random variables exhibits anti-concentration in the following sense: for any degree $d$ polynomial $f$, one has the estimate $P( |f(x)| \leq \varepsilon \cdot…

For a suitable irreducible \textit{base} polynomial $f(x)\in \mathbf{Z}[x]$ of degree $k$, a family of polynomials $F_m(x)$ depending on $f(x)$ is constructed with the properties: (i) there is exactly one irreducible factor $\Phi_{d,f}(x)$…

We study fixed points with N scalar fields in $4 - \varepsilon$ dimensions to leading order in $\varepsilon$ using a bottom-up approach. We do so by analyzing O(N) invariants of the quartic coupling $\lambda_{ijkl}$ that describes such…

We develope the $L$-functions ratios conjecture with one shift in the numerator and denominator in certain ranges for the family of quadratic Hecke $L$-functions in the Gaussian field using multiple Dirichlet series under the generalized…

Let $M_n$ be the maximum of $n$ zero-mean gaussian variables $X_1,..,X_n$ with covariance matrix of minimum eigenvalue $\lambda$ and maximum eigenvalue $\Lambda$. Then, for $n \ge 70$, $$\Pr\{M_n \ge \lambda \left (2 \log n - 2.5 - \log(2…

Using the technique developed in approximation theory, we construct examples of exponential families of infinitely divisible laws which can be viewed as deformations of the normal, gamma, and Poisson exponential families. Replacing the…

NOTE: Unfortunately, most of the results mentioned here were already known under the name of "d-separated interval piercing". The result that T_d(m) exists was first proved by Gya\'rfa\'s and Lehel in 1970, see [5]. Later, the result was…

We study a family of monic orthogonal polynomials which are orthogonal with respect to the varying, complex valued weight function, $\exp(nsz)$, over the interval $[-1,1]$, where $s\in\mathbb{C}$ is arbitrary. This family of polynomials…

We prove a $k^{-\Omega(\log(\varepsilon_2 - \varepsilon_1))}$ lower bound for adaptively testing whether a Boolean function is $\varepsilon_1$-close to or $\varepsilon_2$-far from $k$-juntas. Our results provide the first superpolynomial…

In 1985, Odoni showed that in characteristic $0$ the Galois group of the $n$-th iterate of the generic polynomial with degree $d$ is as large as possible. That is, he showed that this Galois group is the $n$-th wreath power of the symmetric…

A new method of composition orthogonality is introduced. It is applied to generate new sequences of orthogonal polynomials and functions. In particular, classical orthogonal polynomials are interpreted in the sense of composition…

An independent set in a graph is a set of pairwise non-adjacent vertices. The independence number $\alpha{(G)}$ is the size of a maximum independent set in the graph $G$. The independence polynomial of a graph is the generating function for…

Polynomial threshold functions (PTFs) are an important low-complexity class of Boolean functions, with strong connections to learning theory and approximation theory. Recent work on learning and testing PTFs has exploited structural and…

Consider a system of $m$ polynomial equations $\{p_i(x) = b_i\}_{i \leq m}$ of degree $D\geq 2$ in $n$-dimensional variable $x \in \mathbb{R}^n$ such that each coefficient of every $p_i$ and $b_i$s are chosen at random and independently…

We present a perturbative construction of two kinds of eigenfunctions of the commuting family of difference operators defining the elliptic Ruijsenaars system. The first kind corresponds to elliptic deformations of the Macdonald…

The article proves an assertion analogous to the Littlewood-Paley theorem for the orthoprojectors onto mutually orthogonal subspaces of piecewise polynomial functions on the cube $ I^d. $ This assertion provides an upper estimate for the…