Related papers: Simplicity conditions for binary orthogonal arrays
The power of two choices is a classic paradigm for load balancing when assigning $m$ balls to $n$ bins. When placing a ball, we pick two bins according to two hash functions $h_0$ and $h_1$, and place the ball in the least loaded bin.…
Monotone Boolean functions, and the monotone Boolean circuits that compute them, have been intensively studied in complexity theory. In this paper we study the structure of Boolean functions in terms of the minimum number of negations in…
Currently known secondary construction techniques for linear codes mainly include puncturing, shortening, and extending. In this paper, we propose a novel method for the secondary construction of linear codes based on their weight…
Non-trivial 't Hooft anomaly obstructs the existence of a simple symmetric conformal boundary condition in a CFT. Conversely, there is a common piece of lore that trivial 't Hooft anomaly promises the existence of a simple symmetry…
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…
Assuming the Riemann Hypothesis (RH), Montgomery proved a theorem in 1973 concerning the pair correlation of zeros of the Riemann zeta-function and applied this to prove that at least $2/3$ of the zeros are simple. In this paper, we…
A notorious open question in circuit complexity is whether Boolean operations of arbitrary arity can efficiently be expressed using modular counting gates only. H{\aa}stad's celebrated switching lemma yields exponential lower bounds for the…
The resilience of a Boolean query is the minimum number of tuples that need to be deleted from the input tables in order to make the query false. A solution to this problem immediately translates into a solution for the more widely known…
The quotient complexity of a regular language L is the number of left quotients of L, which is the same as the state complexity of L. Suppose that L and L' are binary regular languages with quotient complexities m and n, and that the…
Exhibiting an explicit Boolean function with a large high-order nonlinearity is an important problem in cryptography, coding theory, and computational complexity. We prove lower bounds on the second-order, third-order, and higher-order…
Let $(A,\sigma)$ be a central simple algebra with an orthogonal involution. It is well-known that $O(A,\sigma)$ contains elements of reduced norm $-1$ if and only if the Brauer class of $A$ is trivial. We generalize this statement to…
In this paper, we explicitly construct a large class of symmetric Boolean functions on $2k$ variables with algebraic immunity not less than $d$, where integer $k$ is given arbitrarily and $d$ is a given suffix of $k$ in binary…
The bandwidth of a $\mathbb{C}^*$-action of a polarized pair $(X,L)$ is a natural measure of its complexity. In this paper we study $\mathbb{C}^*$-actions on rational homogeneous spaces, determining which provide minimal bandwidth. We prove…
We establish a lower bound for deciding the satisfiability of the conjunction of any two Boolean formulas from a set called a full representation of Boolean functions of $n$ variables - a set containing a Boolean formula to represent each…
The approximate degree of a Boolean function is the minimum degree of real polynomial that approximates it pointwise. For any Boolean function, its approximate degree serves as a lower bound on its quantum query complexity, and generically…
Recent work has shown that if an isostatic bar and joint framework possesses non-trivial symmetries, then it must satisfy some very simply stated restrictions on the number of joints and bars that are `fixed' by various symmetry operations…
We prove a lower bound of $\Omega(n^{1/2 - c})$, for all $c>0$, on the query complexity of (two-sided error) non-adaptive algorithms for testing whether an $n$-variable Boolean function is monotone versus constant-far from monotone. This…
Let $n$ denote the number of elements currently in a data structure. An in-place heap is stored in the first $n$ locations of an array, uses $O(1)$ extra space, and supports the operations: minimum, insert, and extract-min. We introduce an…
In \cite{Castoldi}, $q^t \by (q+1)t$ ordered orthogonal arrays (OOAs) of strength $t$ over the alphabet $\FF_q$ were constructed using linear feedback shift register sequences (LFSRs) defined by {\em primitive} polynomials in $\FF_q[x]$. In…
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…