Searcharxiv⌕ Search

arXiv subjects

Stefano Barbero

Publications and source records attributed to Stefano Barbero.

At least 19 recordsLinked to original sources
arXiv2024

Algebraic integers with continued fraction expansions containing palindromes and square roots with prescribed periods

We present a characterization of the algebraic integers with continued fraction expansions of the form $[a_0, \overline{a_1, \ldots, a_n, s}]$, where $(a_1, \ldots, a_n)$ is a palindrome and $s \in \mathbb{N}_{\geq 1}$. In particular, we focus on the special case where $(a_1, \ldots, a_n) = (m, \ldots, m)$, providing a detailed characterizations of the corresponding algebraic integers and $s$ in terms of Fibonacci polynomials. Then, we derive new expansions of square roots of integers with these periods, given $m$ and $n$. Moreover, we explicitly determine the fundamental solutions of both positive and negative Pell's equations corresponding to this family of integers.

math.NT↗
arXiv2023

Some notes on the algebraic structure of linear recurrent sequences

Several operations can be defined on the set of all linear recurrent sequences, such as the binomial convolution (Hurwitz product) or the multinomial convolution (Newton product). Using elementary techniques, we prove that this set equipped with the termwise sum and the aforementioned products are R-algebras, given any commutative ring $R$ with identity. Moreover, we provide explicitly a characteristic polynomial of the Hurwitz product and Newton product of any two linear recurrent sequences. Finally, we also investigate whether these $R-$algebras are isomorphic, considering also the R-algebras obtained using the Hadamard product and the convolution product.

math.NT↗
arXiv2020

Rotational analysis of ChaCha permutation

We show that the underlying permutation of ChaCha20 stream cipher does not behave as a random permutation for up to 17 rounds with respect to rotational cryptanalysis. In particular, we derive a lower and an upper bound for the rotational probability through ChaCha quarter round, we show how to extend the bound to a full round and then to the full permutation. The obtained bounds show that the probability to find what we call a parallel rotational collision is, for example, less than $2^{-488}$ for 17 rounds of ChaCha permutation, while for a random permutation of the same input size, this probability is $2^{-511}$. We remark that our distinguisher is not an attack to ChaCha20 stream cipher, but rather a theoretical analysis of its internal permutation from the point of view of rotational cryptanalysis.

math.CO↗
arXiv2020

An isomorphism between the convolution product and the componentwise sum connected to the D'Arcais numbers and the Ramanujan tau function

Given a commutative ring $R$ with identity, let $H_R$ be the set of sequences of elements in $R$. We investigate a novel isomorphism between $(H_R, +)$ and $(\tilde H_R,*)$, where $+$ is the componentwise sum, $*$ is the convolution product (or Cauchy product) and $\tilde H_R$ the set of sequences starting with $1_R$. We also define a recursive transform over $H_R$ that, together to the isomorphism, allows to highlight new relations among some well studied integer sequences. Moreover, these connections allow to introduce a family of polynomials connected to the D'Arcais numbers and the Ramanujan tau function. In this way, we also deduce relations involving the Bell polynomials, the divisor function and the Ramanujan tau function. Finally, we highlight a connection between Cauchy and Dirichlet products.

math.NT↗
arXiv2020

Approximations of algebraic irrationalities with matrices

We discuss the use of matrices for providing sequences of rationals that approximate algebraic irrationalities. In particular, we study the regular representation of algebraic extensions, proving that ratios between two entries of the matrix of the regular representation converge to specific algebraic irrationalities. As an interesting special case, we focus on cubic irrationalities giving a generalization of the Khovanskii matrices for approximating cubic irrationalities. We discuss the quality of such approximations considering both rate of convergence and size of denominators. Moreover, we briefly perform a numerical comparison with well--known iterative methods (such as Newton and Halley ones), showing that the approximations provided by regular representations appear more accurate for the same size of the denominator.

math.NT↗
arXiv2020

Linear fractional transformations and non-linear leaping convergents of some continued fractions

For $α_0 = \left[a_0, a_1, \ldots\right]$ an infinite continued fraction and $σ$ a linear fractional transformation, we study the continued fraction expansion of $σ(α_0)$ and its convergents. We provide the continued fraction expansion of $σ(α_0)$ for four general families of continued fractions and when $\left|\det σ\right| = 2$. We also find nonlinear recurrence relations among the convergents of $σ(α_0)$ which allow us to highlight relations between convergents of $α_0$ and $σ(α_0)$. Finally, we apply our results to some special and well-studied continued fractions, like Hurwitzian and Tasoevian ones, giving a first study about leaping convergents having steps provided by nonlinear functions.

math.NT↗
arXiv2018

On the operations of sequences in rings and binomial type sequences

Given a commutative ring with identity $R$, many different and interesting operations can be defined over the set $H_R$ of sequences of elements in $R$. These operations can also give $H_R$ the structure of a ring. We study some of these operations, focusing on the binomial convolution product and the operation induced by the composition of exponential generating functions. We provide new relations between these operations and their invertible elements. We also study automorphisms of the Hurwitz series ring, highlighting that some well--known transforms of sequences (such as the Stirling transform) are special cases of these automorphisms. Moreover, we introduce a novel isomorphism between $H_R$ equipped with the componentwise sum and the set of the sequences starting with 1 equipped with the binomial convolution product. Finally, thanks to this isomorphism, we find a new method for characterizing and generating all the binomial type sequences.

math.NT↗
arXiv2017

Groups and monoids of Pythagorean triples connected to conics

We define operations that give the set of all Pythagorean triples a structure of commutative monoid. In particular, we define these operations by using injections between integer triples and $3 \times 3$ matrices. Firstly, we completely characterize these injections that yield commutative monoids of integer triples. Secondly, we determine commutative monoids of Pythagorean triples characterizing some Pythagorean triple preserving matrices. Moreover, this study offers unexpectedly an original connection with groups over conics. Using this connection, we determine groups composed by Pythagorean triples with the studied operations.

math.NT↗
arXiv2017

Some combinatorial properties of the Hurwitz series ring

We study some properties and perspectives of the Hurwitz series ring $H_R[[t]]$, for a commutative ring with identity $R$. Specifically, we provide a closed form for the invertible elements by means of the complete ordinary Bell polynomials, we highlight some connections with well--known transforms of sequences, and we see that the Stirling transforms are automorphisms of $H_R[[t]]$. Moreover, we focus the attention on some special subgroups studying their properties. Finally, we introduce a new transform of sequences that allows to see one of this subgroup as an ultrametric dynamic space.

math.NT↗
arXiv2017

Linear divisibility sequences and Salem numbers

We study linear divisibility sequences of order 4, providing a characterization by means of their characteristic polynomials and finding their factorization as a product of linear divisibility sequences of order 2. Moreover, we show a new interesting connection between linear divisibility sequences and Salem numbers. Specifically, we generate linear divisibility sequences of order 4 by means of Salem numbers modulo 1.

math.NT↗
arXiv2016

Generalized Vandermonde Determinants and Characterization of Divisibility Sequences

We present a different proof of the characterization of non--degenerate recurrence sequences, which are also divisibility sequences, given by Van der Poorten, Bezevin, and Petho in their paper "A Full Characterisation of Divisibility Sequence". Our proof is based on an interesting determinant identity related to impulse sequences, arising from the evaluation of a generalized Vandermonde determinant. As a consequence of this new proof we can find a more precise form for the resultant sequence presented in their paper, in the general case of non--degenerate divisibility sequences having minimal polynomial with multiple roots.

math.NT↗
arXiv2016

The Biharmonic mean

We briefly describe some well-known means and their properties, focusing on the relationship with integer sequences. In particular, the harmonic numbers, deriving from the harmonic mean, motivate the definition of a new kind of mean that we call the biharmonic mean. The biharmonic mean allows to introduce the biharmonic numbers, providing a new characterization for primes. Moreover, we highlight some interesting divisibility properties and we characterize the semi--prime biharmonic numbers showing their relationship with linear recurrent sequences that solve certain Diophantine equations.

math.NT↗
arXiv2015

Polynomial sequences on quadratic curves

In this paper we generalize the study of Matiyasevich on integer points over conics, introducing the more general concept of radical points. With this generalization we are able to solve in positive integers some Diophantine equations, relating these solutions by means of particular linear recurrence sequences. We point out interesting relationships between these sequences and known sequences in OEIS. We finally show connections between these sequences and Chebyshev and Morgan-Voyce polynomials, finding new identities.

math.NT↗
arXiv2014

Colored compositions, Invert operator and elegant compositions with the "black tie"

This paper shows how the study of colored compositions of integers reveals some unexpected and original connection with the Invert operator. The Invert operator becomes an important tool to solve the problem of directly counting the number of colored compositions for any coloration. The interesting consequences arising from this relationship also give an immediate and simple criterion to determine whether a sequence of integers counts the number of some colored compositions. Applications to Catalan and Fibonacci numbers naturally emerge, allowing to clearly answer to some open questions. Moreover, the definition of colored compositions with the "black tie" provides straightforward combinatorial proofs to a new identity involving multinomial coefficients and to a new closed formula for the Invert operator. Finally, colored compositions with the "black tie" give rise to a new combinatorial interpretation for the convolution operator, and to a new and easy method to count the number of parts of colored compositions.

math.NT↗
arXiv2014

Construction and Composition of Rooted Trees via Descent Functions

We propose a novel approach for studying rooted trees by using functions that we will call descent functions. We provide a construction method for rooted trees that allows to study their properties through the use of descent functions. Moreover, in this way, we are able to compose rooted trees with each other. Such a new composition of rooted trees is a very powerful tool applied in this paper in order to obtain important results as the creation of new rational and Pythagorean trees.

math.NT↗
arXiv2014

Periodic representations and rational approximations of square roots

In this paper the properties of Rédei rational functions are used to derive rational approximations for square roots and both Newton and Padé approximations are given as particular cases. As a consequence, such approximations can be derived directly by power matrices. Moreover, Rédei rational functions are introduced as convergents of particular periodic continued fractions and are applied for approximating square roots in the field of p-adic numbers and to study periodic representations. Using the results over the real numbers, we show how to construct periodic continued fractions and approximations of square roots which are simultaneously valid in the real and in the p-adic field.

math.NT↗
arXiv2014

Identities Involving Zeros of Ramanujan and Shanks Cubic Polynomials

In this paper we highlight the connection between Ramanujan cubic polynomials (RCPs) and a class of polynomials, the Shanks cubic polynomials (SCPs), which generate cyclic cubic fields. In this way we provide a new characterization for RCPs and we express the zeros of any RCP in explicit form, using trigonometric functions. Moreover, we observe that a cyclic transform of period three permutes these zeros. As a consequence of these results we provide many new and beautiful identities. Finally we connect RCPs to Gaussian periods, finding a new identity, and we study some integer sequences related to SCPs .

math.NT↗