Related papers: A structure theorem for Boolean functions with sma…
In computer science, especially when dealing with quantum computing or other non-standard models of computation, basic notions in probability theory like "a predicate" vary wildly. There seems to be one constant: the only useful example of…
For an ergodic action of the group $Z^n$ on a probability space and a given arbitrarily slowly decreasing to zero sequence, there exists an integrable function such that the standard ergodic time averages for it converge almost everywhere…
We undertake a comprehensive study of structural properties of graph products of von Neumann algebras equipped with faithful, normal states, as well as properties of the graph products relative to subalgebras coming from induced subgraphs.…
Boolean networks constitute relevant mathematical models to study the behaviours of genetic and signalling networks. These networks define regulatory influences between molecular nodes, each being associated to a Boolean variable and a…
A simple way to generate a Boolean function is to take the sign of a real polynomial in $n$ variables. Such Boolean functions are called polynomial threshold functions. How many low-degree polynomial threshold functions are there? The…
We give a simple, short and self-contained presentation of Bourgain's discretised projection theorem from 2010, which is a fundamental tool in many recent breakthroughs in geometric measure theory, harmonic analysis, and homogeneous…
This paper presents a new general formulation of the Radon-Nikodym theorem in the setting of abstract measure theory. We introduce the notion of weak localizability for a measure and show that this property is both necessary and sufficient…
We prove two new results about the randomized query complexity of composed functions. First, we show that the randomized composition conjecture is false: there are families of partial Boolean functions $f$ and $g$ such that $R(f\circ g)\ll…
It is well known that the Riemann zeta function, as well as several other $L$-functions, is universal in the strip $1/2<\sigma<1$; this is certainly not true for $\sigma>1$. Answering a question of Bombieri and Ghosh, we give a simple…
We study mixtures of free, monotone, and Boolean independence described by a directed graph $G = (V,E)$ in the context of $\mathcal{T}$-free convolutions of Jekel and Liu. We prove general limit theorems for the associated additive…
We show that the size of codes in projective space controls structural results for zeros of odd maps from spheres to Euclidean space. In fact, this relation is given through the topology of the space of probability measures on the sphere…
We show that for any natural number $s$, there is a constant $\gamma$ and a subgraph-closed class having, for any natural $n$, at most $\gamma^n$ graphs on $n$ vertices up to isomorphism, but no adjacency labeling scheme with labels of size…
We present a SAT framework which allows to investigate properties of simple drawings of the complete graph $K_n$ using the power of AI. In contrast to classic imperative programming, where a program is operated step by step, our framework…
We develop the theory of invariant structure preserving and free functions on a general structured topological space. We show that an invariant structure preserving function is pointwise approximiable by the appropriate analog of…
A metric probability space $M$ admits thresholds if the random geometric graph on $M$ has a threshold for every monotone graph property. We connect the existence of thresholds to the uniform expansion of $M$ and prove that all standard…
Under suitable requirements on a kernel on a locally compact space, we develop a theory of inner (outer) balayage of quite general Radon measures $\omega$ (not necessarily of finite energy) onto quite general sets (not necessarily closed).…
We introduce probability-graphons which are probability kernels that generalize graphons to the case of weighted graphs. Probability-graphons appear as the limit objects to study sequences of large weighted graphs whose distribution of…
The Fourier-Entropy Influence (FEI) Conjecture states that for any Boolean function $f:\{+1,-1\}^n \to \{+1,-1\}$, the Fourier entropy of $f$ is at most its influence up to a universal constant factor. While the FEI conjecture has been…
Furstenberg, Katznelson and Weiss proved in the early 1980s that every measurable subset of the plane with positive density at infinity has the property that all sufficiently large real numbers are realised as the Euclidean distance between…
We study noisy computation in randomly generated k-ary Boolean formulas. We establish bounds on the noise level above which the results of computation by random formulas are not reliable. This bound is saturated by formulas constructed from…