English
Related papers

Related papers: On $2k$-Variable Symmetric Boolean Functions with …

200 papers

This paper depicts an algorithm for solving the Decision Boolean Satisfiability Problem using the binary numerical properties of a Special Decision Satisfiability Problem, parallel execution, object oriented, and short termination. The two…

Data Structures and Algorithms · Computer Science 2018-04-17 Carlos Barrón-Romero

The sum of the absolute values of the Fourier coefficients of a function $f:\mathbb{F}_2^n \to \mathbb{R}$ is called the spectral norm of $f$. Green and Sanders' quantitative version of Cohen's idempotent theorem states that if the spectral…

Discrete Mathematics · Computer Science 2024-12-02 Tsun-Ming Cheung , Hamed Hatami , Rosie Zhao , Itai Zilberstein

We prove that if the system of integer translates of a square integrable function is $\ell^2$-linear independent then its periodization function is strictly positive almost everywhere. Indeed we show that the above inference is true for any…

Classical Analysis and ODEs · Mathematics 2014-01-09 Sandra Saliani

A class of infinite dimensional Galilean conformal algebra in (2+1) dimensional spacetime is studied. Each member of the class, denoted by \alg_{\ell}, is labelled by the parameter \ell. The parameter \ell takes a spin value, i.e., 1/2, 1,…

Mathematical Physics · Physics 2014-08-15 N. Aizawa , Y. Kimura

A function from $\Bbb F_{2^n}$ to $\Bbb F_{2^n}$ is said to be {\em $k$th order sum-free} if the sum of its values over each $k$-dimensional $\Bbb F_2$-affine subspace of $\Bbb F_{2^n}$ is nonzero. This notion was recently introduced by C.…

Number Theory · Mathematics 2025-10-17 Alyssa Ebeling , Xiang-dong Hou , Ashley Rydell , Shujun Zhao

In this paper we prove results regarding Boolean functions with small spectral norm (the spectral norm of f is $\|\hat{f}\|_1=\sum_{\alpha}|\hat{f}(\alpha)|$). Specifically, we prove the following results for functions $f:\{0,1\}^n \to…

Computational Complexity · Computer Science 2013-05-23 Amir Shpilka , Avishay Tal , Ben lee Volk

Let $f(x)$ be an irreducible polynomial with integer coefficients of degree at least two. Hooley proved that the roots of the congruence equation $f(x)\equiv 0\mod n$ is uniformly distributed. as a parallel of Hooley's theorem under ideal…

Number Theory · Mathematics 2021-08-13 Chunlin Wang

Let $\Bc$ denote the real-valued functions continuous on the extended real line and vanishing at $-\infty$. Let $\Br$ denote the functions that are left continuous, have a right limit at each point and vanish at $-\infty$. Define $\acn$ to…

Classical Analysis and ODEs · Mathematics 2011-10-18 Erik Talvila

An extremal point of a positive threshold Boolean function $f$ is either a maximal zero or a minimal one. It is known that if $f$ depends on all its variables, then the set of its extremal points completely specifies $f$ within the universe…

Combinatorics · Mathematics 2017-06-07 Vadim Lozin , Igor Razgon , Viktor Zamaraev , Elena Zamaraeva , Nikolai Yu. Zolotykh

In this paper, we study the value distributions of perfect nonlinear functions, i.e., we investigate the sizes of image and preimage sets. Using purely combinatorial tools, we develop a framework that deals with perfect nonlinear functions…

Combinatorics · Mathematics 2023-10-19 Lukas Kölsch , Alexandr Polujan

Let $V$ be a finite set of size $n$. We consider real functions on the "slice" $\binom{V}{k}$, which are also known as functions in the Johnson scheme. For $I \subseteq J \subseteq V$, the characteristic function of the set of all…

Combinatorics · Mathematics 2025-10-06 Michael Kiermaier , Jonathan Mannaert , Alfred Wassermann

Homogeneous rotation symmetric Boolean functions have been extensively studied in recent years because of their applications in cryptography. Little is known about the basic question of when two such functions are affine equivalent. The…

Information Theory · Computer Science 2011-10-26 Thomas W. Cusick

We give an algorithm for learning symmetric k-juntas (boolean functions of $n$ boolean variables which depend only on an unknown set of $k$ of these variables) in the PAC model under the uniform distribution, which runs in time n^{O(k/\log…

Combinatorics · Mathematics 2007-05-23 Mihail N. Kolountzakis , Evangelos Markakis , Aranyak Mehta

It is a well-known fact that Riemann Hypothesis will follows if the function identically equal to -1 can be arbitrarily approximated in the norm $\norma{.}$ of $L^{2}([0,1],dx)$ by functions of the form $f(x)=\sum_{k=1}^{n}a_{k}…

Number Theory · Mathematics 2007-05-23 F. Auil

We give a detailed proof, in the identically distributed case, of a conjecture of Feige about the maximum probability that the sum of n independent non-negative integer valued random variables, each of mean 1, exceeds n. The general case is…

Probability · Mathematics 2009-08-26 John H. Elton

The binary sum-of-digits function $\mathsf{s}$ returns the number of ones in the binary expansion of a nonnegative integer. Cusick's Hamming weight conjecture states that, for all integers $t\geq 0$, the set of nonnegative integers $n$ such…

Number Theory · Mathematics 2023-09-04 Bartosz Sobolewski , Lukas Spiegelhofer

Let $\sigma(n)$ be the sum of the positive divisors of $n$, and let $A(t)$ be the natural density of the set of positive integers $n$ satisfying $\sigma(n)/n \ge t$. We give an improved asymptotic result for $\log A(t)$ as $t$ grows…

Number Theory · Mathematics 2010-11-19 Andreas Weingartner

The approximate non-deterministic degree of a Boolean function $f$, denoted $\mathsf{ndeg}_\epsilon(f)$ (written $\mathsf{N}_\epsilon(f)$ for brevity), is the minimum degree of a real polynomial $p$ such that $0 \le |p(x)| \le \epsilon$…

Computational Complexity · Computer Science 2026-05-25 Samruddhi Pednekar , Supartha Podder

We prove that the Fourier dimension of any Boolean function with Fourier sparsity $s$ is at most $O\left(s^{2/3}\right)$. Our proof method yields an improved bound of $\widetilde{O}(\sqrt{s})$ assuming a conjecture of…

Computational Complexity · Computer Science 2014-07-15 Swagato Sanyal

A Boolean function $f:\{0,1\}^n\to \{0,1\}$ is $k$-linear if it returns the sum (over the binary field $F_2$) of $k$ coordinates of the input. In this paper, we study property testing of the classes $k$-Linear, the class of all $k$-linear…

Computational Complexity · Computer Science 2020-06-09 Nader H. Bshouty
‹ Prev 1 4 5 6 7 8 10 Next ›