Find link

language:

jump to random article

Find link is a tool written by Edward Betts.

Longer titles found: Root of unity modulo n (view), Principal root of unity (view)

searching for Root of unity 65 found (206 total)

alternate case: root of unity

Quantum group (4,983 words) [view diff] no match in snippet view article find links to article

In mathematics and theoretical physics, the term quantum group denotes one of a few different kinds of noncommutative algebras with additional structure
Abelian extension (340 words) [view diff] exact match in snippet view article find links to article
definition, is always abelian. If a field K contains a primitive n-th root of unity and the n-th root of an element of K is adjoined, the resulting Kummer
Schönhage–Strassen algorithm (4,601 words) [view diff] exact match in snippet view article find links to article
, and so g {\displaystyle g} is a primitive D {\displaystyle D} th root of unity modulo 2 n ′ + 1 {\displaystyle 2^{n'}+1} . We now take the discrete
P-adic exponential function (772 words) [view diff] exact match in snippet view article find links to article
of C × p  can be written as w = pr·ζ·z with r a rational number, ζ a root of unity, and |z − 1|p < 1, in which case logp(w) = logp(z). This function on
Butson-type Hadamard matrix (603 words) [view diff] exact match in snippet view article find links to article
belongs to the Butson-type H(q, N) if all its elements are powers of q-th root of unity, ( H j k ) q = 1 for j , k = 1 , 2 , … , N . {\displaystyle (H_{jk})^{q}=1\quad
Okubo algebra (830 words) [view diff] exact match in snippet view article find links to article
alternative separable algebra over a field containing a primitive cube root of unity. An Okubo algebra is an algebra constructed in this way from the trace-zero
Rational reciprocity law (294 words) [view diff] exact match in snippet view article find links to article
symbols that are related by a factor of +1 or –1 rather than a general root of unity. As an example, there are rational biquadratic and octic reciprocity
Lehmer's conjecture (1,981 words) [view diff] exact match in snippet view article find links to article
(Equivalently, every complex root of P ( x ) {\displaystyle P(x)} is a root of unity or zero.) There are a number of definitions of the Mahler measure, one
Projective unitary group (2,310 words) [view diff] exact match in snippet view article find links to article
one), because SU(n) still contains elements eiθI where eiθ is an n-th root of unity (since then det(eiθI) = eiθn = 1). Abstractly, given a Hermitian space
Exact trigonometric values (3,272 words) [view diff] exact match in snippet view article find links to article
Since the root of unity is a root of the polynomial xn − 1, it is algebraic. Since the trigonometric number is the average of the root of unity and its
Brauer group (2,943 words) [view diff] exact match in snippet view article find links to article
field in which n is invertible such that K contains a primitive nth root of unity ζ. For nonzero elements a and b of K, the associated cyclic algebra
Quadratic residue code (891 words) [view diff] exact match in snippet view article find links to article
and ζ {\displaystyle \zeta } is a primitive p {\displaystyle p} th root of unity in some finite extension field of G F ( l ) {\displaystyle GF(l)} .
Automorphism (1,330 words) [view diff] exact match in snippet view article find links to article
automorphism, writing: so that μ {\displaystyle \mu } is a new fifth root of unity, connected with the former fifth root λ {\displaystyle \lambda } by
List of finite-dimensional Nichols algebras (1,993 words) [view diff] exact match in snippet view article find links to article
{g}})^{+}} of the infinite-dimensional quantum groups when q is no root of unity, and the first examples of finite-dimensional Nichols algebras are the
Supersingular elliptic curve (2,234 words) [view diff] exact match in snippet view article find links to article
+ 1 = 0 {\displaystyle \omega ^{2}+\omega +1=0} is a primitive cube root of unity. Its group of automorphisms is the group of units of the Hurwitz quaternions
Volume conjecture (490 words) [view diff] exact match in snippet view article find links to article
on the theory of quantum dilogarithms at the N {\displaystyle N} -th root of unity, q = exp ⁡ ( 2 π i / N ) {\displaystyle q=\exp {(2\pi i/N)}} . Murakami
Omega (1,692 words) [view diff] exact match in snippet view article find links to article
uncountable ordinal number (also sometimes written as Ω) A primitive root of unity, like the complex cube roots of 1 The Wright Omega function A generic
Explicit reciprocity law (967 words) [view diff] exact match in snippet view article find links to article
field is the (cyclotomic) extension of the p-adic numbers by a pnth root of unity. Iwasawa (1968) extended the formula of Artin and Hasse to more cases
Reshetikhin–Turaev invariant (1,665 words) [view diff] exact match in snippet view article find links to article
t} to be either a 2 r {\displaystyle 2r} -th root of unity or an r {\displaystyle r} -th root of unity with odd r {\displaystyle r} . Assume that M L
Reciprocity law (1,830 words) [view diff] exact match in snippet view article find links to article
-1}{4}}{\frac {N\theta -1}{4}}}.} Suppose that ζ is an l {\displaystyle l} th root of unity for some odd prime l {\displaystyle l} . The power character is the
Representation ring (849 words) [view diff] exact match in snippet view article find links to article
representation sending a generator of the group to a primitive nth root of unity. More generally, the complex representation ring of a finite abelian
Quadratic field (1,288 words) [view diff] exact match in snippet view article find links to article
the cyclotomic field generated by a primitive p {\displaystyle p} th root of unity, with p {\displaystyle p} an odd prime number. The uniqueness is a consequence
Multiplication algorithm (6,422 words) [view diff] exact match in snippet view article find links to article
achieved is to find N much less than 23k + 1, so that Z/NZ has a (2m)th root of unity. This speeds up computation and reduces the time complexity. However
Main conjecture of Iwasawa theory (1,102 words) [view diff] exact match in snippet view article find links to article
conjecture. p is a prime number. Fn is the field Q(ζ) where ζ is a root of unity of order pn+1. Γ is the largest subgroup of the absolute Galois group
Ramanujan's sum (5,735 words) [view diff] exact match in snippet view article find links to article
is the primitive second root of unity, and ζ 12 12 = 1 {\displaystyle \zeta _{12}^{12}=1} is the primitive first root of unity. Therefore, if η q ( n )
Bochner's theorem (1,214 words) [view diff] exact match in snippet view article find links to article
the "seasonal trends" of the series. For example, let z be an m-th root of unity (with the current identification, this is 1/m ∈ [0, 1]) and f be a random
Q-analog (1,369 words) [view diff] exact match in snippet view article find links to article
[citation needed] Let q = (e2πi/n)d be the d-th power of a primitive n-th root of unity. Let C be a cyclic group of order n generated by an element c. Let X
Topological quantum field theory (3,775 words) [view diff] exact match in snippet view article find links to article
the 3-sphere is just the value of the Jones polynomial for a suitable root of unity. The theory can be defined over the relevant cyclotomic field, see Atiyah
Ideal number (1,226 words) [view diff] exact match in snippet view article find links to article
use of the letter λ to represent a prime number, α to denote a λth root of unity, and his study of the factorization of prime number p ≡ 1 ( mod λ )
Wedderburn's little theorem (1,548 words) [view diff] exact match in snippet view article find links to article
{\displaystyle n>1} , we see that for each primitive n {\displaystyle n} -th root of unity ζ {\displaystyle \zeta } , | q − ζ | > | q − 1 | {\displaystyle |q-\zeta
Brauer's theorem on induced characters (1,057 words) [view diff] exact match in snippet view article find links to article
-combinations of irreducible characters, where ω is a primitive complex |G|-th root of unity). The set of integer combinations of characters induced from linear
P-group (2,753 words) [view diff] exact match in snippet view article find links to article
2n, but that requires a bit more setup. Let ζ denote a primitive pth root of unity in the complex numbers, let Z[ζ] be the ring of cyclotomic integers
Conductor (class field theory) (1,227 words) [view diff] exact match in snippet view article
_{n}\right)} , where ζ n {\displaystyle \zeta _{n}} denotes a primitive nth root of unity. If n is the smallest integer for which this holds, the conductor of
S. L. Huang (690 words) [view diff] case mismatch in snippet view article find links to article
(ebook ed.). self-published. pp. 1–314. ISBN 978-0996070041. —— (2015). Root of Unity (ebook ed.). self-published. ISBN 978-0996070065. —— (2016). Plastic
Cyclic code (5,114 words) [view diff] exact match in snippet view article find links to article
/n} ) is an n {\displaystyle n} th root of unity. Similarly in the finite field n {\displaystyle n} th root of unity is element ω {\displaystyle \omega
P-compact group (1,248 words) [view diff] exact match in snippet view article find links to article
order n, acting on Z p {\displaystyle \mathbb {Z} _{p}} via an nth root of unity.) Generalizing the rank 1 case, any finite complex reflection group
Cayley graph (4,690 words) [view diff] exact match in snippet view article find links to article
for ζ {\displaystyle \zeta } a primitive m t h {\displaystyle m^{th}} root of unity (where m {\displaystyle m} must be divisible by the orders of each x
Special unitary group (5,453 words) [view diff] exact match in snippet view article find links to article
/n\mathbb {Z} } , and is composed of the diagonal matrices ζ I for ζ an nth root of unity and I the n × n identity matrix. Its outer automorphism group for n
Wolfgang Soergel (495 words) [view diff] exact match in snippet view article find links to article
Jantzen: Representations of quantum groups at a p {\displaystyle p} -th root of unity and of semisimple groups in characteristic p {\displaystyle p} : independence
Regular prime (3,267 words) [view diff] exact match in snippet view article find links to article
number of the pth cyclotomic field Q(ζp), where ζp is a primitive pth root of unity. The prime number 2 is often considered regular as well. The class number
Mandelbrot set (7,513 words) [view diff] exact match in snippet view article find links to article
{\displaystyle q} . More specifically, for each primitive q {\displaystyle q} th root of unity r = e 2 π i p q {\displaystyle r=e^{2\pi i{\frac {p}{q}}}} (where 0
Local Langlands conjectures (2,041 words) [view diff] exact match in snippet view article find links to article
GL2(K) over the 2-adic numbers, and over local fields containing a cube root of unity. Kutzko (1980, 1980b) proved the local Langlands conjectures for the
Umbilical point (1,499 words) [view diff] exact match in snippet view article find links to article
{\displaystyle \left|\beta \right|=1} and β {\displaystyle \beta } is not a cube root of unity then the cubic form is a right-angled cubic form which play a special
Chebotarev's density theorem (2,077 words) [view diff] exact match in snippet view article find links to article
obtained from the field of rational numbers by adjoining a primitive root of unity of a given order. For example, the ordinary integer primes group into
Generalizations of Pauli matrices (2,766 words) [view diff] exact match in snippet view article find links to article
ω = exp ⁡ ( 2 π i / d ) {\displaystyle \omega =\exp(2\pi i/d)} , a root of unity. Since ω d = 1 {\displaystyle \omega ^{d}=1} and ω ≠ 1 {\displaystyle
Étale cohomology (5,016 words) [view diff] exact match in snippet view article find links to article
than the Zariski topology is essential. By fixing a primitive n-th root of unity we can identify the group Z/nZ with the group μn of n-th roots of unity
Iwahori–Hecke algebra (2,051 words) [view diff] exact match in snippet view article find links to article
algebras and detailed understanding of their representations (for q not a root of unity). Modular representations of Hecke algebras and representations at roots
Bloch's theorem (6,051 words) [view diff] exact match in snippet view article find links to article
\infty } where the character remains finite. Given the character is a root of unity, for each subgroup the character can be then written as χ k 1 ( τ ^
Linear algebraic group (6,000 words) [view diff] case mismatch in snippet view article find links to article
C.; Soergel, W. (1994), Representations of Quantum Groups at a pth Root of Unity and of Semisimple Groups in Characteristic p: Independence of p, Astérisque
Temperley–Lieb algebra (2,928 words) [view diff] exact match in snippet view article find links to article
+ q − 1 {\displaystyle \delta =q+q^{-1}} with q {\displaystyle q} a root of unity, T L n ( δ ) {\displaystyle TL_{n}(\delta )} may not be semisimple,
McKay graph (1,592 words) [view diff] exact match in snippet view article find links to article
&\varepsilon ^{7}\end{array}}\right),} where ε is a primitive eighth root of unity. In fact, we have T ¯ = { U k , S U k , V U k , S V U k ∣ k = 0 , …
K-regular sequence (2,353 words) [view diff] exact match in snippet view article find links to article
if and only if x = 0 {\displaystyle x=0} or x {\displaystyle x} is a root of unity. Given a candidate sequence s = s ( n ) n ≥ 0 {\displaystyle s=s(n)_{n\geq
Goldberg–Coxeter construction (1,928 words) [view diff] exact match in snippet view article find links to article
parameterization of the Eisenstein integers is used, based on the sixth root of unity instead of the third. The usual definition of Eisenstein integers uses
Petr–Douglas–Neumann theorem (1,515 words) [view diff] exact match in snippet view article find links to article
ωσj )−1( S − ωσj I ) Aj , where ω = exp( 2πi/n ) is the nth primitive root of unity and σj is the jth term of a permutation σ of the integer sequence (1
Cubic reciprocity (4,061 words) [view diff] exact match in snippet view article find links to article
Eisenstein developed the theory of the numbers built up from a cube root of unity; they are now called the ring of Eisenstein integers. Eisenstein said
Azumaya algebra (3,208 words) [view diff] exact match in snippet view article find links to article
{\displaystyle \chi _{n,F}(b)} . Then, since there exists a primitive root of unity ζ ∈ μ n ⊂ F {\displaystyle \zeta \in \mu _{n}\subset F} , there is also
Quartic reciprocity (4,817 words) [view diff] exact match in snippet view article find links to article
introduction of other imaginary quantities. The numbers built up from a cube root of unity are now called the ring of Eisenstein integers. The "other imaginary
SIC-POVM (3,522 words) [view diff] exact match in snippet view article find links to article
where ω = e 2 π i d {\displaystyle \omega =e^{\frac {2\pi i}{d}}} is a root of unity and the shift operator as S | e i ⟩ = | e i + 1 ( mod d ) ⟩ {\displaystyle
Group cohomology (9,794 words) [view diff] exact match in snippet view article find links to article
ζ m {\displaystyle \zeta _{m}} a primitive m {\displaystyle m} -th root of unity, k {\displaystyle k} a field containing m {\displaystyle m} -th roots
Quadratic reciprocity (8,540 words) [view diff] exact match in snippet view article find links to article
}}\right]_{2}=\left({\frac {2}{a+b}}\right).} Consider the following third root of unity: ω = − 1 + − 3 2 = e 2 π ı 3 . {\displaystyle \omega ={\frac {-1+{\sqrt
Dmitry Merezhkovsky (11,776 words) [view diff] exact match in snippet view article find links to article
root of sex. Being aware of myself in all human bodies, I am at the root of unity". Noticing that one of the Aramaic languages translates Spirit as Rucha
Coding theory approaches to nucleic acid design (5,445 words) [view diff] exact match in snippet view article find links to article
{\displaystyle x=\exp(2\pi ij/p)} is a complex primitive p {\displaystyle p} th root of unity, and p > 2 {\displaystyle p>2} is a fixed prime. Further, let A = (
Adele ring (18,442 words) [view diff] exact match in snippet view article find links to article
suppose there exists ξ ∈ E , {\displaystyle \xi \in E,} which is not a root of unity of K . {\displaystyle K.} Then ξ n ≠ 1 {\displaystyle \xi ^{n}\neq 1}
Random permutation statistics (11,987 words) [view diff] exact match in snippet view article find links to article
telephone numbers. This generalizes the concept of an involution. An mth root of unity is a permutation σ so that σm = 1 under permutation composition. Now
Germán Sierra (5,112 words) [view diff] exact match in snippet view article find links to article
and Seiberg for rational conformal field theories, as long as q is a root of unity. Together with Cesar Gomez, he defined the representation spaces of