Some examples of sequence entropy as an isomorphism invariant
نویسندگان
چکیده
منابع مشابه
Model reduction via parametrized locally invariant manifolds: Some examples
A method for model reduction in non-linear ODE systems is demonstrated through computational examples. The method does not require an implicit separation of time-scales in the fine dynamics to be effective. From the computational standpoint, the method has the potential of serving as a subgrid modeling tool. From the physical standpoint, it provides a model for interpreting and describing histo...
متن کاملThermodynamic Entropy as a Noether Invariant.
We study a classical many-particle system with an external control represented by a time-dependent extensive parameter in a Lagrangian. We show that thermodynamic entropy of the system is uniquely characterized as the Noether invariant associated with a symmetry for an infinitesimal nonuniform time translation t→t+ηℏβ, where η is a small parameter, ℏ is the Planck constant, β is the inverse tem...
متن کاملAn Approach of Graph Isomorphism Detection based on Vertex-Invariant
Graph Isomorphism is a widely studied problem due to its practical applications in various fields of networks, chemistry and finger print detection, recent problems in biology such as diabetes detection, protein structure and information retrieval. An approach to the graph isomorphism detection is based on vertex invariant. In the existing approach vertex invariants is used to partition the mat...
متن کاملBlack hole entropy as T - duality invariant
We study the Euler numbers and the entropies of the non-extremal intersecting D-branes in ten-dimensions. We use the surface gravity to constrain the compactification radii. We correctly obtain the integer valued Euler numbers for these radii. Moreover, the entropies are found to be invariant under the T-duality transformation. In the extremal limit, we obtain the finite entropies only for two ...
متن کاملTesting Linear-Invariant Function Isomorphism
A function f : F2 → {−1, 1} is called linear-isomorphic to g if f = g ◦ A for some non-singular matrix A. In the g-isomorphism problem, we want a randomized algorithm that distinguishes whether an input function f is linear-isomorphic to g or far from being so. We show that the query complexity to test g-isomorphism is essentially determined by the spectral norm of g. That is, if g is close to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1980
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-1980-0561831-2