English
Related papers

Related papers: Time-Reversibility in 2-Dim Systems

200 papers

Here, we give an algorithm for deciding if the nonnegative rank of a matrix $M$ of dimension $m \times n$ is at most $r$ which runs in time $(nm)^{O(r^2)}$. This is the first exact algorithm that runs in time singly-exponential in $r$. This…

Data Structures and Algorithms · Computer Science 2012-05-02 Ankur Moitra

Recently new solvable systems of nonlinear evolution equations -- including ODEs, PDEs and systems with discrete time -- have been introduced. These findings are based on certain convenient formulas expressing the $k$-th time-derivative of…

Mathematical Physics · Physics 2018-06-21 Oksana Bihun , Francesco Calogero

The aim of this note is to set in the field of dynamical systems a recent theorem by Obersnel and Omari about the presence of periodic solutions of all periods for a class of scalar time-periodic first order differential equations without…

Dynamical Systems · Mathematics 2009-11-10 Marina Pireddu

A skew Laurent polynomial ring R[x^{\pm 1};\alpha] is reversible if it has a reversing automorphism, that is, an automorphism of period two that transposes x and x^{-1} and restricts to an automorphism of R. We study invariants for…

Rings and Algebras · Mathematics 2007-08-30 David Jordan , Nongkhran Sasom

We investigate quantitative recurrence in systems having an infinite measure. We extend the Ornstein-Weiss theorem for a general class of infinite systems estimating return time in decreasing sequences of cylinders. Then we restrict to a…

Dynamical Systems · Mathematics 2009-11-11 Stefano Galatolo , Dong Han Kim , Kyewon Koh Park

Time-reversibility measured by the deviation of the perturbed time-reversed motion from the unperturbed one is examined for normal quantum diffusion exhibited by four classes of quantum maps with contrastive physical nature. Irrespective of…

Disordered Systems and Neural Networks · Physics 2015-05-19 Hiroaki S. Yamada , Kensuke S. Ikeda

The reconfiguration problem for homomorphisms of digraphs to a reflexive digraph cycle, which amounts to deciding if a `reconfiguration graph' is connected, is known to by polynomially time solvable via a greedy algorithm based on certain…

Combinatorics · Mathematics 2025-03-19 David Emmanuel Pazmiño Pullas , Mark Siggers

We study the dynamical symmetries of a class of two-dimensional superintegrable systems on a 2-sphere, obtained by a procedure based on the Marsden-Weinstein reduction, by considering its shape-invariant intertwining operators. These are…

Exactly Solvable and Integrable Systems · Physics 2015-06-26 J. A. Calzada , J. Negro , M. A. del Olmo

As an inverse problem, we recover the topology of the effective spacetime that a system lies in, in an operational way. This means that from a series of experiments we get a set of points corresponding to events. This continues the previous…

General Relativity and Quantum Cosmology · Physics 2007-05-23 I. Raptis , P. Wallden , R. R. Zapatrin

We explore some qualitative dynamics in the neighborhood of the $3-dimensional$ two-fold symmetric singularity. We study the existence of an one-parameter family of regular (pseudo) periodic orbits of such systems near a reversible two-fold…

Dynamical Systems · Mathematics 2011-12-08 Alain Jacquemard , Marco Antonio Teixeira , Durval Jose Tonon

Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…

Combinatorics · Mathematics 2007-05-23 S. Gao , A. G. B. Lauder

The origin of complex structures, randomness, and irreversibility are analyzed in the scale free SL(2,R) analysis, which is an extension of the ordinary analysis based on the recently uncovered scale free $C^{2^n-1}$ solutions to linear…

General Mathematics · Mathematics 2010-01-12 Dhurjati Prasad Datta , Santanu Raut

We give a complete description and clarification of the structure of the Levy area correction to Ito/Stratonovich stochastic integrals arising as limits of time-reversible deterministic dynamical systems. In particular, we show that…

Dynamical Systems · Mathematics 2024-07-11 Georg Gottwald , Ian Melbourne

Symmetries have a crucial role in today's physics. In this thesis, we are mostly concerned with time reversal invariance (T-symmetry). A physical system is time reversal invariant if its underlying laws are not sensitive to the direction of…

History and Philosophy of Physics · Physics 2018-03-01 Reza Moulavi Ardakani

We propose an algorithm for deciding whether a given braid is pseudo-Anosov, reducible, or periodic. The algorithm is based on Garside's weighted decomposition and is polynomial-time in the word-length of an input braid. Moreover, a…

Geometric Topology · Mathematics 2007-05-23 Ki Hyoung Ko , Jang Won Lee

Recently, a new algorithm for the computation of covariant Lyapunov vectors and of corresponding local Lyapunov exponents has become available. Here we study the properties of these still unfamiliar quantities for a number of simple models,…

Chaotic Dynamics · Physics 2015-05-18 Hadrien Bosetti , Harald A. Posch , Christoph Dellago , William G. Hoover

In this paper, we give a polynomial-time algorithm for deciding whether an input bipartite graph admits a 2-layer fan-planar drawing, resolving an open problem posed in several papers since 2015.

Computational Geometry · Computer Science 2025-08-26 Yasuaki Kobayashi , Yuto Okada

A method for time-reversible numerical integration of the deterministic Landau-Lifshitz Gilbert equation by means of a second order Suzuki-Trotter decomposition is presented and tested against commonly used second order predictor-corrector…

In this lecture we address some topological questions connected with the existence on a general spacetime manifold of diffeomorphisms connected to the identity which reverse the time-orientation.

General Relativity and Quantum Cosmology · Physics 2007-05-23 Andrew Chamblin , G. W. Gibbons

We introduce a concept of efficiency for which we can prove that it applies to all paddable languages, but still does not conflict with potential worst case intractability. Note that the family of paddable languages apparently includes all…

Computational Complexity · Computer Science 2016-09-01 Andras Farago
‹ Prev 1 4 5 6 7 8 10 Next ›