中文
相关论文

相关论文: Gaps in sumsets of $s$ pseudo s-th power sequences

200 篇论文

Length density is a recently introduced factorization invariant, assigned to each element $n$ of a cancellative commutative atomic semigroup $S$, that measures how far the set of factorization lengths of $n$ is from being a full interval.…

It is proved that there exists an (omega-1,omega-1) Souslin gap in the Boolean algebra (L(nu)/Fin,subseteq^*_ae) for every nonseparable measure nu. Thus a Souslin, also known as destructible, (omega-1,omega-1) gap in P(N)/Fin can always be…

逻辑 · 数学 2007-10-30 James Hirschorn

We prove a number of results related to a problem of Po-Shen Loh, which is equivalent to a problem in Ramsey theory. Let $a=(a_1,a_2,a_3)$ and $b=(b_1,b_2,b_3)$ be two triples of integers. Define $a$ to be 2-less than $b$ if $a_i<b_i$ for…

组合数学 · 数学 2023-06-22 W. T. Gowers , J. Long

Let $n$ be a positive integer. In this paper we estimate the size of the set of linear forms $b_1\log a_1 + b_2\log a_2+...+b_n\log a_n$, where $|b_i|\leq B_i$ and $1\leq a_i\leq A_i$ are integers, as $A_i,B_i\to \infty$.

数论 · 数学 2010-05-26 Youness Lamzouri

Let $L(s,f)$ be an $L$-function associated to a primitive (holomorphic or Maass) cusp form $f$ on GL(2) over $\mathbb{Q}$. Combining mean-value estimates of Montgomery and Vaughan with a method of Ramachandra, we prove a formula for the…

For a prime number $p$, we consider its primorial $P:=p\#$ and $U(P):={\left(\mathbb{Z}/P\mathbb{Z}\right)}^\times$ the set of elements of the multiplicative group of integers modulo $P$ which we represent as points anticlockwise on a…

数论 · 数学 2023-12-12 Steven Brown

Fix a prime $p$ and an integer $m$ with $p> m \geq 2$. Define the family of finite groups \[ G_n :=SL_m (\mathbb{Z}/p^{n}\mathbb{Z}) \] for $n=1,2,... $. We will prove that there exist two positive constants $C$ and $d$ such that for any…

群论 · 数学 2007-05-23 Oren Dinai

In this paper we consider the following problems: how many different subsets of Sigma^n can occur as set of all length-n factors of a finite word? If a subset is representable, how long a word do we need to represent it? How many such…

形式语言与自动机理论 · 计算机科学 2013-04-15 Shuo Tan , Jeffrey Shallit

Denoting by Sigma(S) the set of subset sums of a subset S of a finite abelian group G, we prove that |Sigma(S)| >= |S|(|S|+2)/4-1 whenever S is symmetric, |G| is odd and Sigma(S) is aperiodic. Up to an additive constant of 2 this result is…

组合数学 · 数学 2014-07-01 Eric Balandraud , Benjamin Girard , Simon Griffiths , Yahya Ould Hamidoune

We determine the complete list of the gaps between successive elements of the multiplication table of the first N integers.

数论 · 数学 2026-04-07 Emmanuel Kowalski , Vivian Kuperberg

We study the problem of computing a longest increasing subsequence in a sequence $S$ of $n$ distinct elements in the presence of persistent comparison errors. In this model, every comparison between two elements can return the wrong result…

数据结构与算法 · 计算机科学 2018-08-13 Barbara Geissmann

Fix a finite semigroup $S$ and let $a_1,\ldots,a_k, b$ be tuples in a direct power $S^n$. The subpower membership problem (SMP) for $S$ asks whether $b$ can be generated by $a_1,\ldots,a_k$. For bands (idempotent semigroups), we provide a…

群论 · 数学 2016-04-06 Markus Steindl

The sequence of 1/2-discrepancy sums of $\{x + i \theta \bmod 1\}$ is realized through a sequence of substitutions on an alphabet of three symbols; particular attention is paid to $x=0$. The first application is to show that any asymptotic…

动力系统 · 数学 2011-05-31 David Ralston

Every finitely generated self-similar group naturally produces an infinite sequence of finite $d$-regular graphs $\Gamma_n$. We construct self-similar groups, whose graphs $\Gamma_n$ can be represented as an iterated zig-zag product and…

群论 · 数学 2014-09-01 Ievgen Bondarenko

Let $A\subset [1, 2]$ be a $(\delta, \sigma)$-set with measure $|A|=\delta^{1-\sigma}$ in the sense of Katz and Tao. For $\sigma\in (1/2, 1)$ we show that $$ |A+A|+|AA|\gtrapprox \delta^{-c}|A|, $$ for…

组合数学 · 数学 2020-02-26 Changhao Chen

Let b > 1 be an integer and denote by s_b(m) the sum of the digits of the positive integer m when is written in base b. We prove that s_b(n!) > C_b log n log log log n for each integer n > e, where C_b is a positive constant depending only…

数论 · 数学 2014-10-30 Carlo Sanna

We analyze sumsets A+B = {a+b : a in A, b in B} where A,B are sets of integers, A is infinite, and B has positive upper Banach density. For each k, we show that A+B contains at least the expected density of k-term arithmetic progressions…

动力系统 · 数学 2010-11-23 John T. Griesmer

Sharpening (a particular case of) a result of Szemeredi and Vu and extending earlier results of Sarkozy and ourselves, we find, subject to some technical restrictions, a sharp threshold for the number of integer sets needed for their sumset…

数论 · 数学 2008-06-30 Vsevolod F. Lev

Let $0<\gamma_1\leq \gamma_2 \leq \cdots $ denote the ordinates of nontrivial zeros of the Riemann zeta function with positive imaginary parts. For $c>0$ fixed (but possibly small), $T$ large, and $\gamma_n\leq T$, we call a gap…

数论 · 数学 2024-12-23 Steven M. Gonek , Anurag Sahay

The sequence of one-parameter semigroups arising as the approximation of initial-boundary value problem with singularities is the object of investigation of this paper. The set of limit points of the sequence of approximating semigroups is…

量子物理 · 物理学 2015-02-19 Vsevolod Sakbaev