English
Related papers

Related papers: Back and Forth Systems Witnessing Irreversibility

200 papers

This paper approaches, using structural complexity theory, the question of whether there is a chasm between knowing an object exists and getting one's hands on the object or its properties. In particular, we study the nontransparency of…

Artificial Intelligence · Computer Science 2019-01-15 Lane A. Hemaspaandra , David E. Narváez

In the statistical description of dynamical systems, an indication of the irreversibility of a given state change is given geometrically by means of a (pre-)ordering of state pairs. Reversible state changes of classical and quantum systems…

Mathematical Physics · Physics 2011-01-04 P. Busch

Given a nonempty set $\mathcal{L}$ of linear orders, we say that the linear order $L$ is $\mathcal{L}$-convex embeddable into the linear order $L'$ if it is possible to partition $L$ into convex sets indexed by some element of $\mathcal{L}$…

Logic · Mathematics 2025-05-06 Martina Iannella , Alberto Marcone , Luca Motto Ros , Vadim Weinstein

Let $R$ be a ring with identity and $\delta(R)$ denote the Zhou radical of $R$. A ring $R$ is called {\it $\delta$-reversible} if for any $a$, $b \in R$, $ab = 0$ implies $ba \in \delta(R)$. In this paper, we give some properties of…

Rings and Algebras · Mathematics 2024-05-16 Tugce Pekacar Calci , Serhat Emirhan Soycan

The ordered structures of natural, integer, rational and real numbers are studied here. It is known that the theories of these numbers in the language of order are decidable and finitely axiomatizable. Also, their theories in the language…

Logic · Mathematics 2019-07-02 Ziba Assadi , Saeed Salehi

Assume $\kappa = \kappa^{< \kappa}$ (usually $\aleph_0$ or an inaccessible). We shall deal with iterated forcings preserving ${}^{\kappa>}{\rm Ord}$ and not collapsing cardinals along a linear order $L$. A sufficient condition for this,…

Logic · Mathematics 2026-03-19 Saharon Shelah

A dynamical system is said to be reversible if, given an output, the input can always be recovered in a well-posed manner. Nevertheless, we argue that reversible systems that have a time-reversal symmetry, such as the Nonlinear…

Analysis of PDEs · Mathematics 2020-05-20 Amir Sagiv , Adi Ditkowski , Roy H. Goodman , Gadi Fibich

It was generally believed throughout the 20-th century that irreversibility is a purely classical event without operator counterpart. However, a classical irreversible system cannot be consistently decomposed into a finite number of…

General Physics · Physics 2009-11-11 Ruggero Maria Santilli

A relational structure is indivisible if for every partition of its set of elements into two parts there exists an embedding of the structure into one of the parts of the partition. A relational structure is homogeneous if every embedding…

Combinatorics · Mathematics 2020-08-26 Norbert Sauer

The elements of a finite partial order $P$ can be identified with the maximal indecomposable two-sided ideals of its incidence algebra $\A$, and then for two such ideals, $I\prec J \iff IJ \not=0$. This offers one way to recover a poset…

Combinatorics · Mathematics 2009-11-10 Rafael D. Sorkin

We study classes of Borel subsets of the real line $\mathbb{R}$ such as levels of the Borel hierarchy and the class of sets that are reducible to the set $\mathbb{Q}$ of rationals, endowed with the Wadge quasi-order of reducibility with…

Logic · Mathematics 2021-03-11 Daisuke Ikegami , Philipp Schlicht , Hisao Tanaka

We investigate the partial orderings of the form (P(X),\subset), where X is a countable binary relational structure and P(X) the set of the domains of its isomorphic substructures and show that if the components of X are maximally…

Logic · Mathematics 2017-09-26 Milos S. Kurilic

Let $\pi$ be a polarized, regular algebraic, cuspidal automorphic representation of $\operatorname{GL}_n(\mathbb{A}_F)$ where $F$ is totally real or imaginary CM, and let $(\rho_\lambda)_\lambda$ be its associated compatible system of…

Number Theory · Mathematics 2025-12-22 Zachary Feng , Dmitri Whitmore

In this paper we prove that a pure, regular, totally odd, polarizable weakly compatible system of $l$-adic representations is potentially automorphic. The innovation is that we make no irreducibility assumption, but we make a purity…

Number Theory · Mathematics 2019-02-20 Stefan Patrikis , Richard Taylor

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

Discrete Mathematics · Computer Science 2017-08-08 Emmanuel Jeandel

Finite automata whose computations can be reversed, at any point, by knowing the last k symbols read from the input, for a fixed k, are considered. These devices and their accepted languages are called k-reversible automata and k-reversible…

Formal Languages and Automata Theory · Computer Science 2017-08-23 Giovanna J. Lavado , Giovanni Pighizzini , Luca Prigioniero

An element of a group is called \emph{reversible} if it is conjugate to its inverse. While reversibility in the quaternionic M\"{o}bius group $\mathrm{PSL}(2,\mathbb{H})$ has traditionally been studied using geometric and dynamical methods,…

Geometric Topology · Mathematics 2026-04-01 Krishnendu Gongopadhyay , Tejbir Lohan , Abhishek Mukherjee

We prove that the moduli space ${\mathcal A}_{g,\Gamma_0(p)}\otimes \bar {\mathbb F}_p$ of principally polarized abelian varieties of dimension $g$ with a $\Gamma_0(p)$-level structure in characteristic $p$ has $2^g$ irreducible…

Number Theory · Mathematics 2007-05-23 Chia-Fu Yu

We call an operator algebra A {\em reversible} if A with reversed multiplication is also an abstract operator algebra (in the modern operator space sense). This class of operator algebras is intimately related to the {\em symmetric operator…

Operator Algebras · Mathematics 2025-11-24 David P. Blecher

A language is dense if the set of all infixes (or subwords) of the language is the set of all words. Here, it is shown that it is decidable whether the language accepted by a nondeterministic Turing machine with a one-way read-only input…

Formal Languages and Automata Theory · Computer Science 2019-03-08 Oscar H. Ibarra , Ian McQuillan