English
Related papers

Related papers: Hypercontractive Inequality for Pseudo-Boolean Fun…

200 papers

Consider all the level sets of a real function. We can group these level sets according to their Hausdorff dimensions. We show that the Hausdorff dimension of the collection of all level sets of a given Hausdorff dimension can be…

Classical Analysis and ODEs · Mathematics 2016-08-29 Gavin Armstrong

A pseudo [2,b]-factor of a graph G is a spanning subgraph in which each component C on at least three vertices is a [2,b]-graph. The main contibution of this paper, is to give an upper bound to the number of components that are edges or…

Discrete Mathematics · Computer Science 2012-04-18 Siham Bekkai

Finding upper bounds for character ratios is a fundamental problem in asymptotic group theory. Previous bounds in the symmetric group have led to remarkable applications in unexpected domains. The existing approaches predominantly relied on…

Combinatorics · Mathematics 2026-04-02 Noam Lifshitz , Avichai Marmor

We study Boolean functions with sparse Fourier coefficients or small spectral norm, and show their applications to the Log-rank Conjecture for XOR functions f(x\oplus y) --- a fairly large class of functions including well studied ones such…

Computational Complexity · Computer Science 2013-04-10 Hing Yin Tsang , Chung Hoi Wong , Ning Xie , Shengyu Zhang

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

The hypercontractive inequality on the discrete cube plays a crucial role in many fundamental results in the Analysis of Boolean functions, such as the KKL theorem, Friedgut's junta theorem and the invariance principle. In these results the…

Combinatorics · Mathematics 2021-03-09 Peter Keevash , Noam Lifshitz , Eoin Long , Dor Minzer

This paper considers the problem of approximating a Boolean function $f$ using another Boolean function from a specified class. Two classes of approximating functions are considered: $k$-juntas, and linear Boolean functions. The $n$ input…

Information Theory · Computer Science 2019-07-09 Mohsen Heidari , S. Sandeep Pradhan , Ramji Venkataramanan

Given a continuous real-valued function on [0, 1], and a closed subset E \subset [0, 1] we denote by f E the restriction of f to E, that is, the function defined only on E that takes the same values as f at every point of E >. The…

Classical Analysis and ODEs · Mathematics 2007-11-29 Jean-Pierre Kahane , Yitzhak Katznelson

A real valued function $f$ defined on a subset $E$ of $\textbf{R}$, the set of real numbers, is statistically upward continuous if it preserves statistically upward half quasi-Cauchy sequences, is statistically downward continuous if it…

General Mathematics · Mathematics 2013-07-10 Huseyin Cakalli

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

The approximate degree of a Boolean function is the minimum degree of real polynomial that approximates it pointwise. For any Boolean function, its approximate degree serves as a lower bound on its quantum query complexity, and generically…

Computational Complexity · Computer Science 2023-05-23 Mark Bun , Nadezhda Voronova

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

We consider the problem of computing the partition function $\sum_x e^{f(x)}$, where $f: \{-1, 1\}^n \longrightarrow {\Bbb R}$ is a quadratic or cubic polynomial on the Boolean cube $\{-1, 1\}^n$. In the case of a quadratic polynomial $f$,…

Probability · Mathematics 2021-07-01 Alexander Barvinok , Nicholas Barvinok

The number of $n$-ary bent functions is less than $2^{3\cdot2^{n-3}(1+o(1))}$ as $n$ is even and $n\rightarrow\infty$. Keywords: Boolean function, bent function, upper bound

Information Theory · Computer Science 2023-03-30 Vladimir N. Potapov

A famous theorem of Carleson says that, given any function $f\in L^p(\TT)$, $p\in(1,+\infty)$, its Fourier series $(S_nf(x))$ converges for almost every $x\in \mathbb T$. Beside this property, the series may diverge at some point, without…

Classical Analysis and ODEs · Mathematics 2013-04-10 Frédéric Bayart , Yanick Heurteaux

Upper bounds for the probabilities $\mathbb{P}(F\geq \mathbb{E} F + r)$ and $\mathbb{P}(F\leq \mathbb{E} F - r)$ are proved, where $F$ is a certain component count associated with a random geometric graph built over a Poisson point process…

Probability · Mathematics 2016-01-14 Sascha Bachmann

A natural measure of smoothness of a Boolean function is its sensitivity (the largest number of Hamming neighbors of a point which differ from it in function value). The structure of smooth or equivalently low-sensitivity functions is still…

Computational Complexity · Computer Science 2015-08-12 Parikshit Gopalan , Noam Nisan , Rocco A. Servedio , Kunal Talwar , Avi Wigderson

In this paper, we establish a new inequality tying together the effective length and the maximum correlation between the outputs of an arbitrary pair of Boolean functions which operate on two sequences of correlated random variables. We…

Information Theory · Computer Science 2017-02-07 Farhad Shirani , S. Sandeep Pradhan

We consider pseudodifferential operators on functions on $\R^{n+1}$ which commute with the Euler operator, and can thus be restricted to spaces of functions homogeneous of some given degree. Their symbols can be regarded as functions on a…

Representation Theory · Mathematics 2007-05-23 Michael Pevzner , André Unterberger

In this paper, we construct some piecewise defined functions, and study their $c$-differential uniformity. As a by-product, we improve upon several prior results. Further, we look at concatenations of functions with low differential…

Information Theory · Computer Science 2021-12-07 Daniele Bartoli , Marco Calderini , Constanza Riera , Pantelimon Stanica
‹ Prev 1 8 9 10 Next ›