Related papers: Entropy of tropical holonomic sequences
This is a sequel to our work in tropical Hodge theory. Our aim here is to prove a tropical analogue of the Clemens-Schmid exact sequence in asymptotic Hodge theory. As an application of this result, we prove the tropical Hodge conjecture…
We present a method for computing the topological entropy of one-dimensional maps. As an approximation scheme, the algorithm converges rapidly and provides both upper and lower bounds.
We consider the entropy of higher spin black holes in 2+1 dimensions using the conical singularity approach. By introducing a conical singularity along a non contractible cycle and carefully evaluating its contribution to the Chern Simons…
We give an explicit formula for the Hankel transform of a regular sequence in terms of the coefficients of the associated orthogonal polynomials and the sequence itself. We apply this formula to some sequences of combinatorial interest,…
To any graph we associate a sequence of integers called the gonality sequence of the graph, consisting of the minimum degrees of divisors of increasing rank on the graph. This is a tropical analogue of the gonality sequence of an algebraic…
We study the problem of generating monomials of a polynomial in the context of enumeration complexity. In this setting, the complexity measure is the delay between two solutions and the total time. We present two new algorithms for…
We consider the question of when points in tropical affine space uniquely determine a tropical hypersurface. We introduce a notion of multiplicity of points so that this question may be meaningful even if some of the points coincide. We…
Topological entropy has been one of the most difficult to implement of all the entropy-theoretic notions. This is primarily due to finite sample effects and high-dimensionality problems. In particular, topological entropy has been…
In this paper, the concept of L-algebra is revisited and after that, the article is prepared to deal with the notion of the entropy of an L-algebra. If a set has an L-algebraic structure, it is possible to calculate the degree of…
We define scrollar invariants of tropical curves with a fixed divisor of rank 1. We examine the behavior of scrollar invariants under specialization, and provide an algorithm for computing these invariants for a much-studied family of…
We adapt and generalise results of Loganathan on the cohomology of inverse semigroups to the cohomology of ordered groupoids. We then derive a five-term exact sequence in cohomology from an extension of ordered groupoids, and show that this…
We introduce tropical analogues of the notion of volume of polytopes, leading to a tropical version of the (discrete) classical isoperimetric inequality. The planar case is elementary, but a higher-dimensional generalization leads to an…
In a series of articles, we have been developing a theory of tropical diagrams of probability spaces, expecting it to be useful for information optimization problems in information theory and artificial intelligence. In this article, we…
Tropical mathematics is used to establish a correspondence between certain microscopic and macroscopic objects in statistical models. Tropical algebra gives a common framework for macrosystems (subsets) and their elementary constituents…
Entropy for two dimensional extremal black holes is computed explicitly in a finite-space formulation of the black hole thermodynamics and is shown to be zero {\it locally}. Our results are in conformity with the recent one by Hawking et al…
We introduce an algorithm that samples a set of loop momenta distributed as a given Feynman integrand. The algorithm uses the tropical sampling method and can be applied to evaluate phase-space-type integrals efficiently. We provide an…
We define a natural operation of conditioning of tropical diagrams of probability spaces and show that it is Lipschitz continuous with respect to the asymptotic entropy distance.
The problem of solving tropical linear systems, a natural problem of tropical mathematics, has already proven to be very interesting from the algorithmic point of view: it is known to be in $NP\cap coNP$ but no polynomial time algorithm is…
We use the Kerr/CFT correspondence to calculate the entropy for all known extremal stationary and axisymmetric black holes. This is done with the help of two ansatzs that are general enough to cover all such known solutions. Considering…
We study some basic algorithmic problems concerning the intersection of tropical hypersurfaces in general dimension: deciding whether this intersection is nonempty, whether it is a tropical variety, and whether it is connected, as well as…