Permutations with Restricted Cycle Structure and an Algorithmic Application

2002 ◽  
Vol 11 (5) ◽  
pp. 447-464 ◽  
Author(s):  
ROBERT BEALS ◽  
CHARLES R. LEEDHAM-GREEN ◽  
ALICE C. NIEMEYER ◽  
CHERYL E. PRAEGER ◽  
ÁKOS SERESS
Keyword(s):  
Asymptotic Formula ◽  
Symmetric Group ◽  
Gamma Function ◽  
Error Term ◽  
Black Box ◽  
Alternating Group ◽  
Difficult Case ◽  
Cycle Structure ◽  
Finite Symmetric Group

Let q be an integer with q [ges ] 2. We give a new proof of a result of Erdös and Turán determining the proportion of elements of the finite symmetric group Sn having no cycle of length a multiple of q. We then extend our methods to the more difficult case of obtaining the proportion of such elements in the finite alternating group An. In both cases, we derive an asymptotic formula with error term for the above mentioned proportion, which contains an unexpected occurrence of the Gamma-function.We apply these results to estimate the proportion of elements of order 2f in Sn, and of order 3f in An and Sn, where gcd(2, f) = 1, and gcd(3, f) = 1, respectively, and log f is polylogarithmic in n. We also give estimates for the probability that the fth power of such elements is a transposition or a 3-cycle, respectively. An algorithmic application of these results to computing in An or Sn, given as a black-box group with an order oracle, is discussed.

XLIX.—Generalizations of a Problem of Pillai

1949 ◽  
Vol 62 (4) ◽  
pp. 460-469
Author(s):  
L. Mirsky
Keyword(s):  
Asymptotic Formula ◽  
Error Term ◽  
Main Concern ◽  
Positive Integers ◽  
Infinite Set

I. Throughout this paper k1, …, k3 will denote s ≥ I fixed distinct positive integers. Some years ago Pillai (1936) found an asymptotic formula, with error term O(x/log x), for the number of positive integers n ≤ x such that n + k1, …, n + k3 are all square-free. I recently considered (Mirsky, 1947) the corresponding problem for r-free integers (i.e. integers not divisible by the rth power of any prime), and was able, in particular, to reduce the error term in Pillai's formula.Our present object is to discuss various generalizations and extensions of Pillai's problem. In all investigations below we shall be concerned with a set A of integers. This is any given, finite or infinite, set of integers greater than 1 and subject to certain additional restrictions which will be stated later. The elements of A will be called a-numbers, and the letter a will be reserved for them. A number which is not divisible by any a-number will be called A-free, and our main concern will be with the study of A-free numbers. Their additive properties have recently been investigated elsewhere (Mirsky, 1948), and some estimates obtained in that investigation will be quoted in the present paper.

ON A NEW CIRCLE PROBLEM

2016 ◽  
Vol 103 (2) ◽  
pp. 231-249
Author(s):  
JUN FURUYA ◽  
MAKOTO MINAMIDE ◽  
YOSHIO TANIGAWA
Keyword(s):  
Asymptotic Formula ◽  
Error Term ◽  
Dirichlet Character ◽  
Arithmetical Function ◽  
Circle Problem ◽  
The Riemann Zeta Function ◽  
Primitive Dirichlet Character ◽  
Riemann Zeta ◽  
The Mean ◽  
Voronoi Formula

We attempt to discuss a new circle problem. Let $\unicode[STIX]{x1D701}(s)$ denote the Riemann zeta-function $\sum _{n=1}^{\infty }n^{-s}$ ($\text{Re}\,s>1$) and $L(s,\unicode[STIX]{x1D712}_{4})$ the Dirichlet $L$-function $\sum _{n=1}^{\infty }\unicode[STIX]{x1D712}_{4}(n)n^{-s}$ ($\text{Re}\,s>1$) with the primitive Dirichlet character mod 4. We shall define an arithmetical function $R_{(1,1)}(n)$ by the coefficient of the Dirichlet series $\unicode[STIX]{x1D701}^{\prime }(s)L^{\prime }(s,\unicode[STIX]{x1D712}_{4})=\sum _{n=1}^{\infty }R_{(1,1)}(n)n^{-s}$$(\text{Re}\,s>1)$. This is an analogue of $r(n)/4=\sum _{d|n}\unicode[STIX]{x1D712}_{4}(d)$. In the circle problem, there are many researches of estimations and related topics on the error term in the asymptotic formula for $\sum _{n\leq x}r(n)$. As a new problem, we deduce a ‘truncated Voronoï formula’ for the error term in the asymptotic formula for $\sum _{n\leq x}R_{(1,1)}(n)$. As a direct application, we show the mean square for the error term in our new problem.

Asymptotic formula for sum of moment mean deviation for order statistics from uniform distribution

2019 ◽  
Vol 11 (02) ◽  
pp. 1950015
Author(s):  
Rafał Kapelko
Keyword(s):  
Positive Integer ◽  
Asymptotic Formula ◽  
Natural Number ◽  
Uniform Distribution ◽  
Gamma Function ◽  
Order Statistic ◽  
Unit Interval ◽  
Mobile Sensors ◽  
Mean Deviation ◽  
Current Location

Assume that [Formula: see text] mobile sensors are thrown uniformly and independently at random with the uniform distribution on the unit interval. We study the expected sum over all sensors [Formula: see text] from [Formula: see text] to [Formula: see text] where the contribution of the [Formula: see text] sensor is its displacement from the current location to the anchor equidistant point [Formula: see text] raised to the [Formula: see text] power, when [Formula: see text] is an odd natural number. As a consequence, we derive the following asymptotic identity. Fix [Formula: see text] positive integer. Let [Formula: see text] denote the [Formula: see text] order statistic from a random sample of size [Formula: see text] from the Uniform[Formula: see text] population. Then [Formula: see text] where [Formula: see text] is the Gamma function.

scholarly journals The asymptotic behaviour of the mean-square of fractional part sums

2000 ◽  
Vol 43 (2) ◽  
pp. 309-323 ◽  
Author(s):  
Manfred Kühleitner ◽  
Werner Georg Nowak
Keyword(s):  
Asymptotic Formula ◽  
Asymptotic Behaviour ◽  
Error Term ◽  
Fractional Part ◽  
Mean Square ◽  
The Mean

AbstractIn this article we consider sums S(t) = Σnψ (tf(n/t)), where ψ denotes, essentially, the fractional part minus ½ f is a C4-function with f″ non-vanishing, and summation is extended over an interval of order t. For the mean-square of S(t), an asymptotic formula is established. If f is algebraic this can be sharpened by the indication of an error term.

scholarly journals On the degrees of polynomial divisors over finite fields

2016 ◽  
Vol 161 (3) ◽  
pp. 469-487 ◽  
Author(s):  
ANDREAS WEINGARTNER
Keyword(s):  
Asymptotic Formula ◽  
Finite Field ◽  
Finite Fields ◽  
Cycle Structure

AbstractWe show that the proportion of polynomials of degree n over the finite field with q elements, which have a divisor of every degree below n, is given by cqn−1 + O(n−2). More generally, we give an asymptotic formula for the proportion of polynomials, whose set of degrees of divisors has no gaps of size greater than m. To that end, we first derive an improved estimate for the proportion of polynomials of degree n, all of whose non-constant divisors have degree greater than m. In the limit as q → ∞, these results coincide with corresponding estimates related to the cycle structure of permutations.

scholarly journals Densities in certain three-way prime number races

2020 ◽  
pp. 1-34
Author(s):  
Jiawei Lin ◽  
Greg Martin
Keyword(s):  
Asymptotic Formula ◽  
Prime Number ◽  
Error Term ◽  
Proof Technique ◽  
Real Numbers ◽  
Logarithmic Density ◽  
Mutual Independence ◽  
Error Terms ◽  
The Relationship

Abstract Let $a_1$ , $a_2$ , and $a_3$ be distinct reduced residues modulo q satisfying the congruences $a_1^2 \equiv a_2^2 \equiv a_3^2 \ (\mathrm{mod}\ q)$ . We conditionally derive an asymptotic formula, with an error term that has a power savings in q, for the logarithmic density of the set of real numbers x for which $\pi (x;q,a_1)> \pi (x;q,a_2) > \pi (x;q,a_3)$ . The relationship among the $a_i$ allows us to normalize the error terms for the $\pi (x;q,a_i)$ in an atypical way that creates mutual independence among their distributions, and also allows for a proof technique that uses only elementary tools from probability.

scholarly journals Remark on Smith’s result on a divisor problem in arithmetic progressions

1985 ◽  
Vol 98 ◽  
pp. 37-42 ◽  
Author(s):  
Kohji Matsumoto
Keyword(s):  
Asymptotic Formula ◽  
Error Term ◽  
Divisor Problem ◽  
Arithmetic Progressions ◽  
Euler Function

Let dk(n) be the number of the factorizations of n into k positive numbers. It is known that the following asymptotic formula holds: where r and q are co-prime integers with 0 < r < q, Pk is a polynomial of degree k − 1, φ(q) is the Euler function, and Δk(q; r) is the error term. (See Lavrik [3]).

A Class of Trinomials with Galois Group Sn

2012 ◽  
Vol 19 (spec01) ◽  
pp. 905-911 ◽  
Author(s):  
Anuj Bishnoi ◽  
Sudesh K. Khanduja
Keyword(s):  
Positive Integer ◽  
Symmetric Group ◽  
Galois Group ◽  
Rational Numbers ◽  
Alternating Group ◽  
Polynomial Formula

A well known result of Schur states that if n is a positive integer and a0, a1,…,an are arbitrary integers with a0an coprime to n!, then the polynomial [Formula: see text] is irreducible over the field ℚ of rational numbers. In case each ai = 1, it is known that the Galois group of fn(x) over ℚ contains An, the alternating group on n letters. In this paper, we extend this result to a larger class of polynomials fn(x) which leads to the construction of trinomials of degree n for each n with Galois group Sn, the symmetric group on n letters.

scholarly journals Estimates of convolutions of certain number-theoretic error terms

2004 ◽  
Vol 2004 (1) ◽  
pp. 1-23 ◽  
Author(s):  
Aleksandar Ivic
Keyword(s):  
Asymptotic Formula ◽  
Error Term ◽  
Abelian Groups ◽  
Divisor Problem ◽  
Dirichlet Divisor Problem ◽  
Error Terms ◽  
Convolution Function

Several estimates for the convolution functionC [f(x)]:=∫1xf(y) f(x/y)(dy/y)and its iterates are obtained whenf(x)is a suitable number-theoretic error term. We deal with the case of the asymptotic formula for∫0T|ζ(1/2+it)|2kdt(k=1,2), the general Dirichlet divisor problem, the problem of nonisomorphic Abelian groups of given order, and the Rankin-Selberg convolution.

scholarly journals A Note on Cube-Full Numbers in Arithmetic Progression

2021 ◽  
Vol 2021 ◽  
pp. 1-22
Author(s):  
Mingxuan Zhong ◽  
Yuankui Ma
Keyword(s):  
Asymptotic Formula ◽  
Arithmetic Progression ◽  
Error Term ◽  
Exponential Sum

We obtain an asymptotic formula for the cube-full numbers in an arithmetic progression n ≡ l mod   q , where q , l = 1 . By extending the construction derived from Dirichlet’s hyperbola method and relying on Kloosterman-type exponential sum method, we improve the very recent error term with x 118 / 4029 < q .

Sign in / Sign up

Export Citation Format

Share Document