enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Hidden subgroup problem - Wikipedia

    en.wikipedia.org/wiki/Hidden_subgroup_problem

    The hidden subgroup problem (HSP) is a topic of research in mathematics and theoretical computer science. The framework captures problems such as factoring , discrete logarithm , graph isomorphism , and the shortest vector problem .

  3. Simon's problem - Wikipedia

    en.wikipedia.org/wiki/Simon's_problem

    Simon's problem considers access to a function : {,} {,}, as implemented by a black box or an oracle. This function is promised to be either a one-to-one function, or a two-to-one function; if is two-to-one, it is furthermore promised that two inputs and ′ evaluate to the same value if and only if and ′ differ in a fixed set of bits. I.e.,

  4. Shor's algorithm - Wikipedia

    en.wikipedia.org/wiki/Shor's_algorithm

    The discrete logarithm algorithm and the factoring algorithm are instances of the period-finding algorithm, and all three are instances of the hidden subgroup problem. On a quantum computer, to factor an integer N {\displaystyle N} , Shor's algorithm runs in polynomial time , meaning the time taken is polynomial in log ⁡ N {\displaystyle \log ...

  5. Subgroup distortion - Wikipedia

    en.wikipedia.org/wiki/Subgroup_distortion

    For example, consider the infinite cyclic group ℤ = b , embedded as a normal subgroup of the Baumslag–Solitar group BS(1, 2) = a, b . With respect to the chosen generating sets, the element b 2 n = a n b a − n {\displaystyle b^{2^{n}}=a^{n}ba^{-n}} is distance 2 n from the origin in ℤ , but distance 2 n + 1 from the origin in BS(1, 2) .

  6. One-parameter group - Wikipedia

    en.wikipedia.org/wiki/One-parameter_group

    An important example in the theory of Lie groups arises when is taken to be (;), the group of invertible matrices with complex entries. In that case, a basic result is the following: [ 5 ] Theorem : Suppose φ : R → G L ( n ; C ) {\displaystyle \varphi :\mathbb {R} \rightarrow \mathrm {GL} (n;\mathbb {C} )} is a one-parameter group.

  7. Free group - Wikipedia

    en.wikipedia.org/wiki/Free_group

    A free group of rank k clearly has subgroups of every rank less than k. Less obviously, a (nonabelian!) free group of rank at least 2 has subgroups of all countable ranks. The commutator subgroup of a free group of rank k > 1 has infinite rank; for example for F(a,b), it is freely generated by the commutators [a m, b n] for non-zero m and n.

  8. C-normal subgroup - Wikipedia

    en.wikipedia.org/wiki/C-normal_subgroup

    In mathematics, in the field of group theory, a subgroup of a group is called c-normal if there is a normal subgroup of such that = and the intersection of and lies inside the normal core of . For a weakly c-normal subgroup , we only require T {\displaystyle T} to be subnormal .

  9. Artin–Tits group - Wikipedia

    en.wikipedia.org/wiki/Artin–Tits_group

    Examples are free groups, free abelian groups, braid groups, and right-angled Artin–Tits groups, among others. The groups are named after Emil Artin , due to his early work on braid groups in the 1920s to 1940s, [ 1 ] and Jacques Tits who developed the theory of a more general class of groups in the 1960s.