English
Related papers

Related papers: On the sequence $\alpha n!$

200 papers

We show that for any $k$-times continuously differentiable function $f:[a,\infty)\longrightarrow{\mathbb R}$, any integer $q\ge 0$ and any $\alpha>1$ the inequality $$\liminf_{x\to\infty} \frac{x^k \cdot\log x\cdot \log_2 x\cdot\dots\cdot…

Classical Analysis and ODEs · Mathematics 2015-09-09 Jürgen Grahl , Shahar Nevo

Let $p_n$ denotes the $n$-th prime. We prove that $$\max_{p_{n+1} \leq X} (p_{n+1}-p_n) \gg \frac{\log X \log \log X\log\log\log\log X}{\log \log \log X}$$ for sufficiently large $X$, improving upon recent bounds of the first three and…

Number Theory · Mathematics 2019-10-22 Kevin Ford , Ben Green , Sergei Konyagin , James Maynard , Terence Tao

Let H be a countable subgroup of the metrizable compact abelian group G and f:H -> T=R/Z a (not necessarily continuous) character of H. Then there exists a sequence (chi_n)_n of (continuous) characters of G such that lim_n chi_n(alpha) =…

General Topology · Mathematics 2007-05-23 Mathias Beiglböck , Christian Steineder , Reinhard Winkler

Given a Banach space $X$ and a real number $\alpha\ge 1$, we write: (1) $D(X)\le\alpha$ if, for any locally finite metric space $A$, all finite subsets of which admit bilipschitz embeddings into $X$ with distortions $\le C$, the space $A$…

Functional Analysis · Mathematics 2019-10-10 Sofiya Ostrovska , Mikhail I. Ostrovskii

We say that a sequence $\{x_n\}_{n \geq 1}$ in $[0,1)$ has Poissonian pair correlations if \begin{equation*} \lim_{N \rightarrow \infty} \frac{1}{N} \# \left\{ 1 \leq l \neq m \leq N \, : \, \left\lVert x_l-x_m \right\rVert < \frac{s}{N}…

Number Theory · Mathematics 2017-06-21 Sigrid Grepstad , Gerhard Larcher

Let $p_n$ denote the $n$-th prime number, and let $d_n=p_{n+1}-p_{n}$. Under the Hardy--Littlewood prime-pair conjecture, we prove \begin{align*} \sum_{n\le X}\frac{\log^{\alpha}d_n}{d_n} \sim\begin{cases} \frac{X\log\log\log X}{\log…

Number Theory · Mathematics 2018-08-28 Nian Hong Zhou

Efficiently counting or detecting defective items is a crucial task in various fields ranging from biological testing to quality control to streaming algorithms. The \emph{group testing estimation problem} concerns estimating the number of…

Data Structures and Algorithms · Computer Science 2023-12-08 Nader H. Bshouty , Tsun-Ming Cheung , Gergely Harcos , Hamed Hatami , Anthony Ostuni

We show that for any irrational $\alpha$ and any $\tau<8/23$ there are infinitely many $n$ which are the product of two primes for which $$\|n\alpha\|\leq n^{-\tau}.$$ We also show that for all sufficiently large $b$ there exist 3-digit…

Number Theory · Mathematics 2014-09-09 A. J. Irving

We propose a sufficient condition of the convergence of a power-log series that formally satisfies an algebraic ordinary differential equation (ODE) of arbitrary order. A general form and properties of the functional coefficients of such a…

Classical Analysis and ODEs · Mathematics 2021-11-16 Renat Gontsov , Irina Goryuchkina

We study nonlinear elliptic equations in divergence form $${\operatorname{div}}{\mathcal A}(x,Du)={\operatorname{div}}G.$$ When ${\mathcal A}$ has linear growth in $Du$, and assuming that $x\mapsto{\mathcal A}(x,\xi)$ enjoys…

Analysis of PDEs · Mathematics 2016-03-18 Antonio L. Baisón , Albert Clop , Raffaella Giova , Joan Orobitg , Antonia Passarelli di Napoli

We consider the length $L(n)$ of the longest path in a randomly generated Apollonian Network (ApN) ${\cal A}_n$. We show that w.h.p. $L(n)\leq ne^{-\log^cn}$ for any constant $c<2/3$.

Probability · Mathematics 2014-03-07 Colin Cooper , Alan Frieze

For K \subseteq C, let B_n(K)={(x_1,...,x_n) \in K^n: for each y_1,...,y_n \in K the conjunction (\forall i \in {1,...,n} (x_i=1 => y_i=1)) AND (\forall i,j,k \in {1,...,n} (x_i+x_j=x_k => y_i+y_j=y_k)) AND (\forall i,j,k \in {1,...,n}…

Logic · Mathematics 2012-04-09 Apoloniusz Tyszka

In this paper we study representations of real numbers in a numeral system with the base $a>1$ and alphabet (digits set) $A\equiv\{0,1,...,r\}$, $a-1<r\in N$ given by \[x=\sum\limits_{n=1}^{\infty}\frac{\alpha_n}{a^n}\equiv…

Number Theory · Mathematics 2026-03-31 S. O. Vaskevych , Yu. Yu. Vovk , O. M. Pratsiovytyi

We give a necessary and sufficient condition for the following property of an integer $d\in\mathbb N$ and a pair $(a,A)\in\mathbb R^2$: There exist $\kappa > 0$ and $Q_0\in\mathbb N$ such that for all $\mathbf x\in \mathbb R^d$ and $Q\geq…

Number Theory · Mathematics 2015-03-10 Lior Fishman , David Simmons

We prove the property that a function is cyclic (resp., non-cyclic) is not preserved by norm convergence in Dirichlet-type spaces $D_\alpha$, and show how other significant quantities for cyclicity do remain preserved under the limit of…

Functional Analysis · Mathematics 2023-09-22 Alejandra Aguilera , Daniel Seco

We prove that the sizes of the maximal dissociated subsets of a given finite subset of an abelian group differ by a logarithmic factor at most. On the other hand, we show that the set $\{0,1\}^n\seq\Z^n$ possesses a dissociated subset of…

Combinatorics · Mathematics 2015-03-17 Vsevolod F. Lev , Raphael Yuster

In this paper, we will introduce the `grid method' to prove that the extreme case of oscillation occurs for the averages obtained by sampling a flow along the sequence of times of the form $\{n^\alpha: n\in \mathbb{N}\}$, where $\alpha$ is…

Dynamical Systems · Mathematics 2023-03-03 Sovanlal Mondal

Let $(x_n)$ be a positive real sequence decreasing to $0$ such that the series $\sum_n x_n$ is divergent and $\liminf_{n} x_{n+1}/x_n>1/2$. We show that there exists a constant $\theta \in (0,1)$ such that, for each $\ell>0$, there is a…

Classical Analysis and ODEs · Mathematics 2018-05-29 Paolo Leonetti

Let $1<c<\frac{1787}{1502}$ and $N$ be a sufficiently large real number. In this paper, it is proved that for any arbitrarily large number $E>0$ and for almost all real $R \in (N,2N]$, the Diophantine inequality…

Number Theory · Mathematics 2023-12-15 Yuhui Liu

We extend the notion of combinatorial discrepancy to \emph{non-additive} functions. Our main result is an upper bound of $O(\sqrt{n \log(nk)})$ on the non-additive $k$-color discrepancy when $k$ is a prime power. We demonstrate two…

Computer Science and Game Theory · Computer Science 2025-09-23 Max Dupre la Tour , Kaito Fujii