Results 1 
4 of
4
Some studies on arithmetical chaos in classical and quantum mechanics
 Internat. J. Modern Phys
, 1993
"... Several aspects of classical and quantum mechanics applied to a class of strongly chaotic systems are studied. The latter consists of single particles moving without external forces on surfaces of constant negative Gaussian curvature whose corresponding fundamental groups are supplied with an arithm ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Several aspects of classical and quantum mechanics applied to a class of strongly chaotic systems are studied. The latter consists of single particles moving without external forces on surfaces of constant negative Gaussian curvature whose corresponding fundamental groups are supplied with an arithmetic structure. It is shown that the arithmetical features of the considered systems lead to exceptional properties of the corresponding spectra of lengths of closed geodesics (periodic orbits). The most significant one is an exponential growth of degeneracies in these geodesic length spectra. Furthermore, the arithmetical systems are distinguished by a structure that appears as a generalization of geometric symmetries. These pseudosymmetries occur in the quantization of the classical arithmetic systems as Hecke operators, which form an infinite algebra of selfadjoint operators commuting with the Hamiltonian. The statistical properties of quantum energies in the arithmetical systems have previously been identified as exceptional. They do not fit into the general scheme of random matrix theory. It is shown with the help of a simplified model for the spectral form factor
On elementary proofs of the Prime Number Theorem for arithmetic progressions, without characters.
, 1993
"... : We consider what one can prove about the distribution of prime numbers in arithmetic progressions, using only Selberg's formula. In particular, for any given positive integer q, we prove that either the Prime Number Theorem for arithmetic progressions, modulo q, does hold, or that there exists a s ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
: We consider what one can prove about the distribution of prime numbers in arithmetic progressions, using only Selberg's formula. In particular, for any given positive integer q, we prove that either the Prime Number Theorem for arithmetic progressions, modulo q, does hold, or that there exists a subgroup H of the reduced residue system, modulo q, which contains the squares, such that `(x; q; a) ¸ 2x=OE(q) for each a 62 H and `(x; q; a) = o(x=OE(q)), otherwise. From here, we deduce that if the second case holds at all, then it holds only for the multiples of some fixed integer q 0 ? 1. Actually, even if the Prime Number Theorem for arithmetic progressions, modulo q, does hold, these methods allow us to deduce the behaviour of a possible `Siegel zero' from Selberg's formula. We also propose a new method for determining explicit upper and lower bounds on `(x; q; a), which uses only elementary number theoretic computations. 1. Introduction. Define `(x) = P px log p, where p only denot...
Asymptotic Density in Combined Number Systems
"... Abstract. Necessary and sufficient conditions are found for a combination of additive number systems and a combination of multiplicative number systems to preserve the property that all partition sets have asymptotic density. These results cover and extend several special cases mentioned in the lite ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. Necessary and sufficient conditions are found for a combination of additive number systems and a combination of multiplicative number systems to preserve the property that all partition sets have asymptotic density. These results cover and extend several special cases mentioned in the literature and give partial solutions to two problems in [6].
unknown title
, 709
"... Let ω(l) = ∑ pl 1 and m, n ∈ N, n ≥ m. We calculate a formula {p ∈ P; p  () ..."
Abstract
 Add to MetaCart
Let ω(l) = ∑ pl 1 and m, n ∈ N, n ≥ m. We calculate a formula {p ∈ P; p  ()