中文
相关论文

相关论文: Gaps and the exponent of convergence of an integer…

200 篇论文

For $s=3,4$, we prove the existence of arbitrarily long sequences of consecutive integers none of which is a sum of $s$ nonnegative $s$-th powers. More generally, we study the existence of gaps between the values $\leq N$ of diagonal forms…

数论 · 数学 2020-05-06 Luca Ghidelli

Let $s \geq 3$ be a fixed positive integer and $a_1,\dots,a_s \in \mathbb{Z}$ be arbitrary. We show that, on average over $k$, the density of numbers represented by the degree $k$ diagonal form \[ a_1 x_1^k + \cdots + a_s x_s^k \] decays…

数论 · 数学 2018-05-02 Brandon Hanson , Asif Zaman

Let A be a set of integers dense in a finite interval. We establish upper and lower bounds for the longest regularly-spaced and convex subsets of A and of A-A.

组合数学 · 数学 2020-09-03 Brandon Hanson

In this note, we extend the notion of minimal gaps to the higher dimensional sequences. We bound the minimal gap for $(\{\boldsymbol{a}_n\boldsymbol{\alpha}\}),$ $(\{a_n\boldsymbol{\alpha}\})$ and…

数论 · 数学 2024-04-09 Tanmoy Bera

Motivated by a question of S\'ark\"ozy, we study the gaps in the product sequence $\B=\A ... \A=\{b_n=a_ia_j, a_i,a_j\in \A\}$ when $\A$ has upper Banach density $\alpha>0$. We prove that there are infinitely many gaps $b_{n+1}-b_n\ll…

数论 · 数学 2009-10-13 Javier Cilleruelo , Thai Hoang Le

Developing an idea of M. Gromov, we study the intersection formula for random subsets with density. The \textit{density} of a subset $A$ in a finite set $E$ is defined by $dens A := \log_{|E|}(|A|)$. The aim of this article is to give a…

群论 · 数学 2025-08-26 Tsung-Hsuan Tsai

Zeckendorf proved that any integer can be decomposed uniquely as a sum of non-adjacent Fibonacci numbers, $F_n$. Using continued fractions, Lekkerkerker proved the average number of summands of an $m \in [F_n, F_{n+1})$ is essentially…

组合数学 · 数学 2014-02-27 Amanda Bower , Rachel Insoft , Shiyu Li , Steven J. Miller , Philip Tosteson

Denote by $\mathbb{N}$ and $\mathbb{P}$ the set of all positive integers and prime numbers, respectively. Let $\mathbb{P}=\{p_1<p_2<\dots <p_n<\dots\}$, where $p_n$ is the $n$-th prime number. For $k\in\mathbb{N}$ we recursively define…

数论 · 数学 2022-01-06 Piotr Miska , János T. Tóth , Błażej Żmija

For two strings u, v over some alphabet A, we investigate the problem of embedding u into w as a subsequence under the presence of generalised gap constraints. A generalised gap constraint is a triple (i, j, C_{i, j}), where 1 <= i < j <=…

数据结构与算法 · 计算机科学 2024-04-17 Florin Manea , Jonas Richardsen , Markus L. Schmid

We propose a notion of graph convergence that interpolates between the Benjamini--Schramm convergence of bounded degree graphs and the dense graph convergence developed by L\'aszl\'o Lov\'asz and his coauthors. We prove that spectra of…

组合数学 · 数学 2017-12-27 Péter E. Frenkel

Let $S_n$ denote the set of permutations of $[n]:=\{1,\cdots, n\}$, and denote a permutation $\sigma\in S_n$ by $\sigma=\sigma_1\sigma_2\cdots \sigma_n$. For $l\ge2$ an integer, let $A^{(n)}_{l;k}\subset S_n$ denote the event that the set…

组合数学 · 数学 2022-08-26 Ross G. Pinsky

We show any subset $A\subset\mathbb{N}$ with positive upper Banach density contains the pattern $\{m,m+[n\alpha],\dots,m+k[n\alpha]\}$, for some $m\in\mathbb{N}$ and $n=p-1$ for some prime $p$, where…

动力系统 · 数学 2015-07-08 Wenbo Sun

Consider a random matrix $\mathbf{A}\in\mathbb{C}^{m\times n}$ ($m \geq n$) containing independent complex Gaussian entries with zero mean and unit variance, and let $0<\lambda_1\leq \lambda_{2}\leq ...\leq \lambda_n<\infty$ denote the…

统计理论 · 数学 2012-11-06 Prathapasinghe Dharmawansa , Matthew McKay , Yang Chen

This paper deals with the distribution of $\alpha \zeta^{n} \bmod 1$, where $\alpha\neq 0,\zeta>1$ are fixed real numbers and $n$ runs through the positive integers. Denote by $\Vert.\Vert$ the distance to the nearest integer. We…

数论 · 数学 2017-06-16 Johannes Schleischitz

Ascent sequences are sequences of nonnegative integers with restrictions on the size of each letter, depending on the number of ascents preceding it in the sequence. Ascent sequences have recently been related to (2+2)-free posets and…

组合数学 · 数学 2011-11-01 Paul Duncan , Einar Steingrimsson

Past works on remote lossy source coding studied the rate under average distortion and the error exponent of excess distortion probability. In this work, we look into how fast the excess distortion probability converges to 1 at small rates,…

信息论 · 计算机科学 2025-04-24 Han Wu , Hamdi Joudeh

Various authors, including McNew, Nathanson and O'Bryant, have recently studied the maximal asymptotic density of a geometric progression free sequence of positive integers. In this paper we prove the existence of geometric progression free…

数论 · 数学 2017-07-19 Xiaoyu He

At a conference in Debrecen in October 2010 Nathanson announced some results concerning the arithmetic diameters of certain sets. He proposed some related results on the representation of integers by sums or differences of powers of 2 and…

数论 · 数学 2011-08-19 Lajos Hajdu , Rob Tijdeman

We improve by an exponential factor the best known asymptotic upper bound for the density of sets avoiding 1 in Euclidean space. This result is obtained by a combination of an analytic bound that is an analogue of Lovasz theta number and of…

组合数学 · 数学 2015-01-30 Christine Bachoc , Alberto Passuello , Alain Thiery

It is well-known that for a quickly increasing sequence $(n_k)_{k \geq 1}$ the functions $(\cos 2 \pi n_k x)_{k \geq 1}$ show a behavior which is typical for sequences of independent random variables. If the growth condition on $(n_k)_{k…

数论 · 数学 2014-03-10 Christoph Aistleitner , Katusi Fukuyama