English
Related papers

Related papers: On the Spielman-Teng Conjecture

200 papers

Let $p_n$ denote the $n$-th prime. For any $m\geq 1$, there exist infinitely many $n$ such that $p_{n}-p_{n-m}\leq C_m$ for some large constant $C_m>0$, and $$p_{n+1}-p_n\geq \frac{c_m\log n\log\log n\log\log\log\log n}{\log\log\log n}, $$…

Number Theory · Mathematics 2018-02-08 Yu-Chen Sun , Hao Pan

In this article, we prove that for an embedded minimal hypersurface $\Sigma^{m}$ in $S^{m+1}$, the first eigenvalue $\lambda_1$ of the Laplacian operator on $\Sigma$ satisfies: $$\lambda_1> \frac{m}{2}+G(m, |A|_{\max}, |A|_{\min} ) ,$$…

Differential Geometry · Mathematics 2026-03-25 Yuhang Zhao

The exponent $\sigma(T)$ of a tensor $T\in\mathbb{F}^d\otimes\mathbb{F}^d\otimes\mathbb{F}^d$ over a field $\mathbb{F}$ captures the base of the exponential growth rate of the tensor rank of $T$ under Kronecker powers. Tensor exponents are…

Computational Complexity · Computer Science 2024-04-10 Petteri Kaski , Mateusz Michałek

In this paper, we consider the first Szeg\H{o} limit theorems on $d$-torus $\mathbb{T}^d$ for $1\leq d\leq +\infty$. It is shown that for any F{\o}lner sequence $\{\sigma_N\}$ of $\mathbb{Z}^d$ and $\varphi\in L^1_+(\mathbb{T}^d)$, it holds…

Functional Analysis · Mathematics 2023-10-17 Kunyu Guo , Dilong Li , Qi Zhou

We prove that for every nonnegative integer $m$ there exists an $\varepsilon>0$ such that if $\lambda\in (0,\varepsilon]$ and $x$ is sufficiently large in terms of $m$, then the number of positive integers $n\leq x$ for which the interval…

Number Theory · Mathematics 2018-03-01 Daniele Mastrostefano

Consider the matrix $\Sigma_n = n^{-1/2} X_n D_n^{1/2} + P_n$ where the matrix $X_n \in \C^{N\times n}$ has Gaussian standard independent elements, $D_n$ is a deterministic diagonal nonnegative matrix, and $P_n$ is a deterministic matrix…

Probability · Mathematics 2013-01-23 Francois Chapon , Romain Couillet , Walid Hachem , Xavier Mestre

A generating set for a finite group $G$ is said to be minimal if no proper subset generates $G$, and $m(G)$ denotes the maximal size of a minimal generating set for $G$. We prove a conjecture of Lucchini, Moscatiello and Spiga by showing…

Group Theory · Mathematics 2023-07-20 Scott Harper

We deduce, as a consequence of the arithmetic removal lemma, an almost-all version of the Balog-Szemer\'{e}di-Gowers theorem: For any $K\geq 1$ and $\varepsilon > 0$, there exists $\delta = \delta(K,\varepsilon)>0$ such that the following…

Combinatorics · Mathematics 2019-09-09 Xuancheng Shao

It has been known since Erdos that the sum of $1/(n\log n)$ over numbers $n$ with exactly $k$ prime factors (with repetition) is bounded as $k$ varies. We prove that as $k$ tends to infinity, this sum tends to 1. Banks and Martin have…

Number Theory · Mathematics 2020-03-03 Jared Duker Lichtman

Let $\mathbf{M}$ be the basic set theory that consists of the axioms of extensionality, emptyset, pair, union, powerset, infinity, transitive containment, $\Delta_0$-separation and set foundation. This paper studies the relative strength of…

Logic · Mathematics 2019-01-11 Zachiri McKenzie

In arXiv:2208.12944 it is shown that an ordinal $\sup_{N<\omega}\psi_{\Omega_{1}}(\varepsilon_{\Omega_{\mathbb{S}+N}+1})$ is an upper bound for the proof-theoretic ordinal of a set theory ${\sf KP}\ell^{r}+(M\prec_{\Sigma_{1}}V)$. In this…

Logic · Mathematics 2022-11-17 Toshiyasu Arai

Let $\{p_j(n)\}_{j=1}^{\omega(n)}$ denote the increasing sequence of distinct prime factors of an integer $n$. We provide details for the proof of a statement of Erd\H{o}s implying that, for any function $\xi(n)$ tending to infinity with…

Number Theory · Mathematics 2019-05-01 Gérald Tenenbaum

Let $G$ be the alternating group of degree $n$. Let $\omega(G)$ be the maximal size of a subset $S$ of $G$ such that $\langle x,y \rangle = G$ whenever $x,y \in S$ and $x \neq y$ and let $\sigma(G)$ be the minimal size of a family of proper…

Group Theory · Mathematics 2022-06-24 Francesco Fumagalli , Martino Garonzi , Pietro Gheri

A conjecture predicting an injective and surjective mapping $X = \displaystyle\frac{\sigma(p^k)}{p^k}, Y = \displaystyle\frac{\sigma(m^2)}{m^2}$ between OPNs $N = {p^k}{m^2}$ (with Euler factor $p^k$) and rational points on the hyperbolic…

Number Theory · Mathematics 2013-10-17 Jose Arnaldo B. Dris

Some new results concerning the equation $\sigma(N)=aM, \sigma(M)=bN$ are proved. As a corollary, there are only finitely many odd superperfect numbers with a fixed number of distinct prime factors.

Number Theory · Mathematics 2020-10-21 Tomohiro Yamada

Let $G$ be the symmetric group of degree $n$. Let $\omega(G)$ be the maximal size of a subset $S$ of $G$ such that $\langle x,y \rangle = G$ whenever $x,y \in S$ and $x \neq y$ and let $\sigma(G)$ be the minimal size of a family of proper…

Group Theory · Mathematics 2022-03-22 Francesco Fumagalli , Martino Garonzi , Attila Maróti

In 2016, a breakthrough result of Chechik and Wulff-Nilsen [SODA '16] established that every $n$-node graph $G$ has a $(1+\varepsilon)(2k-1)$-spanner of lightness $O_{\varepsilon}(n^{1/k})$, and recent followup work by Le and Solomon [STOC…

Data Structures and Algorithms · Computer Science 2025-01-15 Greg Bodwin

A famous conjecture of Erd\H os and Straus is that for every integer $n\ge2$, $4/n$ can be represented as $1/x+1/y+1/z$, where $x,y,z$ are positive integers. This conjecture was generalized to $5/n$ by Sierpi\'nski, and then Schinzel…

Number Theory · Mathematics 2026-01-16 Carl Pomerance , Andreas Weingartner

Let $(S_0,S_1,...)$ be a supermartingale relative to a nondecreasing sequence of $\sigma$-algebras $H_{\le0},H_{\le1},...$, with $S_0\le0$ almost surely (a.s.) and differences $X_i:=S_i-S_{i-1}$. Suppose that $X_i\le d$ and $\mathsf…

Probability · Mathematics 2007-05-23 Iosif Pinelis

Let $h\colon\mathbb{Z}^+\to\mathbb{Z}^+\setminus\{1\}$ be any function such that $h(n)$ and $\lceil n^{1/h(n)}\rceil$ are computable from $n$ in $O(h(n)\cdot n^{1+1/h(n)})$ time. We show that given any $n$-point metric space $(M,d)$, the…

Data Structures and Algorithms · Computer Science 2018-07-31 Ching-Lueh Chang