Vincenzo Acciaro

Dr. Vincenzo Acciaro

Economic Studies, University G. D'Annunzio, Pescara, Abruzzo, Italy
orcid

Research Focus & Metrics

Academic Career Length

33Years (1994-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 February 1999 in Mathematics of Computation
Verified
Journal Article
Open access
PDF file
VAVincenzo Acciaro
Vincenzo Acciaro
JKJürgen Klüners
Jürgen Klüners
Let L = Q ( α ) L=\mathbb {Q}(\alpha ) be an abelian number field of degree n n . Most algorithms for computing the lattice of subfields of L L require the computation of all the conjugates of α \alpha . This is usually achieved by factoring the minimal polynomial m α ( x ) m_{\alpha }(x) of α \alpha over L L . In practice, the existing algorithms for factoring polynomials over algebraic number fields can handle only problems of moderate size. In this paper we describe a fast probabilistic algorithm for computing the conjugates of α \alpha , which is based on p p -adic techniques. Given m α ( x ) m_{\alpha }(x) and a rational prime p p which does not divide the discriminant disc ⁡ ( m α ( x ) ) \operatorname {disc} (m_{\alpha }(x)) of m α ( x ) m_{\alpha }(x) , the algorithm computes the Frobenius automorphism of p p in time polynomial in the size of p p and in the size of m α ( x ) m_{\alpha }(x) . By repeatedly applying the algorithm to randomly chosen primes it is possible to compute all the conjugates of α \alpha .

1 October 1996 in Mathematics of Computation
Verified
Journal Article
Open access
PDF file
VAVincenzo Acciaro
Vincenzo Acciaro
Let L = Q [ α ] L={\mathbb {Q}} [\alpha ] be an abelian number field of prime degree q q , and let a a be a nonzero rational number. We describe an algorithm which takes as input a a and the minimal polynomial of α \alpha over Q {\mathbb {Q}} , and determines if a a is a norm of an element of L L . We show that, if we ignore the time needed to obtain a complete factorization of a a and a complete factorization of the discriminant of α \alpha , then the algorithm runs in time polynomial in the size of the input. As an application, we give an algorithm to test if a cyclic algebra A = ( E , σ , a ) A=( E, \sigma , a ) over Q {\mathbb {Q}} is a division algebra.

1 August 2000 in Journal of Symbolic Computation
Verified
Journal Article
Closed access
VAVincenzo Acciaro
Vincenzo Acciaro
CFClaus Fieker
Claus Fieker

24 June 2021 in Glasnik Matematicki
Verified
Journal Article
Closed access
UEUniversità di Chieti-Pescara Dipartimento di Economia
Università di Chieti-Pescara Dipartimento di Economia
VAVincenzo Acciaro
Vincenzo Acciaro
Diana SavinDiana Savin
Diana Savin
MTMohammed Taous
Mohammed Taous
AZAbdelkader Zekhnini
Abdelkader Zekhnini
Let p and q be two positive prime integers. In this paper we obtain a complete characterization of division quaternion algebras HK(p, q) over the composite K of n quadratic number fields.

1 September 2000 in Journal of Symbolic Computation
Verified
Journal Article
Closed access
VAVincenzo Acciaro
Vincenzo Acciaro
JKJürgen Klüners
Jürgen Klüners

14 July 2021 in Boletín de la Sociedad Matemática Mexicana
Verified
Journal Article
Closed access
PDF file
VAVincenzo Acciaro
Vincenzo Acciaro
Diana SavinDiana Savin
Diana Savin
MTM. Taous
M. Taous
AZAbdelkader Zekhnini
Abdelkader Zekhnini