相关论文: Junta threshold for low degree Boolean functions o…

This work presents a study of perturbations of symmetric Boolean functions. In particular, it establishes a connection between exponential sums of these perturbations and Diophantine equations of the form $$ \sum_{l=0}^n \binom{n}{l}…

The purpose of this note is twofold. First, we give a quick proof of Ballico-Chiantini's theorem stating that a Fano or Calabi-Yau variety of dimension at least 4 in codimension two is a complete intersection. Second, we improve Barth-Van…

Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…

Shannon proved that almost all Boolean functions require a circuit of size $\Theta(2^n/n)$. We prove a quantum analog of this classical result. Unlike in the classical case the number of quantum circuits of any fixed size that we allow is…

Slice regular functions have been extensively studied over the past decade, but much less is known about their boundary behavior. In this paper, we initiate the study of Julia theory for slice regular functions. More specifically, we…

A natural measure of smoothness of a Boolean function is its sensitivity (the largest number of Hamming neighbors of a point which differ from it in function value). The structure of smooth or equivalently low-sensitivity functions is still…

The logarithmic coefficients $\gamma_n$ of an analytic and univalent function $f$ in the unit disk $\mathbb{D}=\{z\in\mathbb{C}:|z|<1\}$ with the normalization $f(0)=0=f'(0)-1$ is defined by $\log \frac{f(z)}{z}= 2\sum_{n=1}^{\infty}…

Let $\mathcal{U(\alpha, \lambda)}$, $0<\alpha <1$, $0 < \lambda <1$ be the class of functions $f(z)=z+a_{2}z^{2}+a_{3}z^{3}+\cdots$ satisfying $$\left|\left(\frac{z}{f(z)}\right)^{1+\alpha}f'(z)-1\right|<\lambda$$ in the unit disc ${\mathbb…

Let $E$ be an arbitrary closed set on the unit circle $\partial \mathbb{D}$, u be a harmonic function on the unit disk $\mathbb{D}$ satisfying $|u(z)|\lesssim (1-|z|)^\gamma \rho^{-q}(z)$ where $\rho(z)= \mathop{\rm dist}(z, E)$, $\gamma$,…

For domains in $\mathbb{R}^d$, $d\geq 2$, we prove universal upper and lower bounds on the product of the bottom of the spectrum for the Laplacian to the power $p>0$ and the supremum over all starting points of the $p$-moments of the exit…

If a knot K bounds a genus one Seifert surface F in the 3-sphere and F contains an essential simple closed curve alpha that has induced framing 0 and is smoothly slice, then K is smoothly slice. Conjecturally, the converse holds. It is…

We consider the problem of enumerating relevant features hidden in other irrelevant information for multi-labeled data, which is formalized as learning juntas. A $k$-junta function is a function which depends on only $k$ coordinates of the…

We study the problem of testing whether a function $f: \mathbb{R}^n \to \mathbb{R}$ is a polynomial of degree at most $d$ in the \emph{distribution-free} testing model. Here, the distance between functions is measured with respect to an…

Assume that the Riemann hypothesis holds for Dedekind zeta functions. Under this assumption, we prove that a degree $d$ polynomial with random multiplicative $\pm1$ coefficients is irreducible in $\mathbb{Z}[x]$ with probability…

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…

Using Stickelberger's theorem on Gauss sums, we show that if $F$ is a planar function on a finite field $\mathbb{F}_q$, then for all non-zero functions $G : \mathbb{F}_q \to \mathbb{F}_q$, we have \begin{equation*} d_{\mathsf{alg}}(G \circ…

A two-dimensional threshold function of k-valued logic can be viewed as coloring of the points of a k x k square lattice into two colors such that there exists a straight line separating points of different colors. For the number of such…

Lattice induced threshold function is a Boolean function determined by a particular linear combination of lattice elements. We prove that every isotone Boolean function is a lattice induced threshold function and vice versa. We also…

Given any square matrix or a bounded operator $A$ in a Hilbert space such that $p(A)$ is normal (or similar to normal), we construct a Banach algebra, depending on the polynomial $p$, for which a simple functional calculus holds. When the…

We study the extremal competitive ratio of Boolean function evaluation. We provide the first non-trivial lower and upper bounds for classes of Boolean functions which are not included in the class of monotone Boolean functions. For the…