Related papers: Symmetric Boolean Function with Maximum Algebraic …

Let $V$ be a finite set of size $n$. We consider real functions on the "slice" $\binom{V}{k}$, which are also known as functions in the Johnson scheme. For $I \subseteq J \subseteq V$, the characteristic function of the set of all…

This paper concerns the long-standing question of representing (totally) anti-symmetric functions in high dimensions. We propose a new ansatz based on the composition of an odd function with a fixed set of anti-symmetric basis functions. We…

We consider the multiplicative complexity of Boolean functions with multiple bits of output, studying how large a multiplicative complexity is necessary and sufficient to provide a desired nonlinearity. For so-called $\Sigma\Pi\Sigma$…

We associate to each Boolean function a polynomial whose evaluations represents the distances from all possible Boolean affine functions. Both determining the coefficients of this polynomial from the truth table of the Boolean function and…

Homogeneous rotation symmetric Boolean functions have been extensively studied in recent years because of their applications in cryptography. Little is known about the basic question of when two such functions are affine equivalent. The…

Suppose that $Y^n$ is obtained by observing a uniform Bernoulli random vector $X^n$ through a binary symmetric channel with crossover probability $\alpha$. The "most informative Boolean function" conjecture postulates that the maximal…

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…

We consider when the symmetric algebra of an infinite-dimensional Lie algebra, equipped with the natural Poisson bracket, satisfies the ascending chain condition (ACC) on Poisson ideals. We define a combinatorial condition on a graded Lie…

Let $S$ be the symmetric algebra of an algebraic Lie algebra. We provide a sufficient condition for the maximality of Poisson commutative subalgebras of $S$ obtained by the argument shift method.

The vectorial Boolean functions are employed in cryptography to build block coding algorithms. An important criterion on these functions is their resistance to the differential cryptanalysis. Nyberg defined the notion of almost perfect…

In Boolean algebra, it is known that the logical function that corresponds to the negation of the conjunction --NAND-- is universal in the sense that any other logical function can be built based on it. This property makes it essential to…

Is there a classifier that ensures optimal robustness against all adversarial attacks? This paper answers this question by adopting a game-theoretic point of view. We show that adversarial attacks and defenses form an infinite zero-sum game…

Let $\mathcal{A}$ denote the set of all analytic functions $f$ in the unit disk $\ID=\{z:\,|z|<1\}$ of the form $f(z)=z+\sum_{n=2}^{\infty}a_nz^n.$ Let $\mathcal{U}$ denote the set of all $f\in \mathcal{A}$, $f(z)/z\neq 0$ and satisfying…

These notes present a compact and self-contained approach to iterated forcing with a particular emphasis on semiproper forcing. We tried to make our presentation accessible to any scholar who has some familiarity with forcing and boolean…

We compute the nonlinearity of Boolean functions with Groebner basis techniques, providing two algorithms: one over the binary field and the other over the rationals. We also estimate their complexity. Then we show how to improve our…

The textbook adversary bound for function evaluation states that to evaluate a function $f\colon D\to C$ with success probability $\frac{1}{2}+\delta$ in the quantum query model, one needs at least $\left( 2\delta -\sqrt{1-4\delta^2}…

This work brings techniques from the theory of recurrent integer sequences to the problem of balancedness of symmetric Boolean functions. In particular, the periodicity modulo $p$ ($p$ odd prime) of exponential sums of symmetric Boolean…

We prove a new general multiplicity estimate applicable to sets of functions without any assumption on algebraic independence. The multiplicity estimates are commonly used in determining measures of algebraic independence of values of…

We study the algebraic theory of computable functions, which can be viewed as arising from possibly non-halting computer programs or algorithms, acting on some state space, equipped with operations of composition, {\em if-then-else} and…

Let $\mathcal{A}$ be a set of mutually coprime positive integers, satisfying \begin{align*} \sum\limits_{a\in\mathcal{A}}\frac{1}{a} = \infty. \end{align*} Define the (possibly non-multiplicative) "Liouville-like" functions \begin{align*}…