Chebotarev density theorem in short intervals for extensions of 𝔽_{𝕢}(𝕋)

Dynamic Bayesian networks (DBNs) are compact graphical representations used to model probabilistic systems where interdependent random variables and their distributions evolve over time. In this paper, we study the verification of the evolution of conditional-independence (CI) propositions against temporal logic specifications. To this end, we consider two specification formalisms over CI propositions: linear temporal logic (LTL), and non-deterministic Büchi automata (NBAs). This problem has two variants. Stochastic CI properties take the given concrete probability distributions into account, while structural CI properties are viewed purely in terms of the graphical structure of the DBN. We show that deciding whether a stochastic CI proposition eventually holds is at least as hard as the Skolem problem for linear recurrence sequences, which is a long-standing open problem in number theory. On the other hand, we show that verifying the evolution of structural CI propositions against LTL and NBA specifications is in PSPACE, and is hard for both NP and coNP. We also identify natural restrictions on the graphical structure of the DBN that make the verification of structural CI properties tractable.

Let K be a number field. For which primes p does there exist an elliptic curve $E / K$ admitting a K-rational p-isogeny? Although we have an answer to this question over the rationals, extending this to other number fields is a fundamental open problem in number theory. In this paper, we study this question in the case that K is a quadratic field, subject to the assumption that E is semistable at the primes of K above p. We prove results both for families of quadratic fields and for specific quadratic fields.

In this paper, we survey the status of attacks on the ring and polynomial learning with errors problems (RLWE and PLWE). Recent work on the security of these problems [Eisentr\"ager-Hallgren-Lauter, Elias-Lauter-Ozman-Stange] gives rise to interesting questions about number fields. We extend these attacks and survey related open problems in number theory, including spectral distortion of an algebraic number and its relationship to Mahler measure, the monogenic property for the ring of integers of a number field, and the size of elements of small order modulo q.

Schanuel’s conjecture states that the transcendence degree over ℚ of the 2n-tuple (λ 1 ,⋯,λ n ,e λ 1 ,⋯,e λ n ) is at least n for all λ 1 ,⋯,λ n ∈ℂ which are linearly independent over ℚ; if true it would settle a great number of elementary open problems in number theory, among which the transcendence of e over π.

Landau's theorem asserts that the asymptotic density of sums of two squares in the interval $1\leq n\leq x$ is $K/{\sqrt{\log x}}$, where $K$ is the Landau-Ramanujan constant. It is an old problem in number theory whether the asymptotic density remains the same in intervals $|n-x|\leq x^{\epsilon}$ for a fixed $\epsilon$ and $x\to\infty$. This work resolves a function field analogue of this problem, in the limit of a large finite field. More precisely, consider monic $f_0\in\Bbb{F}_q[T]$ of degree $n$ and take $\epsilon$ with $1>\epsilon\geq {2\over n}$. Then the asymptotic density of polynomials $f$ in the "interval" $\deg(f-f_0)\leq\epsilon n$ that are of the form $f=A^2+TB^2$, $A,B\in\Bbb{F}_q[T]$ is ${1\over 4^n}\big(\matrix{2n\atop n}\big)$ as $q\to\infty$. This density agrees with the asymptotic density of such monic $f$'s of degree $n$ as $q\to\infty$, as was shown by the second author, Smilanski, and Wolf. A key point in the proof is the calculation of the Galois group of $f(-T^2)$, where $f$ is a polynomial of degree $n$ with a few variable coefficients: The Galois group is the hyperoctahedral group of order $2^nn!$.

In this expository paper we sketch some interrelations between several famous conjectures in number theory and algebraic geometry that have intrigued mathematicians for a long period of time. Starting from Fermat's Last Theorem one is naturally led to intro duce L-functions, the main motivation being the calculation of class numbers. In particular, Kummer showed that the class numbers of cyclotomic fields playa decisive role in the corroboration of Fermat's Last Theorem for a large class of exponents. Before Kummer, Dirich let had already successfully applied his L-functions to the proof of the theorem on arithmetic progressions. Another prominent appearance of an L-function is Riemann's paper where the now famous Riemann Hypothesis was stated. In short, nineteenth century number theory showed that much, if not all, of number theory is reflected by proper ties of L-functions. Twentieth century number theory, class field theory and algebraic geometry only strengthen the nineteenth century number theorists's view. We just mention the work of E. Heeke, E. Artin, A. Weil and A. Grothendieck with his collaborators. Heeke generalized Dirichlet's L-functions to obtain results on the distribution of primes in number fields. Artin introduced his L-functions as a non-abelian generaliza tion of Dirichlet's L-functions with a generalization of class field the ory to non-abelian Galois extensions of number fields in mind. Weil introduced his zeta-function for varieties over finite fields in relation to a problem in number theory.

One of the challenging problems in number theory is to compute efficiently multiplicative order of integers modulo a prime. This problem was listed under open problems in the number theoretic complexity II proposed by Leonard M. Adleman and Kevin S.McCurley in 1994. This paper offers a polynomial-time quantum algorithm for computing the order k = min {x|x∈, ax ≡ 1(modp)}, if p∈ Primes and gcd(a,p) = 1, where a, p∈, and it requires 2 (1) 2 ((log p) +O )  quantum operations.

This paper contains a summary table of the author’s computation of the Gaussian primes of the form a + i a + i . For the values x = 1000 , 10000 , 100000 , 180000 x = 1000, 10000, 100000, 180000 , and 500000 (500000) 14000000, the following values are tabulated: G ( x ) G(x) , the numbers of Gaussisn primes a + i a + i with a ≦ 14000000 ; π 1 ( x ) a \leqq 14000000;{\pi _1}(x) , the number of primes ≦ x \leqq x congruent to 1 m o d 4 1 mod 4 ; π 3 ( x ) {\pi _3}(x) , the number of primes ≦ x \leqq x congruent to 3 m o d 4 3 mod 4 ; and G ( x ) / π 3 ( x ) G(x)/{\pi _3}(x) .

In this chapter, we investigate infinite Galois extensions and prove an analog of the fundamental theorem of Galois theory for infinite extensions. The key idea is to put a topology on the Galois group of an infinite dimensional Galois extension and then use this topology to determine which subgroups of the Galois group arise as Galois groups of intermediate extensions. We also give a number of constructions of infinite Galois extensions, constructions that arise in quadratic form theory, number theory, and Galois cohomology, among other places.

This paper attempts to form a bridge between a sum of the divisors function and the gamma function, proposing a novel approach that could have significant implications for classical problems in number theory, specifically the Robin inequality and the Riemann hypothesis. The exploration of using invariant properties of these functions to derive insights into twin primes and sequential primes is a potentially innovative concept that deserves careful consideration by the mathematical community.

Let $L$ be a finite Galois extension of the number field $K$. We unconditionally bound the least prime ideal of $K$ occurring in the Chebotarev Density Theorem as a power of the discriminant of $L$ with an explicit exponent. We also establish a quantitative Deuring-Heilbronn phenomenon for the Dedekind zeta function.

In this paper, we study the Mordell-Weil group of an elliptic curve as a Galois module. We consider an elliptic curve E defined over a number field K whose Mordell-Weil rank over a Galois extension F is 1, 2 or 3. We show that E acquires a point (points) of infinite order over a field whose Galois group is one of Cn×Cm (n = 1, 2, 3, 4, 6, m = 1, 2), Dn×Cm (n = 2, 3, 4, 6, m = 1, 2), A4×Cm (m = 1, 2), S4 × Cm (m = 1, 2). Next, we consider the case where E has complex multiplication by the ring of integers of an imaginary quadratic field contained in K. Suppose that the -rank over a Galois extension F is 1 or 2. If ≠ and and h (class number of ) is odd, we show that E acquires positive -rank over a cyclic extension of K or over a field whose Galois group is one of SL2(/3), an extension of SL2(/3) by /2, or a central extension by the dihedral group. Finally, we discuss the relation of the above results to the vanishing of L-functions.

In this article we show the NP-completeness of some simple number-theoretic problems. Natural simplifications of these problems invariably are known to be in P. Our research was motivated by the question whether one could study non-deterministic computation without loss of generality on a restricted, number theoretically significant class of nondeterministic Turing machines, the nondeterministic diophantine machines defined below [1,2]. The results suggest this is true.Because of the relative difficulty of the reduction of the satisfiability problem used in the proof, and the distinctly number-theoretic character of the problems shown to be NP-complete, we hope that the NP-completeness of these problems will play a role in showing the NP-completeness of further problems of a numerical nature, much as the satisfiability problem has in showing the NP-completeness of combinatorial problems ([3],[5]).The results illustrate an intimate connection between problems in computational theory, such as “P=NP?”, and problems in number theory, e.g. about quadratic congruences in one unknown, which are just beyond the range in which efficient algorithms exist. Thus our work exposes an interface between the state-of-the-art in number theory and in the theory of computation. Also, our results can be seen as the solution to a natural and important revision of Hilbert's 10thproblem: Give a feasible algorithmic procedure to decide whether an arbitrary diophantine equation has solutions. Unless P=NP this is impossible, even for a class of quadratic diophantine equations in two unknowns for which a decision procedure in the original sense is in fact available. Certainly, these results present a striking rigorous demonstration that number theorists' intuitions about where problems about diophantine equations and quadratic congruences start to be truly difficult are justified.

Many problems in number theory have simple statements, but their solutions require a deep understanding of algebra, algebraic geometry, complex analysis, group representations, or a combination of all four. The original simply stated problem can be obscured in the depth of the theory developed to understand it. This book is an introduction to some of these problems, and an overview of the theories used nowadays to attack them, presented so that the number theory is always at the forefront of the discussion. Lozano-Robledo gives an introductory survey of elliptic curves, modular forms, and $L$-functions. His main goal is to provide the reader with the big picture of the surprising connections among these three families of mathematical objects and their meaning for number theory. As a case in point, Lozano-Robledo explains the modularity theorem and its famous consequence, Fermat's Last Theorem. He also discusses the Birch and Swinnerton-Dyer Conjecture and other modern conjectures. The book begins with some motivating problems and includes numerous concrete examples throughout the text, often involving actual numbers, such as 3, 4, 5, $\frac{3344161}{747348}$, and $\frac{2244035177043369699245575130906674863160948472041} {8912332268928859588025535178967163570016480830}$. The theories of elliptic curves, modular forms, and $L$-functions are too vast to be covered in a single volume, and their proofs are outside the scope of the undergraduate curriculum. However, the primary objects of study, the statements of the main theorems, and their corollaries are within the grasp of advanced undergraduates. This book concentrates on motivating the definitions, explaining the statements of the theorems and conjectures, making connections, and providing lots of examples, rather than dwelling on the hard proofs. The book succeeds if, after reading the text, students feel compelled to study elliptic curves and modular forms in all their glory.

With the availability of microcomputers, mathematics classes have the opportunity to explore topics in number theory that have previously been ignored or treated superficially. The exploration of problems in number theory permits a further understanding of the BASIC language by introducing new computer functions. One topic that couples number theory to programming is palindromes.