This is the author accepted manuscript. The final version is available from Elsevier via the DOI in this recordNote the slight change of title between the author accepted manuscript in this record and the final published versionIn this paper we discuss two different existing algorithms for computing topological entropy and we perform one of them in order to compute the isentropes for cubic polynomials
Many graph invariants have been used for the construction of entropy-based measures to characterize ...
Topological entropy is one of the most difficult entropies to be used to analyze the DNA sequences, ...
In graph theory, a topological index is a numerical value that is in good correlation with certain p...
In this paper we will modify the Milnor–Thurston map, which maps a one dimensional mapping to a piec...
This paper discusses some properties of the topological entropy systems generated by polynomials of ...
We combine the trellis method and the braid method, and by estimating the lower bounds of the topolo...
We give an effective method to compute the entropy for polynomials orthogonal on a segment of the re...
In graph theory, a topological index is a numerical value that is in good correlation with certain p...
In graph theory, a topological index is a numerical value that is in good correlation with certain p...
Calculating the entropy for complex systems is a significant problem in science and engineering prob...
This paper studies polynomials with core entropy zero. We give several characterizations of polynomi...
We show that it is impossible to compute (or even to approximate) the topological entropy of a conti...
Topological entropy is one of the most difficult entropies to be used to analyze the DNA sequences, ...
In graph theory, a topological index is a numerical value that is in good correlation with certain p...
Abstract. In this note, we establish a connection between the dynamical de-gree, or algebraic entrop...
Many graph invariants have been used for the construction of entropy-based measures to characterize ...
Topological entropy is one of the most difficult entropies to be used to analyze the DNA sequences, ...
In graph theory, a topological index is a numerical value that is in good correlation with certain p...
In this paper we will modify the Milnor–Thurston map, which maps a one dimensional mapping to a piec...
This paper discusses some properties of the topological entropy systems generated by polynomials of ...
We combine the trellis method and the braid method, and by estimating the lower bounds of the topolo...
We give an effective method to compute the entropy for polynomials orthogonal on a segment of the re...
In graph theory, a topological index is a numerical value that is in good correlation with certain p...
In graph theory, a topological index is a numerical value that is in good correlation with certain p...
Calculating the entropy for complex systems is a significant problem in science and engineering prob...
This paper studies polynomials with core entropy zero. We give several characterizations of polynomi...
We show that it is impossible to compute (or even to approximate) the topological entropy of a conti...
Topological entropy is one of the most difficult entropies to be used to analyze the DNA sequences, ...
In graph theory, a topological index is a numerical value that is in good correlation with certain p...
Abstract. In this note, we establish a connection between the dynamical de-gree, or algebraic entrop...
Many graph invariants have been used for the construction of entropy-based measures to characterize ...
Topological entropy is one of the most difficult entropies to be used to analyze the DNA sequences, ...
In graph theory, a topological index is a numerical value that is in good correlation with certain p...
DOI
Add to ORKG