|
Additive Polynomial
In mathematics, the additive polynomials are an important topic in classical algebraic number theory. Definition Let ''k'' be a field of prime characteristic ''p''. A polynomial ''P''(''x'') with coefficients in ''k'' is called an additive polynomial, or a Frobenius polynomial, if :P(a+b)=P(a)+P(b)\, as polynomials in ''a'' and ''b''. It is equivalent to assume that this equality holds for all ''a'' and ''b'' in some infinite field containing ''k'', such as its algebraic closure. Occasionally absolutely additive is used for the condition above, and additive is used for the weaker condition that ''P''(''a'' + ''b'') = ''P''(''a'') + ''P''(''b'') for all ''a'' and ''b'' in the field. For infinite fields the conditions are equivalent, but for finite fields they are not, and the weaker condition is the "wrong" as it does not behave well. For example, over a field of order ''q'' any multiple ''P'' of ''x''''q'' − ''x'' will satisfy ''P''(''a''&nbs ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics with the major subdisciplines of number theory, algebra, geometry, and analysis, respectively. There is no general consensus among mathematicians about a common definition for their academic discipline. Most mathematical activity involves the discovery of properties of abstract objects and the use of pure reason to prove them. These objects consist of either abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of deductive rules to already established results. These results include previously proved theorems, axioms, andin case of abstraction from naturesome basic properties that are considered true starting points of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ring (mathematics)
In mathematics, rings are algebraic structures that generalize fields: multiplication need not be commutative and multiplicative inverses need not exist. In other words, a ''ring'' is a set equipped with two binary operations satisfying properties analogous to those of addition and multiplication of integers. Ring elements may be numbers such as integers or complex numbers, but they may also be non-numerical objects such as polynomials, square matrices, functions, and power series. Formally, a ''ring'' is an abelian group whose operation is called ''addition'', with a second binary operation called ''multiplication'' that is associative, is distributive over the addition operation, and has a multiplicative identity element. (Some authors use the term " " with a missing i to refer to the more general structure that omits this last requirement; see .) Whether a ring is commutative (that is, whether the order in which two elements are multiplied might change the result) has ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Algebraic Number Theory
Algebraic number theory is a branch of number theory that uses the techniques of abstract algebra to study the integers, rational numbers, and their generalizations. Number-theoretic questions are expressed in terms of properties of algebraic objects such as algebraic number fields and their rings of integers, finite fields, and Algebraic function field, function fields. These properties, such as whether a ring (mathematics), ring admits unique factorization, the behavior of ideal (ring theory), ideals, and the Galois groups of field (mathematics), fields, can resolve questions of primary importance in number theory, like the existence of solutions to Diophantine equations. History of algebraic number theory Diophantus The beginnings of algebraic number theory can be traced to Diophantine equations, named after the 3rd-century Alexandrian mathematician, Diophantus, who studied them and developed methods for the solution of some kinds of Diophantine equations. A typical Diophantin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
David Goss
David Mark Goss (April 20, 1952 – April 4, 2017) was a mathematician, a professor in the department of mathematics at Ohio State University,OSU Faculty Profile . and the editor-in-chief of the . He received his B.S. in mathematics in 1973 from and his Ph.D. in 1977 from under the supervision of |
Additive Map
In algebra, an additive map, Z-linear map or additive function is a function f that preserves the addition operation: f(x + y) = f(x) + f(y) for every pair of elements x and y in the domain of f. For example, any linear map is additive. When the domain is the real numbers, this is Cauchy's functional equation. For a specific case of this definition, see additive polynomial. More formally, an additive map is a \Z-module homomorphism. Since an abelian group is a \Z-module, it may be defined as a group homomorphism between abelian groups. A map V \times W \to X that is additive in each of two arguments separately is called a bi-additive map or a \Z-bilinear map. Examples Typical examples include maps between rings, vector spaces, or modules that preserve the additive group. An additive map does not necessarily preserve any other structure of the object; for example, the product operation of a ring. If f and g are additive maps, then the map f + g (defined pointwise) is additiv ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Drinfeld Module
In mathematics, a Drinfeld module (or elliptic module) is roughly a special kind of module over a ring of functions on a curve over a finite field, generalizing the Carlitz module. Loosely speaking, they provide a function field analogue of complex multiplication theory. A shtuka (also called F-sheaf or chtouca) is a sort of generalization of a Drinfeld module, consisting roughly of a vector bundle over a curve, together with some extra structure identifying a "Frobenius twist" of the bundle with a "modification" of it. Drinfeld modules were introduced by , who used them to prove the Langlands conjectures for GL2 of an algebraic function field in some special cases. He later invented shtukas and used shtukas of rank 2 to prove the remaining cases of the Langlands conjectures for GL2. Laurent Lafforgue proved the Langlands conjectures for GL''n'' of a function field by studying the moduli stack of shtukas of rank ''n''. "Shtuka" is a Russian word штука meaning "a single copy ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Group (mathematics)
In mathematics, a group is a Set (mathematics), set and an Binary operation, operation that combines any two Element (mathematics), elements of the set to produce a third element of the set, in such a way that the operation is Associative property, associative, an identity element exists and every element has an Inverse element, inverse. These three axioms hold for Number#Main classification, number systems and many other mathematical structures. For example, the integers together with the addition operation form a group. The concept of a group and the axioms that define it were elaborated for handling, in a unified way, essential structural properties of very different mathematical entities such as numbers, geometric shapes and polynomial roots. Because the concept of groups is ubiquitous in numerous areas both within and outside mathematics, some authors consider it as a central organizing principle of contemporary mathematics. In geometry groups arise naturally in the study of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
If And Only If
In logic and related fields such as mathematics and philosophy, "if and only if" (shortened as "iff") is a biconditional logical connective between statements, where either both statements are true or both are false. The connective is biconditional (a statement of material equivalence), and can be likened to the standard material conditional ("only if", equal to "if ... then") combined with its reverse ("if"); hence the name. The result is that the truth of either one of the connected statements requires the truth of the other (i.e. either both statements are true, or both are false), though it is controversial whether the connective thus defined is properly rendered by the English "if and only if"—with its pre-existing meaning. For example, ''P if and only if Q'' means that ''P'' is true whenever ''Q'' is true, and the only case in which ''P'' is true is if ''Q'' is also true, whereas in the case of ''P if Q'', there could be other scenarios where ''P'' is true and ''Q'' is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Separable Polynomial
In mathematics, a polynomial ''P''(''X'') over a given field ''K'' is separable if its roots are distinct in an algebraic closure of ''K'', that is, the number of distinct roots is equal to the degree of the polynomial. This concept is closely related to square-free polynomial. If ''K'' is a perfect field then the two concepts coincide. In general, ''P''(''X'') is separable if and only if it is square-free over any field that contains ''K'', which holds if and only if ''P''(''X'') is coprime to its formal derivative ''D'' ''P''(''X''). Older definition In an older definition, ''P''(''X'') was considered separable if each of its irreducible factors in ''K'' 'X''is separable in the modern definition.N. Jacobson, Basic Algebra I, p. 233 In this definition, separability depended on the field ''K''; for example, any polynomial over a perfect field would have been considered separable. This definition, although it can be convenient for Galois theory, is no longer in use. Separabl ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Root Of A Function
In mathematics, a zero (also sometimes called a root) of a real-, complex-, or generally vector-valued function f, is a member x of the domain of f such that f(x) ''vanishes'' at x; that is, the function f attains the value of 0 at x, or equivalently, x is the solution to the equation f(x) = 0. A "zero" of a function is thus an input value that produces an output of 0. A root of a polynomial is a zero of the corresponding polynomial function. The fundamental theorem of algebra shows that any non-zero polynomial has a number of roots at most equal to its degree, and that the number of roots and the degree are equal when one considers the complex roots (or more generally, the roots in an algebraically closed extension) counted with their multiplicities. For example, the polynomial f of degree two, defined by f(x)=x^2-5x+6 has the two roots (or zeros) that are 2 and 3. f(2)=2^2-5\times 2+6= 0\textf(3)=3^2-5\times 3+6=0. If the function maps real numbers to real numbers, then it ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Modular Arithmetic
In mathematics, modular arithmetic is a system of arithmetic for integers, where numbers "wrap around" when reaching a certain value, called the modulus. The modern approach to modular arithmetic was developed by Carl Friedrich Gauss in his book ''Disquisitiones Arithmeticae'', published in 1801. A familiar use of modular arithmetic is in the 12-hour clock, in which the day is divided into two 12-hour periods. If the time is 7:00 now, then 8 hours later it will be 3:00. Simple addition would result in , but clocks "wrap around" every 12 hours. Because the hour number starts over at zero when it reaches 12, this is arithmetic ''modulo'' 12. In terms of the definition below, 15 is ''congruent'' to 3 modulo 12, so "15:00" on a 24-hour clock is displayed "3:00" on a 12-hour clock. Congruence Given an integer , called a modulus, two integers and are said to be congruent modulo , if is a divisor of their difference (that is, if there is an integer such that ). Congruence modulo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Commutative Ring
In mathematics, a commutative ring is a ring in which the multiplication operation is commutative. The study of commutative rings is called commutative algebra. Complementarily, noncommutative algebra is the study of ring properties that are not specific to commutative rings. This distinction results from the high number of fundamental properties of commutative rings that do not extend to noncommutative rings. Definition and first examples Definition A ''ring'' is a set R equipped with two binary operations, i.e. operations combining any two elements of the ring to a third. They are called ''addition'' and ''multiplication'' and commonly denoted by "+" and "\cdot"; e.g. a+b and a \cdot b. To form a ring these two operations have to satisfy a number of properties: the ring has to be an abelian group under addition as well as a monoid under multiplication, where multiplication distributes over addition; i.e., a \cdot \left(b + c\right) = \left(a \cdot b\right) + \left(a \cdot ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
