相关论文: Boolean constant degree functions on the slice are…

We prove a sharp degree bound for polynomials constant on a hyperplane with a fixed number of nonnegative distinct monomials. This bound was conjectured by John P. D'Angelo, proved in two dimensions by D'Angelo, Kos and Riehl and in three…

Relations between the decision tree complexity and various other complexity measures of Boolean functions is a thriving topic of research in computational complexity. It is known that decision tree complexity is bounded above by the cube of…

In this paper, we prove the following two results. Let $d$ be a natural number and $q,s$ be co-prime integers such that $1 < qs$. Then there exists a constant $\delta > 0$ depending only on $q,s$ and $d$ such that for any finite subset $A$…

We present an adaptive algorithm with one-sided error for the problem of junta testing for Boolean function under the challenging distribution-free setting, the query complexity of which is $\widetilde O(k)/\epsilon$. This improves the…

We give a new unified proof that any simple graph on $n$ vertices with maximum degree at most $\Delta$ has no more than $a\binom{\Delta+1}{t}+\binom{b}{t}$ cliques of size $t \ (t \ge 3)$, where $n = a(\Delta+1)+b \ (0 \le b \le \Delta)$.

In this paper, we study the following variant of the junta learning problem. We are given oracle access to a Boolean function $f$ on $n$ variables that only depends on $k$ variables, and, when restricted to them, equals some predefined…

In $d$-dimensional space (over any field), given a set of lines, a joint is a point passed through by $d$ lines not all lying in some hyperplane. The joints problem asks to determine the maximum number of joints formed by $L$ lines, and it…

We consider the problem of deciding whether an $n$-qubit unitary (or $n$-bit Boolean function) is $\varepsilon_1$-close to some $k$-junta or $\varepsilon_2$-far from every $k$-junta, where $k$-junta unitaries act non-trivially on at most…

Let X be a finite set of points in R^n. A polynomial p nonnegative on X can be written as a sum of squares of rational functions modulo the vanishing ideal I(X). From the point of view of applications, such as polynomial optimization, we…

Many underlying structural and functional factors that determine the fault behavior of a combinational network, are not yet fully understood. In this paper, we show that there exists a large class of Boolean functions, called root…

We exploit some properties of the Hurwitz zeta function $\zeta (n,x)$ in order to study sums of the form $\frac{1}{\pi ^{n}}\sum_{j=-\infty}^{\infty}1/(jk+l)^{n}$ and $\frac{1}{\pi ^{n}}\sum_{j=-\infty}^{\infty}(-1)^{j}/(jk+l)^{n}$ for $%…

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…

We investigate the approximability of several classes of real-valued functions by functions of a small number of variables ({\em juntas}). Our main results are tight bounds on the number of variables required to approximate a function…

If $f(x,y)$ is a real function satisfying $y>0$ and $\sum_{r=0}^{n-1}f(x+ry,ny)=f(x,y)$ for $n=1,2,3,\ldots$, we say that $f(x,y)$ is an invariant function. Many special functions including Bernoulli polynomials, Gamma function and Hurwitz…

We consider classes of Boolean functions stable under compositions both from the right and from the left with clones. Motivated by the question how many properties of Boolean functions can be defined by means of linear equations, we focus…

The Hilbert function of a module over a positively graded algebra is of quasi-polynomial type (Hilbert--Serre). We derive an upper bound for its grade, i.e. the index from which on its coefficients are constant. As an application, we give a…

Let K be an algebraically closed field of characteristic 0. Following Medvedev-Scanlon, a polynomial of degree d > 1 is said to be disintegrated if neither f nor -f is linearly conjugate to x^d or T_d(x) where T_d is the Chebyshev…

We obtain polylogarithmic bounds in the polynomial Szemer\'{e}di theorem when the polynomials have distinct degrees and zero constant terms. Specifically, let $P_1, \dots, P_m \in \mathbb Z[y]$ be polynomials with distinct degrees, each…

We give an algorithm for learning symmetric k-juntas (boolean functions of $n$ boolean variables which depend only on an unknown set of $k$ of these variables) in the PAC model under the uniform distribution, which runs in time n^{O(k/\log…

This note is concerned with an extension, at second order, of an inequality on the discrete cube $C_n=\{-1,1\}$ (equipped with the uniform measure) due to Talagrand (\cite{TalL1L2}). As an application, the main result of this note is a…