Giuseppe Pirillo
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
Research Subjects
Giuseppe Pirillo has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Christian J. Michel
Equipe de Bioinformatique Théorique, BFO, LSIIT (UMR 7005), Université de Strasbourg, Pôle API, Boulevard Sébastien Brant, 67400 Illkirch, France
2 shared publications - Marco Pellegrini
Università della Calabria
2 shared publications - Christian Jean Michel
Theoretical Bioinformatics, ICube, C.N.R.S., University of Strasbourg, Illkirch, France
1 shared publication - Fabio Caldarola
University of Calabria
1 shared publication - Gianfranco D'Atri
University of Calabria
1 shared publication - Mario Maiolo
University of Calabria
1 shared publication
Latest Publications
- Open Access
- 29 August 2020
- Published by Springer Nature in Soft Computing
- Vol. 24 (23) , 17497-17508
New algebraic and geometric constructs arising from Fibonacci numbers
Fibonacci numbers are the basis of a new geometric construction that leads to the definition of a family $$\{C_n:n\in \mathbb {N}\}$$ of octagons that come very close to the regular octagon. Such octagons, in some previous articles, have been given the name of Carboncettus octagons for historical reasons. Going further, in this paper we want to introduce and investigate some algebraic constructs that arise from the family $$\{C_n:n\in \mathbb {N}\}$$ and therefore from Fibonacci numbers: From each Carboncettus octagon $$C_n$$ , it is possible to obtain an infinite (right) word $$W_n$$ on the binary alphabet $$\{0,1\}$$ , which we will call the nth Carboncettus word. The main theorem shows that all the Carboncettus words thus defined are Sturmian words except in the case $$n=5$$ . The fifth Carboncettus word $$W_5$$ is in fact the only word of the family to be purely periodic: It has period 17 and periodic factor 000 100 100 010 010 01. Finally, we also define a further word $$W_{\infty }$$ named the Carboncettus limit word and, as second main result, we prove that the limit of the sequence of Carboncettus words is $$W_{\infty }$$ itself.- 29 August 2020
- Published by Springer Nature in Soft Computing
- Vol. 24 (23) , 17497-17508
Open AccessNew algebraic and geometric constructs arising from Fibonacci numbers
Fibonacci numbers are the basis of a new geometric construction that leads to the definition of a family $$\{C_n:n\in \mathbb {N}\}$$ of octagons that come very close to the regular octagon. Such octagons, in some previous articles, have been given the name of Carboncettus octagons for historical reasons. Going further, in this paper we want to introduce and investigate some algebraic constructs that arise from the family $$\{C_n:n\in \mathbb {N}\}$$ and therefore from Fibonacci numbers: From each Carboncettus octagon $$C_n$$ , it is possible to obtain an infinite (right) word $$W_n$$ on the binary alphabet $$\{0,1\}$$ , which we will call the nth Carboncettus word. The main theorem shows that all the Carboncettus words thus defined are Sturmian words except in the case $$n=5$$ . The fifth Carboncettus word $$W_5$$ is in fact the only word of the family to be purely periodic: It has period 17 and periodic factor 000 100 100 010 010 01. Finally, we also define a further word $$W_{\infty }$$ named the Carboncettus limit word and, as second main result, we prove that the limit of the sequence of Carboncettus words is $$W_{\infty }$$ itself. - Open Access
A characterization of Fibonacci numbers
The link between the equation $b(b+a)-a^2=0$ concerning the side $b$ and the diagonal $a$ of a regular pentagon and the {\it Cassini identity} $F_{i}F_{i+2}-F_{i+1}^2=(-1)^{i}$, concerning three consecutive Fibonacci numbers, is very strong. In this paper we present our thesis that the two mentioned equations were "almost simultaneously" discovered by the {\it Pythagorean School}.Open AccessA characterization of Fibonacci numbers
The link between the equation $b(b+a)-a^2=0$ concerning the side $b$ and the diagonal $a$ of a regular pentagon and the {\it Cassini identity} $F_{i}F_{i+2}-F_{i+1}^2=(-1)^{i}$, concerning three consecutive Fibonacci numbers, is very strong. In this paper we present our thesis that the two mentioned equations were "almost simultaneously" discovered by the {\it Pythagorean School}. - 1 January 2016
- Published by Elsevier in Journal of Theoretical Biology
- Vol. 389, 40-46
Maximal dinucleotide and trinucleotide circular codes
- 1 January 2016
- Published by Elsevier in Journal of Theoretical Biology
- Vol. 389, 40-46
Maximal dinucleotide and trinucleotide circular codes
- 1 January 2014
- Vol. 107, 89-95
On the dinucleotide circular codes of maximum cardinality.
In a recent paper, Michel and Pirillo prove that there are 24 dinucleotide circular codes of maximum cardinality over an alphabet of cardinality 4. In this paper we find the exact number of dinucleotide circular codes of maximum cardinality for any given (finite) cardinality of the alphabet. Moreover, we describe the structure of these codes.
- 1 January 2014
- Vol. 107, 89-95
On the dinucleotide circular codes of maximum cardinality.
In a recent paper, Michel and Pirillo prove that there are 24 dinucleotide circular codes of maximum cardinality over an alphabet of cardinality 4. In this paper we find the exact number of dinucleotide circular codes of maximum cardinality for any given (finite) cardinality of the alphabet. Moreover, we describe the structure of these codes.
- Open Access
- 25 August 2011
- Published by Hindawi Limited in International Journal of Combinatorics
- Vol. 2011, 1-14
Strong Trinucleotide Circular Codes
Recently, we identified a hierarchy relation between trinucleotide comma-free codes and trinucleotide circular codes (see our previous works). Here, we extend our hierarchy with two new classes of codes, called and codes, which are stronger than the comma-free codes. We also prove that no circular code with 20 trinucleotides is a code and that a circular code with 20 trinucleotides is comma-free if and only if it is a code. Finally, we point out the possible role of the symmetric group in the mathematical study of trinucleotide circular codes.- 25 August 2011
- Published by Hindawi Limited in International Journal of Combinatorics
- Vol. 2011, 1-14
Open AccessStrong Trinucleotide Circular Codes
Recently, we identified a hierarchy relation between trinucleotide comma-free codes and trinucleotide circular codes (see our previous works). Here, we extend our hierarchy with two new classes of codes, called and codes, which are stronger than the comma-free codes. We also prove that no circular code with 20 trinucleotides is a code and that a circular code with 20 trinucleotides is comma-free if and only if it is a code. Finally, we point out the possible role of the symmetric group in the mathematical study of trinucleotide circular codes. - 1 April 2010
- Published by Elsevier in Computational Biology and Chemistry
- Vol. 34 (2) , 122-125
Identification of all trinucleotide circular codes
- 1 April 2010
- Published by Elsevier in Computational Biology and Chemistry
- Vol. 34 (2) , 122-125
Identification of all trinucleotide circular codes
- 27 April 2008
- Published by Springer Nature in Annals of Combinatorics
- Vol. 12 (1) , 115-121
Morse and Hedlund’s Skew Sturmian Words Revisited
- 27 April 2008
- Published by Springer Nature in Annals of Combinatorics
- Vol. 12 (1) , 115-121
Morse and Hedlund’s Skew Sturmian Words Revisited
- 22 January 2008
- Published by EDP Sciences in RAIRO - Theoretical Informatics and Applications
- Vol. 42 (4) , 717-728
A hierarchy for circular codes
We first prove an extremal property of the infinite Fibonacci* word f: the family of the palindromic prefixes {hn | n ≥ 6} of f is not only a circular code but “almost” a comma-free one (see Prop. 12 in Sect. 4). We also extend to a more general situation the notion of a necklace introduced for the study of trinucleotides codes on the genetic alphabet, and we present a hierarchy relating two important classes of codes, the comma-free codes and the circular ones.
- 22 January 2008
- Published by EDP Sciences in RAIRO - Theoretical Informatics and Applications
- Vol. 42 (4) , 717-728
A hierarchy for circular codes
We first prove an extremal property of the infinite Fibonacci* word f: the family of the palindromic prefixes {hn | n ≥ 6} of f is not only a circular code but “almost” a comma-free one (see Prop. 12 in Sect. 4). We also extend to a more general situation the notion of a necklace introduced for the study of trinucleotides codes on the genetic alphabet, and we present a hierarchy relating two important classes of codes, the comma-free codes and the circular ones.