English
Related papers

Related papers: Counting self-dual monotone Boolean functions

200 papers

We present dichotomy theorems regarding the computational complexity of counting fixed points in boolean (discrete) dynamical systems, i.e., finite discrete dynamical systems over the domain {0,1}. For a class F of boolean functions and a…

Computational Complexity · Computer Science 2008-12-02 Christopher M. Homan , Sven Kosub

This paper presents a method to detect and recognize symmetries in Boolean functions. The idea is to use information theoretic measures of Boolean functions to detect sub-space of possible symmetric variables. Coupled with the new…

Other Computer Science · Computer Science 2007-10-15 Denis V. Popel

Monotone Boolean functions are a structurally important class of Boolean functions, but their restricted form imposes strong limitations on achievable nonlinearity. In this paper, we investigate whether evolutionary computation can evolve…

Neural and Evolutionary Computing · Computer Science 2026-04-21 Claude Carlet , Marko Čupić , Marko Ðurasevic , Domagoj Jakobovic , Luca Mariot , Stjepan Picek

The additive monotone (resp. boolean) unitary Brownian motion is a non-commutative stochastic process with monotone (resp. boolean) independent and stationary increments which are distributed according to the arcsine law (resp. Bernoulli…

Probability · Mathematics 2015-06-02 Tarek Hamdi

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…

Computational Complexity · Computer Science 2025-02-27 Daniel M. Kane , Anthony Ostuni , Kewen Wu

Let $(u_n)_{n\ge 0}$ denote the Thue-Morse sequence with values $\pm 1$. The Woods-Robbins identity below and several of its generalisations are well-known in the literature…

Number Theory · Mathematics 2018-05-17 Samin Riasat

Inspired by Armin Straub's conjecture (arXiv:1601.07161) about the number and maximal size of (2n+1, 2n+3)-core partitions with distinct parts, we develop relatively efficient, symbolic-computational algorithms, based on non-linear…

Combinatorics · Mathematics 2016-12-12 Anthony Zaleski , Doron Zeilberger

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

We introduce a total order and the absolute value function for dual numbers. The absolute value function of dual numbers are with dual number values, and have properties similar to the properties of the absolute value function of real…

Rings and Algebras · Mathematics 2021-11-24 Liqun Qi , Chen Ling , Hong Yan

For certain negative rational numbers k, called singular values, and associated with the symmetric group S_N on N objects, there exist homogeneous polynomials annihilated by each Dunkl operator when the parameter equals k. It was shown by…

Representation Theory · Mathematics 2007-05-23 Charles F. Dunkl

We introduce a simply stated conjecture regarding the maximum mutual information a Boolean function can reveal about noisy inputs. Specifically, let $X^n$ be i.i.d. Bernoulli(1/2), and let $Y^n$ be the result of passing $X^n$ through a…

Information Theory · Computer Science 2013-07-16 Gowtham R. Kumar , Thomas A. Courtade

The discrete Fourier transform of the greatest common divisor is a multiplicative function that generalises both the gcd-sum function and Euler's totient function. On the one hand it is the Dirichlet convolution of the identity with…

Number Theory · Mathematics 2012-01-17 Peter H. van der Kamp

Submodular function minimization is a key problem in a wide variety of applications in machine learning, economics, game theory, computer vision, and many others. The general solver has a complexity of $O(n^3 \log^2 n . E +n^4 {\log}^{O(1)}…

Data Structures and Algorithms · Computer Science 2017-01-25 Srikumar Ramalingam , Chris Russell , Lubor Ladicky , Philip H. S. Torr

The Motzkin numbers $M_n=\sum_{k=0}^n\binom n{2k}\binom{2k}k/(k+1)$ $(n=0,1,2,\ldots)$ and the central trinomial coefficients $T_n$ ($n=0,1,2,\ldots)$ given by the constant term of $(1+x+x^{-1})^n$, have many combinatorial interpretations.…

Combinatorics · Mathematics 2022-02-02 Zhi-Wei Sun

In this paper we give an improvement of the degree of the homogeneous linear recurrence with integer coefficients that exponential sums of symmetric Boolean functions satisfy. This improvement is tight. We also compute the asymptotic…

Number Theory · Mathematics 2011-01-26 Francis N. Castro , Luis A. Medina

We study efficient differentially private algorithms for estimating monotone statistics, i.e., statistics that are monotone under the addition of new observations. The starting point for our investigation is subsample-and-aggregate: a…

Cryptography and Security · Computer Science 2026-05-28 Gavin Brown , Ephraim Linder , Mahbod Majid , Vikrant Singhal

In this paper, we determine the bifurcation set of a real polynomial function of two variables for non-degenerate case in the sense of Newton polygons by using a toric compactification. We also count the number of singular phenomena at…

Geometric Topology · Mathematics 2016-08-10 Masaharu Ishikawa , Tat Thang Nguyen , Tien Son Pham

For every $n\geq 2$, Bourgain's constant $b_n$ is the largest number such that the (upper) Hausdorff dimension of harmonic measure is at most $n-b_n$ for every domain in $\mathbb{R}^n$ on which harmonic measure is defined. Jones and Wolff…

Classical Analysis and ODEs · Mathematics 2022-11-11 Matthew Badger , Alyssa Genschaw

We study the problem of multiplying two bit matrices with entries either over the Boolean algebra $(0,1,\vee,\wedge)$ or over the binary field $(0,1,+,\cdot)$. We engineer high-performance open-source algorithm implementations for…

Data Structures and Algorithms · Computer Science 2019-09-05 Matti Karppa , Petteri Kaski

The aim of this work is to study the dual and the algebraic dual of an evaluation code using standard monomials and indicator functions. We show that the dual of an evaluation code is the evaluation code of the algebraic dual. We develop an…

Commutative Algebra · Mathematics 2024-02-07 Hiram H. López , Ivan Soprunov , Rafael H. Villarreal