中文
相关论文

相关论文: Quasirandom Arithmetic Permutations

200 篇论文

Chung and Graham define quasirandom subsets of $\mathbb{Z}_n$ to be those with any one of a large collection of equivalent random-like properties. We weaken their definition and call a subset of $\mathbb{Z}_n$ $\epsilon$-balanced if its…

组合数学 · 数学 2007-05-23 Joshua N. Cooper

A sequence $\pi_1,\pi_2,\dots$ of permutations is said to be "quasirandom" if the induced density of every permutation $\sigma$ in $\pi_n$ converges to $1/|\sigma|!$ as $n\to\infty$. We prove that $\pi_1,\pi_2,\dots$ is quasirandom if and…

组合数学 · 数学 2024-10-07 Gabriel Crudele , Peter Dukes , Jonathan A. Noel

The theory of quasirandomness has greatly expanded from its inaugural graph theoretical setting to several different combinatorial objects such as hypergraphs, tournaments, permutations, etc. However, these quasirandomness variants have…

组合数学 · 数学 2020-12-23 Leonardo N. Coregliano , Alexander A. Razborov

We introduce a new, elementary method for studying random differences in arithmetic progressions and convergence phenomena along random sequences of integers. We apply our method to obtain significant improvements on previously known…

组合数学 · 数学 2014-05-07 Nikos Frantzikinakis , Emmanuel Lesigne , Máté Wierdl

We introduce a permutation analogue of the celebrated Szemeredi Regularity Lemma, and derive a number of consequences. This tool allows us to provide a structural description of permutations which avoid a specified pattern, a result that…

组合数学 · 数学 2007-05-23 Joshua N. Cooper

We introduce the quasi-ordinarization transform of a numerical semigroup. This transform will allow to organize all the semigroups of a given genus in a forest rooted at all quasi-ordinary semigroups with the given genus. This construction…

We use the theory of graph limits to study several quasi-random properties, mainly dealing with various versions of hereditary subgraph counts. The main idea is to transfer the properties of (sequences of) graphs to properties of graphons,…

组合数学 · 数学 2009-05-21 Svante Janson

This paper investigates the quadratic irrationals that arise as periodic points of the Gauss type shift associated to the odd continued fraction expansion. It is shown that these numbers, which we call O-reduced, when ordered by the length…

数论 · 数学 2022-03-03 Maria Siskaki

The well known Erdos-Turan law states that the logarithm of an order of a random permutation is asymptotically normally distributed. The aim of this work is to estimate convergence rate in this theorem and also to prove analogous result for…

组合数学 · 数学 2009-01-14 Vytas Zacharovas

We show, in a formal way, how a class of complex quasiprobability distribution functions may be introduced by using the fractional Fourier transform. This leads to the Fresnel transform of a characteristic function instead of the usual…

量子物理 · 物理学 2019-02-19 Jorge A. Anaya-Contreras , A. Zúñiga-Segundo , Héctor M. Moya-Cessa

The theory of quasi-arithmetic means is a powerful tool in the study of covariance functions across space-time. In the present study we use quasi-arithmetic functionals to make inferences about the permissibility of averages of functions…

概率论 · 数学 2007-06-13 E. Porcu , J. Mateu , G. Christakos

For permutations P and T of lengths |P|\le|T|, let t(P,T) be the probability that the restriction of T to a random |P|-point set is (order) isomorphic to P. We show that every sequence \{T_j\} of permutations such that |T_j|\to\infty and…

组合数学 · 数学 2013-01-22 Daniel Král' , Oleg Pikhurko

We consider two related problems arising from a question of R. Graham on quasirandom phenomena in permutation patterns. A ``pattern'' in a permutation $\sigma$ is the order type of the restriction of $\sigma : [n] \to [n]$ to a subset $S…

组合数学 · 数学 2008-01-29 Joshua Cooper , Andrew Petrarca

Pseudorandmness plays an important role in number theory, complexity theory and cryptography. Our aim is to use models of arithmetic to explain pseudorandomness by randomness. To this end we construct a set of models $\cal M$, a common…

逻辑 · 数学 2012-10-18 Pavel Pudlak

Quasirandomness is a general mathematical concept meant to encapsulate several characteristics usually satisfied by random combinatorial objects, and which we regard as describing when a given object 'looks random'. In this survey we…

组合数学 · 数学 2021-07-06 Davi Castro-Silva

We construct an absolutely normal number whose continued fraction expansion is normal in the sense that it contains all finite patterns of partial quotients with the expected asymptotic frequency as given by the Gauss-Kuzmin measure. The…

数论 · 数学 2017-01-30 Adrian-Maria Scheerer

Assuming a $q$-variant of the prime $k$-tuple conjecture uniformly, we compute mixed moments of the number of primes in disjoint short intervals and progressions, respectively. This involves estimating the mean of singular series along…

数论 · 数学 2024-11-26 Sun-Kai Leung

We develop the Perron-Frobenius theory using a variational approach and extend it to a set of arbitrary matrices, including those that are neither irreducible nor essentially positive, and non-preserved cones. We introduce a new concept…

偏微分方程分析 · 数学 2024-07-19 Yavdat Il'yasov , Nurmukhamet Valeev

A combinatorial object is said to be quasirandom if it exhibits certain properties that are typically seen in a truly random object of the same kind. It is known that a permutation is quasirandom if and only if the pattern density of each…

组合数学 · 数学 2024-07-10 Daniel Kráľ , Jae-baek Lee , Jonathan A. Noel

Complex extension of quantum mechanics and the discovery of pseudo-unitarily invariant random matrix theory has set the stage for a number of applications of these concepts in physics. We briefly review the basic ideas and present…

量子物理 · 物理学 2013-02-13 Shashi. C. L. Srivastava , S. R. Jain
‹ 上一页 1 2 3 10 下一页 ›