English
Related papers

Related papers: Quadratic Probabilistic Algorithms for Normal Base…

200 papers

Considering finite extensions K[A] \subseteq K[B] of positive affine semigroup rings over a field K we have developed in [1] an algorithm to decompose K[B] as a direct sum of monomial ideals in K[A]. By computing the regularity of…

Commutative Algebra · Mathematics 2013-09-24 Janko Boehm , David Eisenbud , Max Joachim Nitsche

We introduce the concepts of Grover operators and Grover kernels to systematically analyse Grover's searching algorithms. Then, we investigate a one-parameter family of quantum searching algorithms of Grover's type and we show that the…

Quantum Physics · Physics 2009-11-06 Alberto Galindo , Miguel A. Martin-Delgado

Let $G$ be a finite group and let $c(G)$ be the number of cyclic subgroups of $G$. We study the function $\alpha(G) = c(G)/|G|$. We explore its basic properties and we point out a connection with the probability of commutation. For many…

Group Theory · Mathematics 2018-02-23 Igor Lima , Martino Garonzi

Garside calculus is the common mechanism that underlies a certain type of normal form for the elements of a monoid, a group, or a category. Originating from Garside's approach to Artin's braid groups, it has been extended to more and more…

Group Theory · Mathematics 2014-02-25 Patrick Dehornoy , Volker Gebhardt

Grover's quantum algorithm can find a marked item from an unstructured database faster than any classical algorithm, and hence it has been used for several applications such as cryptanalysis and optimization. When there exist multiple…

Quantum Physics · Physics 2025-07-02 Kota Tani , Shunji Tsuchiya , Seiichiro Tani , Yuki Takeuchi

We consider representations of algebraic tori $T_n(F_q)$ over finite fields. We make use of normal elliptic bases to show that, for infinitely many squarefree integers $n$ and infinitely many values of $q$, we can encode $m$ torus elements,…

Cryptography and Security · Computer Science 2009-09-02 Clement Dunand , Reynald Lercier

The normaliser problem takes as input subgroups $G$ and $H$ of the symmetric group $S_n$, and asks one to compute $N_G(H)$. The fastest known algorithm for this problem is simply exponential, whilst more efficient algorithms are known for…

Group Theory · Mathematics 2021-12-02 Mun See Chang , Christopher Jefferson , Colva M. Roney-Dougal

In this paper, a method for constructing a near optimal normal basis for algebraic extensions of a finite field is described. In each extension, except for the squares of basis elements, the product of two distinct normal basis elements can…

General Mathematics · Mathematics 2021-06-29 Duggirala Meher Krishna , Duggirala Ravi

Let G=Aut_K (K(x)) be the Galois group of the transcendental degree one pure field extension K(x)/K. In this paper we describe polynomial time algorithms for computing the field Fix(H) fixed by a subgroup H < G and for computing the fixing…

Symbolic Computation · Computer Science 2009-04-19 Jaime Gutierrez , Rosario Rubio , David Sevilla

We propose a family of quantum algorithms for estimating Gowers uniformity norms $ U^k $ over finite abelian groups and demonstrate their applications to testing polynomial structure and counting arithmetic progressions. Building on recent…

Quantum Physics · Physics 2025-08-05 En-Jui Kuo

Let $G=\mathop{A\ast B}\limits_C$ be an amalgamated product of finite rank free groups $A$, $B$ and $C$. We introduce atomic measures and corresponding asymptotic densities on a set of normal forms of elements in $G$. We also define two…

Group Theory · Mathematics 2011-07-21 Elizaveta Frenkel , Alexei G. Myasnikov , Vladimir N. Remeslennikov

This work provides a method(an algorithm) for solving the solvable unary algebraic equation $f(x)=0$ ($f(x)\in\mathbb{Q}[x]$) of arbitrary degree and obtaining the exact radical roots. This method requires that we know the Galois group as…

Rings and Algebras · Mathematics 2022-03-30 Song Li

We introduce the first provably efficient algorithm to check if a finitely generated subgroup of an almost simple semi-simple group over the rationals is Zariski-dense. We reduce this question to one of computing Galois groups, and to this…

Number Theory · Mathematics 2015-01-08 Igor Rivin

Let $G$ be a finite group generated by $k$ elements. The well-known product replacement algorithm provides an effective method for sampling generating sets of $G$. We study a refinement of this algorithm that is designed to output…

Group Theory · Mathematics 2025-12-23 Michał Marcinkowski , Piotr Mizerka

Let $V$ be a simple vertex algebra of countable dimension, $G$ be a finite automorphism group of $V$ and $\sigma$ be a central element of $G$. Assume that ${\cal S}$ is a finite set of inequivalent irreducible $\sigma$-twisted $V$-modules…

Quantum Algebra · Mathematics 2023-02-21 Chongying Dong , Li Ren , Chao Yang

Let $L/K$ be a finite, totally ramified $p$-extension of complete local fields with residue fields of characteristic $p > 0$, and let $A$ be a $K$-algebra acting on $L$. We define the concept of an $A$-scaffold on $L$, thereby extending and…

Number Theory · Mathematics 2017-07-26 Nigel P. Byott , Lindsay N. Childs , G. Griffith Elder

Quantum normalizer circuits were recently introduced as generalizations of Clifford circuits [arXiv:1201.4867]: a normalizer circuit over a finite Abelian group $G$ is composed of the quantum Fourier transform (QFT) over G, together with…

Quantum Physics · Physics 2015-10-09 Juan Bermejo-Vega , Maarten Van den Nest

Let $K$ be a field of characteristic $p$ and $G$ a nonabelian metacyclic finite $p$-group. We give an explicit list of all metacyclic $p$-groups $G$, such that the group algebra $KG$ over a field of characteristic $p$ has a filtered…

Rings and Algebras · Mathematics 2007-05-23 Victor Bovdi

We study the spectra of non-regular semisimple elements in irreducible representations of simple algebraic groups. More precisely, we prove that if G is a simply connected simple linear algebraic group and f is a non-trivial irreducible…

Representation Theory · Mathematics 2021-06-11 Donna M Testerman , Alexandre Zalesski

A finite group $G$ is called $C$-quasirandom (by Gowers) if all non-trivial irreducible complex representations of $G$ have dimension at least $C$. For any unit $\ell^{2}$ function on a finite group we associate the quantum probability…

Spectral Theory · Mathematics 2023-12-19 Michael Magee , Joe Thomas , Yufei Zhao