Related papers: Reversibility of Disconnected Structures

We indicate a way of distinguishing between structures, for which, two structures are said to be separable.Being separable implies being non-isomorphic. We show that for any first order theory $T$ in a countable language, if it has an…

An element of a group is called $\textit{strongly reversible}$ or $\textit{strongly real}$ if it can be expressed as a product of two involutions. We provide necessary and sufficient conditions for an element of $\mathrm{SL}(n,\mathbb{C})$…

An element $g$ of a group is called reversible if it is conjugate in the group to its inverse. An element is an involution if it is equal to its inverse. This paper is about factoring elements as products of reversibles in the group…

We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…

We consider the space of countable structures with fixed underlying set in a given countable language. We show that the number of ergodic probability measures on this space that are $S_\infty$-invariant and concentrated on a single…

A sum-and-distance system is a collection of finite sets of integers such that the sums and differences formed by taking one element from each set generate a prescribed arithmetic progression. Such systems, with two component sets, arise…

A standard contextual equivalence for process algebras is strong barbed congruence. Configuration structures are a denotational semantics for processes in which one can define equivalences that are more discriminating, i.e. that distinguish…

A partial order is called semilinear iff the upper bounds of each element are linearly ordered and any two elements have a common upper bound. There exists, up to isomorphism, a unique countable existentially closed semilinear order, which…

Order-$p$ parasupersymmetric and orthosupersymmetric quantum mechanics are shown to be fully reducible when they are realized in terms of the generators of a generalized deformed oscillator algebra and a ${\rm Z}_{p+1}$-grading structure is…

Necessary and sufficient conditions are given for the similarity between two perturbations of the (backward) shift by rank one operators, under certain assumptions on the perturbations. The proof of similarity is based on an explicit…

We introduce the inverse monoid of inner partial automorphisms of a semigroup -- a tool that associates to every semigroup an inverse semigroup. When the semigroup is a group, this inverse semigroup is isomorphic to the group of inner…

An element $g$ in a group $G$ is called reversible (or real) if it is conjugate to $g^{-1}$ in $G$, i.e., there exists $h$ in $G$ such that $g^{-1}=hgh^{-1}$. The element $g$ is called strongly reversible if the conjugating element $h$ is…

A subset $U$ of a set $S$ with a binary operation is called {\it avoidable} if $S$ can be partitioned into two subsets $A$ and $B$ such that no element of $U$ can be written as a product of two distinct elements of $A$ or as the product of…

A random variable Z will be called self-inverse if it has the same distribution as its reciprocal 1/Z. It is shown that if Z is defined as a ratio, X/Y, of two rv's X and Y (with Pr[X=0]=Pr[Y=0]=0), then Z is self-inverse if and only if X…

A relational structure R is ultrahomogeneous if every isomorphism of finite induced substructures of R extends to an automorphism of R. We classify the ultrahomogeneous finite binary relational structures with one asymmetric binary relation…

An algebraic structure is said to be congruence permutable if its arbitrary congruences $\alpha$ and $\beta$ satisfy the equation $\alpha \circ \beta =\beta \circ \alpha$, where $\circ$ denotes the usual composition of binary relations. For…

A digraph $\mathbb G$ is called weakly connected, strongly connected, and extremely connected if any two vertices of $\mathbb G$ are connected respectively by an oriented, a directed, and a symmetric path in $\mathbb G$. We investigate the…

For a topologically complete space $X$ and a family of closed covers $\mathcal A$ of $X$ satisfying a "local refinement condition" and a "completeness condition," we give a construction of an inverse system $\mathbf{ N}_{\mathcal A}$ of…

Two structures are said to be equimorphic if each embeds in the other. Such structures cannot be expected to be isomorphic, and in this paper we investigate the special case of linear orders, here also called chains. In particular we…

We introduce a new notion of a relational word as a finite totally ordered set of positions endowed with three binary relations that describe which positions are labeled by equal data, by unequal data and those having an undefined relation…