English
Related papers

Related papers: Boolean degree 1 functions on some classical assoc…

200 papers

Bloch and Okounkov's correlation function on the infinite wedge space has connections to Gromov-Witten theory, Hilbert schemes, symmetric groups, and certain character functions of $\hgl_\infty$-modules of level one. Recent works have…

Representation Theory · Mathematics 2009-11-13 David G. Taylor

We consider Boolean functions f:{-1,1}^n->{-1,1} that are close to a sum of independent functions on mutually exclusive subsets of the variables. We prove that any such function is close to just a single function on a single subset. We also…

Probability · Mathematics 2015-12-31 Aviad Rubinstein , Muli Safra

We describe a new class of Boolean functions which provide the presently best known trade-off between low computational complexity, nonlinearity and (fast) algebraic immunity. In particular, for $n\leq 20$, we show that there are functions…

Cryptography and Security · Computer Science 2025-01-14 Claude Carlet , Palash Sarkar

We analyze the space of geometrically continuous piecewise polynomial functions or splines for quadrangular and triangular patches with arbitrary topology and general rational transition maps. To define these spaces of G 1 spline functions,…

Algebraic Geometry · Mathematics 2016-03-24 Bernard Mourrain , Raimundas Vidunas , Nelly Villamizar

We classify all possible local linear procedures over triangular meshes resulting in polynomial $C^1$-spline functions with affinely uniform shape for the basic functions at the edges, and fitting the 9 value- and gradient data at the…

Numerical Analysis · Mathematics 2019-03-28 Laszlo Stachó

We give the first non-trivial upper bounds on the average sensitivity and noise sensitivity of polynomial threshold functions. More specifically, for a Boolean function f on n variables equal to the sign of a real, multivariate polynomial…

Computational Complexity · Computer Science 2014-03-28 Prahladh Harsha , Adam Klivans , Raghu Meka

Here we revisit the quantum algorithms for obtaining Forrelation [Aaronson et al, 2015] values to evaluate some of the well-known cryptographically significant spectra of Boolean functions, namely the Walsh spectrum, the cross-correlation…

Quantum Physics · Physics 2025-05-20 Suman Dutta , Subhamoy Maitra , Chandra Sekhar Mukherjee

We study several bialgebraic structures on boolean functions, that is to say maps defined on the set of subsets of a finite set $X$, taking the value $0$ on $\emptyset$. Examples of boolean functions are given by the indicator function of…

Combinatorics · Mathematics 2026-01-21 Loïc Foissy

Multi-degree splines are piecewise polynomial functions having sections of different degrees. For these splines, we discuss the construction of a B-spline basis by means of integral recurrence relations, extending the class of multi-degree…

Numerical Analysis · Mathematics 2017-09-18 Carolina Vittoria Beccari , Giulio Casciola , Serena Morigi

Idempotent Boolean functions form a highly structured subclass of Boolean functions that is closely related to rotation symmetry under a normal-basis representation and to invariance under a fixed linear map in a polynomial basis. These…

Cryptography and Security · Computer Science 2026-02-03 Claude Carlet , Marko Ðurasevic , Domagoj Jakobovic , Luca Mariot , Stjepan Picek

We show that the classical kernel and domain functions associated to an n-connected domain in the plane are all given by rational combinations of three or fewer holomorphic functions of one complex variable. We characterize those domains…

Complex Variables · Mathematics 2007-05-23 Steven R. Bell

It is known that a positive Boolean function f depending on n variables has at least n + 1 extremal points, i.e. minimal ones and maximal zeros. We show that f has exactly n + 1 extremal points if and only if it is linear read-once. The…

Combinatorics · Mathematics 2018-05-28 Vadim Lozin , Igor Razgon , Viktor Zamaraev , Elena Zamaraeva , Nikolai Yu. Zolotykh

Boolean functions have important applications in cryptography and coding theory. Two famous classes of binary codes derived from Boolean functions are the Reed-Muller codes and Kerdock codes. In the past two decades, a lot of progress on…

Information Theory · Computer Science 2015-11-23 Cunsheng Ding

We consider the problem of jointly minimizing forms of two Boolean functions $f, g \colon \{0,1\}^J \to \{0,1\}$ such that $f + g \leq 1$ and so as to separate disjoint sets $A \cup B \subseteq \{0,1\}^J$ such that $f(A) = \{1\}$ and $g(B)…

Machine Learning · Computer Science 2022-09-09 David Stein , Bjoern Andres

We show that a Boolean degree $d$ function on the slice $\binom{[n]}{k}$ is a junta if $k \geq 2d$, and that this bound is sharp. We prove a similar result for $A$-valued degree $d$ functions for arbitrary finite $A$, and for functions on…

Combinatorics · Mathematics 2022-03-15 Yuval Filmus

The approximate degree of a Boolean function $f \colon \{-1, 1\}^n \rightarrow \{-1, 1\}$ is the least degree of a real polynomial that approximates $f$ pointwise to error at most $1/3$. We introduce a generic method for increasing the…

Computational Complexity · Computer Science 2017-03-20 Mark Bun , Justin Thaler

Boolean functions with good cryptographic properties like high nonlinearity and algebraic degree play an important in the security of stream and block ciphers. Such functions may be designed, for instance, by algebraic constructions or…

Neural and Evolutionary Computing · Computer Science 2025-01-31 Claude Carlet , Marko Ðurasevic , Domagoj Jakobovic , Luca Mariot , Stjepan Picek

We aim to completely formalize the rough topological analysis of integrable Hamiltonian systems admitting analytical solutions such that the initial phase variables along with the time derivatives of the auxiliary variables are expressed as…

Exactly Solvable and Integrable Systems · Physics 2013-09-30 Mikhail P. Kharlamov

Generalisations of the bent property of a boolean function are presented, by proposing spectral analysis with respect to a well-chosen set of local unitary transforms. Quadratic boolean functions are related to simple graphs and it is shown…

Information Theory · Computer Science 2007-07-13 Constanza Riera , Matthew G. Parker

We establish that any finite extension of function fields of genus greater than 1 whose relative class group is trivial is Galois and cyclic. This depends on a result from a preceding paper which establishes a finite list of possible Weil…

Number Theory · Mathematics 2024-05-31 Kiran S. Kedlaya