English
Related papers

Related papers: A structure theorem for Boolean functions with sma…

200 papers

We consider certain finite sets of circle-valued functions defined on intervals of real numbers and estimate how large the intervals must be for the values of these functions to be uniformly distributed in an approximate way. This is used…

Functional Analysis · Mathematics 2018-12-27 Stefano Ferri , Jorge Galindo , Camilo Gómez

We show that several spaces of holomorphic functions on a Riemann domain over a Banach space, including the nuclear and Hilbert-Schmidt bounded type, are locally $m$-convex Fr\'echet algebras. We prove that the spectrum of these algebras…

Functional Analysis · Mathematics 2011-10-06 Santiago Muro

A strong submeasure on a compact metric space X is a sub-linear and bounded operator on the space of continuous functions on X. A strong submeasure is positive if it is non-decreasing. By Hahn-Banach theorem, a positive strong submeasure is…

Dynamical Systems · Mathematics 2019-10-16 Tuyen Trung Truong

We investigate the occurrence of additive and multiplicative structures in random subsets of the natural numbers. Specifically, for a Bernoulli random subset of $\mathbb{N}$ where each integer is included independently with probability…

Combinatorics · Mathematics 2025-11-03 Sukrit Chakraborty , Sayan Goswami , Sourav Kanti Patra

Consider the binomial model $G^{d+1}(n,p)$ of the random $(d+1)$-uniform hypergraph on $n$ vertices, where each edge is present, independently of one another, with probability $p:\mathbb{N}\to[0,1]$. We prove that, for all…

Combinatorics · Mathematics 2016-02-23 Nicolau C. Saldanha , Márcio Telles

The embedding theorem arises in several problems from analysis and geometry. The purpose of this paper is to provide a deeper understanding of analysis and geometry with a particular focus on embedding theorems on spaces of homogeneous type…

Classical Analysis and ODEs · Mathematics 2016-01-25 Yanchang Han , Yongsheng Han , Ji Li

The strong thin tree conjecture states that every $k$-edge-connected graph $G$ contains an $O(1/k)$-thin spanning tree, meaning a spanning tree which contains at most an $O(1/k)$ fraction of the edges across each cut in $G$. This conjecture…

Data Structures and Algorithms · Computer Science 2026-05-14 Nathan Klein , Neil Olver , Zi Song Yeoh

Let $U_{k,N}$ denote the Boolean function which takes as input $k$ strings of $N$ bits each, representing $k$ numbers $a^{(1)},\dots,a^{(k)}$ in $\{0,1,\dots,2^{N}-1\}$, and outputs 1 if and only if $a^{(1)} + \cdots + a^{(k)} \geq 2^N.$…

Computational Complexity · Computer Science 2015-08-14 Xi Chen , Igor C. Oliveira , Rocco A. Servedio

Sequences of discrete random variables are studied whose probability generating functions are zero-free in a sector of the complex plane around the positive real axis. Sharp bounds on the cumulants of all orders are stated, leading to…

Probability · Mathematics 2023-12-04 Nils Heerten , Holger Sambale , Christoph Thäle

The quantum mechanics is proved to admit no hidden-variable in 1960s, which means the quantum systems are contextual. Revealing the mathematical structure of quantum mechanics is a significant task. We develop the approach of partial…

Quantum Physics · Physics 2024-12-03 Songyi Liu , Yongjun Wang , Baoshan Wang , Jian Yan , Heng Zhou

One of the major results of [N. Robertson and P. D. Seymour. Graph minors. XIII. The disjoint paths problem. J. Combin. Theory Ser. B, 63(1):65--110, 1995], also known as the weak structure theorem, revealed the local structure of graphs…

Combinatorics · Mathematics 2011-03-01 Archontia C. Giannopoulou , Dimitrios M. Thilikos

The Kestelman-Borwein-Ditor Theorem asserts that a non-negligible subset of $\mathbb{R}$ which is Baire (=has the Baire property, BP) or measurable is shift-compact: it contains some subsequence of any null sequence to within translation by…

Classical Analysis and ODEs · Mathematics 2019-01-29 H. I. Miller , L. Miller-Van Wieren , A. J. Ostaszewski

We provide proofs certifying that the structure theorem for vertex sets of bounded bidimensionality holds with polynomial bounds. The bidimensionality of vertex sets is a common generalisation of both treewidth and the face-cover-number of…

Combinatorics · Mathematics 2026-02-10 Maximilian Gorsky , Evangelos Protopapas , Sebastian Wiederrecht

We prove a query complexity variant of the weak polynomial Freiman-Ruzsa conjecture in the following form. For any $\epsilon > 0$, a set $A \subset \mathbb{Z}^d$ with doubling $K$ has a subset of size at least $K^{-\frac{4}{\epsilon}}|A|$…

Number Theory · Mathematics 2022-01-14 Dmitrii Zhelezov , Dömötör Pálvölgyi

We study algorithmic randomness notions via effective versions of almost-everywhere theorems from analysis and ergodic theory. The effectivization is in terms of objects described by a computably enumerable set, such as lower semicomputable…

Logic · Mathematics 2016-03-22 Kenshi Miyabe , André Nies , Jing Zhang

We construct a family of shift spaces with almost specification and multiple measures of maximal entropy. This answers a question from Climenhaga and Thompson [Israel J. Math. 192 (2012), no. 2, 785--817]. Elaborating on our examples we…

Dynamical Systems · Mathematics 2014-11-10 Dominik Kwietniak , Piotr Oprocha , Michał Rams

The theory of influence and sharp threshold is a key tool in probability and probabilistic combinatorics, with numerous applications. One significant aspect of the theory is directed at identifying the level of generality of the product…

Probability · Mathematics 2015-04-27 Geoffrey Grimmett , Svante Janson , James Norris

We prove an analogue of the portmanteau theorem on weak convergence of probability measures allowing measures which are unbounded on an underlying metric space but finite on the complement of any Borel neighbourhood of a fixed element.

Probability · Mathematics 2007-05-23 Matyas Barczy , Gyula Pap

We prove a sequence of limiting results about weakly dependent stationary and regularly varying stochastic processes in discrete time. After deducing the limiting distribution for individual clusters of extremes, we present a new type of…

Probability · Mathematics 2017-12-05 Bojan Basrak , Hrvoje Planinic , Philippe Soulier

Bourgain showed that any noise stable Boolean function $f$ can be well-approximated by a junta. In this note we give an exponential sharpening of the parameters of Bourgain's result under the additional assumption that $f$ is a halfspace.

Computational Complexity · Computer Science 2012-03-01 Ilias Diakonikolas , Ragesh Jaiswal , Rocco A. Servedio , Li-Yang Tan , Andrew Wan
‹ Prev 1 8 9 10 Next ›