|
Additive Basis
In additive number theory, an additive basis is a set S of natural numbers with the property that, for some finite number k, every natural number can be expressed as a sum of k or fewer elements of S. That is, the sumset of k copies of S consists of all natural numbers. The ''order'' or ''degree'' of an additive basis is the number k. When the context of additive number theory is clear, an additive basis may simply be called a basis. An asymptotic additive basis is a set S for which all but finitely many natural numbers can be expressed as a sum of k or fewer elements of S. For example, by Lagrange's four-square theorem, the set of square numbers is an additive basis of order four, and more generally by the Fermat polygonal number theorem the polygonal numbers for k-sided polygons form an additive basis of order k. Similarly, the solutions to Waring's problem imply that the kth powers are an additive basis, although their order is more than k. By Vinogradov's theorem, the prime numbe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Additive Number Theory
Additive number theory is the subfield of number theory concerning the study of subsets of integers and their behavior under addition. More abstractly, the field of additive number theory includes the study of abelian groups and commutative semigroups with an operation of addition. Additive number theory has close ties to combinatorial number theory and the geometry of numbers. Two principal objects of study are the sumset of two subsets ''A'' and ''B'' of elements from an abelian group ''G'', :A + B = \, and the h-fold sumset of ''A'', :hA = \underset\,. Additive number theory The field is principally devoted to consideration of ''direct problems'' over (typically) the integers, that is, determining the structure of ''hA'' from the structure of ''A'': for example, determining which elements can be represented as a sum from ''hA'', where ''A'' is a fixed subset.Nathanson (1996) II:1 Two classical problems of this type are the Goldbach conjecture (which is the conjecture that 2 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Supremum
In mathematics, the infimum (abbreviated inf; plural infima) of a subset S of a partially ordered set P is a greatest element in P that is less than or equal to each element of S, if such an element exists. Consequently, the term ''greatest lower bound'' (abbreviated as ) is also commonly used. The supremum (abbreviated sup; plural suprema) of a subset S of a partially ordered set P is the least element in P that is greater than or equal to each element of S, if such an element exists. Consequently, the supremum is also referred to as the ''least upper bound'' (or ). The infimum is in a precise sense dual to the concept of a supremum. Infima and suprema of real numbers are common special cases that are important in analysis, and especially in Lebesgue integration. However, the general definitions remain valid in the more abstract setting of order theory where arbitrary partially ordered sets are considered. The concepts of infimum and supremum are close to minimum and max ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Journal Of The London Mathematical Society
The London Mathematical Society (LMS) is one of the United Kingdom's learned societies for mathematics (the others being the Royal Statistical Society (RSS), the Institute of Mathematics and its Applications (IMA), the Edinburgh Mathematical Society and the Operational Research Society (ORS). History The Society was established on 16 January 1865, the first president being Augustus De Morgan. The earliest meetings were held in University College, but the Society soon moved into Burlington House, Piccadilly. The initial activities of the Society included talks and publication of a journal. The LMS was used as a model for the establishment of the American Mathematical Society in 1888. Mary Cartwright was the first woman to be President of the LMS (in 1961–62). The Society was granted a royal charter in 1965, a century after its foundation. In 1998 the Society moved from rooms in Burlington House into De Morgan House (named after the society's first president), at 57–5 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Proceedings Of The American Mathematical Society
''Proceedings of the American Mathematical Society'' is a monthly peer-reviewed scientific journal of mathematics published by the American Mathematical Society. As a requirement, all articles must be at most 15 printed pages. According to the ''Journal Citation Reports'', the journal has a 2018 impact factor of 0.813. Scope ''Proceedings of the American Mathematical Society'' publishes articles from all areas of pure and applied mathematics, including topology, geometry, analysis, algebra, number theory, combinatorics, logic, probability and statistics. Abstracting and indexing This journal is indexed in the following databases: 2011. American Mathematical Society. * |
Henry Mann
Henry Berthold Mann (27 October 1905, Vienna – 1 February 2000, Tucson) was a professor of mathematics and statistics at the Ohio State University. Mann proved the Schnirelmann-Landau conjecture in number theory, and as a result earned the 1946 Cole Prize. He and his student developed the ("Mann-Whitney") ''U''-statistic of nonparametric statistics. (The web-link is to a slightly updated edition of the biography.) Mann published the first mathematical book on the design of experiments: . Early life of a number theorist Born in Vienna, Austria-Hungary, to a Jewish family, Mann earned his Ph.D. degree in mathematics in 1935 from the University of Vienna under the supervision of Philipp Furtwängler. Mann immigrated to the United States in 1938, and lived in New York, supporting himself by tutoring students. In additive number theory, Mann proved the Schnirelmann–Landau conjecture on the asymptotic density of sumsets in 1942. By doing so he established Mann's theorem and earne ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Schnirelmann Density
In additive number theory, the Schnirelmann density of a sequence of numbers is a way to measure how "dense" the sequence is. It is named after Russian mathematician Lev Schnirelmann, who was the first to study it.Schnirelmann, L.G. (1930).On the additive properties of numbers, first published in "Proceedings of the Don Polytechnic Institute in Novocherkassk" (in Russian), vol XIV (1930), pp. 3-27, and reprinted in "Uspekhi Matematicheskikh Nauk" (in Russian), 1939, no. 6, 9–25.Schnirelmann, L.G. (1933). First published asÜber additive Eigenschaften von Zahlen in "Mathematische Annalen" (in German), vol 107 (1933), 649-690, and reprinted asOn the additive properties of numbers in "Uspekhin. Matematicheskikh Nauk" (in Russian), 1940, no. 7, 7–46. Definition The Schnirelmann density of a set of natural numbers ''A'' is defined as :\sigma A = \inf_n \frac, where ''A''(''n'') denotes the number of elements of ''A'' not exceeding ''n'' and inf is infimum.Nathanson (1996) pp.191–19 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lev Schnirelmann
Lev Genrikhovich Schnirelmann (also Shnirelman, Shnirel'man; ; 2 January 1905 – 24 September 1938) was a Soviet mathematician who worked on number theory, topology and differential geometry. Work Schnirelmann sought to prove Goldbach's conjecture. In 1930, using the Brun sieve, he proved that any natural number greater than 1 can be written as the sum of not more than ''C'' prime numbers, where ''C'' is an effectively computable constant. His other fundamental work is joint with Lazar Lyusternik. Together, they developed the ''Lusternik–Schnirelmann category'', as it is called now, based on the previous work by Henri Poincaré, George David Birkhoff, and Marston Morse. The theory gives a global invariant of spaces, and has led to advances in differential geometry and topology. They also proved the theorem of the three geodesics, that a Riemannian manifold topologically equivalent to a sphere has at least three simple closed geodesics. Biography Schnirelmann graduated from ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Erdős–Tetali Theorem
In additive number theory, an area of mathematics, the Erdős–Tetali theorem is an existence theorem concerning economical additive bases of every order. More specifically, it states that for every fixed integer h \geq 2, there exists a subset of the natural numbers \mathcal \subseteq \mathbb satisfying r_(n) \asymp \log n, where r_(n) denotes the number of ways that a natural number ''n'' can be expressed as the sum of ''h'' elements of ''B''. The theorem is named after Paul Erdős and Prasad V. Tetali, who published it in 1990. Motivation The original motivation for this result is attributed to a problem posed by S. Sidon in 1932 on ''economical bases''. An additive basis \mathcal\subseteq\mathbb is called ''economical'' (or sometimes ''thin'') when it is an additive basis of order ''h'' and :r_(n) \ll_ n^\varepsilon for every \varepsilon > 0. In other words, these are additive bases that use as few numbers as possible to represent a given ''n'', and yet represent every na ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Linear Function
In mathematics, the term linear function refers to two distinct but related notions: * In calculus and related areas, a linear function is a function (mathematics), function whose graph of a function, graph is a straight line, that is, a polynomial function of polynomial degree, degree zero or one. For distinguishing such a linear function from the other concept, the term Affine transformation, affine function is often used. * In linear algebra, mathematical analysis, and functional analysis, a linear function is a linear map. As a polynomial function In calculus, analytic geometry and related areas, a linear function is a polynomial of degree one or less, including the zero polynomial (the latter not being considered to have degree zero). When the function is of only one variable (mathematics), variable, it is of the form :f(x)=ax+b, where and are constant (mathematics), constants, often real numbers. The graph of a function, graph of such a function of one variable is a n ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Erdős–Fuchs Theorem
In mathematics, in the area of additive number theory, the Erdős–Fuchs theorem is a statement about the number of ways that numbers can be represented as a sum of elements of a given additive basis, stating that the average order of this number cannot be too close to being a linear function. The theorem is named after Paul Erdős and Wolfgang Heinrich Johannes Fuchs, who published it in 1956. Statement Let \mathcal\subseteq\mathbb be an infinite subset of the natural numbers and r_(n) its ''representation function'', which denotes the number of ways that a natural number n can be expressed as the sum of h elements of \mathcal (taking order into account). We then consider the ''accumulated representation function'' s_(x) := \sum_ r_(n), which counts (also taking order into account) the number of solutions to k_1 + \cdots + k_h \leqslant x, where k_1,\ldots,k_h \in \mathcal. The theorem then states that, for any given c>0, the relation s_(n) = cn + o\left(n^\log(n)^ \right) c ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Erdős–Turán Conjecture On Additive Bases
The Erdős–Turán conjecture is an old unsolved problem in additive number theory (not to be confused with Erdős conjecture on arithmetic progressions) posed by Paul Erdős and Pál Turán in 1941. The question concerns subsets of the natural numbers, typically denoted by \mathbb , called additive bases. A subset B is called an (asymptotic) additive basis of finite order if there is some positive integer h such that every sufficiently large natural number n can be written as the sum of at most h elements of B. For example, the natural numbers are themselves an additive basis of order 1, since every natural number is trivially a sum of at most one natural number. Lagrange's four-square theorem says that the set of positive square numbers is an additive basis of order 4. Another highly non-trivial and celebrated result along these lines is Vinogradov's theorem. One is naturally inclined to ask whether these results are optimal. It turns out that Lagrange's four-square theorem ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Natural Number
In mathematics, the natural numbers are those numbers used for counting (as in "there are ''six'' coins on the table") and ordering (as in "this is the ''third'' largest city in the country"). Numbers used for counting are called ''Cardinal number, cardinal numbers'', and numbers used for ordering are called ''Ordinal number, ordinal numbers''. Natural numbers are sometimes used as labels, known as ''nominal numbers'', having none of the properties of numbers in a mathematical sense (e.g. sports Number (sports), jersey numbers). Some definitions, including the standard ISO/IEC 80000, ISO 80000-2, begin the natural numbers with , corresponding to the non-negative integers , whereas others start with , corresponding to the positive integers Texts that exclude zero from the natural numbers sometimes refer to the natural numbers together with zero as the whole numbers, while in other writings, that term is used instead for the integers (including negative integers). The natural ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
