Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
116 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
24 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
3 tokens/sec
DeepSeek R1 via Azure Pro
35 tokens/sec
2000 character limit reached

Reversible Disjoint Unions of Well Orders and Their Inverses (1711.07053v1)

Published 19 Nov 2017 in math.LO

Abstract: A poset ${\mathbb{P}}$ is called reversible iff every bijective homomorphism $f:{\mathbb{P}} \rightarrow {\mathbb{P}}$ is an automorphism. Let ${\mathcal{W}}$ and ${\mathcal{W}} *$ denote the classes of well orders and their inverses respectively. We characterize reversibility in the class of posets of the form ${\mathbb{P}} =\bigcup {i\in I}{\mathbb{L}} _i$, where ${\mathbb{L}} _i, i\in I$, are pairwise disjoint linear orders from ${\mathcal{W}} \cup {\mathcal{W}} *$. First, if ${\mathbb{L}} _i \in {\mathcal{W}}$, for all $i\in I$, and ${\mathbb{L}} _i \cong \alpha _i =\gamma_i+n_i\in Ord$, where $\gamma_i\in Lim \cup {0}$ and $n_i\in\omega$, defining $I\alpha := { i\in I : \alpha_i = \alpha }$, for $\alpha \in Ord$, and $J_\gamma := { j\in I : \gamma_j = \gamma }$, for $\gamma\in Lim 0$, we prove that $\bigcup _{i\in I} {\mathbb{L}} _i$ is a reversible poset iff $\langle \alpha _i :i\in I\rangle$ is a finite-to-one sequence, or there is $\gamma =\max { \gamma _i : i\in I}$, for $\alpha \leq \gamma$ we have $|I\alpha |<\omega $, and $\langle n_i : i\in J_\gamma \setminus I_\gamma \rangle $ is a reversible sequence of natural numbers. The same holds when ${\mathbb{L}} _i \in {\mathcal{W}} *$, for all $i\in I$. In the general case, the reversibility of the whole union is equivalent to the reversibility of the union of components from ${\mathcal{W}}$ and the union of components from ${\mathcal{W}} *$.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.