RIEMANN ZETA ZEROS AND PRIME NUMBER SPECTRA IN QUANTUM FIELD THEORY

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

An Invitation to Additive Prime Number Theory

2000 Mathematics Subject Classification: 11D75, 11D85, 11L20, 11N05, 11N35, 11N36, 11P05, 11P32, 11P55.

On some Extremal Problems of Landau

2000 Mathematics Subject Classification: Primary: 42A05. Secondary: 42A82, 11N05.

On the local Tamagawa number conjecture for Tate motives

There is a wonderful conjecture of Bloch and Kato that generalizes both the analytic Class Number Formula and the Birch and Swinnerton-Dyer conjecture. The conjecture itself was generalized by Fukaya and Kato to an equivariant formulation. In this thesis, I provide a new proof for the equivariant local Tamagawa number conjecture in the case of Tate motives for unramified fields, using Iwasawa theory and (φ,Γ)-modules, and provide some work towards extending the proof to tamely ramified fields.

Number of phase levels of a Talbot array illuminator

The number of phase levels of a Talbot array illuminator is an important factor in the estimation of practical fabrication complexity and cost. We show that the number it) of phase levels of a Talbot array illuminator has a simple relationship to the prime number. When there is an alternative pi -phase modulation in the output array, the relations are similar. (C) 2001 Optical Society of America OCIS codes: 070.6760, 050.1950, 050.1980.

Irrégularités dans la distribution des nombres premiers et des suites plus générales dans les progressions arithmétiques

Le sujet principal de cette thèse est la distribution des nombres premiers dans les progressions arithmétiques, c'est-à-dire des nombres premiers de la forme $qn+a$, avec $a$ et $q$ des entiers fixés et $n=1,2,3,\dots$ La thèse porte aussi sur la comparaison de différentes suites arithmétiques par rapport à leur comportement dans les progressions arithmétiques. Elle est divisée en quatre chapitres et contient trois articles. Le premier chapitre est une invitation à la théorie analytique des nombres, suivie d'une revue des outils qui seront utilisés plus tard. Cette introduction comporte aussi certains résultats de recherche, que nous avons cru bon d'inclure au fil du texte. Le deuxième chapitre contient l'article \emph{Inequities in the Shanks-Rényi prime number race: an asymptotic formula for the densities}, qui est le fruit de recherche conjointe avec le professeur Greg Martin. Le but de cet article est d'étudier un phénomène appelé le <>, qui s'observe dans les <>. Chebyshev a observé qu'il semble y avoir plus de premiers de la forme $4n+3$ que de la forme $4n+1$. De manière plus générale, Rubinstein et Sarnak ont montré l'existence d'une quantité $\delta(q;a,b)$, qui désigne la probabilité d'avoir plus de premiers de la forme $qn+a$ que de la forme $qn+b$. Dans cet article nous prouvons une formule asymptotique pour $\delta(q;a,b)$ qui peut être d'un ordre de précision arbitraire (en terme de puissance négative de $q$). Nous présentons aussi des résultats numériques qui supportent nos formules. Le troisième chapitre contient l'article \emph{Residue classes containing an unexpected number of primes}. Le but est de fixer un entier $a\neq 0$ et ensuite d'étudier la répartition des premiers de la forme $qn+a$, en moyenne sur $q$. Nous montrons que l'entier $a$ fixé au départ a une grande influence sur cette répartition, et qu'il existe en fait certaines progressions arithmétiques contenant moins de premiers que d'autres. Ce phénomène est plutôt surprenant, compte tenu du théorème des premiers dans les progressions arithmétiques qui stipule que les premiers sont équidistribués dans les classes d'équivalence $\bmod q$. Le quatrième chapitre contient l'article \emph{The influence of the first term of an arithmetic progression}. Dans cet article on s'intéresse à des irrégularités similaires à celles observées au troisième chapitre, mais pour des suites arithmétiques plus générales. En effet, nous étudions des suites telles que les entiers s'exprimant comme la somme de deux carrés, les valeurs d'une forme quadratique binaire, les $k$-tuplets de premiers et les entiers sans petit facteur premier. Nous démontrons que dans chacun de ces exemples, ainsi que dans une grande classe de suites arithmétiques, il existe des irrégularités dans les progressions arithmétiques $a\bmod q$, avec $a$ fixé et en moyenne sur $q$.

ON THE MINIMUM ABSOLUTE VALUE of THE DISCRIMINANT of ABELIAN FIELDS of DEGREE p(2)

Let p be a prime number. A formula for the minimum absolute value of the discriminant of all Abelian extensions of Q of degree p(2) is given in terms of p.

Jacobi quartic curves revisited

This paper provides new results about efficient arithmetic on Jacobi quartic form elliptic curves, y 2 = d x 4 + 2 a x 2 + 1. With recent bandwidth-efficient proposals, the arithmetic on Jacobi quartic curves became solidly faster than that of Weierstrass curves. These proposals use up to 7 coordinates to represent a single point. However, fast scalar multiplication algorithms based on windowing techniques, precompute and store several points which require more space than what it takes with 3 coordinates. Also note that some of these proposals require d = 1 for full speed. Unfortunately, elliptic curves having 2-times-a-prime number of points, cannot be written in Jacobi quartic form if d = 1. Even worse the contemporary formulae may fail to output correct coordinates for some inputs. This paper provides improved speeds using fewer coordinates without causing the above mentioned problems. For instance, our proposed point doubling algorithm takes only 2 multiplications, 5 squarings, and no multiplication with curve constants when d is arbitrary and a = ±1/2.

A Flat Concurrent Prolog compiler for PARAM

We describe a compiler for the Flat Concurrent Prolog language on a message passing multiprocessor architecture. This compiler permits symbolic and declarative programming in the syntax of Guarded Horn Rules, The implementation has been verified and tested on the 64-node PARAM parallel computer developed by C-DAC (Centre for the Development of Advanced Computing, India), Flat Concurrent Prolog (FCP) is a logic programming language designed for concurrent programming and parallel execution, It is a process oriented language, which embodies dataflow synchronization and guarded-command as its basic control mechanisms. An identical algorithm is executed on every processor in the network, We assume regular network topologies like mesh, ring, etc, Each node has a local memory, The algorithm comprises of two important parts: reduction and communication, The most difficult task is to integrate the solutions of problems that arise in the implementation in a coherent and efficient manner. We have tested the efficacy of the compiler on various benchmark problems of the ICOT project that have been reported in the recent book by Evan Tick, These problems include Quicksort, 8-queens, and Prime Number Generation, The results of the preliminary tests are favourable, We are currently examining issues like indexing and load balancing to further optimize our compiler.

Cubic Sieve Congruence of the Discrete Logarithm Problem, and fractional part sequences

The Cubic Sieve Method for solving the Discrete Logarithm Problem in prime fields requires a nontrivial solution to the Cubic Sieve Congruence (CSC) x(3) equivalent to y(2)z (mod p), where p is a given prime number. A nontrivial solution must also satisfy x(3) not equal y(2)z and 1 <= x, y, z < p(alpha), where alpha is a given real number such that 1/3 < alpha <= 1/2. The CSC problem is to find an efficient algorithm to obtain a nontrivial solution to CSC. CSC can be parametrized as x equivalent to v(2)z (mod p) and y equivalent to v(3)z (mod p). In this paper, we give a deterministic polynomial-time (O(ln(3) p) bit-operations) algorithm to determine, for a given v, a nontrivial solution to CSC, if one exists. Previously it took (O) over tilde (p(alpha)) time in the worst case to determine this. We relate the CSC problem to the gap problem of fractional part sequences, where we need to determine the non-negative integers N satisfying the fractional part inequality {theta N} < phi (theta and phi are given real numbers). The correspondence between the CSC problem and the gap problem is that determining the parameter z in the former problem corresponds to determining N in the latter problem. We also show in the alpha = 1/2 case of CSC that for a certain class of primes the CSC problem can be solved deterministically in <(O)over tilde>(p(1/3)) time compared to the previous best of (O) over tilde (p(1/2)). It is empirically observed that about one out of three primes is covered by the above class. (C) 2013 Elsevier B.V. All rights reserved.

Symmetry of the Talbot effect and its applications

The Talbot effect is one of the most basic optical phenomena that has received extensive investigations both because its new results provide us more understanding of the fundamental Fresnel diffraction and also because of its wide applications. We summarize our recent results on this subject. Symmetry of the Talbot effect, which was reported in Optics Communications in 1995, is now realized as the key to reveal other rules for explanation of the Talbot effect for array illumination. The regularly rearranged-neighboring-phase-differences (RRNPD) rule, a completely new set of analytic phase equations (Applied Optics, 1999), and the prime-number decomposing rule (Applied Optics, 2001) are the newly obtained results that reflect the symmetry of the Talbot effect in essence. We also reported our results on the applications of the Talbot effect. Talbot phase codes are the orthogonal codes that can be used for phase coding of holographic storage. A new optical scanner based on the phase codes for Talbot array illumination has unique advantages. Furthermore, a novel two-layered multifunctional computer-generated hologram based on the fractional Talbot effect was proposed and implemented (Optics Letters, 2003). We believe that these new results should bring us more new understanding of the Talbot effect and help us to design novel optical devices that should benefit practical applications. (C) 2004 Society of Photo-Optical Instrumentation Engineers.

Microoptical research in Shanghai Institute of Optics and Fine Mechanics

This paper summarized the recent research results of Changhe Zhou's group of Information Optics Lab in Shanghai Institute of Optics and Fine Mechanics (SIOM). The first is about the Talbot self-imaging research. We have found the symmetry rule, the regular-rearranged neighboring phase difference rule and the prime-number decamping rule, which is briefly summarized in a recent educational publication of Optics and Photonics News, pp.46-50, November 2004. The second is about four novel microoptical gratings designed and fabricated in SIOM. The third is about the design and fabrication of novel supperresolution phase plates for beam shaping and possible use in optical storage. The fourth is to develop novel femtosecond laser information processing techniques by incorporating microoptical elements, for example, use of a pair of reflective Dammann gratings for splitting the femtosecond laser pulses. The most attractive feature of this approach is that the conventional beam splitter is avoided. The conventional beam splitter would introduce the unequal dispersion due to the broadband spectrum of ultrashort laser pulses, which will affect the splitting result. We implemented the Dammann splitting apparatus by using two-layered reflective Dammann gratings, which generates the almost same array without angular dispersion. We believe that our device is highly interesting for splitting femtosecond laser pulses.

基于素数序列的Java哈希表性能优化

分析了Java哈希表的实现特点并给出了导致其性能恶化的一种数据模式.针对这种数据模式的特点,提出了基于素数序列的哈希表优化方法,从而几乎完全避免了该模式下哈希表的性能恶化.实验与理论结果表明:对提出的模式数据,优化方法产生的Hash碰撞比JDK中的方法下降接近100%,而且对随机数据下的Java哈希表性能也有改善.

心算年老化的认知心理机制及功能磁共振成像研究

Mechanisms underlying cognitive psychology and cerebral physiological of mental arithmetic with increasing are were studied by using behavioral methods and functional magnetic resonance imaging (fMRI). I. Studies on mechanism underlying cognitive psychology of mental arithmetic with increasing age These studies were accomplished in 172 normal subjects ranging from 20 to 79 years of age with above 12 years of education (Mean = 1.51, SD = 1.5). Five mental arithmetic tasks, "1000-1", "1000-3", "1000-7", "1000-13", "1000-17", were designed with a serial calculation in which subjects sequentially subtracted the same prime number (1, 3, 7, 13, 17) from another number 1000. The variables studied were mental arithmetic, age, working memory, and sensory-motor speed, and four studies were conducted: (1) Aging process of mental arithmetic with different difficulties, (2) mechanism of aging of mental arithmetic processing. (3) effects of working memory and sensory-motor speed on aging process of mental arithmetic, (4) model of cognitive aging of mental arithmetic, with statistical methods such as MANOVA, hierarchical multiple regression, stepwise regression analysis, structural equation modelling (SEM). The results were indicated as following: Study 1: There was an obvious interaction between age and mental arithmetic, in which reaction time (RT) increased with advancing age and more difficult mental arithmetic, and mental arithmetic efficiency (the ratio of accuracy to RT) deceased with advancing age and more difficult mental arithmetic; Mental arithmetic efficiency with different difficulties decreased in power function: Study 2: There were two mediators (latent variables) in aging process of mental arithmetic, and age had an effect on mental arithmetic with different difficulties through the two mediators; Study 3: There were obvious interactions between age and working memory, working memory and mental arithmetic; Working memory and sensory-motor speed had effects on aging process of mental arithmetic, in which the effect of working memory on aging process of mental arithmetic was about 30-50%, and the effect of sensory-motor speed on aging process of mental arithmetic was above 35%. Study 4: Age, working memory, and sensory-motor speed had effects on two latent variables (factor 1 and factor 2), then had effects on mental arithmetic with different difficulties through factor 1 which was relative to memory component, and factor 2 which relative to speed component and had an effect on factor 1 significantly. II. Functional magnetic resonance imaging study on metal arithmetic with increasing age This study was accomplished in 14 normal right-handed subjects ranging from 20 to 29 (7 subjects) and 60 to 69 (7 subjects) years of age by using functional magnetic resonance imaging apparatus, a superconductive Signa Horizon 1.5T MRI system. Two mental arithmetic tasks, "1000-3" and "1000-17", were designed with a serial calculation in which subjects sequentially subtracted the same prime number (3 or 17) from another number 1000 silently, and controlling task, "1000-0", in which subjects continually rehearsed number 1000 silently, was regarded as baseline, based on current "baseline-task" OFF-ON subtraction pattern. Original data collected by fMRI apparatus, were analyzed off-line in SUN SPARC working station by using current STIMULATE software. The analytical steps were composed of within-subject analysis, in which brain activated images about mental arithmetic with two difficulties were obtained by using t-test, and between-subject analysis, in which features of brain activation about mental arithmetic with two difficulties, the relationship between left and right hemisphere during mental arithmetic, and age differences of brain activation in young and elderly adults were examined by using non-parameter Wilcoxon test. The results were as following: