Alessandro Languasco
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Alessandro Languasco has a total of 37 co-authors. Here are the top co-authors by number of shared publications:
- Alessandro Zaccagnini
Univ Parma, Dipartimento Sci Matemat Fis & Informat, Parco Area Sci 53-A, I-43124 Parma, Italy
52 shared publications - Pieter Moree
Max-Planck-Institut für Mathematik, Bonn, Germany
9 shared publications - Alberto Perelli
Univ Genoa, Dipartimento Matemat, Via Dodecaneso 35, I-16146 Genoa, Italy
5 shared publications Alberto Perelli
3 shared publications- Alessandro Gambini
Sapienza Università di Roma
3 shared publications Alessandro Zaccagnini
3 shared publications
Latest Publications
- Open Access
- 13 February 2026
- Published by Springer Nature in Mathematische Annalen
- Vol. 394 (2) , 43
Pair correlation of zeros of Dirichlet L-functions: a possible path towards the conjectures of Chowla, Elliott-Halberstam and Montgomery
Assuming the Generalized Riemann Hypothesis and a pair correlation conjecture for the zeros of Dirichlet L -functions, we establish the truth of a conjecture of Montgomery (in its corrected form stated by Friedlander and Granville) on the magnitude of the error term in the prime number theorem in arithmetic progressions. As a consequence, we obtain that, under the same assumptions, the Elliott–Halberstam conjecture holds true. As another consequence, under the same assumptions, we will show that the number of Dirichlet characters $$\chi (\text {mod}\,q)$$ for which $$L(\frac{1}{2},\chi )=0$$ is of order less than $$q^{1/2+\varepsilon }$$ .- 13 February 2026
- Published by Springer Nature in Mathematische Annalen
- Vol. 394 (2) , 43
Open AccessPair correlation of zeros of Dirichlet L-functions: a possible path towards the conjectures of Chowla, Elliott-Halberstam and Montgomery
Assuming the Generalized Riemann Hypothesis and a pair correlation conjecture for the zeros of Dirichlet L -functions, we establish the truth of a conjecture of Montgomery (in its corrected form stated by Friedlander and Granville) on the magnitude of the error term in the prime number theorem in arithmetic progressions. As a consequence, we obtain that, under the same assumptions, the Elliott–Halberstam conjecture holds true. As another consequence, under the same assumptions, we will show that the number of Dirichlet characters $$\chi (\text {mod}\,q)$$ for which $$L(\frac{1}{2},\chi )=0$$ is of order less than $$q^{1/2+\varepsilon }$$ . - Open Access
- 1 October 2025
- Published by Springer Nature in Abhandlungen aus dem Mathematischen Seminar der Universitat Hamburg
- Vol. 95 (2) , 123-148
Sequences of integers generated by two fixed primes
Let p and q be two distinct fixed prime numbers and $$(n_i)_{i\ge 0}$$ the sequence of consecutive integers of the form $$p^a\cdot q^b$$ with $$a,b\ge 0$$ . Tijdeman gave a lower bound (1973) and an upper bound (1974) for the gap size $$n_{i+1}-n_i$$ , with each bound containing an unspecified exponent and implicit constant. We will explicitly bound these four quantities. Earlier Langevin (1976) gave weaker estimates for (only) the exponents. Given a real number $$\alpha >1$$ , there exists a smallest number m such that for every $$n\ge m$$ , there exists an integer $$n_i$$ in $$[n,n\alpha )$$ . Our effective version of Tijdeman’s result immediately implies an upper bound for m , which using the Koksma–Erdős–Turan inequality we will improve on. We present a fast algorithm to determine m when $$\max \{p,q\}$$ is not too large and demonstrate it with numerical material. In an appendix we explain, given $$n_i$$ , how to efficiently determine both $$n_{i-1}$$ and $$n_{i+1}$$ , something closely related to work of Bérczes, Dujella and Hajdu.- 1 October 2025
- Published by Springer Nature in Abhandlungen aus dem Mathematischen Seminar der Universitat Hamburg
- Vol. 95 (2) , 123-148
Open AccessSequences of integers generated by two fixed primes
Let p and q be two distinct fixed prime numbers and $$(n_i)_{i\ge 0}$$ the sequence of consecutive integers of the form $$p^a\cdot q^b$$ with $$a,b\ge 0$$ . Tijdeman gave a lower bound (1973) and an upper bound (1974) for the gap size $$n_{i+1}-n_i$$ , with each bound containing an unspecified exponent and implicit constant. We will explicitly bound these four quantities. Earlier Langevin (1976) gave weaker estimates for (only) the exponents. Given a real number $$\alpha >1$$ , there exists a smallest number m such that for every $$n\ge m$$ , there exists an integer $$n_i$$ in $$[n,n\alpha )$$ . Our effective version of Tijdeman’s result immediately implies an upper bound for m , which using the Koksma–Erdős–Turan inequality we will improve on. We present a fast algorithm to determine m when $$\max \{p,q\}$$ is not too large and demonstrate it with numerical material. In an appendix we explain, given $$n_i$$ , how to efficiently determine both $$n_{i-1}$$ and $$n_{i+1}$$ , something closely related to work of Bérczes, Dujella and Hajdu. - 25 August 2025
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 95 (362) , 2991-3040
Relative class numbers and Euler–Kronecker constants of maximal real cyclotomic subfields
The Euler–Kronecker constant of a number field K K is the ratio of the constant and the residue of the Laurent series of the Dedekind zeta function ζ K ( s ) \zeta _K(s) at s = 1 s=1 . We study the distribution of the Euler–Kronecker constant γ q + \gamma _q^+ of the maximal real subfield of Q ( ξ q ) \mathbb Q(\xi _q) , where ξ q \xi _q is the q q -th root of unity, as q q ranges over the primes. Further, we consider the distribution of γ q + − γ q \gamma _q^+-\gamma _q , with γ q \gamma _q the Euler–Kronecker constant of Q ( ξ q ) \mathbb Q(\xi _q) and show how it is connected with Kummer’s conjecture, which predicts the asymptotic growth of the relative class number of Q ( ξ q ) \mathbb Q(\xi _q) . We improve, for example, the known results on the bounds on average for the Kummer ratio and we prove analogous sharp bounds for γ q + − γ q \gamma _q^+-\gamma _q . The methods employed are partly inspired by those used by Granville [Invent. Math. 100 (1990), pp. 321–338] and Croot and Granville [J. London Math. Soc. (2) 66 (2002), pp. 579–591] to investigate Kummer’s conjecture. We supplement our theoretical findings with numerical illustrations to reinforce our conclusions.
- 25 August 2025
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 95 (362) , 2991-3040
Relative class numbers and Euler–Kronecker constants of maximal real cyclotomic subfields
The Euler–Kronecker constant of a number field K K is the ratio of the constant and the residue of the Laurent series of the Dedekind zeta function ζ K ( s ) \zeta _K(s) at s = 1 s=1 . We study the distribution of the Euler–Kronecker constant γ q + \gamma _q^+ of the maximal real subfield of Q ( ξ q ) \mathbb Q(\xi _q) , where ξ q \xi _q is the q q -th root of unity, as q q ranges over the primes. Further, we consider the distribution of γ q + − γ q \gamma _q^+-\gamma _q , with γ q \gamma _q the Euler–Kronecker constant of Q ( ξ q ) \mathbb Q(\xi _q) and show how it is connected with Kummer’s conjecture, which predicts the asymptotic growth of the relative class number of Q ( ξ q ) \mathbb Q(\xi _q) . We improve, for example, the known results on the bounds on average for the Kummer ratio and we prove analogous sharp bounds for γ q + − γ q \gamma _q^+-\gamma _q . The methods employed are partly inspired by those used by Granville [Invent. Math. 100 (1990), pp. 321–338] and Croot and Granville [J. London Math. Soc. (2) 66 (2002), pp. 579–591] to investigate Kummer’s conjecture. We supplement our theoretical findings with numerical illustrations to reinforce our conclusions.
- Open Access
Counting ideals in abelian number fields
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 fields, we obtain as a consequence an improvement of the available results on counting pairs of coprime ideals each having norm at most $x$.Open AccessCounting ideals in abelian number fields
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 fields, we obtain as a consequence an improvement of the available results on counting pairs of coprime ideals each having norm at most $x$. - Open Access
- 31 January 2025
- Published by Mathematical Sciences Publishers in Pacific Journal of Mathematics
- Vol. 334 (1) , 167-182
The Brauer–Siegel ratio for prime cyclotomic fields
The Brauer-Siegel theorem concerns the size of the product of the class number and the regulator of a number field K. We derive bounds for this product in case K is a prime cyclotomic field, distinguishing between whether there is a Siegel zero or not. In particular, we make a result of Tatuzawa (1953) more explicit. Our theoretical advancements are complemented by numerical illustrations that are consistent with our findings.
- 31 January 2025
- Published by Mathematical Sciences Publishers in Pacific Journal of Mathematics
- Vol. 334 (1) , 167-182
Open AccessThe Brauer–Siegel ratio for prime cyclotomic fields
The Brauer-Siegel theorem concerns the size of the product of the class number and the regulator of a number field K. We derive bounds for this product in case K is a prime cyclotomic field, distinguishing between whether there is a Siegel zero or not. In particular, we make a result of Tatuzawa (1953) more explicit. Our theoretical advancements are complemented by numerical illustrations that are consistent with our findings.
- 28 January 2025
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 95 (357) , 363-387
Euler constants from primes in arithmetic progression
Many Dirichlet series of number theoretic interest can be written as a product of generating series ζ d , a ( s ) = ∏ p ≡ a ( m o d d ) ( 1 − p − s ) − 1 \zeta _{\,d,a}(s)=\prod \limits _{p\equiv a\ (\mathrm {mod}\ d)}(1-p^{-s})^{-1} , with p p ranging over all the primes in the primitive residue class modulo a ( m o d d ) a\ (\mathrm {mod}\ d) , and a function H ( s ) H(s) well-behaved around s = 1 s=1 . In such a case the corresponding Euler constant can be expressed in terms of the Euler constants γ ( d , a ) \gamma (d,a) of the series ζ d , a ( s ) \zeta _{\,d,a}(s) involved and the (numerically more harmless) term H ′ ( 1 ) / H ( 1 ) H’(1)/H(1) . Here we systematically study γ ( d , a ) \gamma (d,a) , their numerical evaluation and discuss some examples.
- 28 January 2025
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 95 (357) , 363-387
Euler constants from primes in arithmetic progression
Many Dirichlet series of number theoretic interest can be written as a product of generating series ζ d , a ( s ) = ∏ p ≡ a ( m o d d ) ( 1 − p − s ) − 1 \zeta _{\,d,a}(s)=\prod \limits _{p\equiv a\ (\mathrm {mod}\ d)}(1-p^{-s})^{-1} , with p p ranging over all the primes in the primitive residue class modulo a ( m o d d ) a\ (\mathrm {mod}\ d) , and a function H ( s ) H(s) well-behaved around s = 1 s=1 . In such a case the corresponding Euler constant can be expressed in terms of the Euler constants γ ( d , a ) \gamma (d,a) of the series ζ d , a ( s ) \zeta _{\,d,a}(s) involved and the (numerically more harmless) term H ′ ( 1 ) / H ( 1 ) H’(1)/H(1) . Here we systematically study γ ( d , a ) \gamma (d,a) , their numerical evaluation and discuss some examples.
- Open Access
- 12 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Efficient analysis of overdispersed data using an accurate computation of the Dirichlet multinomial distributio
Modeling count data using suitable statistical distributions has been instrumental for analyzing the patterns it conveys. However, failing to address critical aspects, like overdispersion, jeopardizes the effectiveness of such an analysis. In this paper, overdispersed count data is modeled using the Dirichlet Multinomial (DM) distribution by maximizing its likelihood using a fixed-point iteration algorithm. This is achieved by estimating the DM distribution parameters while comparing the recent Languasco-Migliardi (LM), and the Yu-Shaw (YS) procedures, which address the well-known computational difficulties of evaluating its log-likelihood. Experiments were conducted using multiple datasets from different domains spanning polls, images, and IoT network traffic. They all showed the superiority of the LM procedure as it succeeded at estimating the DM parameters at the designated level of accuracy in all experiments, while the YS procedure failed to produce sufficiently accurate results (or any results at all) in several experiments. Moreover, the LM procedure achieved a speedup that ranged from 2-fold to 20-fold over YS. (Revised form accepted for publication in IEEE Transactions on Pattern Analysis and Machine Intelligence, 2024, https://doi.org/10.1109/TPAMI.2024.3489645 ).
- 12 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Open AccessEfficient analysis of overdispersed data using an accurate computation of the Dirichlet multinomial distributio
Modeling count data using suitable statistical distributions has been instrumental for analyzing the patterns it conveys. However, failing to address critical aspects, like overdispersion, jeopardizes the effectiveness of such an analysis. In this paper, overdispersed count data is modeled using the Dirichlet Multinomial (DM) distribution by maximizing its likelihood using a fixed-point iteration algorithm. This is achieved by estimating the DM distribution parameters while comparing the recent Languasco-Migliardi (LM), and the Yu-Shaw (YS) procedures, which address the well-known computational difficulties of evaluating its log-likelihood. Experiments were conducted using multiple datasets from different domains spanning polls, images, and IoT network traffic. They all showed the superiority of the LM procedure as it succeeded at estimating the DM parameters at the designated level of accuracy in all experiments, while the YS procedure failed to produce sufficiently accurate results (or any results at all) in several experiments. Moreover, the LM procedure achieved a speedup that ranged from 2-fold to 20-fold over YS. (Revised form accepted for publication in IEEE Transactions on Pattern Analysis and Machine Intelligence, 2024, https://doi.org/10.1109/TPAMI.2024.3489645 ).
- 31 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 47 (2) , 1181-1189
Efficient Analysis of Overdispersed Data Using an Accurate Computation of the Dirichlet Multinomial Distribution
Modeling count data using suitable statistical distributions has been instrumental for analyzing the patterns it conveys. However, failing to address critical aspects, like overdispersion, jeopardizes the effectiveness of such an analysis. In this paper, overdispersed count data is modeled using the Dirichlet Multinomial (DM) distribution by maximizing its likelihood using a fixed-point iteration algorithm. This is achieved by estimating the DM distribution parameters while comparing the recent Languasco-Migliardi (LM), and the Yu-Shaw (YS) procedures, which address the well-known computational difficulties of evaluating its log-likelihood. Experiments were conducted using multiple datasets from different domains spanning polls, images, and IoT network traffic. They all showed the superiority of the LM procedure as it succeeded at estimating the DM parameters at the designated level of accuracy in all experiments, while the YS procedure failed to produce sufficiently accurate results (or any results at all) in several experiments. Moreover, the LM procedure achieved a speedup that ranged from 2-fold to 20-fold over YS.
- 31 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 47 (2) , 1181-1189
Efficient Analysis of Overdispersed Data Using an Accurate Computation of the Dirichlet Multinomial Distribution
Modeling count data using suitable statistical distributions has been instrumental for analyzing the patterns it conveys. However, failing to address critical aspects, like overdispersion, jeopardizes the effectiveness of such an analysis. In this paper, overdispersed count data is modeled using the Dirichlet Multinomial (DM) distribution by maximizing its likelihood using a fixed-point iteration algorithm. This is achieved by estimating the DM distribution parameters while comparing the recent Languasco-Migliardi (LM), and the Yu-Shaw (YS) procedures, which address the well-known computational difficulties of evaluating its log-likelihood. Experiments were conducted using multiple datasets from different domains spanning polls, images, and IoT network traffic. They all showed the superiority of the LM procedure as it succeeded at estimating the DM parameters at the designated level of accuracy in all experiments, while the YS procedure failed to produce sufficiently accurate results (or any results at all) in several experiments. Moreover, the LM procedure achieved a speedup that ranged from 2-fold to 20-fold over YS.
- Open Access
- 26 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Fast and accurate implementation of the Dirichlet multinomial log-likelihood function
Fitting overdispersed count data accurately and efficiently is instrumental for statistical modeling. Failing to capture the overdispersed nature of data yields to inaccurate model parameter and error estimations, and this jeopardizes the validity and reliability of statistical inferences. In this study, we expand on previous studies on developing efficient and accurate estimations of the Dirichlet Multinomial distribution log-likelihood function. A faster and accurate implementation of a state-of-the-art technique is presented and its performance is compared to Python's math and Scipy implementations of the same function. Experiments conducted using 10 different public datasets, two of which are not overdispersed, show that the proposed technique achieves a 1.5 up to 10 fold speed gain over both of Python's implementations of the log-likelihood function.
- 26 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Open AccessFast and accurate implementation of the Dirichlet multinomial log-likelihood function
Fitting overdispersed count data accurately and efficiently is instrumental for statistical modeling. Failing to capture the overdispersed nature of data yields to inaccurate model parameter and error estimations, and this jeopardizes the validity and reliability of statistical inferences. In this study, we expand on previous studies on developing efficient and accurate estimations of the Dirichlet Multinomial distribution log-likelihood function. A faster and accurate implementation of a state-of-the-art technique is presented and its performance is compared to Python's math and Scipy implementations of the same function. Experiments conducted using 10 different public datasets, two of which are not overdispersed, show that the proposed technique achieves a 1.5 up to 10 fold speed gain over both of Python's implementations of the log-likelihood function.
- Open Access
- 23 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Modeling and forecasting overdispersed IoT data using an efficient and accurate computation of the Dirichlet Multinomial distribution
The Internet of Things (IoT) has rapidly become a ubiquitous aspect of modern society, intertwining with our daily lives in many ways; while these advancements provide several beneficial effects, they also bring forth significant security concerns that must be addressed to safeguard sensitive data, ensure privacy, and prevent potential cyber threats. While security by design will undoubtedly help in hardening systems, security is and will remain an arm-race between attackers and defenders, hence, a most important feat in the field of security for networked systems is the capability to model traffic and provide predictions capable of identifying suspicious behavior. In this paper we model the overdispersed traffic of data collected from a device belonging to an IoT system using the Dirichlet Multinomial distribution and use that model to forecast the device traffic for the next 24 hours. Also, we compare the efficiency and accuracy of some state of the art techniques in generating traffic predictions.
- 23 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Open AccessModeling and forecasting overdispersed IoT data using an efficient and accurate computation of the Dirichlet Multinomial distribution
The Internet of Things (IoT) has rapidly become a ubiquitous aspect of modern society, intertwining with our daily lives in many ways; while these advancements provide several beneficial effects, they also bring forth significant security concerns that must be addressed to safeguard sensitive data, ensure privacy, and prevent potential cyber threats. While security by design will undoubtedly help in hardening systems, security is and will remain an arm-race between attackers and defenders, hence, a most important feat in the field of security for networked systems is the capability to model traffic and provide predictions capable of identifying suspicious behavior. In this paper we model the overdispersed traffic of data collected from a device belonging to an IoT system using the Dirichlet Multinomial distribution and use that model to forecast the device traffic for the next 24 hours. Also, we compare the efficiency and accuracy of some state of the art techniques in generating traffic predictions.