Relevant bibliographies by topics / Tribonacci

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Tribonacci'

Author: Grafiati
Published: 4 June 2021
Last updated: 19 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Tribonacci.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Tribonacci"

1

Liu, Li, and Zhaolin Jiang. "Explicit Form of the Inverse Matrices of Tribonacci Circulant Type Matrices." Abstract and Applied Analysis 2015 (2015): 1–10. http://dx.doi.org/10.1155/2015/169726.

Full text
Abstract:
It is a hot topic that circulant type matrices are applied to networks engineering. The determinants and inverses of Tribonacci circulant type matrices are discussed in the paper. Firstly, Tribonacci circulant type matrices are defined. In addition, we show the invertibility of Tribonacci circulant matrix and present the determinant and the inverse matrix based on constructing the transformation matrices. By utilizing the relation between left circulant,g-circulant matrices and circulant matrix, the invertibility of Tribonacci left circulant and Tribonaccig-circulant matrices is also discussed. Finally, the determinants and inverse matrices of these matrices are given, respectively.
APA, Harvard, Vancouver, ISO, and other styles
2

Soykan, Yüksel. "Tribonacci and Tribonacci-Lucas Sedenions." Mathematics 7, no. 1 (January 11, 2019): 74. http://dx.doi.org/10.3390/math7010074.

Full text
Abstract:
The sedenions form a 16-dimensional Cayley-Dickson algebra. In this paper, we introduce the Tribonacci and Tribonacci-Lucas sedenions. Furthermore, we present some properties of these sedenions and derive relationships between them.
APA, Harvard, Vancouver, ISO, and other styles
3

Tasyurdu, Yasemin. "Tribonacci and Tribonacci-Lucas hybrid numbers." International Journal of Contemporary Mathematical Sciences 14, no. 4 (2019): 245–54. http://dx.doi.org/10.12988/ijcms.2019.91124.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Tasyurdu, Yasemin. "Hyperbolic Tribonacci and Tribonacci-Lucas sequences." International Journal of Mathematical Analysis 13, no. 12 (2019): 565–72. http://dx.doi.org/10.12988/ijma.2019.91167.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Frontczak, Robert. "Sums of Tribonacci and Tribonacci-Lucas numbers." International Journal of Mathematical Analysis 12, no. 1 (2018): 19–24. http://dx.doi.org/10.12988/ijma.2018.712153.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Vieira, Renata Passos Machado, and Francisco Regis Vieira Alves. "IDENTIDADES TRIBONACCI." Revista Sergipana de Matemática e Educação Matemática 4, no. 1 (April 27, 2019): 216–26. http://dx.doi.org/10.34179/revisem.v4i1.9823.

Full text
Abstract:
O presente escrito realiza um estudo da sequência de Tribonacci, baseado no mesmo raciocínio da recorrência da Sequência de Fibonacci. Assim, foram estudadas algumas propriedades dos números inteiros positivos, dentre elas a soma dos termos da Sequência Generalizada de Tribonacci, bem como o comportamento dos termos desses números para índices negativos.
APA, Harvard, Vancouver, ISO, and other styles
7

Demirci, Musa, and Ismail Naci Cangul. "Tribonacci graphs." ITM Web of Conferences 34 (2020): 01002. http://dx.doi.org/10.1051/itmconf/20203401002.

Full text
Abstract:
Special numbers have very important mathematical properties alongside their numerous applications in many fields of science. Probably the most important of those is the Fibonacci numbers. In this paper, we use a generalization of Fibonacci numbers called tribonacci numbers having very limited properties and relations compared to Fibonacci numbers. There is almost no result on the connections between these numbers and graphs. A graph having a degree sequence consisting of t successive tribonacci numbers is called a tribonacci graph of order t. Recently, a new graph parameter named as omega invariant has been introduced and shown to be very informative in obtaining combinatorial and topological properties of graphs. It is useful for graphs having the same degree sequence and gives some common properties of the realizations of this degree sequence together with some properties especially connectedness and cyclicness of all realizations. In this work, we determined all the tribonacci graphs of any order by means of some combinatorial results. Those results should be useful in networks with large degree sequences and cryptographic applications with special numbers.
APA, Harvard, Vancouver, ISO, and other styles
8

Messaoudi, A. "Tribonacci multiplication." Applied Mathematics Letters 15, no. 8 (November 2002): 981–85. http://dx.doi.org/10.1016/s0893-9659(02)00073-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Adegoke, Kunle, Adenike Olatinwo, and Winning Oyekanmi. "New Tribonacci recurrence relations and addition formulas." Notes on Number Theory and Discrete Mathematics 26, no. 4 (November 2020): 164–72. http://dx.doi.org/10.7546/nntdm.2020.26.4.164-172.

Full text
Abstract:
Only one three-term recurrence relation, namely, W_{r}=2W_{r-1}-W_{r-4}, is known for the generalized Tribonacci numbers, W_r, r\in Z, defined by W_{r}=W_{r-1}+W_{r-2}+W_{r-3} and W_{-r}=W_{-r+3}-W_{-r+2}-W_{-r+1}, where W_0, W_1 and W_2 are given, arbitrary integers, not all zero. Also, only one four-term addition formula is known for these numbers, which is W_{r + s} = T_{s - 1} W_{r - 1} + (T_{s - 1} + T_{s-2} )W_r + T_s W_{r + 1}, where ({T_r})_{r\in Z} is the Tribonacci sequence, a special case of the generalized Tribonacci sequence, with W_0 = T_0 = 0 and W_1 = W_2 = T_1 = T_2 = 1. In this paper we discover three new three-term recurrence relations and two identities from which a plethora of new addition formulas for the generalized Tribonacci numbers may be discovered. We obtain a simple relation connecting the Tribonacci numbers and the Tribonacci–Lucas numbers. Finally, we derive quadratic and cubic recurrence relations for the generalized Tribonacci numbers.
APA, Harvard, Vancouver, ISO, and other styles
10

Gómez Ruiz, Carlos Alexis, and Florian Luca. "Tribonacci Diophantine quadruples." Glasnik Matematicki 50, no. 1 (June 22, 2015): 17–24. http://dx.doi.org/10.3336/gm.50.1.02.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Tribonacci"

1

Fransson, Linnea. "Tribonacci Cat Map : A discrete chaotic mapping with Tribonacci matrix." Thesis, Linnéuniversitetet, Institutionen för matematik (MA), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-104706.

Full text
Abstract:
Based on the generating matrix to the Tribonacci sequence, the Tribonacci cat map is a discrete chaotic dynamical system, similar to Arnold's discrete cat map, but on three dimensional space. In this thesis, this new mapping is introduced and the properties of its matrix are presented. The main results of the investigation prove how the size of the domain of the map affects its period and explore the orbit lengths of non-trivial points. Different upper bounds to the map are studied and proved, and a conjecture based on numerical calculations is proposed. The Tribonacci cat map is used for applications such as 3D image encryption and colour encryption. In the latter case, the results provided by the mapping are compared to those from a generalised form of the map.
APA, Harvard, Vancouver, ISO, and other styles
2

Davila, Rosa. "Tribonacci Convolution Triangle." CSUSB ScholarWorks, 2019. https://scholarworks.lib.csusb.edu/etd/883.

Full text
Abstract:
A lot has been said about the Fibonacci Convolution Triangle, but not much has been said about the Tribonacci Convolution Triangle. There are a few ways to generate the Fibonacci Convolution Triangle. Proven through generating functions, Koshy has discovered the Fibonacci Convolution Triangle in Pascal's Triangle, Pell numbers, and even Tribonacci numbers. The goal of this project is to find inspiration in the Fibonacci Convolution Triangle to prove patterns that we observe in the Tribonacci Convolution Triangle. We start this by bringing in all the information that will be useful in constructing and solving these convolution triangles and find a way to prove them in an easy way.
APA, Harvard, Vancouver, ISO, and other styles
3

Meinke, Ashley Marie. "Fibonacci Numbers and Associated Matrices." Kent State University / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=kent1310588704.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Fransson, Jonas. "Generalized Fibonacci Series Considered modulo n." Thesis, Linnéuniversitetet, Institutionen för matematik (MA), 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-26844.

Full text
Abstract:
In this thesis we are investigating identities regarding Fibonacci sequences. In particular we are examiningthe so called Pisano period, which is the period for the Fibonacci sequence considered modulo n to repeatitself. The theory shows that it suces to compute Pisano periods for primes. We are also looking atthe same problems for the generalized Pisano period, which can be described as the Pisano period forthe generalized Fibonacci sequence.
APA, Harvard, Vancouver, ISO, and other styles
5

Almeida, Edjane Gomes dos Santos. "Propriedades e generalizações dos números de Fibonacci." Universidade Federal da Paraíba, 2014. http://tede.biblioteca.ufpb.br:8080/handle/tede/7658.

Full text
Abstract:
Submitted by Maria Suzana Diniz (msuzanad@hotmail.com) on 2015-11-30T12:34:27Z No. of bitstreams: 1 arquivototal.pdf: 766531 bytes, checksum: ad20186d0268a15265279ab809f9fd2f (MD5)
Approved for entry into archive by Maria Suzana Diniz (msuzanad@hotmail.com) on 2015-11-30T12:38:24Z (GMT) No. of bitstreams: 1 arquivototal.pdf: 766531 bytes, checksum: ad20186d0268a15265279ab809f9fd2f (MD5)
Made available in DSpace on 2015-11-30T12:38:24Z (GMT). No. of bitstreams: 1 arquivototal.pdf: 766531 bytes, checksum: ad20186d0268a15265279ab809f9fd2f (MD5) Previous issue date: 2014-08-29
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES
This work is about research done Fibonacci's Numbers. Initially it presents a brief account of the history of Leonardo Fibonacci, from his most famous work,The Liber Abaci, to the relationship with other elds of Mathematics. Then we will introduce some properties of Fibonacci's Numbers, Binet's Form, Lucas' Numbers and the relationship with Fibonacci's Sequence and an important property observed by Fermat. Within relationships with other areas of Mathematics, we show the relationship Matrices, Trigonometry and Geometry. Also presents the Golden Ellipse and the Golden Hyperbola. We conclude with Tribonacci's Numbers and some properties that govern these numbers. Made some generalizations about Matrices and Polynomials Tribonacci.
Este trabalho tem como objetivo o estudo dos Números de Fibonacci. Apresenta-se inicialmente um breve relato sobre a história de Leonardo Fibonacci, desde sua obra mais famosa, O Liber Abaci, até a relação com outros campos da Matemática. Em seguida, apresenta-se algumas propriedades dos Números de Fibonacci, a Fórmula de Binet, os Números de Lucas e a relação com a Sequência de Fibonacci e uma importante propriedade observada por Fermat. Dentro das relações com outras áreas da Matemática, destacamos a relação com as Matrizes, com a Trigonometria, com a Geometria. Apresenta-se também a Elipse e a Hipérbole de Ouro. Concluímos com os Números Tribonacci e algumas propriedades que regem esses números. Realizamos algumas generalizações sobre Matrizes e Polinômios Tribonacci.
APA, Harvard, Vancouver, ISO, and other styles
6

Glen, Amy Louise. "On Sturmian and Episturmian words, and related topics." 2006. http://hdl.handle.net/2440/37765.

Full text
Abstract:
In recent years, combinatorial properties of finite and infinite words have become increasingly important in fields of physics, biology, mathematics, and computer science. In particular, the fascinating family of Sturmian words has become an extremely active subject of research. These infinite binary sequences have numerous applications in various fields of mathematics, such as symbolic dynamics, the study of continued fraction expansion, and also in some domains of physics ( quasicrystal modelling ) and computer science ( pattern recognition, digital straightness ). There has also been a recent surge of interest in a natural generalization of Sturmian words to more than two letters - the so - called episturmian words, which include the well - known Arnoux - Rauzy sequences. This thesis represents a significant contribution to the study of Sturmian and episturmian words, and related objects such as generalized Thue - Morse words and substitutions on a finite alphabet. Specifically, we prove some new properties of certain palindromic factors of the infinite Fibonacci word; establish generalized ' singular ' decompositions of suffixes of certain morphic Sturmian words; completely describe where palindromes occur in characteristic Sturmian words; explicitly determine all integer powers occurring in a certain class of k-strict episturmian words ( including the k-bonacci word ) ; and prove that certain episturmian and generalized Thue - Morse continued fractions are transcendental. Lastly, we begin working towards a proof of a characterization of invertible substitutions on a finite alphabet, which generalizes the fact that invertible substitutions on two letters are exactly the Sturmian morphisms.
Thesis (Ph.D.)--School of Mathematical Sciences, 2006.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Tribonacci"

1

Maukar, Asep Juarna, and Djati Kerami. "Enumeration and Generation Aspects of Tribonacci Strings." In Proceedings of Second International Conference on Electrical Systems, Technology and Information 2015 (ICESTI 2015), 659–67. Singapore: Springer Singapore, 2016. http://dx.doi.org/10.1007/978-981-287-988-2_73.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Lee, Jack Y. "Some Basic Properties of a Tribonacci Line-Sequence." In Applications of Fibonacci Numbers, 145–57. Dordrecht: Springer Netherlands, 2004. http://dx.doi.org/10.1007/978-0-306-48517-6_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Mousavi, Hamoon, and Jeffrey Shallit. "Mechanical Proofs of Properties of the Tribonacci Word." In Lecture Notes in Computer Science, 170–90. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-23660-5_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Lejeune, Marie, Michel Rigo, and Matthieu Rosenfeld. "Templates for the k-Binomial Complexity of the Tribonacci Word." In Lecture Notes in Computer Science, 238–50. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-28796-2_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Waddill, Marcellus E. "Using Matrix Techniques to Establish Properties of a Generalized Tribonacci Sequence." In Applications of Fibonacci Numbers, 299–308. Dordrecht: Springer Netherlands, 1991. http://dx.doi.org/10.1007/978-94-011-3586-3_33.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

"Tribonacci Numbers." In Fibonacci and Lucas Numbers with Applications, 527–32. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2011. http://dx.doi.org/10.1002/9781118033067.ch46.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

"Tribonacci Polynomials." In Fibonacci and Lucas Numbers with Applications, 533–36. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2011. http://dx.doi.org/10.1002/9781118033067.ch47.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

"Tribonacci Polynomials." In Fibonacci and Lucas Numbers With Applications, 611–29. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2019. http://dx.doi.org/10.1002/9781118742297.ch49.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Braswell, Leigh Marie, and Tanya Khovanova. "The Cookie Monster Problem." In The Mathematics of Various Entertaining Subjects. Princeton University Press, 2015. http://dx.doi.org/10.23943/princeton/9780691164038.003.0016.

Full text
Abstract:
This chapter examines the problem of the “Cookie Monster number.” In 2002, Cookie Monster® appeared in the book The Inquisitive Problem Solver by Vaderlind, Guy, and Larson, where the hungry monster wants to empty a set of jars filled with various numbers of cookies. The Cookie Monster number is the minimum number of moves Cookie Monster must use to empty all the jars. The chapter analyzes this problem by first introducing known general algorithms and known bounds for the Cookie Monster number. It then explicitly finds the Cookie Monster number for jars containing cookies in the Fibonacci, Tribonacci, n-nacci, and Super-n-nacci sequences. The chapter also constructs sequences of k jars such that their Cookie Monster numbers are asymptotically rk, where r is any real number, 0 ≤ r ≤ 1.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Tribonacci"

1

Irmak, Nurettin, and Abdullah Açikel. "On perfect numbers close to Tribonacci numbers." In 1ST INTERNATIONAL CONFERENCE ON MATHEMATICAL AND RELATED SCIENCES (ICMRS 2018). Author(s), 2018. http://dx.doi.org/10.1063/1.5047878.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Tribonacci' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography