English
Related papers

Related papers: Reversibility of Disconnected Structures

200 papers

We present an example of two countable $\omega$-categorical structures, one of which has a finite relational language, whose endomorphism monoids are isomorphic as abstract monoids, but not as topological monoids -- in other words, no…

Logic · Mathematics 2016-07-04 Manuel Bodirsky , David Evans , Michael Kompatscher , Michael Pinsker

Third-order ordinary differential equations with Lie symmetry algebras isomorphic to the nonsolvable algebra $\mathfrak{sl}(2,\mathbb{R})$ admit solvable structures. These solvable structures can be constructed by using the basis elements…

Classical Analysis and ODEs · Mathematics 2016-08-09 Adrián Ruiz , Concepción Muriel

We study random relational structures that are \emph{relatively exchangeable}---that is, whose distributions are invariant under the automorphisms of a reference structure $\mathfrak{M}$. When $\mathfrak{M}$ has {\em trivial definable…

Logic · Mathematics 2015-10-05 Harry Crane , Henry Towsner

For an integrable hierarchy which possesses a bihamiltonian structure with semisimple hydrodynamic limit, we prove that the linear reciprocal transformation with respect to any of its symmetry transforms it to another bihamiltonian…

Exactly Solvable and Integrable Systems · Physics 2023-05-31 Si-Qi Liu , Zhe Wang , Youjin Zhang

A block in a linear order is an equivalence class when factored by the block relation B(x,y), satisfied by elements that are finitely far apart. We show that every computable linear order with dense condensation-type (i.e. a dense…

Logic · Mathematics 2009-04-29 Michael F Moses

We define unbounded twisted complexes and bicomplexes generalising the notion of a (bounded) twisted complex over a DG category [BK90]. These need to be considered relative to another DG category $B$ admitting countable direct sums and…

Category Theory · Mathematics 2023-03-22 Rina Anno , Timothy Logvinenko

The Lie product and the order relation are viewed as defining structures for Hamiltonian dynamical systems. Their admissible combinations are singled out by the requirement that the group of the Lie automorphisms be contained in the group…

Quantum Physics · Physics 2007-05-23 A. Petrov

Suppose $Y$ is a continuum, $x\in Y$, and $X$ is the union of all nowhere dense subcontinua of $Y$ containing $x$. Suppose further that there exists $y\in Y$ such that every connected subset of $X$ limiting to $y$ is dense in $X$. And,…

General Topology · Mathematics 2019-06-07 David Sumner Lipham

Let (L;C) be the (up to isomorphism unique) countable homogeneous structure carrying a binary branching C-relation. We study the reducts of (L;C), i.e., the structures with domain L that are first-order definable in (L;C). We show that up…

Logic · Mathematics 2016-02-26 Manuel Bodirsky , Peter Jonsson , Trung Van Pham

The class of generic structures among those consisting of the measure algebra of a probability space equipped with an automorphism is axiomatizable by positive sentences interpreted using an approximate semantics. The separable generic…

Logic · Mathematics 2007-05-23 Alexander Berenstein , C. Ward Henson

We introduce a reducibility on classes of structures, essentially a uniform enumeration reducibility. This reducibility is inspired by the Friedman-Stanley paper on using Borel reductions to compare classes of countable structures. This…

Logic · Mathematics 2008-03-25 Wesley Calvert , Desmond Cummins , Sara Miller , Julia F. Knight

A self-contained graph is an infinite graph which is isomorphic to one of its proper induced subgraphs. In this paper, these graphs are studied by presenting some examples and defining some of their sub-structures such as removable…

Combinatorics · Mathematics 2016-11-04 Mohammad Hadi Shekarriz , Madjid Mirzavaziri

We indicate a way of distinguishing between structures, for which, we call two structures distinguishable. Roughly, being distinguishable means that they differ in the number of realizations each gives for some formula. Being…

Logic · Mathematics 2016-11-04 Mohammad Assem

Two structures $M, N$ in the same language are called probably isomorphic if they (or, in case of metric structures, their completions) are isomorphic after forcing with the Lebesgue measure algebra. We show that, if $M$ and $N$ are…

Logic · Mathematics 2025-07-03 Ilijas Farah , Andrea Vaccaro

A digraph is connected-homogeneous if every isomorphism between two finite connected induced subdigraphs extends to an automorphism of the whole digraph. In this paper, we completely classify the countable connected-homogeneous digraphs.

Combinatorics · Mathematics 2013-11-26 Matthias Hamann

In the several contexts such as combinatorial number theory, families of sets of positive integers closed under taking subsets have been investigated. Then it is sometimes useful to give bijections between the set of the one-sided infinite…

Combinatorics · Mathematics 2024-12-31 Shoichi Kamada

This paper investigates topological reconstruction, related to the reconstruction conjecture in graph theory. We ask whether the homeomorphism types of subspaces of a space $X$ which are obtained by deleting singletons determine $X$…

General Topology · Mathematics 2013-12-02 Max F. Pitz , Rolf Suabedissen

We prove that the minimally displaced set of a relatively irreducible automorphism of a free splitting, situated in a deformation space, is uniformly locally finite. The minimally displaced set coincides with the train track points for an…

Group Theory · Mathematics 2020-04-17 Stefano Francaviglia , Armando Martino , Dionysios Syrigos

The partial automorphism monoid of an inverse semigroup is an inverse monoid consisting of all isomorphisms between its inverse subsemigroups. We prove that a tightly connected fundamental inverse semigroup $S$ with no isolated nontrivial…

Rings and Algebras · Mathematics 2011-07-26 Simon M. Goberstein

Let B be the operation of re-ordering a sequence by one pass of bubble sort. We completely answer the question of when the inverse image of a principal pattern class under B is a pattern class.

Combinatorics · Mathematics 2011-10-11 Michael H. Albert , M. D. Atkinson , Mathilde Bouvel , Anders Claesson , Mark Dukes
‹ Prev 1 4 5 6 7 8 10 Next ›