Related papers: Reversibility of Extreme Relational Structures
We describe new, simple, recursive methods of construction for orientable sequences over an arbitrary finite alphabet, i.e. periodic sequences in which any sub-sequence of n consecutive elements occurs at most once in a period in either…
A construction of reversible extensions of dynamical systems which applies to arbitrary mappings (not necessarily with open range) is presented. It is based on calculating the maximal ideal space of C*-algebras that extends endomorphisms to…
Given two two-dimensional conformal field theories, a domain wall -- or defect line -- between them is called invertible if there is another defect with which it fuses to the identity defect. A defect is called topological if it is…
The semantic paradoxes are associated with self-reference or referential circularity. However, there are infinitary versions of the paradoxes, such as Yablo's paradox, that do not involve this form of circularity. It remains an open…
Consider complex semisimple Lie algebras of a given dimension specified by their structure constants. We describe a finite collection of rational functions in the structure constants that form a complete set of invariants: two sets of…
A plurisubharmonic singularity is extreme if it cannot be represented as the sum of non-homothetic singularities. A complete characterization of such singularities is given for the case of homogeneous singularities (in particular, those…
We study countable structures from the viewpoint of enumeration reducibility. Since enumeration reducibility is based on only positive information, in this setting it is natural to consider structures given by their positive atomic diagram…
The program Reverse Mathematics (RM for short) seeks to identify the axioms necessary to prove theorems of ordinary mathematics, usually working in the language of second-order arithmetic $L_{2}$. A major theme in RM is therefore the study…
We introduce and characterize a particularly tractable class of unital type 1 C*-algebras with bounded dimension of irreducible representations. Algebras in this class are called recursive subhomogeneous algebras, and they have an inductive…
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,…
A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…
Let $R\subseteq \Bbb Q$ be a subring of the rationals and let $p$ be the least prime (if none, $p=\infty $) which is not invertible in $R.$ For an $R$-local $r$-connected $CW$-complex $X$ of dimension $\leq \min(r+2p-3,rp-1), r\geq 1, $ a…
The notion of homomorphism indistinguishability offers a combinatorial framework for characterizing equivalence relations of graphs, in particular equivalences in counting logics within finite model theory. That is, for certain graph…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
We establish a close connection between a reversible programming language based on type isomorphisms and a formally presented univalent universe. The correspondence relates combinators witnessing type isomorphisms in the programming…
To any finite graph $X$ (viewed as a topological space) we assosiate some explicit compact metric space ${\cal X}^r(X)$ which we call {\it the reflection tree of graphs $X$}. This space is of topological dimension $\le1$ and its connected…
We study analytically and numerically the extreme value distribution of observables defined along the temporal evolution of a dynamical system. The convergence to the Gumbel law of observable recurrences gives information on the fractal…
Semifields are semirings in which every nonzero element has a multiplicative inverse. A rough classification uses the characteristic of the semifield, that is the isomorphism type of the semifield generated by the two neutral elements. For…
We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…
$\omega$-clones are multi-sorted structures that naturally emerge as algebras for infinite trees, just as $\omega$-semigroups are convenient algebras for infinite words. In the algebraic theory of languages, one hopes that a language is…