中文
相关论文

相关论文: Arithmetic structures in random sets

200 篇论文

We adapt methods coming from additive combinatorics in groups to the study of linear span in associative unital algebras. In particular, we establish for these algebras analogues of Diderrich-Kneser's and Hamidoune's theorems on sumsets and…

组合数学 · 数学 2015-06-24 Vincent Beck , Cédric Lecouvey

Given a set $A\subseteq\mathbb{N}$, we consider the relationship between stability of the structure $(\mathbb{Z},+,0,A)$ and sparsity of the set $A$. We first show that a strong enough sparsity assumption on $A$ yields stability of…

逻辑 · 数学 2020-05-22 Gabriel Conant

Based on computeralgebra experiments we formulate a refined version of Green's conjecture and a conjecture of Schicho-Schreyer-Weimann which conjecturally also holds in positive characteristic. The experiments are done by using our…

代数几何 · 数学 2018-03-29 Christian Bopp , Frank-Olaf Schreyer

Fix an integer $r\geq 3$. We consider metric spaces on $n$ points such that the distance between any two points lies in $\{1,..., r\}$. Our main result describes their approximate structure for large $n$. As a consequence, we show that the…

组合数学 · 数学 2015-02-10 Dhruv Mubayi , Caroline Terry

We show that Ramsey theory, a domain presently conceived to guarantee the existence of large homogeneous sets for partitions on k-tuples of words (for every natural number k) over a finite alphabet, can be extended to one for partitions on…

组合数学 · 数学 2007-05-23 V. Farmaki , S. Negrepontis

We prove a variant of the abstract probabilistic version of Szemer\'edi's regularity lemma, due to Tao, which applies to a number of structures (including graphs, hypergraphs, hypercubes, graphons, and many more) and works for random…

组合数学 · 数学 2016-07-26 Pandelis Dodos , Vassilis Kanellopoulos , Thodoris Karageorgos

We consider random trigonometric polynomials with general dependent coefficients. We show that under mild hypotheses on the structure of dependence, the asymptotics as the degree goes to infinity of the expected number of real zeros…

概率论 · 数学 2024-09-24 Jürgen Angst , Oanh Nguyen , Guillaume Poly

We use techniques of relative algebraic K-theory to develop a common refinement of the existing theories of metrized and hermitian Galois structures in arithmetic. As a first application of this very general approach, we then use it to…

数论 · 数学 2020-03-25 Werner Bley , David Burns , Carl Hahn

We show that the Freiman--Ruzsa theorem, characterising finite sets with bounded doubling, leads to an alternative proof of a characterisation of Meyer sets, that is, relatively dense subsets of Euclidean spaces whose difference sets are…

数论 · 数学 2023-12-20 Jakub Konieczny

In 1975 Szemer\'edi proved the long-standing conjecture of Erd\H{o}s and Tur\'an that any subset of $\bbZ$ having positive upper Banach density contains arbitrarily long arithmetic progressions. Szemer\'edi's proof was entirely…

动力系统 · 数学 2010-06-09 Tim Austin

We introduce geometric and homological finiteness properties for countable approximate groups via coarse geometry and then study these finiteness properties for S-arithmetic reductive approximate groups. For S-arithmetic approximate groups…

群论 · 数学 2022-04-05 Tobias Hartnick , Stefan Witzel

In this paper, the two settings we are concerned with are $\Gamma < \operatorname{SO}(n, 1)$ a Zariski dense Schottky semigroup and $\Gamma < \operatorname{SL}_2(\mathbb C)$ a Zariski dense continued fractions semigroup. In both settings,…

数论 · 数学 2025-11-21 Pratyush Sarkar

This paper explores the relationship between convexity and sum sets. In particular, we show that elementary number theoretical methods, principally the application of a squeezing principle, can be augmented with the Elekes-Szab\'{o} Theorem…

组合数学 · 数学 2024-01-17 Oliver Roche-Newton , Elaine Wong

We show that there exists a bounded pattern of m consecutive primes for any m>0, that means a tuple H_m of m distinct non-negative integers h_i (i=1,2,...m) such that its translations contain arbitrarily long (finite) arithmetic…

数论 · 数学 2015-09-08 Janos Pintz

We extend the results of the general small-gain theorem proposed by Z.P Jiang. The significance of this extension is two fold. First, it allows one to use general vector norm to characterize the input-to-output property of two…

系统与控制 · 计算机科学 2014-09-25 Yunsheng Li , Chi Jin

Inspired by a question of Kra, Moreira, Richter, and Robertson, we prove two new results about infinite polynomial configurations in large subsets of the rational numbers. First, given a finite coloring of $\mathbb{Q}$, we show that there…

组合数学 · 数学 2025-07-08 Ethan Ackelsberg

According to a classical result of Szemer\'{e}di, every dense subset of $1,2,...,N$ contains an arbitrary long arithmetic progression, if $N$ is large enough. Its analogue in higher dimensions due to F\"urstenberg and Katznelson says that…

组合数学 · 数学 2010-04-13 Adrian Dumitrescu

Let $q$ be an odd prime power. Combining the discussion of Varnavides and a recent theorem of Ellenberg and Gijswijt, we show that a subset $A\subset{\mathbb F}_q^n$ will contain many non-trivial three-term arithmetic progressions, whenever…

组合数学 · 数学 2016-11-29 Shanshan Du , Hao Pan

This paper is mainly concerned with sets which do not contain four-term arithmetic progressions, but are still very rich in three term arithmetic progressions, in the sense that all sufficiently large subsets contain at least one such…

组合数学 · 数学 2020-09-17 Cosmin Pohoata , Oliver Roche-Newton

This paper extends classical probabilistic results to the broader class of demimartingales and demisubmartingales. We establish variants of Doob's-type optional sampling theorem under minimal structural conditions on stopping times, relying…

概率论 · 数学 2025-07-24 Milto Hadjikyriakou , B. L. S Prakasa Rao
‹ 上一页 1 8 9 10 下一页 ›