asymptotic formulae
Recently Published Documents


TOTAL DOCUMENTS

304
(FIVE YEARS 26)

H-INDEX

23
(FIVE YEARS 1)

2022 ◽  
Vol 275 (1351) ◽  
Author(s):  
Athanassios Fokas ◽  
Jonatan Lenells

We present several formulae for the large t t asymptotics of the Riemann zeta function ζ ( s ) \zeta (s) , s = σ + i t s=\sigma +i t , 0 ≤ σ ≤ 1 0\leq \sigma \leq 1 , t > 0 t>0 , which are valid to all orders. A particular case of these results coincides with the classical results of Siegel. Using these formulae, we derive explicit representations for the sum ∑ a b n − s \sum _a^b n^{-s} for certain ranges of a a and b b . In addition, we present precise estimates relating this sum with the sum ∑ c d n s − 1 \sum _c^d n^{s-1} for certain ranges of a , b , c , d a, b, c, d . We also study a two-parameter generalization of the Riemann zeta function which we denote by Φ ( u , v , β ) \Phi (u,v,\beta ) , u ∈ C u\in \mathbb {C} , v ∈ C v\in \mathbb {C} , β ∈ R \beta \in \mathbb {R} . Generalizing the methodology used in the study of ζ ( s ) \zeta (s) , we derive asymptotic formulae for Φ ( u , v , β ) \Phi (u,v, \beta ) .


Author(s):  
Martin Lind

We consider an equidistributed concatenation sequence of pseudorandom rational numbers generated from the primes by an inversive congruential method. In particular, we determine the sharp convergence rate for the star discrepancy of said sequence. Our arguments are based on well-known discrepancy estimates for inversive congruential pseudorandom numbers together with asymptotic formulae involving prime numbers.


Author(s):  
Matthew Joseph Basso

Abstract Within the framework of likelihood-based statistical tests for particle physics measurements, we derive expressions for estimating the statistical significance of discovery using the asymptotic approximations of Wilks and Wald for four measurement models. These models include arbitrary numbers of signal regions, control regions, and Gaussian constraints. We extend our expressions to use the representative or "Asimov" dataset proposed by Cowan et al. such that they are made data-free. While many of the expressions are complicated and often involve solving systems of coupled, multivariate equations, we show these expressions reduce to closed-form results under simplifying assumptions. We also validate the predicted significances using toy-based data in select cases and show the asymptotic formulae to be more computationally efficient than the toy-based approach. Additionally, different parameters within each measurement model are varied in order to understand their effect on the predicted significance.


2021 ◽  
Vol 27 (3) ◽  
pp. 16-28
Author(s):  
V. Siva Rama Prasad ◽  
◽  
P. Anantha Reddy ◽  

Let \mathbb{N} denote the set of all positive integers and for j,n \in \mathbb{N}, let (j,n) denote their greatest common divisor. For any S\subseteq \mathbb{N}, we define P_{S}(n) to be the sum of those (j,n) \in S, where j \in \{1,2,3, \ldots, n\}. An asymptotic formula for the summatory function of P_{S}(n) is obtained in this paper which is applicable to a variety of sets S. Also the formula given by Bordellès for the summatory function of P_{\mathbb{N}}(n) can be derived from our result. Further, depending on the structure of S, the asymptotic formulae obtained from our theorem give better error terms than those deducible from a theorem of Bordellès (see Remark 4.4).


Author(s):  
Monica Feliksiak

We derive two asymptotic formulae, for the upper bound on the sum of the first n primes. Both the Supremum and the Estimate of the sum are superior to known bounds. The Estimate bound had been derived to promote the efficiency of estimation of the sum.


2021 ◽  
Vol vol. 23 no. 1 (Graph Theory) ◽  
Author(s):  
Éva Czabarka ◽  
Peter Dankelmann ◽  
Trevor Olsen ◽  
László A. Székely

Let $G$ be a a connected graph. The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices. We provide asymptotic formulae for the maximum Wiener index of simple triangulations and quadrangulations with given connectivity, as the order increases, and make conjectures for the extremal triangulations and quadrangulations based on computational evidence. If $\overline{\sigma}(v)$ denotes the arithmetic mean of the distances from $v$ to all other vertices of $G$, then the remoteness of $G$ is defined as the largest value of $\overline{\sigma}(v)$ over all vertices $v$ of $G$. We give sharp upper bounds on the remoteness of simple triangulations and quadrangulations of given order and connectivity.


2021 ◽  
pp. 1-16
Author(s):  
Alexander Dabrowski

A variational characterization for the shift of eigenvalues caused by a general type of perturbation is derived for second order self-adjoint elliptic differential operators. This result allows the direct extension of asymptotic formulae from simple eigenvalues to repeated ones. Some examples of particular interest are presented theoretically and numerically for the Laplacian operator for the following domain perturbations: excision of a small hole, local change of conductivity, small boundary deformation.


2021 ◽  
Vol 6 (11) ◽  
pp. 11723-11732
Author(s):  
Yanbo Song ◽  

<abstract><p>In this article, we study sums related to the Lehmer problem over short intervals, and give two asymptotic formulae for them. The original Lehmer problem is to count the numbers coprime to a prime such that the number and the its number theoretical inverse are in different parities in some intervals. The numbers which satisfy these conditions are called Lehmer numbers. It prompts a series of investigations, such as the investigation of the error term in the asymptotic formula. Many scholars investigate the generalized Lehmer problems and get a lot of results. We follow the trend of these investigations and generalize the Lehmer problem.</p></abstract>


Symmetry ◽  
2020 ◽  
Vol 12 (12) ◽  
pp. 2079
Author(s):  
Lei Liu ◽  
Zhefeng Xu

Let q>2 be a prime, p be a given prime with p<q. The main purpose of this paper is using transforms, the hybrid mean value of Dirichlet L-functions with character sums and the related properties of character sums to study the mean value of the general Dedekind sums over interval [1,qp), and give some interesting asymptotic formulae.


Sign in / Sign up

Export Citation Format

Share Document