No footnotes date May 2010 In mathematics , computationalnumbertheory , also known as algorithmic numbertheory , is the study of algorithm s for performing numbertheorynumber theoretic computation s. The best known problem in the field is integer factorization . See also Computational complexity of mathematical operations Sage Math NumberTheory Library PARI GP Further reading Victor Shoup , A Computational Introduction to NumberTheory and Algebra . Cambridge, 2005, ISBN 0 521 85 154 8 Henri Cohen number theorist Henri Cohen , A Course in Computational Algebraic NumberTheory , Graduate Texts in Mathematics 138, Springer Verlag, 1993. Eric Bach and Jeffrey Shallit , Algorithmic NumberTheory , volume 1 Efficient Algorithms . MIT Press, 1996, ISBN 0 262 02405 5 Richard Crandall and Carl Pomerance , Prime Numbers A Computational Perspective , Springer Verlag, 2001, ISBN 0 387 94777 9 Hans Riesel , Prime Numbers and Computer Methods for Factorization , second edition, Birkh user, 1994, ISBN 0 8176 3743 5, ISBN 3 7643 3743 5 Number theoretic algorithms Numbertheory footer Category Computationalnumbertheory Category Numbertheory Numtheory stub ar de Algorithmische Zahlentheorie fr Th orie algorithmique des nombres pl Algorytmiczna teoria liczb ... more details
. See also arithmetic combinatorics . ComputationalnumbertheoryComputationalnumbertheory studies algorithms relevant in numbertheory. Fast algorithms for prime testing and integer factorization ... ntb A Computational Introduction to NumberTheory and Algebra by Victor Shoup Mathematics footer Number ... number this yields an intriguing, yet not fully understood pattern. Numbertheory is the branch of pure ..., as well as the wider classes of problems that arise from their study. Numbertheory may be subdivided ... of numbertheory topics . The terms arithmetic or the higher arithmetic as nouns are also used to refer to elementary numbertheory. These are somewhat older terms, which are no longer as popular ... cumbersome phrase number theoretic , and also arithmetic of rather than numbertheory of , e.g. ... theory In elementary numbertheory , integers are studied without use of techniques from other mathematical .... Many questions in numbertheory can be stated in elementary number theoretic terms, but they may require very deep consideration and new approaches outside the realm of elementary numbertheory ... shown to be Decision problem undecidable see Hilbert s tenth problem . Analytic numbertheory Analytic numbertheory employs the machinery of calculus and complex analysis to tackle questions about ..., such as pi or e mathematical constant e , are also classified as analytical numbertheory ... a given real number may be approximated by a rational number rational one. Algebraic numbertheory In algebraic numbertheory , the concept of a number is expanded to the algebraic number s which ... and it arises from algebraic numbertheory. Geometry of numbers The geometry of numbers incorporates ... theorems in algebraic numbertheory. Combinatorial numbertheory Combinatorial numbertheory deals .... Paul Erd s is the main founder of this branch of numbertheory. Typical topics include Partition numbertheory partitions , covering system , zero sum problems , various restricted sumset s, and arithmetic ... more details
In theoretical computer science , computational learning theory is a mathematical field related to the analysis ... such as minimizing the number of mistakes made on new samples. In addition to performance bounds, computational learning theorists study the time complexity and feasibility of learning. In computational learning theory, a computation is considered feasible if it can be done in polynomial time . There are two ... learnability, Proc. 1st ACM Workshop on Computational Learning Theory, 1988 42 55. L. Pitt and M. K ... Basics of Bayesian inference Category Machine learning de Computational learning theory ... in negative results are Computational complexity P NP problem P &ne NP cryptography Cryptographic One way function s exist. There are several different approaches to computational learning theory. These differences are based on making assumptions about the inference principles used to generalize ... theory , proposed by Vladimir Vapnik Bayesian inference , arising from work first done by Thomas Bayes . Algorithmic learning theory , from the work of E. M. Gold. Online machine learning , from the work of Nick Littlestone. Computational learning theory has led to several practical algorithms. For example, PAC theory inspired boosting , VC theory led to support vector machine s, and Bayesian inference led to belief networks by Judea Pearl . See also Information theory References Surveys Angluin, D. 1992. Computational learning theory Survey and selected bibliography. In Proceedings of the Twenty Fourth Annual ACM Symposium on Theory of Computing May 1992 , pp. 351 369. http portal.acm.org ... to their probabilities. Theory of Probability and its Applications, 16 2 264 280, 1971. Feature ... Symposium on Theory of Computing, pages 433 444, New York. ACM. http citeseer.ist.psu.edu kearns89cryptographic.html ... of the ACM, 36 4 929 865, 1989. Probably approximately correct learning L. Valiant. A Theory of the Learnable ... learning from statistical queries. In Proceedings of the Twenty Fifth Annual ACM Symposium on Theory ... more details
Computational complexity theory is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty. In this context, a computational problem is understood to be a task that is in principle ... of communication used in communication complexity , the number of logic gate gates in a circuit used in circuit complexity and the number of processors used in parallel computing . One of the roles of computational complexity theory is to determine the practical limits on what computer s can ... theory . A key distinction between analysis of algorithms and computational complexity theory is that the former is devoted to analyzing the amount of resources needed by a particular algorithm ... on the available resources is what distinguishes computational complexity from computability theory the latter theory asks what kind of problems can be solved in principle algorithmically. Computational ... objects of study in computational complexity theory. A decision problem is a special type of computational ... Structural complexity theory Descriptive complexity theory Quantum complexity theory Context of computational ... citation last Du first Ding Zhu coauthors Ko, Ker I title Theory of Computational Complexity publisher ... Link FA de DEFAULTSORT Computational Complexity Theory Category Computational complexity theory ... simple Computational complexity theory sk Te ria zlo itosti sr ... of mathematical instructions . Informally, a computational problem consists of problem instances and solutions ... whether a given number is prime number prime or not. The instances of this problem are natural numbers , and the solution to an instance is yes or no based on whether the number is prime or not. A problem ..., whatever the algorithm used for solving it. The theory formalizes this intuition, by introducing ... city exactly once. Problem instances A computational problem can be viewed as an infinite collection ... more details
In mathematics , computational group theory is the study of group mathematics group s by means of computers. It is concerned with designing and analysing algorithm s and data structure s to compute information about groups. The subject has attracted interest because for many interesting groups including most of the sporadic groups it is impractical to perform calculations by hand. Important algorithms in computational group theory include the Schreier Sims algorithm for finding the order of a permutation group the Todd Coxeter algorithm and Knuth Bendix algorithm for coset enumeration the product replacement algorithm for finding random elements of a group Two important computer algebra system s CAS used for group theory are GAP computer algebra system GAP and MAGMA . Historically, other systems such as CAS for character theory and Cayley computer algebra system Cayley a predecessor of MAGMA were important. Some achievements of the field include complete enumeration of List of small groups all finite groups of order less than 2000 computation of representations for all the sporadic groups References A http www.math.ohio state.edu akos notices.ps survey of the subject by kos Seress from Ohio State University , expanded from an article that appeared in the Notices of the American Mathematical Society is available online. There is also a http www.math.rutgers.edu sims publications survey.pdf survey by Charles Sims mathematician Charles Sims from Rutgers University and an http www.math.rwth aachen.de Joachim.Neubueser preprint.html older survey by Joachim Neub ser from RWTH Aachen . There are three books covering various parts of the subject Derek F. Holt, Bettina Eick, Bettina, Eamonn A. O Brien, Handbook of computational group theory , Discrete Mathematics and its Applications Boca Raton . Chapman & Hall CRC, Boca Raton, FL, 2005. ISBN 1 58488 372 3 Charles C. Sims , Computation ... 0 521 66103 X. Category Computational group theory nl Computationele groepentheorie ru ... more details
a step by step algorithm to get a specific output. The computationaltheory of mind claims that there are certain .... The computationaltheory of mind requires Representation psychology representation because ... the representation. The computationaltheory of mind is related to the representational ... the computationaltheory leaves open that certain mental states, such as pain or depression, may ... representational mental states are known as qualia . The computationaltheory of mind is also related ... Computationaltheory of mind is not the same as the computer metaphor, according to which the mind ... York Penguin. 2002 ref Computationaltheory just uses some of the same principles as those found ... of thoughts At the heart of the ComputationalTheory of Mind is the idea that thoughts are a form ... against the ComputationalTheory of Mind. Some of the most compelling encompass the physical realm ... be said to understand it? This is essentially what the computationaltheory of mind presents us with a model ... CPC.pdf Bruno Marchal argues that physical supervenience is not compatible with computationaltheory ref that physical supervenience is not compatible with computationaltheory, using arguments like ... s entry on the computationaltheory http homepage.mac.com blinkcentral The Cognitive Process ... with computationaltheory French Category theories of mind fa fr Computationnalisme ...Citations missing date July 2008 No footnotes date April 2009 In philosophy of mind philosophy , the computationaltheory of mind is the view that the human mind ought to be conceived as an information processing system and that thought is a form of computation . The theory was proposed in its modern ... and 70s. ref Steven Horst Horst, Steven , 2005 http plato.stanford.edu entries computational mind The ComputationalTheory of Mind in The Stanford Encyclopedia of Philosophy ref This view is common in modern cognitive psychology and is presumed by theorists of evolutionary psychology . The computational ... more details
In mathematical numbertheory and computer science , a Morton number is a single integer value constructed by interleaving the bits or digits of one or more source numbers. This is often useful for constructing a single hash index from a pair or more of input numbers. In numbertheory, Morton numbers are useful in proofs, often in examples which map multiple dimensions to one, or vice versa. For example, an infinite 2D grid of integer coordinates can have a single unique Morton number computed for each coordinate, and those Morton numbers give a one to one mapping of the infinite 2D coordinates to a 1D coordinate along the Z order curve Z order curve proving that the infinite number of integer pairs has the same cardinality as the integers. External links http graphics.stanford.edu seander bithacks.html InterleaveTableObvious Bits interleaving in C Category Hash functions Category Numbertheory ... more details
Infobox Software name CCP4 developer CCLRC Daresbury Laboratory latest release version 6.1.3 latest release date release date and age 2010 06 01 df yes operating system UNIX , Linux , Apple Macintosh Mac , MS Windows programming language C programming language C , Fortran , Tcl , Python programming language Python genre X Ray Crystallography licence http www.ccp4.ac.uk ccp4license.php Various website http www.ccp4.ac.uk CCP4 The Collaborative Computational Project Number 4 in protein crystallography or CCP4 was set up in 1979 in the United Kingdom to support collaboration between researchers working in software development and assemble a comprehensive collection of software for structural biology . The CCP4 core team is located at the Research Complex at Harwell RCaH at Rutherford Appleton Laboratory RAL in Didcot , near Oxford, UK. CCP4 was originally supported by the UK Science and Engineering Research Council SERC , and is now supported by the Biotechnology and Biological Sciences Research Council BBSRC . The project is coordinated at CCLRC Daresbury Laboratory. The results of this effort gave rise to the CCP4 program suite, which is now distributed to academic and commercial users worldwide. Projects http www.ccp4.ac.uk ccp4i main.php CCP4i &mdash CCP4 Graphical User Interface http www.ysbl.york.ac.uk ccp4mg CCP4MG &mdash CCP4 Molecular Graphics Project http www.ccp4.ac.uk HAPPy HAPPy &mdash automated experimental phasing http www.ccp4.ac.uk MrBUMP MrBUMP &mdash automated Molecular Replacement http www.ebi.ac.uk msd srv prot int pistart.html PISA &mdash Protein Interfaces, Surfaces and Assemblies http www.mrc lmb.cam.ac.uk harry imosflm index.html MOSFLM GUI &mdash building a modern interface to MOSFLM See also CCP4 file format External links http www.ccp4.ac.uk CCP4 Main Web site http ccp4wiki.org ccp4wiki wiki index.php?title Main Page CCP4 Documentation wiki &mdash concentrates only on CCP4 http strucbio.biologie.uni konstanz.de ccp4wiki index.php Main Page C ... more details
Prime numbertheory may refer to Prime number Prime number theorem Numbertheory disambig Long comment to avoid being listed on short pages ... more details
Computationalnumbertheory Category Recurring events established in 1994 ... Bordeaux , France Organizers Henri Cohen number theorist Henri Cohen , Michel Olivier Proceedings ... more details
was just a small number effect, but small here included values of n up to a billion. The requirement of computability reflects on and contrasts with the approach used in analytic numbertheory ... explicit. The Siegel period Many of the principal results of analytic numbertheory that were proved ... id d d032590 title Diophantine approximation Category Analytic numbertheory Category Diophantine equations ... on the Skewes number of 1933, these results were believed by some experts to be intrinsically ... of A , the so called implied constant , may also need to be made explicit, for computational ... Linfoot on the class number 1 problem ref H. Heilbronn, E. Linfoot, On the imaginary quadratic corpora of class number one. Quart. J. Math. Oxford Ser. 5 1934 , pp. 293&ndash 301. ref The 1935 result ... s for some families of number fields grow and bounds for the best rational approximations to algebraic number s in terms of denominator s. These latter could be read quite directly as results on Diophantine equations, after the work of Axel Thue . The result used for Liouville number s in the proof .... The logic involved is closer to proof theory than to that of computability theory and computable function s. It is rather loosely conjectured that the difficulties may lie in the realm of computational complexity theory . Ineffective results are still being proved in the shape A or B , where ... more details
This is a list of numbertheory topics , by Wikipedia page. See also List of recreational numbertheory topics Topics in cryptography Factors Composite number Highly composite number Even and odd numbers ... Euler s criterion Legendre symbol Gauss s lemma numbertheory Congruence of squares Luhn formula Mod ... function numbertheory Integer partition Bell numbers Landau s function Pentagonal number theorem Bell series Lambert series Analytic numbertheory additive problems Twin prime Brun s constant ... square identity Lagrange s four square theorem Taxicab number Generalized taxicab number Cabtaxi number Schnirelmann density Sumset Landau Ramanujan constant Sierpinski number Seventeen or Bust Niven s constant Algebraic numbertheory See list of algebraic numbertheory topics Quadratic form s Unimodular ... Mahler s compactness theorem Mahler measure Effective results in numbertheory Mahler s theorem Sieve ... prime Woodall prime Prime pages Combinatorial numbertheory Covering system Small set combinatorics ... numbertheory Algorithmic numbertheory Residue number system Cunningham project Quadratic residuosity ... Prime Obsession Category Mathematics related lists Numbertheory Category Numbertheory ... Table of divisors Prime number , prime power Bonse s inequality Prime factor Table of prime factors Formula for primes Factorization RSA number Fundamental theorem of arithmetic Square free Square free integer Square free polynomial Square number Power of two Integer valued polynomial Fraction mathematics Fraction s Rational number Unit fraction Irreducible fraction in lowest terms Dyadic fraction Recurring decimal Cyclic number Farey sequence Ford circle Stern Brocot tree Dedekind sum Egyptian ... squares L function s Riemann zeta function Basel problem on 2 Hurwitz zeta function Bernoulli number Agoh Giuga conjecture Von Staudt Clausen theorem Dirichlet series Euler product Prime number theorem Prime counting function Offset logarithmic integral Legendre s constant Skewes number Bertrand ... more details
Probabilistic numbertheory is a subfield of numbertheory , which explicitly uses probability to answer questions of numbertheory. One basic idea underlying it is that different prime number s are, in some serious sense, like independent random variables . This however is not an idea that has a unique useful formal expression. The founders of the theory were Paul Erd s , Aurel Wintner and Mark Kac during the 1930s, one of the most intense periods of investigation in analytic numbertheory . The Erd s Wintner theorem and the Erd s Kac theorem on additive function s were foundational results. See also analytic numbertheory areas of mathematics list of numbertheory topics list of probability topics mathematics probabilistic method probable prime References cite book title Introduction to Analytic and Probabilistic NumberTheory author G rald Tenenbaum series Cambridge studies in advanced mathematics volume 46 publisher Cambridge University Press year 1995 isbn 0 521 41261 7 Category Numbertheory numtheory stub ... more details
In the mathematical field of graph theory , the intersection number of a graph math G V , E is the smallest number of elements in a representation of math G as an intersection graph of finite set s. Equivalently, it is the smallest number of clique graph theory cliques needed to cover all of the edges of math G . ref name gy06 citation title Graph Theory and its Applications first1 Jonathan L. last1 ... Lov sz conjecture.svg thumb A graph with intersection number four. The four shaded regions indicate cliques that cover all the edges of the graph. An alternative definition of the intersection number of a graph math G is that it is the smallest number of clique graph theory cliques in math G complete ... number of the graph is the smallest number math k such that there exists a representation of this type ... representation of a graph with a given number of elements is known as the intersection graph ... is known as a clique edge cover or edge clique cover , and for this reason the intersection number is also sometimes called the edge clique cover number . ref citation title Sphericity, cubicity ... number at most math m , for each edge forms a clique and these cliques together cover all the edges. ref citation title Schaum s outline of theory and problems of graph theory first V. K. last Balakrishnan ... that every graph with math n vertices has intersection number at most math n sup 2 sup 4 . More strongly ... number equals the number of edges. ref name r85 An even tighter bound is possible when the number of edges is strictly greater than math n sup 2 sup 4 . Let p be the number of pairs of vertices that are not connected ... math t t &minus 1 p t t 1 . Then the intersection number of math G is at most math p t . ref name ... graph complement of a sparse graph have small intersection numbers the intersection number ... e is the e mathematical constant base of the natural logarithm and d is the degree graph theory degree ... Covering graphs by the minimum number of equivalence relations journal Combinatorica volume 6 issue ... more details
The NumberTheory Foundation NTF is a non profit organization based in the United States which supports research and conferences in the field of numbertheory . The NTF funds the Selfridge prize which is awarded at the ANTS conference ANTS conferences. External links http www.math.uiuc.edu ntf NTF web site Category Numbertheory Category Non profit organizations based in the United States math stub ... more details
Multiplicative numbertheory is a subfield of analytic numbertheory that deals with prime numbers and with factorization and divisors . The focus is usually on developing approximate formulas for counting these objects in various contexts. The prime number theorem is a key result in this subject. The Mathematics Subject Classification for multiplicative numbertheory is 11Nxx. Scope Multiplicative numbertheory deals primarily in asymptotic estimates for arithmetic functions . Historically the subject has been dominated by the prime number theorem , first by attempts to prove it and then by improvements in the error term. The Dirichlet divisor problem that estimates the average order of the divisor function d n and Gauss s circle problem that estimates the average order of the number of representations of a number as a sum of two squares are also classical problems, and again the focus is on improving ... The methods belong primarily to analytic numbertheory , but elementary methods, especially sieve ... of multiplicative numbertheory. The distribution of prime numbers is closely tied to the behavior ... a numbertheory viewpoint and a complex analysis viewpoint. Standard texts A large part of analytic numbertheory deals with multiplicative problems, and so most of its texts contain sections on multiplicative numbertheory. These are some well known texts that deal specifically with multiplicative problems cite book last Davenport first Harold authorlink Harold Davenport title Multiplicative NumberTheory edition 3rd edition publisher Springer location Berlin year 2000 isbn 9780387950976 cite ... mathematician Robert C. Vaughan title Multiplicative NumberTheory I. Classical Theory publisher Cambridge University Press location Cambridge year 2005 isbn 9780521849036 See also Additive numbertheory Category Analytic numbertheory ... that there are an infinity of primes in each co prime residue class, and the prime number theorem ... more details
number of crossings among all drawings of this graph, so the graph has crossing number cr G 3. In graph theory , the crossing number cr G of a graph G is the lowest number of edge ..., determining the rectilinear crossing number is Complete complexity complete for the existential theory ... planar if and only if its crossing number is zero. The concept originated in Tur n s brick factory problem , in which P l Tur n asked to determine the crossing number of the complete bipartite graph ... journal J. Graph Theory volume 1 pages 7 9 year 1977 ref History Kazimierz Zarankiewicz Zarankiewicz ... n 2 rfloor lfloor n 1 2 rfloor lfloor m 2 rfloor lfloor m 1 2 rfloor, math for the crossing number ... is now known as Zarankiewicz Crossing Number Conjecture. The problem of determining the crossing number of the complete graph was first posed by Anthony Hill artist Anthony Hill , and appears ... upper bound for this crossing number, which Richard Guy published in 1960. ref name nabla As of March ... in 2007, states that, among all graphs with chromatic number n , the complete graph K sub n sub has the minimum number of crossings. That is, if Guy s conjecture on the crossing number of the complete graph is valid, every n chromatic graph has crossing number at least equal to the formula in the conjecture ... Variations Without further qualification, the crossing number allows drawings in which the edges may be represented by arbitrary curves the rectilinear crossing number requires all edges to be straight line segments, and may differ from the crossing number. In particular, the rectilinear crossing number of a complete graph is essentially the same as the minimum number of convex quadrilaterals determined ... Cite journal title The rectilinear crossing number of a complete graph and Sylvester s four point problem ... http jstor.org stable 2975158 ref Complexity In general, determining the crossing number of a graph ... number is NP complete journal SIAM J. Alg. Discr. Meth. volume 4 pages 312 316 year 1983 id MathSciNet ... more details
Infobox Journal cover Image JNumberTh.jpg 250px discipline Mathematics abbreviation J Num. Th. publisher Elsevier country United States USA history 1969 website http www.math.ohio state.edu JNT ISSN 0022 314X The Journal of Number Theory ISSN 0022 314X , often abbreviated J. Number Theory or J. Num. Th. in bibliographies, is a mathematics journal that publishes a broad spectrum of original research in number theory . The journal was founded in 1969 by R.P. Bambah, P. Roquette, Arnold Ross A. Ross , A. Woods, and Hans Julius Zassenhaus H. Zassenhaus , under the auspices of Ohio State University . It is currently published by Elsevier , with 12 issues and 6 volumes per year. The editor in chief is Ohio State professor David Goss . External links http www.sciencedirect.com science journal 0022314X The Journal of Number Theory . Official web site at Elsevier. http www.math.ohio state.edu JNT JNT editorial office at Ohio State University. Category Number theory Category Mathematics journals Category Publications established in 1969 Category Ohio State University Category Elsevier academic journals math journal stub ru Journal of Number Theory ... more details
Unsolved Problems in NumberTheory may refer to Unsolved problems in mathematics in the field of numbertheory . A book with this title by Richard K. Guy published by Springer Verlag First edition 1981, 161 pages, ISBN 0 387 90593 6 Second edition 1994, 285 pages, ISBN 0 387 94289 0 Third edition 2004, 438 pages, ISBN 0 387 20860 7 ISBN 13 978 0387208602 Books with a similar title include Solved and Unsolved Problems in NumberTheory , by Daniel Shanks First edition, 1962 Second edition, 1978 Third edition, 1985, ISBN 0 8284 1297 9 Fourth edition, 1993 Old and New Unsolved Problems in Plane Geometry and NumberTheory , by Victor Klee and Stan Wagon , 1991, ISBN 0 88385 315 9. mathdab ... more details
based key exchange protocol. Public key cryptography and computationalnumbertheory Warsaw, 2000 ... The infrastructure of a real quadratic field and its applications. Proceedings of the NumberTheory ... of a real quadratic number field in terms of circular groups . It was also described by R. Schoof ref name schoof infrastructure1 R. J. Schoof Quadratic fields and factorization. Computational methods in numbertheory, Part II, 235&ndash 286, Math. Centre Tracts, 155, Math. Centrum, Amsterdam ... fractions and number theoretic computations. Numbertheory Winnipeg, Man., 1983 . Rocky Mountain J ... Arakelov class groups. English summary Algorithmic numbertheory lattices, number fields, curves and cryptography ... cubic function fields of unit rank 1. English summary Algorithmic numbertheory Portland, OR, 1998 ... for divisors. English summary Algorithmic numbertheory, 342&ndash 356, Lecture Notes in Comput. Sci ... NumberTheory Category Algebra Category Algebraic structures ... the infrastructure of a Quadratic field real quadratic number field and applied his baby step giant ... H. W. Lenstra Jr. On the calculation of regulators and class numbers of quadratic fields. Numbertheory days, 1980 Exeter, 1980 , 123&ndash 150, London Math. Soc. Lecture Note Ser., 56, Cambridge ... and B. K. Schmid to certain Cubic field cubic number fields of Dirichlet s unit theorem unit rank ... the regulator and class number of a pure cubic field. Math. Comp. 41 1983 , no. 163, 235&ndash 286. MR 701638 ref ref name williams dueck G. W. Dueck, H. C. Williams Computation of the class number ... ref and by J. Buchmann and H. C. Williams to all number fields of unit rank one. ref name buchmann ... of an algebraic number field of unit rank one. Math. Comp. 50 1988 , no. 182, 569&ndash 579. MR ... to compute the regulator of a number field of arbitrary unit rank. ref name buchmann habil ... habil.pdf PDF ref The first description of infrastructures in number fields of arbitrary unit ... more details
In numbertheory , the specialty additive numbertheory studies subsets of integers and their behavior under addition. More abstractly, the field of additive numbertheory includes the study of Abelian group s and commutative semigroup s with an operation of addition. Additive numbertheory has close ties to combinatorial numbertheory and the geometry of numbers . Two principal objects of study are the sumset of two subsets math A math and math B math of elements from an Abelian group math G math , math A B a b a in A, b in B math , and the h fold sumset of math A math , math hA underset h underbrace A cdots A . math There are two main subdivisions listed below. 1 Additive numbertheory The first is principally devoted to consideration of direct problems over typically the integers, that is, to determining which elements can be represented as a summand from math hA math , where math A math ... the spectrum of mathematics, including combinatorics, ergodic theory , analysis , graph theory , group theory , and linear algebraic and polynomial methods. See also Shapley Folkman lemma Multiplicative numbertheory References cite book author Henry Mann authorlink Henry Mann title Addition Theorems The Addition Theorems of Group Theory and NumberTheory publisher http www.krieger publishing.com ... 1 cite book title Additive NumberTheory the Classical Bases volume 164 series Graduate Texts in Mathematics ... title Additive NumberTheory Inverse Problems and the Geometry of Sumsets volume 165 series Graduate ... title Additive NumberTheory urlname AdditiveNumberTheory Category Additive numbertheory numtheory ... of Prime number primes and Waring s problem which asks how large must math h math be to guarantee that math ... number is the sum of three primes, and so every sufficiently large even integer is the sum of four ... number of k th powers. In general, a set A of nonnegative integers is called a basis of order h ... question to be considered is how small can the number of representations of math n math as a sum ... more details
Algebra & NumberTheory ISSN 1937 0652 is a peer reviewed mathematics journal published by the nonprofit organization Mathematical Sciences Publishers . ref http www.mathscipub.org journals.html Mathematical Sciences Publishers journals ref It was launched on January 17, 2007 with the goal of providing an alternative to the current range of commercial specialty journals in algebra and numbertheory , an alternative of higher quality and much lower cost. ref http listserv.nodak.edu cgi bin wa.exe?A2 ind0701&L nmbrthry&T 0&P 2999 Announcement email to the NMBRTHRY email list ref The journal publishes original research articles in algebra and numbertheory , interpreted broadly, including algebraic geometry and arithmetic geometry , for example. ref http pjm.math.berkeley.edu ant about journal about.html About the journal at the ANT website ref Issues are published both online and in print. Editorial board The Managing Editor is Bjorn Poonen of Massachusetts Institute of Technology MIT , and the Editorial Board Chair is David Eisenbud of University of California at Berkeley U. C. Berkeley . ref http pjm.math.berkeley.edu ant about journal editorial.html Editorial board at the ANT website ref References reflist External links http jant.org Algebra & NumberTheory http www.mathscipub.org Mathematical Sciences Publishers Category Mathematics journals Category Publications established in 2007 Category Mathematical Sciences Publishers academic journals ... more details
Infobox journal title International Journal of NumberTheory cover discipline Mathematics abbreviation editor Bruce C. Berndt, Ramdorai Sujatha, Michel Waldschmidt publisher World Scientific country history 2005 present frequency 8 year impact 0.318 impact year 2009 website http www.worldscinet.com ijnt ijnt.shtml ISSN 1793 0421 eISSN 1793 7310 OCLC 62161796 The International Journal of NumberTheory was established in 2005 and is published by World Scientific . It covers numbertheory , encompassing areas such as analytic numbertheory , diophantine equation s, and modular form s. Abstracting and indexing The journal is abstracted and indexed in Zentralblatt MATH , Mathematical Reviews , Science Citation Index Science Citation Index Expanded , and Current Contents Physical, Chemical and Earth Sciences. According to the Journal Citation Reports , the journal s 2009 impact factor is 0.318, ranking it 233rd out of 255 journals in the category Mathematics . External links Official http www.worldscinet.com ijnt ijnt.shtml Category Publications established in 2005 Category Mathematics journals Category World Scientific academic journals Category English language journals ... more details
Abstract analytic numbertheory is a branch of mathematics which takes the ideas and techniques of classical analytic numbertheory and applies them to a variety of different mathematical fields. The classical prime number theorem serves as a prototypical example, and the emphasis is on abstract asymptotic analysis asymptotic distribution results . The theory was invented and developed by John Knopfmacher in the early 1970s. Arithmetic semigroups The fundamental notion involved is that of an arithmetic ... integer not exceeding x . If K is an algebraic number field , i.e. a finite extension of the field mathematics field of rational number s Q , then the set G of all nonzero ideal ring theory ideal ... numbertheory to the context of an arbitrary arithmetic semigroup which may satisfy one or more additional ... of the ideal class group in algebraic numbertheory and allows for abstract asymptotic distribution results under constraints. In the case of number fields, for example, this is Chebotarev s density theorem . References cite book title Abstract Analytic NumberTheory author John Knopfmacher publisher ... numbertheory I. Classical theory series Cambridge tracts in advanced mathematics volume 97 year 2007 isbn 0 521 84903 9 page 278 Category Algebraic numbertheory Category Analytic numbertheory ... of P are called the primes of G . There exists a real number real valued norm mapping math ... a,b in G math The total number math N G x math of elements math a in G math of norm math a leq x math ... 1, 2, 3, ... , with subset of rational prime number prime s P 2, 3, 5, ... . Here, the norm of an integer ... O sub K sub I . In this case, the appropriate generalisation of the prime number theorem is the Landau ... these cases, the elements of G are isomorphism classes in an appropriate category category theory ... semigroup which satisfies Axiom A , we have the following abstract prime number theorem math pi G x sim frac x delta delta log x mbox as x rightarrow infin math where sub G sub x total number ... more details
Cleanup date June 2008 Refimprove date September 2008 In mathematics , analytic numbertheory is a branch of numbertheory that uses methods from mathematical analysis to solve problems about the integers ... number theorem . Analytic numbertheory can be split up into two major parts, divided more by the type ... numbertheory deals with the distribution of the prime number s, such as estimating the number of primes ... progressions. Additive numbertheory is concerned with the additive structure of the integers ... of the main results in additive numbertheory is the solution to Waring s problem . Developments within analytic numbertheory are often refinements of earlier techniques, which reduce the error terms ... numbertheory on quantitative upper and lower bounds. Another recent development is probabilistic numbertheory sfn Tenenbaum 1995 p 267 , which uses tools from probability theory to estimate the distribution ... in analytic numbertheory The great theorems and results within analytic numbertheory tend not to be exact ... functions, as the following examples illustrate. Multiplicative numbertheory The Prime Number Theorem is probably one of the most famous and interesting results in analytic numbertheory. Euclid ... n . In one of the first applications of analytic techniques to numbertheory, Dirichlet proved ... x 1. math There are also many deep and wide ranging conjectures in numbertheory whose proofs seem too ... k less than 16. Additive numbertheory One of the most important problems in additive numbertheory ... , math . Again, the difficult part and a great achievement of analytic numbertheory is obtaining ... ref M.N. Huxley, Integer points, exponential sums and the Riemann zeta function , Numbertheory ... numbertheory Dirichlet series One of the most useful tools in multiplicative numbertheory are Dirichlet ... line. Analysis and numbertheory One may ask why exactly it is that analysis calculus can be applied to numbertheory. One is continuous in nature and the other is discrete after all. Leonard Euler ... more details
Encyclopedia
top
