中文
相关论文

相关论文: Hochman's upcrossing theorem for groups of polynom…

200 篇论文

For arrays $(S_{i,j})_{1\leq i\leq j}$ of random variables that are stationary in an appropriate sense, we show that the fluctuations of the process $(S_{1,n})_{n=1}^{\infty}$ can be bounded in terms of a measure of the ``mean…

动力系统 · 数学 2016-09-07 Michael Hochman

Given an abstract group $G$, we study the function $ab_n(G) := \sup_{|G:H| \leq n} |H/[H,H]|$. If $G$ has no abelian composition factors, then $ab_n(G)$ is bounded by a polynomial: as a consequence, we find a sharp upper bound for the…

群论 · 数学 2022-10-10 Luca Sabatini

It was shown by S. Kalikow and B. Weiss that, given a measure-preserving action of $\mathbb{Z}^d$ on a probability space $X$ and a nonnegative measurable function $f$ on $X$, the probability that the sequence of ergodic averages $$ \frac 1…

动力系统 · 数学 2016-08-22 Nikita Moriakov

We study the growth of typical groups from the family of $p$-groups of intermediate growth constructed by the second author. We find that, in the sense of category, a generic group exhibits oscillating growth with no universal upper bound.…

群论 · 数学 2013-05-03 Mustafa G. Benli , Rostislav Grigorchuk , Yaroslav Vorobets

Let S be an abelian semigroup, and A a finite subset of S. The sumset hA consists of all sums of h elements of A, with repetitions allowed. Let |hA| denote the cardinality of hA. Elementary lattice point arguments are used to prove that an…

数论 · 数学 2016-12-30 Melvyn B. Nathanson , Imre Z. Ruzsa

Furstenberg and Glasner proved that for an arbitrary k in N, any piecewise syndetic set contains k length arithmetic progression and such collection is also piecewise syndetic in Z: They used algebraic structure of beta N. The above result…

组合数学 · 数学 2019-08-12 Pintu Debnath , Sayan Goswami

We strengthen the maximal ergodic theorem for actions of groups of polynomial growth to a form involving jump quantity, which is the sharpest result among the family of variational or maximal ergodic theorems. As a consequence, we deduce in…

动力系统 · 数学 2026-01-14 Guixiang Hong , Wei Liu

We give overcrowding estimates for the Sine_beta process, the bulk point process limit of the Gaussian beta-ensemble. We show that the probability of having at least n points in a fixed interval is given by $e^{-\frac{\beta}{2} n^2…

概率论 · 数学 2015-06-24 Diane Holcomb , Benedek Valkó

We study the growth and isoperimetry of infinite clusters in slightly supercritical Bernoulli bond percolation on transitive nonamenable graphs under the $L^2$ boundedness condition ($p_c<p_{2\to 2}$). Surprisingly, we find that the volume…

概率论 · 数学 2022-07-08 Tom Hutchcroft

For fixed integers $b\geq k$, a problem of relevant interest in computer science and combinatorics is that of determining the asymptotic growth, with $n$, of the largest set for which a $(b, k)$-hash family of $n$ functions exists.…

组合数学 · 数学 2022-03-23 Stefano Della Fiore , Simone Costa , Marco Dalai

Using a theorem of J. Groves we give a ping-pong proof of Osin's uniform exponential growth for solvable groups. We discuss slow exponential growth and show that this phenomenon disappears as one passes to a finite index subgroup.

群论 · 数学 2007-05-23 Emmanuel Breuillard

We consider supercritical long-range percolation on transitive graphs of polynomial growth. In this model, any two vertices $x$ and $y$ of the underlying graph $G$ connect by a direct edge with probability $1-\exp(-\beta J(x,y))$, where…

概率论 · 数学 2026-01-13 Yago Moreno Alonso , Julia Komjathy

We show that an arbitrary nilprogression can be approximated by a proper coset nilprogression in upper-triangular form. This can be thought of as a nilpotent version of the Freiman-Bilu result that a generalised arithmetic progression can…

群论 · 数学 2018-11-07 Romain Tessera , Matthew Tointon

For stationary sequences, under general local and asymptotic dependence restrictions, any limiting point process for time normalized upcrossings of high levels is a compound Poisson process, i.e., there is a clustering of high upcrossings,…

This paper proves that in a non-elementary relatively hyperbolic group, the logarithm growth rate of any non-elementary subgroup has a linear lower bound by the logarithm of the size of the corresponding generating set. As a consequence,…

群论 · 数学 2021-03-18 Yu-miao Cui , Yue-ping Jiang , Wen-yuan Yang

Denote by $f_D(n)$ the maximum size of a set family $\mathcal{F}$ on $[n] \stackrel{\mbox{\normalfont\tiny def}}{=} \{1, \dots, n\}$ with distance set $D$. That is, $|A \bigtriangleup B| \in D$ holds for every pair of distinct sets $A, B…

组合数学 · 数学 2025-12-09 Zichao Dong , Jun Gao , Hong Liu , Minghui Ouyang , Qiang Zhou

Motivated by the classical Hilbert's Sixteenth Problem, we extend some main developments obtained for Hilbert's number in the polynomial setting to the piecewise polynomial context. Specifically, we study the growth of the maximum number of…

动力系统 · 数学 2026-01-30 Luana Ascoli , Douglas D. Novaes

The stable-regenerative multiple-stable model has been shown recently to have distinct candidate extremal index and extremal index. To understand further this rare phenomenon, two more results are established here for the double-stable…

概率论 · 数学 2024-10-10 Shuyang Bai , Rafał Kulik , Yizao Wang

H.Furstenberg and E.Glasner proved that for an arbitrary $k\in\mathbb{N}$, any piecewise syndetic set of integers contains a $k$-term arithmetic progression and the collection of such progressions is itself piecewise syndetic in…

组合数学 · 数学 2024-08-22 Dibyendu De , Pintu Debnath

Furstenberg and Glasner proved that for an arbitrary k in N, any piecewise syndetic set contains k term arithmetic progression and such collection is also piecewise syndetic in Z. They used algebraic structure of beta N. The above result…

组合数学 · 数学 2019-09-27 Sayan Goswami , Subhajit Jana
‹ 上一页 1 2 3 10 下一页 ›