|
Gauss Sum
In algebraic number theory, a Gauss sum or Gaussian sum is a particular kind of finite sum of roots of unity, typically :G(\chi) := G(\chi, \psi)= \sum \chi(r)\cdot \psi(r) where the sum is over elements of some finite commutative ring , is a group homomorphism of the additive group into the unit circle, and is a group homomorphism of the unit group into the unit circle, extended to non-unit , where it takes the value 0. Gauss sums are the analogues for finite fields of the Gamma function. Such sums are ubiquitous in number theory. They occur, for example, in the functional equations of Dirichlet -functions, where for a Dirichlet character the equation relating and ) (where is the complex conjugate of ) involves a factor :\frac. History The case originally considered by Carl Friedrich Gauss was the quadratic Gauss sum, for the field of residues modulo a prime number , and the Legendre symbol. In this case Gauss proved that or for congruent to 1 or 3 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
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 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 Diophantine problem is to find two in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Modular Arithmetic
In mathematics, modular arithmetic is a system of arithmetic operations for integers, other than the usual ones from elementary arithmetic, 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 example of modular arithmetic is the hour hand on a 12-hour clock. If the hour hand points to 7 now, then 8 hours later it will point to 3. Ordinary addition would result in , but 15 reads as 3 on the clock face. This is because the hour hand makes one rotation every 12 hours and the hour number starts over when the hour hand passes 12. We say that 15 is ''congruent'' to 3 modulo 12, written 15 ≡ 3 (mod 12), so that 7 + 8 ≡ 3 (mod 12). Similarly, if one starts at 12 and waits 8 hours, the hour hand will be at 8. If one instead waited twice as long, 16 hours, the hour hand would be on 4. This ca ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Möbius Function
The Möbius function \mu(n) is a multiplicative function in number theory introduced by the German mathematician August Ferdinand Möbius (also transliterated ''Moebius'') in 1832. It is ubiquitous in elementary and analytic number theory and most often appears as part of its namesake the Möbius inversion formula. Following work of Gian-Carlo Rota in the 1960s, generalizations of the Möbius function were introduced into combinatorics, and are similarly denoted \mu(x). Definition The Möbius function is defined by :\mu(n) = \begin 1 & \text n = 1 \\ (-1)^k & \text n \text k \text \\ 0 & \text n \text > 1 \end The Möbius function can alternatively be represented as : \mu(n) = \delta_ \lambda(n), where \delta_ is the Kronecker delta, \lambda(n) is the Liouville function, Prime omega function, \omega(n) is the number of distinct prime divisors of n, and Prime omega function, \Omega(n) is the number of prime factors of n, counted with multiplicity. Another characterization ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Conductor Of A Dirichlet Character
In analytic number theory and related branches of mathematics, a complex-valued arithmetic function \chi: \mathbb\rightarrow\mathbb is a Dirichlet character of modulus m (where m is a positive integer) if for all integers a and b: # \chi(ab) = \chi(a)\chi(b); that is, \chi is completely multiplicative. # \chi(a) \begin =0 &\text \gcd(a,m)>1\\ \ne 0&\text\gcd(a,m)=1. \end (gcd is the greatest common divisor) # \chi(a + m) = \chi(a); that is, \chi is periodic with period m. The simplest possible character, called the principal character, usually denoted \chi_0, (see Notation below) exists for all moduli: : \chi_0(a)= \begin 0 &\text \gcd(a,m)>1\\ 1 &\text \gcd(a,m)=1. \end The German mathematician Peter Gustav Lejeune Dirichlet—for whom the character is named—introduced these functions in his 1837 paper on primes in arithmetic progressions. Notation \phi(n) is Euler's totient function. \zeta_n is a complex primitive n-th root of unity: : \zeta_n^n=1, but \zeta_n\ne 1, \zet ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Kummer Sum
In mathematics, Kummer sum is the name given to certain cubic Gauss sums for a prime modulus ''p'', with ''p'' congruent to 1 modulo 3. They are named after Ernst Kummer, who made a conjecture about the statistical properties of their arguments, as complex numbers. These sums were known and used before Kummer, in the theory of cyclotomy. Definition A Kummer sum is therefore a finite sum :\sum \chi(r)e(r/p) = G(\chi) taken over ''r'' modulo ''p'', where χ is a Dirichlet character In analytic number theory and related branches of mathematics, a complex-valued arithmetic function \chi: \mathbb\rightarrow\mathbb is a Dirichlet character of modulus m (where m is a positive integer) if for all integers a and b: # \chi(ab) = \ch ... taking values in the cube roots of unity, and where ''e''(''x'') is the exponential function exp(2π''ix''). Given ''p'' of the required form, there are two such characters, together with the trivial character. The cubic exponential sum ''K''(''n'',''p'' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Plancherel's Theorem
In mathematics, the Plancherel theorem (sometimes called the Parseval–Plancherel identity) is a result in harmonic analysis, proven by Michel Plancherel in 1910. It is a generalization of Parseval's theorem; often used in the fields of science and engineering, proving the unitarity of the Fourier transform. The theorem states that the integral of a function's squared modulus is equal to the integral of the squared modulus of its frequency spectrum. That is, if f(x) is a function on the real line, and \widehat(\xi) is its frequency spectrum, then Formal definition The Fourier transform of an ''L''''1'' function f on the real line \mathbb R is defined as the Lebesgue integral \hat f(\xi) = \int_ f(x)e^dx. If f belongs to both L^1 and L^2, then the Plancherel theorem states that \hat f also belongs to L^2, and the Fourier transform is an isometry with respect to the ''L''2 norm, which is to say that \int_^\infty , f(x), ^2 \, dx = \int_^\infty , \widehat(\xi), ^2 \, d\xi Thi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Gaussian Period
In mathematics, in the area of number theory, a Gaussian period is a certain kind of sum of root of unity, roots of unity. The periods permit explicit calculations in cyclotomic fields connected with Galois theory and with harmonic analysis (discrete Fourier transform). They are basic in the classical theory called cyclotomy. Closely related is the Gauss sum, a type of exponential sum which is a linear combination of periods. History As the name suggests, the periods were introduced by Carl Friedrich Gauss, Gauss and were the basis for his theory of compass and straightedge construction. For example, the construction of the heptadecagon (a formula that furthered his reputation) depended on the algebra of such periods, of which : 2 \cos \left(\frac\right) = \zeta + \zeta^ \, is an example involving the seventeenth root of unity : \zeta = \exp \left(\frac\right). General definition Given an integer ''n'' > 1, let ''H'' be any subgroup of the multiplicative group : G = (\mathb ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Cyclotomic Field
In algebraic number theory, a cyclotomic field is a number field obtained by adjoining a complex root of unity to \Q, the field of rational numbers. Cyclotomic fields played a crucial role in the development of modern algebra and number theory because of their relation with Fermat's Last Theorem. It was in the process of his deep investigations of the arithmetic of these fields (for prime n)—and more precisely, because of the failure of unique factorization in their rings of integers—that Ernst Kummer first introduced the concept of an ideal number and proved his celebrated congruences. Definition For n \geq 1, let :\zeta_n=e^\in\C. This is a primitive nth root of unity. Then the nth cyclotomic field is the field extension \mathbb(\zeta_n) of \mathbb generated by \zeta_n. Properties * The nth cyclotomic polynomial :: \Phi_n(x) = \prod_\stackrel\!\!\! \left(x-e^\right) = \prod_\stackrel\!\!\! (x-^k) :is irreducible, so it is the minimal polynomial of \zeta_n o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Prime Decomposition
In mathematics, integer factorization is the decomposition of a positive integer into a product of integers. Every positive integer greater than 1 is either the product of two or more integer factors greater than 1, in which case it is a composite number, or it is not, in which case it is a prime number. For example, is a composite number because , but is a prime number because it cannot be decomposed in this way. If one of the factors is composite, it can in turn be written as a product of smaller factors, for example . Continuing this process until every factor is prime is called prime factorization; the result is always unique up to the order of the factors by the prime factorization theorem. To factorize a small integer using mental or pen-and-paper arithmetic, the simplest method is trial division: checking if the number is divisible by prime numbers , , , and so on, up to the square root of . For larger numbers, especially when using a computer, various more sophisti ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Jacobi Sum
In mathematics, a Jacobi sum is a type of character sum formed with Dirichlet characters. Simple examples would be Jacobi sums ''J''(''χ'', ''ψ'') for Dirichlet characters ''χ'', ''ψ'' modulo a prime number ''p'', defined by : J(\chi,\psi) = \sum \chi(a) \psi(1 - a) \,, where the summation runs over all residues (for which neither ''a'' nor is 0). Jacobi sums are the analogues for finite fields of the beta function. Such sums were introduced by C. G. J. Jacobi early in the nineteenth century in connection with the theory of cyclotomy. Jacobi sums ''J'' can be factored generically into products of powers of Gauss sums ''g''. For example, when the character ''χψ'' is nontrivial, : J(\chi, \psi) = \frac\,, analogous to the formula for the beta function in terms of gamma functions. Since the nontrivial Gauss sums ''g'' have absolute value ''p'', it follows that also has absolute value ''p'' when the characters ''χψ'', ''χ'', ''ψ'' are nontrivial. Jacobi sums ''J'' li ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Theta Function
In mathematics, theta functions are special functions of several complex variables. They show up in many topics, including Abelian varieties, moduli spaces, quadratic forms, and solitons. Theta functions are parametrized by points in a tube domain inside a complex Lagrangian Grassmannian, namely the Siegel upper half space. The most common form of theta function is that occurring in the theory of elliptic functions. With respect to one of the complex variables (conventionally called ), a theta function has a property expressing its behavior with respect to the addition of a period of the associated elliptic functions, making it a quasiperiodic function. In the abstract theory this quasiperiodicity comes from the cohomology class of a line bundle on a complex torus, a condition of descent. One interpretation of theta functions when dealing with the heat equation is that "a theta function is a special function that describes the evolution of temperature on a segment do ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
