English
Related papers

Related papers: Root Extraction in Certain Finite Abelian $p$-Grou…

200 papers

We introduce the concept of completely positive roots of completely positive maps on operator algebras. We do this in different forms: as asymptotic roots, proper discrete roots and as continuous one-parameter semigroups of roots. We…

Operator Algebras · Mathematics 2020-04-21 B. V. Rajarama Bhat , Robin Hillier , Nirupama Mallick , Vijaya Kumar U

Every torsion--free abelian group of finite rank has two essentially unique complete direct decompositions whose summands come from specific classes of groups.

Group Theory · Mathematics 2020-07-16 Phill Schultz

We obtain a classification of the finite two-generated cyclic-by-abelian groups of prime-power order. For that we associate to each such group $G$ a list $\inv(G)$ of numerical group invariants which determines the isomorphism type of $G$.…

Group Theory · Mathematics 2023-02-22 Osnel Broche , Diego García , Ángel del Río

Two problems are addressed: reduction of an arbitrary degree non-special divisor to the equivalent divisor of the degree equal to genus of a curve, and addition of divisors of arbitrary degrees. The hyperelliptic case is considered as the…

Algebraic Geometry · Mathematics 2020-06-16 Julia Bernatska , Yaacov Kopeliovich

We study the number of elliptic curves, up to isomorphism, over a fixed quartic field $K$ having a prescribed torsion group $T$ as a subgroup. Let $T=\Z/m\Z \oplus \Z/n\Z$, where $m|n$, be a torsion group such that the modular curve…

Number Theory · Mathematics 2012-05-30 Filip Najman

The main goal of this paper is to apply the arithmetic method developed in our previous paper \cite{13} to determine the number of some types of subgroups of finite abelian groups.

Group Theory · Mathematics 2018-06-01 Marius Tărnăuceanu

A new version of the Graeffe algorithm for finding all the roots of univariate complex polynomials is proposed. It is obtained from the classical algorithm by a process analogous to renormalization of dynamical systems. This iteration is…

Numerical Analysis · Mathematics 2025-10-20 Gregorio Malajovich , Jorge P. Zubelli

Let $\Phi^\infty(d)$ denote the set of finite abelian groups that occur infinitely often as the torsion subgroup of an elliptic curve over a number field of degree $d$. The sets $\Phi^\infty(d)$ are known for $d\le 4$. In this article we…

Number Theory · Mathematics 2017-09-26 Maarten Derickx , Andrew V. Sutherland

We consider some problems of analytic number theory for elliptic curves which can be considered as analogues of classical questions around the distribution of primes in arithmetic progressions to large moduli, and of the question of twin…

Number Theory · Mathematics 2007-05-23 Emmanuel Kowalski

Let $E$ be an elliptic curve over a quartic field $K$. By the Mordell-Weil theorem, $E(K)$ is a finitely generated group. We determine all the possibilities for the torsion group $E(K)_{tor}$ where $K$ ranges over all quartic fields $K$ and…

Number Theory · Mathematics 2025-10-14 Maarten Derickx , Filip Najman

The complexity of the equation solvability problem is known for nilpotent groups, for not solvable groups and for some semidirect products of Abelian groups. We provide a new polynomial time algorithm for deciding the equation solvability…

Group Theory · Mathematics 2016-03-21 Attila Földvári

Let $p$ be an odd prime number. Let $K$ be the $p$-th cyclotomic field and $F$ its maximal real subfield. We give general formulae of the root numbers of the Jacobian varieties of the Fermat curves $X^p+Y^p=\delta$ where $\delta$ is an…

Number Theory · Mathematics 2021-11-30 Jie Shu

We prove several results on torsion points and Galois representations for complex multiplication (CM) elliptic curves over a number field containing the CM field. One result computes the degree in which such an elliptic curve has a rational…

Number Theory · Mathematics 2020-03-18 Abbey Bourdon , Pete L. Clark

As it is well known, one can define an abelian group on the points of an elliptic curve, using the so called chord-tangent law \cite{dale}, and a chosen point. However, that very chord-tangent law allows us to define a rather more obscure…

Algebraic Geometry · Mathematics 2022-01-17 Ilia Pirashvili

We give a simple proof of the well-known divisibility by 2 condition for rational points on elliptic curves with rational 2-torsion. As an application of the explicit division by $2^n$ formulas obtained in Sec.2, we construct versal…

Number Theory · Mathematics 2017-02-13 Boris M. Bekker , Yuri G. Zarhin

In this paper, we establish the conditions for some finite abelian groups and the family all the $k$-sets in each of them summing up to an element $x$ to form $t$-designs. We fully characterize the sufficient and necessary conditions for…

Combinatorics · Mathematics 2025-06-03 Hengfeng Liu , Chunming Tang , Cuiling Fan , Rong Luo

Quantum-chemical calculations often make use of point-group theory to exploit molecular symmetry, resulting in a reduction of the computational cost and in insights into the electronic structure. This exploitation is often limited to…

Chemical Physics · Physics 2026-02-16 Marios-Petros Kitsaras , Stella Stopkowicz

In his previous paper, the author proposed as a problem a purely inseparable analogue of the Abhyankar conjecture for affine curves in positive characteristic and gave a partial answer to it, which includes a complete answer for finite…

Algebraic Geometry · Mathematics 2021-08-25 Shusuke Otabe

We show that for all odd primes $p$, there exist ordinary elliptic curves over $\bar{\mathbb{F}}_p(x)$ with arbitrarily high rank and constant $j$-invariant. This shows in particular that there are elliptic curves with arbitrarily high rank…

Number Theory · Mathematics 2007-05-23 Claus Diem , Jasper Scholten

Root extraction is a classical problem in computers algebra. It plays an essential role in cryptosystems based on elliptic curves. In 2006, Barreto and Voloch proposed an algorithm to compute $r$th roots in ${F}_{q^m} $ for certain choices…

Symbolic Computation · Computer Science 2011-10-24 Zhengjun Cao , Xiao Fan