English
Related papers

Related papers: When are sequences of Boolean functions tame?

200 papers

Motivated by the Berry-Tabor Conjecture and the seminal work of Rudnick-Sarnak, the fine-scale properties of sequences $(a_n\alpha)_{n \in \mathbb{N}} \mod 1$ with $(a_n)_{n \in \mathbb{N}} \subseteq \mathbb{N} $ and $\alpha$ irrational…

Number Theory · Mathematics 2025-06-03 Manuel Hauke

Let f be a definable function, enough differentiable. Under the condition of having strongly isolated singularities at infinity at a regular value c we give a sufficient condition expressed in terms of the total absolute curvature function…

Logic · Mathematics 2011-03-04 V. Grandjean

A sequence $\Big(u_n\Big)_{n=0}^{\infty}$ is said to be convex if it satisfies the following inequality $$ 2u_n\leq u_{n-1}+u_{n+1}\qquad \mbox{for all}\qquad n\in\mathbb{N}. $$ We present several characterizations of convex sequences and…

General Mathematics · Mathematics 2025-05-30 Angshuman Robin Goswami

We consider uniform random permutations of length $n$ conditioned to have no cycle longer than $n^\beta$ with $0<\beta<1$, in the limit of large $n$. Since in unconstrained uniform random permutations most of the indices are in cycles of…

Probability · Mathematics 2018-12-21 Volker Betz , Helge Schäfer , Dirk Zeindler

In this paper, we analyze the convergence speed of a series related with $\mathcal{P}_\tau^\alpha f$ by discussing the behavior of the family of operators \begin{equation*} T_N^\alpha f(t) = \sum_{j=N_1}^{N_2}…

Classical Analysis and ODEs · Mathematics 2020-12-15 Chao Zhang , Tao Ma , José L. Torrea

A class of graphs admits an adjacency labeling scheme of size $b(n)$, if the vertices in each of its $n$-vertex graphs can be assigned binary strings (called labels) of length $b(n)$ so that the adjacency of two vertices can be determined…

Combinatorics · Mathematics 2024-02-21 Édouard Bonnet , Julien Duron , John Sylvester , Viktor Zamaraev , Maksim Zhukovskii

If $f:\mathbb{N}\rightarrow \mathbb{N}$ is a function, then let us say that $f$ is sublinear if \[\lim_{n\rightarrow +\infty}\frac{f(n)}{n}=0.\] If $G=(V,E)$ is a cubic graph and $c:E\rightarrow \{1,...,k\}$ is a proper $k$-edge-coloring of…

Discrete Mathematics · Computer Science 2021-04-20 Davide Mattiolo , Giuseppe Mazzuoccolo , Vahan Mkrtchyan

A Steinhaus random multiplicative function $f$ is a completely multiplicative function obtained by setting its values on primes $f(p)$ to be independent random variables distributed uniformly on the unit circle. Recent work of Harper shows…

Number Theory · Mathematics 2024-01-02 Kannan Soundararajan , Max Wenqiang Xu

Around 2008, Schramm conjectured that the critical probabilities for Bernoulli bond percolation satisfy the following continuity property: If $(G_n)_{n\geq 1}$ is a sequence of transitive graphs converging locally to a transitive graph $G$…

Probability · Mathematics 2019-07-29 Tom Hutchcroft

Let $f$ be a real function defined on the interval $[0,1]$ which is constant on $(a,b)\subset [0,1]$, and let $B_nf$ be its associated $n$th Bernstein polynomial. We prove that, for any $x\in (a,b)$, $|B_nf(x)-f(x)|$ converges to $0$ as…

Classical Analysis and ODEs · Mathematics 2024-11-18 José A. Adell , Daniel Cárdenas-Morales , Antonio J. López-Moreno

We show for a class of sequences $(a_n)_{n\geq 1}$ of distinct positive integers, that for no $\alpha$ the sequence $(\left\{a_n \alpha \right\})_{n \geq 1}$ does have Poissonian pair correlation. This class contains for example all…

Number Theory · Mathematics 2018-01-31 Gerhard Larcher

We establish the linear independence of time-frequency translates for functions $f$ having one sided decay $\lim_{x\to \infty} |f(x)| e^{cx \log x} = 0$ for all $c>0$. We also prove such results for functions with faster than exponential…

Functional Analysis · Mathematics 2014-02-26 Marcin Bownik , Darrin Speegle

Let f be a transcendental meromorphic function. Suppose that the finite part of the postsingular set of f is bounded, that f has no recurrent critical points or wandering domains, and that the degree of pre-poles of f is uniformly bounded.…

Dynamical Systems · Mathematics 2014-11-14 Lasse Rempe , Sebastian van Strien

We prove that if $f$ is a random completely multiplicative function, conditional $f(p)=1$ for each prime $p \le (\log x)^{2-\epsilon}$, the probability that $\sum_{1\le n \le N}f(n)\ge 0$ for all $N\le x$ is $o(1)$ as $x \rightarrow…

Number Theory · Mathematics 2026-03-25 Rodrigo Angelo , Max Wenqiang Xu

A well-known discovery of Feige's is the following: Let $X_1, \ldots, X_n$ be nonnegative independent random variables, with $\mathbb{E}[X_i] \leq 1 \;\forall i$, and let $X = \sum_{i=1}^n X_i$. Then for any $n$, \[\Pr[X < \mathbb{E}[X] +…

Probability · Mathematics 2018-04-06 Brian Garnett

We give an adaptive algorithm which tests whether an unknown Boolean function $f\colon \{0, 1\}^n \to\{0, 1\}$ is unate, i.e. every variable of $f$ is either non-decreasing or non-increasing, or $\epsilon$-far from unate with one-sided…

Computational Complexity · Computer Science 2017-08-22 Xi Chen , Erik Waingarten , Jinyu Xie

Let $A,$ $T$ and $B$ be bounded linear operators on a Banach space. This paper is concerned mainly with finding some necessary and sufficient conditions for convergence in operator norm of the sequences $\left\{ A^{n}TB^{n}\right\} $ and…

Functional Analysis · Mathematics 2019-04-15 Heybetkulu Mustafayev

A uniformly bounded complete orthonormal system of functions $\Theta =\{ \theta_n\}_{n=1}^{\infty},$ $ \|\theta_n\|_{L^\infty_{[0,1]} } \leq M $ is constructed such that $\sum_{n=1}^{\infty} a_{n}\theta_{n}$ converges almost everywhere on…

Classical Analysis and ODEs · Mathematics 2019-12-30 K. S. Kazarian

In [GW09a] we conjectured that uniformity of degree $k-1$ is sufficient to control an average over a family of linear forms if and only if the $k$th powers of these linear forms are linearly independent. In this paper we prove this…

Number Theory · Mathematics 2019-06-14 W. T. Gowers , J. Wolf

Let $\{G_n\}_{n=1}^{\infty}$ be a sequence of transitive infinite connected graphs with $\sup\limits_{n\geq 1} p_c(G_n) < 1,$ where each $p_c(G_n)$ is bond percolation critical probability on $G_n.$ Schramm (2008) conjectured that if $G_n$…

Probability · Mathematics 2014-10-14 He Song , Kai-Nan Xiang , Song-Chao-Hao Zhu