Related papers: Symmetric Boolean Function with Maximum Algebraic …
We prove that every abelian permutation group, but known exceptions, is the symmetry group of a boolean function. This solves the problem posed in the book by Clote and Kranakis. In fact, our result is proved for a larger class of groups,…
We study the circuit complexity of boolean functions in a certain infinite basis. The basis consists of all functions that take value $1$ on antichains over the boolean cube. We prove that the circuit complexity of the parity function and…
Given a small random sample of $n$-bit strings labeled by an unknown Boolean function, which properties of this function can be tested computationally efficiently? We show an equivalence between properties that are efficiently testable from…
Recent works have shown that the input domain of any machine learning classifier is bound to contain adversarial examples. Thus we can no longer hope to immune classifiers against adversarial examples and instead can only aim to achieve the…
We study the relation among some security parameters for vectorial Boolean functions which prevent attacks on the related block cipher. We focus our study on a recently-introduced security criterion, called weak differential uniformity,…
Let \bar{M}_{0,n} be the moduli space of pointed, genus 0 curves. Let L_i denote the line bundle on \bar{M}_{0,n} associated to the i-th marked point (the fiber of L_i is the cotangent space of the pointed curve at the i-th point).…
A coloring of the $q$-ary $n$-dimensional cube (hypercube) is called perfect if, for every $n$-tuple $x$, the collection of the colors of the neighbors of $x$ depends only on the color of $x$. A Boolean-valued function is called…
Nisan and Szegedy (CC 1994) showed that any Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$ that depends on all its input variables, when represented as a real-valued multivariate polynomial $P(x_1,\ldots,x_n)$, has degree at least $\log…
We present a versatile construction allowing one to obtain pairs of integer sets with infinite symmetric difference, infinite intersection, and identical representation functions.
The present article is part of a research program the aim of which is to find all indecomposable solvable extensions of a given class of nilpotent Lie algebras. Specifically in this article we consider a nilpotent Lie algebra n that is…
Recent years have witnessed a renewed interest in Boolean function in explaining binary classifiers in the field of explainable AI (XAI). The standard approach of Boolean function is propositional logic. We present a modal language of a…
In this report, we show that all n-variable Boolean function can be represented as polynomial threshold functions (PTF) with at most $0.75 \times 2^n$ non-zero integer coefficients and give an upper bound on the absolute value of these…
The approximate degree of a Boolean function is the least degree of a real multilinear polynomial approximating it in the $\ell_\infty$-norm over the Boolean hypercube. We show that the approximate degree of the Bipartite Perfect Matching…
We pursue a systematic study of the following problem. Let f:{0,1}^n -> {0,1} be a (usually monotone) Boolean function whose behaviour is well understood when the input bits are identically independently distributed. What can be said about…
The convergence of double Fourier series of functions of bounded partial $\Lambda$-variation is investigated. The sufficient and necessary conditions on the sequence $\Lambda=\{\lambda_n\}$ are found for the convergence of Fourier series of…
We prove novel algorithmic guarantees for several online problems in the smoothed analysis model. In this model, at each time an adversary chooses an input distribution with density function bounded above by $\tfrac{1}{\sigma}$ times that…
We give a new computational method to obtain symmetries of ordinary differential equations. The proposed approach appears as an extension of a recent algorithm to compute variational symmetries of optimal control problems [Comput. Methods…
The paper investigates possible generalisations of Maharam's theorem to a classification of Boolean algebras that support a finitely additive measure. We prove that Boolean algebras that support a finitely additive non-atomic uniformly…
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…
In this paper, I give sufficient conditions for any linear combination in $\mathbb{Q}$ of numbers $\sum_{n=1}^{\infty}\frac{b_{1,n}}{\alpha_{1,n}}$, $\ldots$, $\sum_{n=1}^{\infty}\frac{b_{K,n}}{\alpha_{K,n}}$ to have algebraic degree…