Related papers: Trace Monomial Boolean Functions with Large High-O…

In a recent work with Kindler and Wimmer we proved an invariance principle for the slice for low-influence, low-degree functions. Here we provide an alternative proof for general low-degree functions, with no constraints on the influences.…

The sensitivity of a Boolean function f is the maximum over all inputs x, of the number of sensitive coordinates of x. The well-known sensitivity conjecture of Nisan (see also Nisan and Szegedy) states that every sensitivity-s Boolean…

In this paper, we prove a trace inequality $\text{Tr}[ f(A) A^s B^s ] \leq \text{Tr}[ f(A) (A^{1/2} B A^{1/2} )^s ]$ for any positive and monotone increasing function $f$, $s\in[0,1]$, and positive semi-definite matrices $A$ and $B$. On the…

The main aim of this paper is to study the functional inequality \begin{equation*} \int_{[0,1]}f\bigl((1-t)x+ty\bigr)d\mu(t)\geq 0, \qquad x,y\in I \mbox{ with } x<y, \end{equation*} for a continuous unknown function $f:I\to{\mathbb R}$,…

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 investigate the max min of the algebraic degree and the nonlinearity of a Boolean function in $n$ variables when restricted to a $k$-dimensional affine subspace of $\mathbb{F}_2^n$. Previous authors have focused on the cases when the max…

A simple way to generate a Boolean function is to take the sign of a real polynomial in $n$ variables. Such Boolean functions are called polynomial threshold functions. How many low-degree polynomial threshold functions are there? The…

It is known that the order of correlation immunity of a nonconstant unbalanced Boolean function in $n$ variables cannot exceed $2n/3-1$; moreover, it is $2n/3-1$ if and only if the function corresponds to an equitable $2$-partition of the…

We investigate the randomized decision tree complexity of a specific class of read-once threshold functions. A read-once threshold formula can be defined by a rooted tree, every internal node of which is labeled by a threshold function…

In this paper, we study the fundamental open question of finding the optimal high-order algorithm for solving smooth convex minimization problems. Arjevani et al. (2019) established the lower bound $\Omega\left(\epsilon^{-2/(3p+1)}\right)$…

We study ternary monomial functions of the form $f(x)=\Tr_n(ax^d)$, where $x\in \Ff_{3^n}$ and $\Tr_n: \Ff_{3^n}\to \Ff_3$ is the absolute trace function. Using a lemma of Hou \cite{hou}, Stickelberger's theorem on Gauss sums, and certain…

Let a Boolean function be available as a black-box (oracle) and one likes to devise an algorithm to test whether it has certain property or it is $\epsilon$-far from having that property. The efficiency of the algorithm is judged by the…

Caucal hierarchy is a well-known class of graphs with decidable monadic theories. It were proved by L. Braud and A. Carayol that well-orderings in the hierarchy are the well-orderings with order types less than $\varepsilon_0$. Naturally,…

In this paper, a technique on constructing nonlinear resilient Boolean functions is described. By using several sets of disjoint spectra functions on a small number of variables, an almost optimal resilient function on a large even number…

In this paper, we establish lower bounds for the oracle complexity of the first-order methods minimizing regularized convex functions. We consider the composite representation of the objective. The smooth part has H\"older continuous…

In (J. Funct. Anal. 257, 1092-1132 (2009)), Dykema and Skripka showed the existence of higher order spectral shift functions when the unperturbed self-adjoint operator is bounded and the perturbations is Hilbert-Schmidt. In this article, we…

We consider generalizations of Reed-Muller codes, toric codes, and codes from certain plane curves, such as those defined by norm and trace functions on finite fields. In each case we are interested in codes defined by evaluating arbitrary…

In metric measure spaces, we study boundary traces of BV functions in domains equipped with a doubling measure and supporting a Poincar\'e inequality, but possibly having a very large and irregular boundary. We show that the trace exists in…

We introduce the polynomial coefficient matrix and identify maximum rank of this matrix under variable substitution as a complexity measure for multivariate polynomials. We use our techniques to prove super-polynomial lower bounds against…

Kernel-based approach to operator approximation for partial differential equations has been shown to be unconditionally stable for linear PDEs and numerically exhibit unconditional stability for non-linear PDEs. These methods have the same…