English
Related papers

Related papers: Constructing Boolean Functions With Potential Opti…

200 papers

We investigate the max min of the algebraic degree and the nonlinearity of a Boolean function in $n$ variables when restricted to a $k$-dimensional affine subspace of $\mathbb{F}_2^n$. Previous authors have focused on the cases when the max…

Combinatorics · Mathematics 2025-03-03 Jan Kristian Haugland

This paper develops upper and lower bounds for the probability of Boolean functions by treating multiple occurrences of variables as independent and assigning them new individual probabilities. We call this approach dissociation and give an…

Artificial Intelligence · Computer Science 2015-06-30 Wolfgang Gatterbauer , Dan Suciu

In this paper we study structural properties of LV-degrees of the algebra of collections of sequences that are non-negligible in the sense that they can be computed by a probabilistic algorithm with positive probability. We construct atoms…

Information Theory · Computer Science 2021-09-10 Vladimir V. V'yugin

This paper introduces the $u$-deformed homogeneous functions $\mathrm{R}_{\alpha}(x,y;u|q)$, for all $\alpha\in\mathbb{C}$. Basic properties of the functions $\mathrm{R}_{\alpha}(x,y;u|q)$ are given, along with recurrence relations, their…

Combinatorics · Mathematics 2026-02-05 Ronald Orozco López

Determining the approximate degree composition for Boolean functions remains a significant unsolved problem in Boolean function complexity. In recent decades, researchers have concentrated on proving that approximate degree composes for…

Computational Complexity · Computer Science 2025-01-22 Sourav Chakraborty , Chandrima Kayal , Rajat Mittal , Manaswi Paraashar , Nitin Saurabh

A classical result of Rothschild and van Lint asserts that if every non-zero Fourier coefficient of a Boolean function $f$ over $\mathbb{F}_2^{n}$ has the same absolute value, namely $|\hat{f}(\alpha)|=1/2^k$ for every $\alpha$ in the…

Computational Complexity · Computer Science 2021-04-01 Ning Xie , Shuai Xu , Yekun Xu

Let $\mathbf{A}$ be a finite algebra generating a finitely decidable variety and having nontrivial strongly solvable radical $\tau$. We provide an improved bound on the number of variables in which a term can be sensitive to changes within…

Logic · Mathematics 2013-11-13 Matthew Smedberg

Recently, a new concept called multiplicative differential cryptanalysis and the corresponding $c$-differential uniformity were introduced by Ellingsen et al.~\cite{Ellingsen2020}, and then some low differential uniformity functions were…

Information Theory · Computer Science 2021-04-28 Xiaoqiang Wang , Dabin Zheng

Decomposition of any Boolean Function BF_n of n binary inputs into an optimal inverter coupled network of Symmetric Boolean functions SF_k (k \leq n) is described. Each SF component is implemented by Threshold Logic Cells, forming a…

General Mathematics · Mathematics 2007-05-23 N. F. Benschop

For every field $F$ which has a quadratic extension $E$ we show there are non-metabelian infinite-dimensional thin graded Lie algebras all of whose homogeneous components, except the second one, have dimension $2$. We construct such Lie…

Rings and Algebras · Mathematics 2021-01-29 M. Avitabile , A. Caranti , N. Gavioli , V. Monti , M. F. Newman , E. A. O'Brien

We call a function "constructible" if it has a globally subanalytic domain and can be expressed as a sum of products of globally subanalytic functions and logarithms of positively-valued globally subanalytic functions. Our main theorem…

Classical Analysis and ODEs · Mathematics 2013-04-24 Raf Cluckers , Daniel J. Miller

Examples of discontinuous functions already appear in the work of Euler, Abel, Dirichlet, Fourier, and Bolzano. A ground-breaking discovery due to Baire was that many discontinuous functions are well-behaved in that they are the pointwise…

Logic · Mathematics 2026-02-06 Dag Normann , Sam Sanders

The number of quantifiers needed to express first-order (FO) properties is captured by two-player combinatorial games called multi-structural games. We analyze these games on binary strings with an ordering relation, using a technique we…

Logic in Computer Science · Computer Science 2025-08-01 Marco Carmosino , Ronald Fagin , Neil Immerman , Phokion Kolaitis , Jonathan Lenchner , Rik Sengupta

A fundamental problem in quantum physics is to encode functions that are completely anti-symmetric under permutations of identical particles. The Barron space consists of high-dimensional functions that can be parameterized by infinite…

Numerical Analysis · Mathematics 2023-03-24 Nilin Abrahamsen , Lin Lin

Secure multi-party computation using a physical deck of cards, often called card-based cryptography, has been extensively studied during the past decade. Card-based protocols to compute various Boolean functions have been developed. As each…

Cryptography and Security · Computer Science 2024-02-27 Suthee Ruangwises

Functional data analysis is a fast evolving branch of statistics. Estimation procedures for the popular functional linear model either suffer from lack of robustness or are computationally burdensome. To address these shortcomings, a…

Methodology · Statistics 2021-08-27 Ioannis Kalogridis , Stefan Van Aelst

For any positive integers $n=2k$ and $m$ such that $m\geq k$, in this paper we show the maximal number of bent components of any $(n,m)$-functions is equal to $2^{m}-2^{m-k}$, and for those attaining the equality, their algebraic degree is…

Information Theory · Computer Science 2019-05-28 Lijing Zheng , Jie Peng , Haibin Kan , Yanjun Li , Juan Luo

Various problems on integers lead to the class of congruence preserving functions on rings, i.e. functions verifying $a-b$ divides $f(a)-f(b)$ for all $a,b$. We characterized these classes of functions in terms of sums of rational…

Number Theory · Mathematics 2015-06-02 Patrick Cégielski , Serge Grigorieff , Irène Guessarian

We prove that the homogeneously polyanalytic functions of total order $m$, defined by the system of equations $\overline{D}^{(k_1,\ldots,k_n)} f=0$ with $k_1+\cdots+k_n=m$, can be written as polynomials of total degree $<m$ in variables…

Complex Variables · Mathematics 2021-09-15 Christian Rene Leal-Pacheco , Egor A. Maximenko , Gerardo Ramos-Vazquez

We derive exact formulas for the proportions of derangements and of derangements of $p$-power order in the affine classical groups $AU_m(q)$, $ASp_{2m}(q)$, $AO_{2m+1}(q)$ and $AO^{\pm}_{2m}(q)$, where $p$ denotes the characteristic of the…

Combinatorics · Mathematics 2026-05-06 Jessica Anzanello