Witnessing a Poincaré recurrence with Mathematica
نویسندگان
چکیده
منابع مشابه
Poincaré recurrence theorem in MV-algebras
The classical Poincaré weak recurrence theorem states that for any probability space (Ω,S, P ), any P -measure preserving transformation T , and any A ∈ S, almost all points of A return to A. In the present paper the Poincaré theorem is proved when the σ-algebra S is replaced by any σ-complete MV-algebra. Keywords— Measure preserving transformation, Poincaré recurrence theorem, σ-complete MV-al...
متن کاملPoincaré recurrence and spectral cascades in three-dimensional quantum turbulence.
The time evolution of the ground state wave function of a zero-temperature Bose-Einstein condensate (BEC) gas is well described by the Hamiltonian Gross-Pitaevskii (GP) equation. Using a set of appropriately interleaved unitary collision-stream operators, a qubit lattice gas algorithm is devised, which on taking moments, recovers the Gross-Pitaevskii (GP) equation under diffusion ordering (time...
متن کاملPoincaré recurrence and output reversibility in linear dynamical systems
Reversibility of dynamical processes arises in many physical dynamical systems. For example, lossless Newtonian and Hamiltonian mechanical systems exhibit trajectories that can be obtained by time going forward and backward, providing an example of time symmetry that arises in natural sciences. Another example of such time symmetry is the phenomenon known as Poincaré recurrence wherein the dyna...
متن کاملClifford Algebra with Mathematica
The Clifford algebra of a n-dimensional Euclidean vector space provides a general language comprising vectors, complex numbers, quaternions, Grassman algebra, Pauli and Dirac matrices. In this work, we present an introduction to the main ideas of Clifford algebra, with the main goal to develop a package for Clifford algebra calculations for the computer algebra program Mathematica∗. The Cliffor...
متن کاملGraph Coloring with web Mathematica
Coloring of a graph is an assignment of colors either to the edges of the graph G, or to vertices, or to maps in such a way that adjacent edges/vertices/maps are colored differently. We consider the problem of coloring graphs by using webMathematica which is the new web-based technology. In this paper, we describe some web-based interactive examples on graph coloring with webMathematica.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Results in Physics
سال: 2017
ISSN: 2211-3797
DOI: 10.1016/j.rinp.2017.08.055