相关论文: Symmetric Boolean Function with Maximum Algebraic …
We prove the Courtade-Kumar conjecture, for several classes of n-dimensional Boolean functions, for all $n \geq 2$ and for all values of the error probability of the binary symmetric channel, $0 \leq p \leq 1/2$. This conjecture states that…
Usually when we have polyadic-like algebras, meaning that we have infinitary substitutions (that is substitutions moving infinitely many points) in the similarity type, then we get the superamalgamation property especially if this class of…
We prove that n independent abelian functions admit an algebraic addition theorem, with no appeal to theta functions.
We prove that, to compute a Boolean function $f$ on $N$ variables with error probability $\epsilon$, any quantum black-box algorithm has to query at least $\frac{1 - 2\sqrt{\epsilon}}{2} \rho_f N = \frac{1 - 2\sqrt{\epsilon}}{2} \bar{S}_f$…
We investigate Boolean degree 1 functions for several classical association schemes, including Johnson graphs, Grassmann graphs, graphs from polar spaces, and bilinear forms graphs, as well as some other domains such as multislices (Young…
Proofs of the fundamental theorem of algebra can be divided up into three groups according to the techniques involved: proofs that rely on real or complex analysis, algebraic proofs, and topological proofs. Algebraic proofs make use of the…
Let $\mathcal{P}$ be the set of the primes. We consider a class of random multiplicative functions $f$ supported on the squarefree integers, such that $\{f(p)\}_{p\in\mathcal{P}}$ form a sequence of $\pm1$ valued independent random…
Boolean functions are important primitives in different domains of cryptology, complexity and coding theory. In this paper, we connect the tools from cryptology and complexity theory in the domain of Boolean functions with low polynomial…
We characterize the power of constant-depth Boolean circuits in generating uniform symmetric distributions. Let $f\colon\{0,1\}^m\to\{0,1\}^n$ be a Boolean function where each output bit of $f$ depends only on $O(1)$ input bits. Assume the…
A homogeneous symmetric structure on an associative superalgebra A is a non-degenerate, supersymmetric, homogeneous (i.e. even or odd) and associative bilinear form on A. In this paper, we show that any associative superalgebra with non…
Given an ideal $\mathcal{I}$ on the positive integers, a real sequence $(x_n)$ is said to be $\mathcal{I}$-statistically convergent to $\ell$ provided that $$ \textstyle \left\{n \in \mathbf{N}: \frac{1}{n}|\{k \le n: x_k \notin U\}| \ge…
A subset $S$ of the Boolean hypercube $\mathbb{F}_2^n$ is a sumset if $S = \{a + b : a, b\in A\}$ for some $A \subseteq \mathbb{F}_2^n$. Sumsets are central objects of study in additive combinatorics, featuring in several influential…
A Boolean function $f$ on $n$ variables is said to be a bent function if the absolute value of all its Walsh coefficients is $2^{n/2}$. Our main result is a new asymptotic lower bound on the number of Boolean bent functions. It is based on…
Let v(n) denote the number of compositions (ordered partitions) of a positive integer n into powers of 2. It appears that the function v(n) satisfies many congruences modulo 2^N. For example, for every integer B there exists (as k tends to…
We establish a lower bound of $\Omega{(\sqrt{n})}$ on the bounded-error quantum query complexity of read-once Boolean functions, providing evidence for the conjecture that $\Omega(\sqrt{D(f)})$ is a lower bound for all Boolean functions.…
Functionality ($\mathrm{fun}$) is a graph parameter that generalizes graph degeneracy defined by Alecu et al. [JCTB, 2021]. They research the relation of functionality to many other graphs parameters (tree-width, clique-width, VC-dimension,…
We consider universal approximations of symmetric and anti-symmetric functions, which are important for applications in quantum physics, as well as other scientific and engineering computations. We give constructive approximations with…
Premet has conjectured that the nilpotent variety of any finite-dimensional restricted Lie algebra is an irreducible variety. In this paper, we prove this conjecture in the case of Hamiltonian Lie algebra. and show that its nilpotent…
We investigate shift-invariant transformations, also known as rotation-symmetric vectorial Boolean functions, on $n$ bits that are induced from Boolean functions on $k$ bits, for $k\leq n$. We consider such transformations that are not…
Let $\{U_n\}$ be given by $U_0=1$ and $U_n=-2\sum_{k=1}^{[n/2]} \b n{2k}U_{n-2k}\ (n\ge 1)$, where $[\cdot]$ is the greatest integer function. In the paper we present a summation formula and several congruences involving $\{U_n\}$.