English
Related papers

Related papers: Chains of large gaps between primes

200 papers

Let (X,d_X) be an n-point metric space. We show that there exists a distribution D over non-contractive embeddings into trees f:X-->T such that for every x in X, the expectation with respect to D of the maximum over y in X of the ratio…

Data Structures and Algorithms · Computer Science 2012-11-15 Manor Mendel , Assaf Naor

We show that once $\theta>17/30$, every sufficiently long interval $[x,x+x^\theta]$ contains many $k$-term arithmetic progressions of primes, uniformly in the starting point $x$. More precisely, for each fixed $k\ge3$ and $\theta>17/30$,…

Number Theory · Mathematics 2025-09-25 Le Duc Hieu

This paper presents a method for the robust selection of measurements in a simultaneous localization and mapping (SLAM) framework. Existing methods check consistency or compatibility on a pairwise basis, however many measurement types are…

Robotics · Computer Science 2022-09-07 Brendon Forsgren , Ram Vasudevan , Michael Kaess , Timothy W. McLain , Joshua G. Mangelson

We observe that the distribution of the eigenvalues of an $N$-by-$N$ GUE random matrix is log-concave on $\mathbb{R}^N$, and that the same is true for the law of a single gap between two consecutive eigenvalues. We use this observation to…

Probability · Mathematics 2026-01-12 Samuel G. G. Johnston

We obtain complementary recurrence and transience criteria for processes $X=(X_n)_{n \ge 0}$ with values in $\mathbb R^d_+$ fulfilling a non-linear equation $X_{n+1}=MX_n+g(X_n)+ \xi_{n+1}$. Here $M$ denotes a primitive matrix having…

Probability · Mathematics 2016-05-16 Götz Kersting

Let $G$ be a $p$-group. We denote by $\mathcal{X}_i(G)$ the intersection of all subgroups of $G$ having index $p^i$, for $i \leq \log_p(|G|)$. In this paper, the newly introduced series $\{\mathcal{X}_i(G)\}_i$ is investigated and a number…

Group Theory · Mathematics 2023-10-02 Stefanos Aivazidis , Maria Loukaki

All the available results on the approximation of the k-spacings process to Gaussian processes have only used one approach, that is the Shorack and Pyke's one. Here, it is shown that this approach cannot yield a rate better than $% \left(…

Methodology · Statistics 2014-07-01 Gane Samb Lo

The Gaussian moat problem asks whether it is possible to find an infinite sequence of distinct Gaussian prime numbers such that the difference between consecutive numbers in the sequence is bounded. In this paper, we have proved that the…

Number Theory · Mathematics 2024-09-09 Madhuparna Das

The purpose of this paper is to discuss the relationship between prime numbers and sums of Fibonacci numbers. One of our main results says that for every sufficiently large integer $k$ there exists a prime number that can be represented as…

Number Theory · Mathematics 2022-08-17 Michael Drmota , Clemens Müllner , Lukas Spiegelhofer

Let $(L_n^{(k)})_{n\geq 2-k}$ be the sequence of $k$--generalized Lucas numbers for some fixed integer $k\ge 2$ whose first $k$ terms are $0,\ldots,0,2,1$ and each term afterwards is the sum of the preceding $k$ terms. For an integer $m$,…

Number Theory · Mathematics 2023-11-23 Herbert Batte , Florian Luca

Let $X_1,X_2,\ldots,X_n$ be independent random variables and $S_k=\sum_{i=1}^k X_i$. We show that for any constants $a_k$, \[ \Pr(\max_{1\leq k\leq n}||S_{k}|-a_{k}|>11t)\leq 30 \max_{1\leq k\leq n}\Pr(||S_{k}|-a_{k}|>t). \] We also discuss…

Probability · Mathematics 2015-01-06 Rafał Latała

We show that in a sample of size $n$ from a GEM$(0,\theta)$ random discrete distribution, the gaps $G_{i:n}:= X_{n-i+1:n} - X_{n-i:n}$ between order statistics $X_{1:n} \le \cdots \le X_{n:n}$ of the sample, with the convention $G_{n:n} :=…

Probability · Mathematics 2017-01-24 Jim Pitman , Yuri Yakubovich

In this paper, we consider the global comparison problem of Gini means with fixed number of variables on a subinterval $I$ of $\mathbb{R}_+$, i.e., the following inequality \begin{align}\tag{$\star$}\label{ggcabs}…

Classical Analysis and ODEs · Mathematics 2024-08-15 Richárd Grünwald , Zsolt Páles

For a countable ultrahomogeneous graph G let P(G) denote the collection of domains of subgraphs of G isomorphic to G. The order types of maximal chains in the set P(G) U {\o} ordered by the inclusion are characterized as: (I) the order…

Logic · Mathematics 2017-09-26 Milos S. Kurilic , Borisa Kuzeljevic

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot...\cdot(n_kg)$ where $g\in G$ and $n_1,\cdots,n_k\in[1,{\hbox{\rm ord}}(g)]$, and the index $\ind S$ of $S$ is defined to be the minimum…

Number Theory · Mathematics 2014-02-03 Li-meng Xia , Caixia Shen

Consider a Markov chain $(X_i)_{i\ge0}$ with invariant measure $\mu$ that admits the representation $X_{i+1}=\Phi(X_i,U_i)$, where $(U_i)_{i\ge0}$ are i.i.d. random variables and $\Phi$ is a measurable map. We introduce a tangent-decoupled…

Probability · Mathematics 2025-12-23 Nawaf Bou-Rabee , Victor H. de la Peña

This paper is motivated by the following question in sieve theory. Given a subset $X\subset [N]$ and $\alpha\in (0,1/2)$. Suppose that $|X\pmod p|\leq (\alpha+o(1))p$ for every prime $p$. How large can $X$ be? On the one hand, we have the…

Number Theory · Mathematics 2014-09-26 Xuancheng Shao

We present a method for finding large fixed-size primes of the form $X^2+c$. We study the density of primes on the sets $E_c = \{N(X,c)=X^2+c,\ X \in (2\mathbb{Z}+(c-1))\}$, $c \in \mathbb{N}^*$. We describe an algorithm for generating…

Data Structures and Algorithms · Computer Science 2023-12-20 Marc Wolf , François Wolf

We present a simple, natural #P-complete problem. Let G be a directed graph, and let k be a positive integer. We define q(G;k) as follows. At each vertex v, we place a k-dimensional complex vector x_v. We take the product, over all edges…

Computational Complexity · Computer Science 2010-01-15 Cristopher Moore , Alexander Russell

Let $k\geq2$ and $s$ be positive integers. Let $\theta\in(0,1)$ be a real number. In this paper, we establish that if $s>k(k+1)$ and $\theta>0.55$, then every sufficiently large natural number $n$, subjects to certain congruence conditions,…

Number Theory · Mathematics 2022-07-21 Mengdi Wang