Displaying 121 – 140 of 1526

Showing per page

S-expansions in dimension two

Bernhard Schratzberger (2004)

Journal de Théorie des Nombres de Bordeaux

The technique of singularization was developped by C. Kraaikamp during the nineties, in connection with his work on dynamical systems related to continued fraction algorithms and their diophantine approximation properties. We generalize this technique from one into two dimensions. We apply the method to the the two dimensional Brun’s algorithm. We discuss, how this technique, and related ones, can be used to transfer certain metrical and diophantine properties from one algorithm to the others. In...

S-extremal strongly modular lattices

Gabriele Nebe, Kristina Schindelar (2007)

Journal de Théorie des Nombres de Bordeaux

S-extremal strongly modular lattices maximize the minimum of the lattice and its shadow simultaneously. They are a direct generalization of the s-extremal unimodular lattices defined in [6]. If the minimum of the lattice is even, then the dimension of an s-extremal lattices can be bounded by the theory of modular forms. This shows that such lattices are also extremal and that there are only finitely many s-extremal strongly modular lattices of even minimum.

Sharp bounds for the intersection of nodal lines with certain curves

Junehyuk Jung (2014)

Journal of the European Mathematical Society

Let Y be a hyperbolic surface and let φ be a Laplacian eigenfunction having eigenvalue - 1 / 4 - τ 2 with τ > 0 . Let N ( φ ) be the set of nodal lines of φ . For a fixed analytic curve γ of finite length, we study the number of intersections between N ( φ ) and γ in terms of τ . When Y is compact and γ a geodesic circle, or when Y has finite volume and γ is a closed horocycle, we prove that γ is “good” in the sense of [TZ]. As a result, we obtain that the number of intersections between N ( φ ) and γ is O ( τ ) . This bound is sharp.

Sharp large deviations for Gaussian quadratic forms with applications

Bernard Bercu, Fabrice Gamboa, Marc Lavielle (2010)

ESAIM: Probability and Statistics

Under regularity assumptions, we establish a sharp large deviation principle for Hermitian quadratic forms of stationary Gaussian processes. Our result is similar to the well-known Bahadur-Rao theorem [2] on the sample mean. We also provide several examples of application such as the sharp large deviation properties of the Neyman-Pearson likelihood ratio test, of the sum of squares, of the Yule-Walker estimator of the parameter of a stable autoregressive Gaussian process, and finally of the empirical...

Sharper ABC-based bounds for congruent polynomials

Daniel J. Bernstein (2005)

Journal de Théorie des Nombres de Bordeaux

Agrawal, Kayal, and Saxena recently introduced a new method of proving that an integer is prime. The speed of the Agrawal-Kayal-Saxena method depends on proven lower bounds for the size of the multiplicative semigroup generated by several polynomials modulo another polynomial h . Voloch pointed out an application of the Stothers-Mason ABC theorem in this context: under mild assumptions, distinct polynomials A , B , C of degree at most 1 . 2 deg h - 0 . 2 deg rad A B C cannot all be congruent modulo h . This paper presents two improvements...

Shifted values of the largest prime factor function and its average value in short intervals

Jean-Marie De Koninck, Imre Kátai (2016)

Colloquium Mathematicae

We obtain estimates for the average value of the largest prime factor P(n) in short intervals [x,x+y] and of h(P(n)+1), where h is a complex-valued additive function or multiplicative function satisfying certain conditions. Letting s q ( n ) stand for the sum of the digits of n in base q ≥ 2, we show that if α is an irrational number, then the sequence ( α s q ( P ( n ) ) ) n is uniformly distributed modulo 1.

Currently displaying 121 – 140 of 1526