English
Related papers

Related papers: Computing normal integral bases of abelian number …

200 papers

The universal Gr\"obner basis of an ideal is a Gr\"obner basis with respect to all term orders simultaneously. The aim of this paper is to present an algorithmic approach to compute the universal Gr\"obner basis for the toric ideal…

Commutative Algebra · Mathematics 2019-04-23 Yannis C. Stamatiou , Christos Tatakis

From a resolution graph with certain conditions, Neumann and Wahl constructed an equisingular family of surface singularities called splice quotients. For this class some fundamental analytic invariants have been computed from their…

Algebraic Geometry · Mathematics 2025-12-16 Tomohiro Okuma

We consider a nonlinear representation of a Lie algebra which is regular on an abelian ideal, we define a normal form which generalizes that defined in [D. Arnal, M. Ben Ammar, M. Selmi, {\rm Normalisation d'une repr\'esentation non…

Representation Theory · Mathematics 2017-01-17 Mabrouk Ben Ammar

The group of units modulo constants of an affine variety over an algebraically closed field is free abelian of finite rank. Computing this group is difficult but of fundamental importance in tropical geometry, where it is desirable to…

Algebraic Geometry · Mathematics 2018-08-09 Justin Chen , Sameera Vemulapalli , Leon Zhang

The abelian sandpile models feature a finite abelian group G generated by the operators corresponding to particle addition at various sites. We study the canonical decomposition of G as a product of cyclic groups G = Z_{d_1} X Z_{d_2} X…

Condensed Matter · Physics 2007-05-23 D. Dhar , P. Ruelle , S. Sen , D. -N. Verma

Gr\"{o}bner bases are nowadays central tools for solving various problems in commutative algebra and algebraic geometry. A typical use of Gr\"{o}bner bases is the multivariate polynomial system solving, which enables us to construct…

Symbolic Computation · Computer Science 2024-03-05 Momonari Kudo , Kazuhiro Yokoyama

Let $U/L$ be a finite abelian extension of number fields. We first construct a universal primitive generator of $U$ over $L$ whose relative trace to any intermediate field $F$ becomes a generator of $F$ over $L$, too. We also develop a…

Number Theory · Mathematics 2017-07-19 Ja Kyung Koo , Dong Hwa Shin

We are interested in classical and logarithmic imaginary classes of abelian number fields in connection with Iwasawa theory. For any given odd prime ${\ell}$ and any imaginary abelian number field K, we compute the isotypic components of…

Number Theory · Mathematics 2024-06-28 Jean-François Jaulent

Already Dedekind and Weber considered the problem of counting integral ideals of norm at most $x$ in a given number field $K$. Here we improve on the existing results in case $K/\mathbb Q$ is abelian and has degree at least four. For these…

Number Theory · Mathematics 2025-12-30 Alessandro Languasco , Rashi Lunia , Pieter Moree

Let $N/F$ be an odd degree Galois extension of number fields with Galois group $G$ and rings of integers ${\mathfrak O}_N$ and ${\mathfrak O}_F=\bo$ respectively. Let $\mathcal{A}$ be the unique fractional ${\mathfrak O}_N$-ideal with…

Number Theory · Mathematics 2019-02-20 Erik Jarl Pickett , Stéphane Vinatier

In this paper we discuss the basic problems of algorithmic algebraic number theory. The emphasis is on aspects that are of interest from a purely mathematical point of view, and practical issues are largely disregarded. We describe what has…

Number Theory · Mathematics 2008-02-03 Hendrik W. Lenstra

A finite non-abelian group $G$ is called super integral if the spectrum, Laplacian spectrum and signless Laplacian spectrum of its commuting graph contain only integers. In this paper, we first compute various spectra of several families of…

Group Theory · Mathematics 2016-08-10 Jutirekha Dutta , Rajat Kanti Nath

In this article we study the Galois group of field generated by division points of special class of formal group laws and prove an equivalent condition for the group to be abelian. Further, we explore relations between the endomorphism ring…

Number Theory · Mathematics 2019-01-23 Soumyadip Sahu

An accurate method to compute enclosures of Abelian integrals is developed. This allows for an accurate description of the phase portraits of planar polynomial systems that are perturbations of Hamiltonian systems. As an example, it is…

Dynamical Systems · Mathematics 2011-09-06 Tomas Johnson , Warwick Tucker

We construct infinitely many abelian surfaces A defined over the rational numbers such that, for a prime ell <= 7, the ell-torsion subgroup of A is not isomorphic as a Galois module to the ell-torsion subgroup of its dual. We do this by…

Number Theory · Mathematics 2025-09-18 Sarah Frei , Katrina Honigs , John Voight

Ramification invariants are necessary, but not in general sufficient, to determine the Galois module structure of ideals in local number field extensions. This insufficiency is associated with elementary abelian extensions, where one can…

Number Theory · Mathematics 2007-05-23 Nigel P. Byott , G. Griffith Elder

Let $K$ be a finite extension of $\Q_p$, let $L/K$ be a finite abelian Galois extension of odd degree and let $\bo_L$ be the valuation ring of $L$. We define $A_{L/K}$ to be the unique fractional $\bo_L$-ideal with square equal to the…

Number Theory · Mathematics 2010-07-05 Erik Jarl Pickett

Let $K$ be a number field and $G$ a finite abelian group. We study the asymptotic behaviour of the number of tamely ramified $G$-extensions of $K$ with ring of integers of fixed realisable class as a Galois module.

Number Theory · Mathematics 2010-10-14 A. Agboola

Standard noncommutative Gr\"obner basis procedures are used for computing ideals of free noncommutative polynomial rings over fields. This paper describes Gr\"obner basis procedures for one-sided ideals in finitely presented noncommutative…

Rings and Algebras · Mathematics 2007-05-23 Anne Heyworth

Let $G$ be a finite abelian group $G$ with $N$ elements. In this paper we give a O(N) time algorithm for computing a basis of $G$. Furthermore, we obtain an algorithm for computing a basis from a generating system of $G$ with $M$ elements…

Data Structures and Algorithms · Computer Science 2008-08-26 Gregory Karagiorgos , Dimitrios Poulakis
‹ Prev 1 3 4 5 6 7 10 Next ›