Anna Dushistova
Let $ p_{i, n}, i=1,..., N(n)=2^{n-1} $ be the lengths of intervals between the neighboring fractions of Brocot sequence $ F_n $. We obtain an asymptotic formula for $σ_β(F_n)=\sum_{i=1}^{N(n)} p_{i, n}^β $,which improves known estimates.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We generalize the Farey-Brocot partition to a twodimensional continued fraction algorithm and generalized Farey-Brocot nets. We give an asymptotic formula for the moments of order β.
In this paper we obtain multifractal generalizations of classical results by Lévy and Khintchin in metrical Diophantine approximations and measure theory of continued fractions. We give a complete multifractal analysis for Stern--Brocot intervals, for continued fractions and for certain Diophantine growth rates. In particular, we give detailed discussions of two multifractal spectra closely related to the Farey map and the Gauss map.
Quasimodular Forms, Partitions, and Primes in Intervals
本文利用素数探测拟模形式的性质，证明素数无穷性，构造基于分拆的因式分解算法，并揭示系数分布与区间素数存在性的关联，同时推广至算术级数及Linnik问题。
Let $Σ_{2n}$ be the set of all partitions of the even integers from the interval $(4,2n], n>2,$ into two odd prime parts. We show that $\midΣ_{2n}\mid\sim 2n^2/\log^2{n}$ as $n\to\infty$. We also assume that a partition is selected uniformly at random from the set $Σ_{2n}$. Let $2X_n\in (4,2n]$ be the size of this partition. We prove a limit theorem which establishes that $X_n/n$ converges weakly to the maximum of two random variables which are independent copies of a uniformly distributed random variable in the interval $(0,1)$. Our method of proof is based on a classical Tauberian theorem du…
Lochs' theorem and its generalizations are conversion theorems that relate the number of digits determined in one expansion of a real number as a function of the number of digits given in some other expansion. In its original version, Lochs' theorem related decimal expansions with continued fraction expansions. Such conversion results can also be stated for sequences of interval partitions under suitable assumptions, with results holding almost everywhere, or in measure, involving the entropy. This is the viewpoint we develop here. In order to deal with sequences of partitions beyond positive …
Weighted partitions with interval restrictions: exact formulas and a bivariate master identity
本文通过引入辅助变量记录大于1的非强制部分个数，证明了Andrews和El Bachraoui提出的两个猜想，得到了带区间限制的加权划分函数的生成函数精确公式和系数范围。
The Three Gap Theorem states that for any $α\in (0,1)$ and any integer $N \geq 1$, the fractional parts of the sequence $0, α, 2α, \cdots, (N-1)α$ partition the unit interval into $N$ subintervals having at most \emph{three} distinct lengths. We here provide a new proof of this theorem using zippered rectangles, and present a new gaps theorem (along with two proofs) for sequences generated as orbits of general interval exchange transformations. We also derive a number of results on primitive points in lattices mirroring several properties of Farey fractions. This makes it possible to derive a …
Let $Σ_{2n}$ be the set of all partitions of the even integers from the interval $(4,2n], n>2,$ into two odd prime parts. We select a partition from the set $Σ_{2n}$ uniformly at random. Let $2G_n$ be the number partitioned by this selection. $2G_n$ is sometimes called a Goldbach number. In [6] we showed that $G_n/n$ converges weakly to the maximum $T$ of two random variables which are independent copies of a uniformly distributed random variable in the interval $(0,1)$. In this note we show that the mean and the variance of $G_n/n$ tend to the mean $μ_T=2/3$ and variance $σ_T^2=1/18$ of $T$, …
For many meta-Fibonacci sequences it is possible to identify a partition of the sequence into successive intervals (sometimes called blocks) with the property that the sequence behaves "similarly" in each block. This partition provides insights into the sequence properties. To date, for any given sequence, only ad hoc methods have been available to identify this partition. We apply a new concept - the spot-based generation sequence - to derive a general methodology for identifying this partition for a large class of meta-Fibonacci sequences. This class includes the Conolly and Conway sequences…
For the random interval partition of $[0,1]$ generated by the uniform stick-breaking scheme known as GEM$(1)$, let $u_k$ be the probability that the first $k$ intervals created by the stick-breaking scheme are also the first $k$ intervals to be discovered in a process of uniform random sampling of points from $[0,1]$. Then $u_k$ is a renewal sequence. We prove that $u_k$ is a rational linear combination of the real numbers $1, ζ(2), \ldots, ζ(k)$ where $ζ$ is the Riemann zeta function, and show that $u_k$ has limit $1/3$ as $k \to \infty$. Related results provide probabilistic interpretations …
For a Borel measure and a sequence of partitions on the unit interval, we define a multifractal spectrum based on coarse Holder regularity. Specifically, the coarse Holder regularity values attained by a given measure and with respect to a sequence of partitions generate a sequence of lengths (or rather, scales) which in turn define certain Dirichlet series, called the partition zeta functions. The abscissae of convergence of these functions define a multifractal spectrum whose concave envelope is the (geometric) Hausdorff multifractal spectrum which follows from a certain type of Moran constr…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。