中文
相关论文

相关论文: On uniform distribution modulo one

200 篇论文

We will investigate proof-theoretic and linguistic aspects of first-order linear logic. We will show that adding partial order constraints in such a way that each sequent defines a unique linear order on the antecedent formulas of a sequent…

计算机科学中的逻辑 · 计算机科学 2020-08-17 Richard Moot

By a classical result of Weyl, for any increasing sequence $(n_k)_{k \geq 1}$ of integers the sequence of fractional parts $(\{n_k x\})_{k \geq 1}$ is uniformly distributed modulo 1 for almost all $x \in [0,1]$. Except for a few special…

数论 · 数学 2013-07-26 Christoph Aistleitner

We prove that for a positive integer $k$ the primes in certain kinds of intervals can not distribute too 'uniformly' among the reduced residue classes modulo $k$. Hereby, we prove a generalization of a conjecture of Recaman and establish…

数论 · 数学 2016-02-16 Christian Elsholtz , Niclas Technau , Robert Tichy

In this paper we expound some basic ideas of proof theory for theories of ordinals such that there are many stable ordinals below the ordinals.

逻辑 · 数学 2011-04-12 Toshiyasu Arai

We prove uniform estimates for the expected value of averages of order statistics of matrices in terms of their largest entries. As an application, we obtain similar probabilistic estimates for $\ell_p$ norms via real interpolation.

概率论 · 数学 2018-10-02 Richard Lechner , Markus Passenbrunner , Joscha Prochno

We consider the joint distribution of real and imaginary parts of eigenvalues of random matrices with independent real entries with mean zero and unit variance. We prove the convergence of this distribution to the uniform distribution on…

概率论 · 数学 2007-05-23 F. Götze , A. Tikhomirov

We provide an elementary proof of the lower bound for the variance of continuous unimodal distributions and obtain analogous bounds for the higher order central moments. A lower bound for the rth central moment of discrete distribution is…

统计理论 · 数学 2016-02-16 R. Sharma , R. Bhandari , R. Saini

We solve an elementary number theory problem on sums of fractional parts, using methods from group theory. We apply our result to deduce the finiteness of certain monodromy representations.

数论 · 数学 2016-12-15 Eknath Ghate , T. N. Venkataramana

This paper describes a simple method for estimating lower bounds on the number of classes of equivalence for a special kind of integer sequences, called division sequences. The method is based on adding group structure to classes of…

组合数学 · 数学 2010-05-25 Natalia Vanetik

For a uniform process $\{ X_t: t\in E\}$ (by which $X_t $ is uniformly distributed on $(0,1)$ for $t\in E$) and a function $w(x)>0$ on $(0,1)$, we give a sufficient condition for the weak convergence of the empirical process based on $\{…

概率论 · 数学 2014-12-30 Yuping Yang

We examine an elementary problem on prime divisibility of binomial coefficients. Our problem is motivated by several related questions on alternating groups.

组合数学 · 数学 2017-10-24 John Shareshian , Russ Woodroofe

Let $\Omega(n)$ denote the number of prime factors of $n$. We show that for any bounded $f\colon\mathbb{N}\to\mathbb{C}$ one has \[ \frac{1}{N}\sum_{n=1}^N\, f(\Omega(n)+1)=\frac{1}{N}\sum_{n=1}^N\, f(\Omega(n))+\mathrm{o}_{N\to\infty}(1).…

数论 · 数学 2022-05-16 Florian K. Richter

We prove some extensions of Andrews inequality.

微分几何 · 数学 2020-11-02 Hao Fang , Biao Ma , Wei Wei

We study the persistence probabilities of a moving average process of order one with uniform innovations. We identify a number of regions, characterized by the location of the uniform distribution and the coupling parameter of the process,…

概率论 · 数学 2025-07-08 Frank Aurzada , Kilian Raschel

We provide elementary proof of several congruences involving single sum and multisums of binomial coefficients.

组合数学 · 数学 2017-09-22 Moa Apagodu

Using a probabilistic model, based on random walks on the additive group $\mathbb{Z}/m\mathbb{Z}$, we prove that the values of certain real character sums are uniformly distributed in residue classes modulo $m$.

数论 · 数学 2011-04-27 Youness Lamzouri , Alexandru Zaharescu

Based on Euclid's algorithm, we find a kind of special sequences which play an interesting role in the study of primes. We call them W Sequences. They not only ties up the distribution of primes in short interval but also enables us to give…

综合数学 · 数学 2009-09-15 Shaohua Zhang

Two conjectures are presented. The first, Conjecture 1, is that the pushforward of a geometric distribution on the integers under $n$ Collatz iterates, modulo $2^p$, is usefully close to uniform distribution on the integers modulo $2^p$, if…

概率论 · 数学 2024-04-22 Mary Rees

In this study, we aim to introduce the concept of a 1-absorbing prime submodule of an unital module over a commutative ring with a non-zero identity. Let M be an R-module and N be a proper submodule of M. For all non-unit elements a, b in R…

交换代数 · 数学 2020-07-03 Emel Aslankarayigit Ugurlu

The first-order model theory of modules has been studied for decades. More recently, the model theoretic study of nonelementary classes of modules--especially Abstract Elementary Classes of modules--has produced interesting results. This…

逻辑 · 数学 2025-07-21 Will Boney