Concept
Root of unity
Related concepts (74)
Quantum Fourier transform
In quantum computing, the quantum Fourier transform (QFT) is a linear transformation on quantum bits, and is the quantum analogue of the discrete Fourier transform. The quantum Fourier transform is a part of many quantum algorithms, notably Shor's algorithm for factoring and computing the discrete logarithm, the quantum phase estimation algorithm for estimating the eigenvalues of a unitary operator, and algorithms for the hidden subgroup problem. The quantum Fourier transform was discovered by Don Coppersmith.
Square root of 3
The square root of 3 is the positive real number that, when multiplied by itself, gives the number 3. It is denoted mathematically as or . It is more precisely called the principal square root of 3 to distinguish it from the negative number with the same property. The square root of 3 is an irrational number. It is also known as Theodorus' constant, after Theodorus of Cyrene, who proved its irrationality. its numerical value in decimal notation had been computed to at least ten billion digits.
Square root of 5
The square root of 5 is the positive real number that, when multiplied by itself, gives the prime number 5. It is more precisely called the principal square root of 5, to distinguish it from the negative number with the same property. This number appears in the fractional expression for the golden ratio. It can be denoted in surd form as: It is an irrational algebraic number. The first sixty significant digits of its decimal expansion are: 2.23606 79774 99789 69640 91736 68731 27623 54406 18359 61152 57242 7089.
Kummer theory
In abstract algebra and number theory, Kummer theory provides a description of certain types of field extensions involving the adjunction of nth roots of elements of the base field. The theory was originally developed by Ernst Eduard Kummer around the 1840s in his pioneering work on Fermat's Last Theorem. The main statements do not depend on the nature of the field – apart from its characteristic, which should not divide the integer n – and therefore belong to abstract algebra.
Generator (mathematics)
In mathematics and physics, the term generator or generating set may refer to any of a number of related concepts. The underlying concept in each case is that of a smaller set of objects, together with a set of operations that can be applied to it, that result in the creation of a larger collection of objects, called the generated set. The larger set is then said to be generated by the smaller set. It is commonly the case that the generating set has a simpler set of properties than the generated set, thus making it easier to discuss and examine.
Resolvent (Galois theory)
In Galois theory, a discipline within the field of abstract algebra, a resolvent for a permutation group G is a polynomial whose coefficients depend polynomially on the coefficients of a given polynomial p and has, roughly speaking, a rational root if and only if the Galois group of p is included in G. More exactly, if the Galois group is included in G, then the resolvent has a rational root, and the converse is true if the rational root is a simple root. Resolvents were introduced by Joseph Louis Lagrange and systematically used by Évariste Galois.
Fundamental unit (number theory)
In algebraic number theory, a fundamental unit is a generator (modulo the roots of unity) for the unit group of the ring of integers of a number field, when that group has rank 1 (i.e. when the unit group modulo its torsion subgroup is infinite cyclic). Dirichlet's unit theorem shows that the unit group has rank 1 exactly when the number field is a real quadratic field, a complex cubic field, or a totally imaginary quartic field. When the unit group has rank ≥ 1, a basis of it modulo its torsion is called a fundamental system of units.
Heptadecagon
In geometry, a heptadecagon, septadecagon or 17-gon is a seventeen-sided polygon. A regular heptadecagon is represented by the Schläfli symbol {17}. As 17 is a Fermat prime, the regular heptadecagon is a constructible polygon (that is, one that can be constructed using a compass and unmarked straightedge): this was shown by Carl Friedrich Gauss in 1796 at the age of 19. This proof represented the first progress in regular polygon construction in over 2000 years.
Vieta's formulas
In mathematics, Vieta's formulas relate the coefficients of a polynomial to sums and products of its roots. They are named after François Viète (more commonly referred to by the Latinised form of his name, "Franciscus Vieta"). Any general polynomial of degree n (with the coefficients being real or complex numbers and an ≠ 0) has n (not necessarily distinct) complex roots r1, r2, ..., rn by the fundamental theorem of algebra. Vieta's formulas relate the polynomial's coefficients to signed sums of products of the roots r1, r2, .
Discrete Fourier transform over a ring
In mathematics, the discrete Fourier transform over a ring generalizes the discrete Fourier transform (DFT), of a function whose values are commonly complex numbers, over an arbitrary ring. Let R be any ring, let be an integer, and let be a principal nth root of unity, defined by: The discrete Fourier transform maps an n-tuple of elements of R to another n-tuple of elements of R according to the following formula: By convention, the tuple is said to be in the time domain and the index j is called time.