SearcharxivSearch

arXiv subjects

Carlo Sanna

Publications and source records attributed to Carlo Sanna.

At least 19 recordsLinked to original sources

Counting contiguous superregular $4 \times 4$ matrices

This short paper has two goals. First, explaining a simple procedure (which is essentially folklore) that, sometimes, makes it possible to obtain a formula for the number of solutions to a system of multivariate polynomial inequalities over a finite field. Second, applying that procedure to prove a formula for the number of contiguous superregular $4 \times 4$ matrices over a finite field. The formula was previously conjectured by Appuswamy, Bazzani, Connelly, Ekaireb, Congero, and Zeger [Probability of super-regular matrices and MDS codes over finite fields, arXiv:2603.20983]. In addition, the same procedure is used to provide formulas for the number of contiguous superregular $3 \times 4$, $3 \times 5$, and $3 \times 6$ matrices over a finite field.

math.CO

Another factor of integer polynomials with minimal integrals

Let $N$ be a positive integer and let $S_N$ be the set of polynomials with integer coefficients, degree less than $N$, and minimal positive integral over $[0,1]$. D. Bazzanella initiated the study of $S_N$ because of its relation to the distribution of prime numbers. Indeed, it is possible to prove that $\sum_{p^m \leq N} \log p = -\log \int_0^1 P(x) \mathrm{d} x$ for every $P \in S_N$, where the sum runs over prime numbers $p$ and positive integers $m$ such that $p^m \leq N$. For each real number $t$, let $\lfloor t \rfloor$ denote the maximal integer not exceeding $t$. The main result of this paper states that there exist infinitely many polynomials $P \in S_N$ such that $\big(x^3(1 - x)^2\big)^{\lfloor N / 6 \rfloor}$ divides $P(x)$ in $\mathbb{Z}[x]$. This improves upon a similar result of Sanna, who proved the same claim but with the lower-degree polynomial $\big(x(1-x)\big)^{\lfloor N / 3 \rfloor}$ in place of $\big(x^3(1 - x)^2\big)^{\lfloor N / 6 \rfloor}$.

math.NT

Explicit inequalities for the nth lucky number

Gardiner, Lazarus, Metropolis, and Ulam introduced a variation of the sieve of Eratosthenes that (instead of producing the sequence of prime numbers) produces the sequence of "lucky numbers". The distribution of lucky numbers has a striking similarity to that of prime numbers. In particular, Hawkins and Briggs proved that if $\ell_n$ denotes the $n$th lucky number then $\ell_n \sim n \log n$, which is analogous to the prime number theorem. This work provides explicit upper and lower bounds on $\ell_n$.

math.NT

A lower bound for the number of Egyptian fractions

An Egyptian fraction is a sum of the form $1/n_1 + \cdots + 1/n_r$ where $n_1, \dots, n_k$ are distinct positive integers. We prove explicit lower bounds for the cardinality of the set $E_N$ of rational numbers that can be represented by Egyptian fractions with denominators not exceeding $N$. More precisely, we show that for every integer $k \geq 4$ such that $\ln_k N \geq 3/2$ it holds $$ \frac{\ln(|E_N|)}{\ln 2} \geq \Big(2 - \frac{3}{\ln_k N}\Big)\frac{N}{\ln N}\prod_{j=3}^{k} \ln_j N , $$ where $\ln_k$ denotes the $k$-th iterate of the natural logarithm. This improves on a previous result of Bleicher and Erdős who established a similar bound but under the more stringent condition $\ln_k N\geq k$ and with a leading constant of $1$. Furthermore, we provide some methods to compute the exact values of $|E_N|$ for large positive integers $N$, and we give a table of $|E_N|$ for $N$ up to $154$.

math.NT

A note on the power sums of the number of Fibonacci partitions

For every nonnegative integer $n$, let $r_F(n)$ be the number of ways to write $n$ as a sum of Fibonacci numbers, where the order of the summands does not matter. Moreover, for all positive integers $p$ and $N$, let \begin{equation*} S_{F}^{(p)}(N) := \sum_{n = 0}^{N - 1} \big(r_F(n)\big)^p . \end{equation*} Chow, Jones, and Slattery determined the order of growth of $S_{F}^{(p)}(N)$ for $p \in \{1,2\}$. We prove that, for all positive integers $p$, there exists a real number $λ_p > 1$ such that \begin{equation*} S^{(p)}_F(N) \asymp_p N^{(\log λ_p) /\!\log φ} \end{equation*} as $N \to +\infty$, where $φ:= (1 + \sqrt{5})/2$ is the golden ratio. Furthermore, we show that \begin{equation*} \lim_{p \to +\infty} λ_p^{1/p} = φ^{1/2} . \end{equation*} Our proofs employ automata theory and a result on the generalized spectral radius due to Blondel and Nesterov.

math.NT

On the number of solutions to a random instance of the permuted kernel problem

The Permuted Kernel Problem (PKP) is a problem in linear algebra that was first introduced by Shamir in 1989. Roughly speaking, given an $\ell \times m$ matrix $\mathbf{A}$ and an $m \times 1$ vector $\mathbf{b}$ over a finite field of $q$ elements $\mathbb{F}_q$, the PKP asks to find an $m \times m$ permutation matrix $\mathbfπ$ such that $\mathbfπ \mathbf{b}$ belongs to the kernel of $\mathbf{A}$. In recent years, several post-quantum digital signature schemes whose security can be provably reduced to the hardness of solving random instances of the PKP have been proposed. In this regard, it is important to know the expected number of solutions to a random instance of the PKP in terms of the parameters $q,\ell,m$. Previous works have heuristically estimated the expected number of solutions to be $m! / q^\ell$. We provide, and rigorously prove, exact formulas for the expected number of solutions to a random instance of the PKP and the related Inhomogeneous Permuted Kernel Problem (IPKP), considering two natural ways of generating random instances.

math.CO

Counting numbers that are divisible by the product of their digits

Let $b \geq 3$ be a positive integer. A natural number is said to be a base-$b$ Zuckerman number if it is divisible by the product of its base-$b$ digits. Let $\mathcal{Z}_b(x)$ be the set of base-$b$ Zuckerman numbers that do not exceed $x$, and assume that $x \to +\infty$. First, we prove an upper bound of the form $|\mathcal{Z}_b(x)| < x^{z_b^{+} + o(1)}$, where $z_b^{+} \in (0,1)$ is an effectively computable constant. In particular, we have that $z_{10}^+ = 0.665{\scriptstyle\ldots}$, which improves upon the previous upper bound $|\mathcal{Z}_{10}(x)| < x^{0.717}$ due to Sanna. Moreover, we prove that $|\mathcal{Z}_{10}(x)| > x^{0.204}$, which improves upon the previous lower bound $|\mathcal{Z}_{10}(x)| > x^{0.122}$, due to De Koninck and Luca. Second, we provide a heuristic suggesting that $|\mathcal{Z}_b(x)| = x^{z_b + o(1)}$, where $z_b \in (0,1)$ is an effectively computable constant. In particular, we have that $z_{10} = 0.419{\scriptstyle\ldots}$. Third, we provide algorithms to count, respectively enumerate, the elements of $\mathcal{Z}_b(x)$, and we determine their complexities. Implementing one of such counting algorithms, we computed $|\mathcal{Z}_b(x)|$ for $b=3,\dots,12$ and large values of $x$ (depending on $b$), and we showed that the results are consistent with our heuristic.

math.NT

On the number of residues of certain second-order linear recurrences

For every monic polynomial $f \in \mathbb{Z}[X]$ with $\operatorname{deg}(f) \geq 1$, let $\mathcal{L}(f)$ be the set of all linear recurrences with values in $\mathbb{Z}$ and characteristic polynomial $f$, and let \begin{equation*} \mathcal{R}(f) := \big\{ρ(\mathbf{x}; m) : \mathbf{x} \in \mathcal{L}(f), \, m \in \mathbb{Z}^+ \big\} , \end{equation*} where $ρ(\mathbf{x}; m)$ is the number of distinct residues of $\mathbf{x}$ modulo $m$. Dubickas and Novikas proved that $\mathcal{R}(X^2 - X - 1) = \mathbb{Z}^+$. We generalize this result by showing that $\mathcal{R}(X^2 - a_1 X - 1) = \mathbb{Z}^+$ for every nonzero integer $a_1$. As a corollary, we deduce that for all integers $a_1 \geq 1$ and $k \geq 4$ there exists $ξ\in \mathbb{R}$ such that the sequence of fractional parts $\big(\!\operatorname{frac}(ξα^n)\big)_{n \geq 0}$, where $α:= \big(a_1 + \sqrt{a_1^2 + 4}\,\big) / 2$, has exactly $k$ limit points. Our proofs are constructive and employ some results on the existence of special primitive divisors of certain Lehmer sequences.

math.NT

Smaller public keys for MinRank-based schemes

MinRank is an NP-complete problem in linear algebra whose characteristics make it attractive to build post-quantum cryptographic primitives. Several MinRank-based digital signature schemes have been proposed. In particular, two of them, MIRA and MiRitH, have been submitted to the NIST Post-Quantum Cryptography Standardization Process. In this paper, we propose a key-generation algorithm for MinRank-based schemes that reduces the size of the public key to about 50% of the size of the public key generated by the previous best (in terms of public-key size) algorithm. Precisely, the size of the public key generated by our algorithm sits in the range of 328-676 bits for security levels of 128-256 bits. We also prove that our algorithm is as secure as the previous ones.

cs.CR

On the distribution of the entries of a fixed-rank random matrix over a finite field

Let $r > 0$ be an integer, let $\mathbb{F}_q$ be a finite field of $q$ elements, and let $\mathcal{A}$ be a nonempty proper subset of $\mathbb{F}_q$. Moreover, let $\mathbf{M}$ be a random $m \times n$ rank-$r$ matrix over $\mathbb{F}_q$ taken with uniform distribution. We prove, in a precise sense, that, as $m, n \to +\infty$ and $r,q,\mathcal{A}$ are fixed, the number of entries of $\mathbf{M}$ that belong to $\mathcal{A}$ approaches a normal distribution.

math.CO

On the inverse of a Fibonacci number modulo a Fibonacci number being a Fibonacci number

Let $(F_n)_{n \geq 1}$ be the sequence of Fibonacci numbers. For all integers $a$ and $b \geq 1$ with $\gcd(a, b) = 1$, let $[a^{-1} \!\bmod b]$ be the multiplicative inverse of $a$ modulo $b$, which we pick in the usual set of representatives $\{0, 1, \dots, b-1\}$. Put also $[a^{-1} \!\bmod b] := \infty$ when $\gcd(a, b) > 1$. We determine all positive integers $m$ and $n$ such that $[F_m^{-1} \bmod F_n]$ is a Fibonacci number. This extends a previous result of Prempreesuk, Noppakaew, and Pongsriiam, who considered the special case $m \in \{3, n - 3, n - 2, n - 1\}$ and $n \geq 7$. Let $(L_n)_{n \geq 1}$ be the sequence of Lucas numbers. We also determine all positive integers $m$ and $n$ such that $[L_m^{-1} \bmod L_n]$ is a Lucas number.

math.NT

On the index of appearance of a Lucas sequence

Let $\mathbf{u} = (u_n)_{n \geq 0}$ be a Lucas sequence, that is, a sequence of integers satisfying $u_0 = 0$, $u_1 = 1$, and $u_n = a_1 u_{n - 1} + a_2 u_{n - 2}$ for every integer $n \geq 2$, where $a_1$ and $a_2$ are fixed nonzero integers. For each prime number $p$ with $p \nmid 2a_2D_{\mathbf{u}}$, where $D_{\mathbf{u}} := a_1^2 + 4a_2$, let $ρ_{\mathbf{u}}(p)$ be the rank of appearance of $p$ in $\mathbf{u}$, that is, the smallest positive integer $k$ such that $p \mid u_k$. It is well known that $ρ_{\mathbf{u}}(p)$ exists and that $p \equiv \big(D_{\mathbf{u}} \mid p \big) \pmod {ρ_{\mathbf{u}}(p)}$, where $\big(D_{\mathbf{u}} \mid p \big)$ is the Legendre symbol. Define the index of appearance of $p$ in $\mathbf{u}$ as $ι_{\mathbf{u}}(p) := \left(p - \big(D_{\mathbf{u}} \mid p \big)\right) / ρ_{\mathbf{u}}(p)$. For each positive integer $t$ and for every $x > 0$, let $\mathcal{P}_{\mathbf{u}}(t, x)$ be the set of prime numbers $p$ such that $p \leq x$, $p \nmid 2a_2 D_{\mathbf{u}}$, and $ι_{\mathbf{u}}(p) = t$. Under the Generalized Riemann Hypothesis, and under some mild assumptions on $\mathbf{u}$, we prove that \begin{equation*} \#\mathcal{P}_{\mathbf{u}}(t, x) = A\, F_{\mathbf{u}}(t) \, G_{\mathbf{u}}(t) \, \frac{x}{\log x} + O_{\mathbf{u}}\!\left(\frac{x}{(\log x)^2} + \frac{x \log (2\log x)}{φ(t) (\log x)^2}\right) , \end{equation*} for all positive integers $t$ and for all $x > t^3$, where $A$ is the Artin constant, $F_{\mathbf{u}}(\cdot)$ is a multiplicative function, and $G_{\mathbf{u}}(\cdot)$ is a periodic function (both these functions are effectively computable in terms of $\mathbf{u}$). Furthermore, we provide some explicit examples and numerical data.

math.NT

On the greatest common divisor of $n$ and the $n$th Fibonacci number, II

Let $\mathcal{A}$ be the set of all integers of the form $\gcd(n, F_n)$, where $n$ is a positive integer and $F_n$ denotes the $n$th Fibonacci number. Leonetti and Sanna proved that $\mathcal{A}$ has natural density equal to zero, and asked for a more precise upper bound. We prove that \begin{equation*} \#\big(\mathcal{A} \cap [1, x]\big) \ll \frac{x \log \log \log x}{\log \log x} \end{equation*} for all sufficiently large $x$.

math.NT

Greatest common divisors of shifted primes and Fibonacci numbers

Let $(F_n)$ be the sequence of Fibonacci numbers and, for each positive integer $k$, let $\mathcal{P}_k$ be the set of primes $p$ such that $\gcd(p - 1, F_{p - 1}) = k$. We prove that the relative density $\text{r}(\mathcal{P}_k)$ of $\mathcal{P}_k$ exists, and we give a formula for $\text{r}(\mathcal{P}_k)$ in terms of an absolutely convergent series. Furthermore, we give an effective criterion to establish if a given $k$ satisfies $\text{r}(\mathcal{P}_k) > 0$, and we provide upper and lower bounds for the counting function of the set of such $k$'s. As an application of our results, we give a new proof of a lower bound for the counting function of the set of integers of the form $\gcd(n, F_n)$, for some positive integer $n$. Our proof is more elementary than the previous one given by Leonetti and Sanna, which relies on a result of Cubre and Rouse.

math.NT

Zeckendorf representation of multiplicative inverses modulo a Fibonacci number

Prempreesuk, Noppakaew, and Pongsriiam determined the Zeckendorf representation of the multiplicative inverse of $2$ modulo $F_n$, for every positive integer $n$ not divisible by $3$, where $F_n$ denotes the $n$th Fibonacci number. We determine the Zeckendorf representation of the multiplicative inverse of $a$ modulo $F_n$, for every fixed integer $a \geq 3$ and for all positive integers $n$ with $\gcd(a, F_n) = 1$. Our proof makes use of the so-called base-$φ$ expansion of real numbers.

math.NT

RLWE and PLWE over cyclotomic fields are not equivalent

We prove that the Ring Learning With Errors (RLWE) and the Polynomial Learning With Errors (PLWE) problems over the cyclotomic field $\mathbb{Q}(ζ_n)$ are not equivalent. Precisely, we show that reducing one problem to the other increases the noise by a factor that is more than polynomial in $n$. We do so by providing a lower bound, holding for infinitely many positive integers $n$, for the condition number of the Vandermonde matrix of the $n$th cyclotomic polynomial.

math.NT

A Survey on Coefficients of Cyclotomic Polynomials

Cyclotomic polynomials play an important role in several areas of mathematics and their study has a very long history, which goes back at least to Gauss (1801). In particular, the properties of their coefficients have been intensively studied by several authors, and in the last 10 years there has been a burst of activity in this field of research. This concise survey attempts to collect the main results regarding the coefficients of the cyclotomic polynomials and to provide all the relevant references to their proofs. Previous surveys on this topic were given by Lenstra (1979), Vaughan (1989), and Thangadurai (2000).

math.NT

On the number of residues of linear recurrences

For every nonconstant monic polynomial $g \in \mathbb{Z}[X]$, let $\mathfrak{M}(g)$ be the set of positive integers $m$ for which there exist an integer linear recurrence $(s_n)_{n \geq 0}$ having characteristic polynomial $g$ and a positive integer $M$ such that $(s_n)_{n \geq 0}$ has exactly $m$ distinct residues modulo $M$. Dubickas and Novikas proved that $\mathfrak{M}(X^2 - X - 1) = \mathbb{N}$. We study $\mathfrak{M}(g)$ in the case in which $g$ is divisible by a monic quadratic polynomial $f \in \mathbb{Z}[X]$ with roots $α,β$ such that $αβ= \pm 1$ and $α/ β$ is not a root of unity. We show that this problem is related to the existence of special primitive divisors of certain Lehmer sequences, and we deduce some consequences on $\mathfrak{M}(g)$. In particular, for $αβ= -1$, we prove that $m \in \mathfrak{M}(g)$ for every integer $m \geq 7$ with $m \neq 10$ and $4 \nmid m$.

math.NT