English
Related papers

Related papers: Boolean constant degree functions on the slice are…

200 papers

It has been conjectured that there are no homogeneous rotation symmetric bent Boolean functions of degree greater than two. In this paper we begin by proving that sums of short-cycle rotation symmetric bent Boolean functions must contain a…

Information Theory · Computer Science 2017-08-31 T. W. Cusick , E. M. Sanger

With a view toward studying the homotopy type of spaces of Boolean formulae, we introduce a simplicial complex, called the theta complex, associated to any hypergraph, which is the Alexander dual of the more well-known independence complex.…

Algebraic Topology · Mathematics 2010-08-24 James Conant , Oliver Thistlethwaite

This paper is concerned with a class of generalized slice Fueter-regular functions on arbitrary domains in O with local stem functions. Some classical theorems such as the maximum modulus principle will be generalized to our setting. Some…

Complex Variables · Mathematics 2026-05-12 Xinyuan Dou , Guangbin Ren , Zeping Zhu , Ting Yang

Univariate polynomials are called stable with respect to a domain $D$ if all of their roots lie in $D$. We study linear slices of the space of stable univariate polynomials with respect to a half-plane. We show that a linear slice always…

Algebraic Geometry · Mathematics 2025-08-07 Sebastian Debus , Cordian Riener , Robin Schabert

A slice decomposition is an expression of a homogeneous polynomial as a sum of forms with a linear factor. A strength decomposition is an expression of a homogeneous polynomial as a sum of reducible forms. The slice rank and strength of a…

Algebraic Geometry · Mathematics 2022-05-04 Arthur Bik , Alessandro Oneto

Let $p\ge 7$, $q=p^m$. $K_q(a)=\sum_{x\in \mathbb{F}_{p^m}} \zeta^{\mathrm{Tr}^m_1(x^{p^m-2}+ax)}$ is the Kloosterman sum of $a$ on $\mathbb{F}_{p^m}$, where $\zeta=e^{\frac{2\pi\sqrt{-1}}{p}}$. The value $1-\frac{2}{\zeta+\zeta^{-1}}$ of…

Information Theory · Computer Science 2013-12-30 Chunming Tang , Yanfeng Qi

Let $n=2m$. In the present paper, we study the binomial Boolean functions of the form $$f_{a,b}(x) = \mathrm{Tr}_1^{n}(a x^{2^m-1 }) +\mathrm{Tr}_1^{2}(bx^{\frac{2^n-1}{3} }), $$ where $m$ is an even positive integer, $a\in…

Information Theory · Computer Science 2021-09-29 Chunming Tang , Peng Han , Qi Wang , Jun Zhang , Yanfeng Qi

The property of zeta-functions on mixed joint universality in the Voronin's sense states that any two holomorphic functions can be approximated simultaneously with accuracy $\epsilon>0$ by suitable vertical shifts of the pair consisting…

Number Theory · Mathematics 2022-10-13 Benjaminas Togobickij , Roma Kačinskaitė

We generalize and extend the ideas in a recent paper of Chiarelli, Hatami and Saks to prove new bounds on the number of relevant variables for boolean functions in terms of a variety of complexity measures. Our approach unifies and refines…

Combinatorics · Mathematics 2022-12-23 Jake Wellens

A real univariate polynomial of degree $n$ is called hyperbolic if all of its $n$ roots are on the real line. Such polynomials appear quite naturally in different applications, for example, in combinatorics and optimization. The focus of…

Algebraic Geometry · Mathematics 2023-03-09 Cordian Riener , Robin Schabert

The threshold degree of a Boolean function f:{0,1}^n->{-1,+1} is the least degree of a real polynomial p such that f(x)=sgn p(x). We construct two halfspaces on {0,1}^n whose intersection has threshold degree Theta(sqrt n), an exponential…

Computational Complexity · Computer Science 2016-09-08 Alexander A. Sherstov

We study how well functions over the boolean hypercube of the form $f_k(x)=(|x|-k)(|x|-k-1)$ can be approximated by sums of squares of low-degree polynomials, obtaining good bounds for the case of approximation in $\ell_{\infty}$-norm as…

Computational Complexity · Computer Science 2016-03-09 Troy Lee , Anupam Prakash , Ronald de Wolf , Henry Yuen

We study projective functions. We prove that projective functions generalise lower and upper-semianalytic ones while being stable by composition and difference. We show that the class of projective functions is closed under sums,…

Logic · Mathematics 2025-10-14 Laurence Carassus , Massinissa Ferhoune

We prove that Boolean functions on $S_n$, whose Fourier transform is highly concentrated on irreducible representations indexed by partitions of $n$ whose largest part has size at least $n-t$, are close to being unions of cosets of…

Combinatorics · Mathematics 2017-06-30 David Ellis , Yuval Filmus , Ehud Friedgut

Given a graphic degree sequence $D$, let $\chi(D)$ (respectively $\omega(D)$, $h(D)$, and $H(D)$) denote the maximum value of the chromatic number (respectively, the size of the largest clique, largest clique subdivision, and largest clique…

Combinatorics · Mathematics 2009-07-10 Zdenek Dvorak , Bojan Mohar

We derive a spectral interpretation of the pivot operation on a graph and generalise this operation to hypergraphs. We establish lower bounds on the number of flat spectra of a Boolean function, depending on internal structures, with…

Combinatorics · Mathematics 2007-05-23 Constanza Riera , Lars Eirik Danielsen , Matthew G. Parker

We prove that $\mathrm{deg}(f) \leq \widetilde{O}(\mathrm{rdeg}(f)^3)$ for every Boolean function $f$, where $\mathrm{deg}(f)$ is the degree of $f$ and $\mathrm{rdeg}(f)$ is the rational degree of $f$. This resolves the second of the three…

Computational Complexity · Computer Science 2026-04-09 Robin Kothari , Matt Kovacs-Deak , Daochen Wang , Rain Zimin Yang

In this paper we prove a new representation formula for slice regular functions, which shows that the value of a slice regular function $f$ at a point $q=x+yI$ can be recovered by the values of $f$ at the points $q+yJ$ and $q+yK$ for any…

Complex Variables · Mathematics 2010-03-30 Fabrizio Colombo , Graziano Gentili , Irene Sabadini , Daniele C. Struppa

Polynomial representations of Boolean functions over various rings such as $\mathbb{Z}$ and $\mathbb{Z}_m$ have been studied since Minsky and Papert (1969). From then on, they have been employed in a large variety of fields including…

Computational Complexity · Computer Science 2020-05-04 Xiaoming Sun , Yuan Sun , Jiaheng Wang , Kewen Wu , Zhiyu Xia , Yufan Zheng

In this note, the polar decomposition of binary fields of even extension degree is used to reduce the evaluation of the Walsh transform of binomial Boolean functions to that of Gauss sums. In the case of extensions of degree four times an…

Number Theory · Mathematics 2016-08-22 Jean-Pierre Flori