Related papers: Principalization algorithm via class group structu…

Let $\tilde{f}(X)\in\mathbb{Z}[X]$ be a degree-$n$ polynomial such that $f(X):=\tilde{f}(X)\bmod p$ factorizes into $n$ distinct linear factors over $\mathbb{F}_p$. We study the problem of deterministically factoring $f(X)$ over…

Let C be an arbitrary smooth algebraic curve of genus g over a large finite field K. We revisit fast addition algorithms in the Jacobian of C due to Khuri-Makdisi (math.NT/0409209, to appear in Math. Comp.). The algorithms, which reduce to…

We classify central extensions of a reductive group $G$ by $\mathcal{K}_3$ and $B\mathcal{K}_3$, the sheaf of third Quillen $K$-theory groups and its classifying stack. These turn out to be parametrized by the group of Weyl-invariant…

We analyse the complexity of solving the discrete logarithm problem and of testing the principality of ideals in a certain class of number fields. We achieve the subexponential complexity in $O(L(1/3,O(1)))$ when both the discriminant and…

This paper proposes a new, visual method to study numerical semigroups and the Frobenius problem. The method is based on building a so-called reduction graph, whose nodes usually correspond to monogenic semigroups, and whose edges can have…

Let $R$ be an order in an algebraic number field. If $R$ is a principal order, then many explicit results on its arithmetic are available. Among others, $R$ is half-factorial if and only if the class group of $R$ has at most two elements.…

It is well known that the Tchebotarev density theorem implies that an irreducible $\ell$-adic representation $\rho$ of the absolute Galois group of a number field $K$ is determined (up to isomorphism) by the characteristic polynomials of…

Search-base algorithms have widespread applications in different scenarios. Grover's quantum search algorithms and its generalization, amplitude amplification, provide a quadratic speedup over classical search algorithms for unstructured…

Let F be the function field of a curve over totally imaginary number field. Let p be a prime. If F contains a primitive p th root of unity, then every element in the third Galois cohomology group of F with values in the group of p th roots…

Let $K$ be a number field with ring of integers $\mathcal{O}_K$ and let $G$ be a finite abelian group of odd order. Given a $G$-Galois $K$-algebra $K_h$, let $A_h$ denote its square root of the inverse different, which exists by Hilbert's…

Given a global field K and a rational function phi defined over K, one may take pre-images of 0 under successive iterates of phi, and thus obtain an infinite rooted tree T by assigning edges according to the action of phi. The absolute…

Let $G$ be a finite group and let $\pi(G)=\{p_1, p_2, \ldots, p_k\}$ be the set of prime divisors of $|G|$ for which $p_1<p_2<\cdots<p_k$. The Gruenberg-Kegel graph of $G$, denoted ${\rm GK}(G)$, is defined as follows: its vertex set is…

The isospectral flows of an $n^{th}$ order linear scalar differential operator $L$ under the hypothesis that it possess a Baker-Akhiezer function were originally investigated by Segal and Wilson from the point of view of infinite…

We consider families of number fields of degree 4 whose normal closures over $\mathbb{Q}$ have Galois group isomorphic to $D_4$, the symmetries of a square. To any such field $L$, one can associate the Artin conductor of the corresponding…

We consider the grading of $sl(n,\mathbb{C})$ by the group $\Pi_n$ of generalized Pauli matrices. The grading decomposes the Lie algebra into $n^2-1$ one--dimensional subspaces. In the article we demonstrate that the normalizer of grading…

The perennial formalism is applied to the real, massive Klein-Gordon field on a globally-hyperbolic background space-time with compact Cauchy hypersurfaces. The parametrized form of this system is taken over from the accompanying paper. Two…

An ideal is a classical object of study in the field of algebraic number theory. In maximal quadratic orders of number fields, ideals usually represented by the $\mathbb Z$-basis. This form of representation is used in most of the…

We implement and interpret various supervised learning experiments involving real quadratic fields with class numbers 1, 2 and 3. We quantify the relative difficulties in separating class numbers of matching/different parity from a…

We describe an efficient algorithm which, given a principally polarized (p.p.) abelian surface $A$ over $\mathbb{Q}$ with geometric endomorphism ring equal to $\mathbb{Z}$, computes all the other p.p. abelian surfaces over $\mathbb{Q}$ that…

We present a randomized quantum algorithm for polynomial factorization over finite fields. For polynomials of degree $n$ over a finite field $\F_q$, the average-case complexity of our algorithm is an expected $O(n^{1 + o(1)} \log^{2 +…