Related papers: Reversibility of Extreme Relational Structures

Suppose $X$ is a vector lattice and there is a notion of convergence $x_{\alpha} \rightarrow x$ in $X$. Then we can speak of an "unbounded" version of this convergence by saying that $(x_{\alpha})$ unbounded converges to $x\in X$ if $\lvert…

Let G/Q be an homogeneous variety embedded in a projective space P thanks to an ample line bundle L. Take a projective space containing P and form the cone X over G/Q, we call this a cone over an homogeneous variety. Let $\alpha$ a class of…

We say that a finite almost simple $G$ with socle $S$ is admissible (with respect to the spectrum) if $G$ and $S$ have the same sets of orders of elements. Let $L$ be a finite simple linear or unitary group of dimension at least three over…

Here we classify all topological spaces where all bijections to itself are homeomorphisms. As a consequence, we also classify all topological spaces where all maps to itself are continuous. Analogously, we classify all measurable spaces…

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 give a characterization of the invariant measures for the exclusion process on the integers with certain reversible transition kernels. Some examples include all nearest-neighbor kernels with asymptotic mean zero. One tool used is a…

A group topology is said to be linear if open subgroups form a base of neighborhoods of the identity element. It is proved that the existence of a nondiscrete extremally disconnected group of Ulam nonmeasurable cardinality with linear…

A matrix (and any associated linear system) will be referred to as structured if it has a small displacement rank. It is known that the inverse of a structured matrix is structured, which allows fast inversion (or solution), and reduced…

Twisted diagrams are "diagrams" with components in different categories. Structure maps are defined using auxiliary data which consists of functors relating the various categories to each other. Prime examples of the construction are…

Dictionaries are often developed using tools that save to Extensible Markup Language (XML)-based standards. These standards often allow high-level repeating elements to represent lexical entries, and utilize descendants of these repeating…

Reversible forms of computations are often interesting from an energy efficiency point of view. When the computation device in question is an automaton, it is known that the minimal reversible automaton recognizing a given language is not…

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…

We investigate the poset (P(X),\subset), where P(X) is the set of isomorphic suborders of a countable ultrahomogeneous partial order X. For X different from (resp. equal to) a countable antichain the order types of maximal chains in…

We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…

For any fixed integer $R \geq 2$ we characterise the typical structure of undirected graphs with vertices $1, ..., n$ and maximum degree $R$, as $n$ tends to infinity. The information is used to prove that such graphs satisfy a labelled…

Causal-consistent reversibility is the reference notion of reversibility for concurrency. We introduce a modular framework for defining causal-consistent reversible extensions of concurrent models and languages. We show how our framework…

The homset invariant of a knot or link L with respect to an algebraic knot coloring structure X can be identified with a set of colorings of a diagram of L by elements of X via an identification of diagrammatic generators with algebraic…

Let $G$ be a finite group. A faithful $G$-variety $X$ is called strongly incompressible if every dominant $G$-equivariant rational map of $X$ onto another faithful $G$-variety $Y$ is birational. We settle the problem of existence of…

Interval graphs and interval orders are deeply linked. In fact, edges of an interval graphs represent the incomparability relation of an interval order, and in general, of different interval orders. The question about the conditions under…

Properties expressed as the provability of a first-order sentence can be disproved by just finding a model of the negation of the sentence. This fact, however, is meaningful in restricted cases only, depending on the shape of the sentence…