English
Related papers

Related papers: Trivial Isomorphisms between Reduced Products

200 papers

A trivial automorphism of the Boolean algebra $\mathcal P(\mathbb N) / \mathrm{Fin}$ is an automorphism induced by the action of some function $\mathbb N \rightarrow \mathbb N$. In models of forcing axioms all automorphisms are trivial, and…

Logic · Mathematics 2025-06-23 Will Brian , Ilijas Farah

We study isomorphisms between metric reduced products of symmetric groups with the normalized Hamming metric assuming the open coloring axiom $\mathsf{OCA}$ and Martin's axiom for $\sigma$-linked posets.

Group Theory · Mathematics 2024-12-17 Ben De Bondt , Andreas Thom

We investigate the statement ``all automorphisms of $\mathcal P(\lambda)/[\lambda]^{<\lambda}$ are trivial''. We show that MA implies the statement for regular uncountable $\lambda<2^{\aleph_0}$; that the statement is false for measurable…

Logic · Mathematics 2024-05-14 Jakob Kellner , Anda Latif , Saharon Shelah

A coloring of a direct product of graphs is said to be {\em trivial} iff it is induced by some coloring of a factor of the product. A graph $G$ is trivially power colorable iff every coloring of a finite power of $G$ with $\chi(G)$-many…

Combinatorics · Mathematics 2024-10-23 Tamás Csernák

We introduce the notions of triviality and order-triviality for global invariant types in an arbitrary first-order theory and show that they are well behaved in the NIP context. We show that these two notions agree for invariant global…

Logic · Mathematics 2026-02-24 Slavko Moconja , Predrag Tanović

We adapt a proof of Lascar in order to show the simplicity of the group of automorphisms fixing pointwise all non-generic elements for a class of uncountable models of suitable theories, encompassing both strongly minimal theories as well…

In a previous paper, the author and his collaborators studied the phenomenon of isotropy in the context of single-sorted equational theories, and showed that the isotropy group of the category of models of any such theory encodes a notion…

Logic in Computer Science · Computer Science 2020-10-21 Jason Parker

We introduce a family of forcing notions that are helpful in showing that certain graphs do not have countable colourings of (additive) Borel class alpha. We construct graphs that are ''weakly minimal'' for such colourings.

General Topology · Mathematics 2026-04-08 Noam Greenberg , Dominique Lecomte , Dan Turetsky , Miroslav Zelen

We prove that the statement `For all Borel ideals I and J on $\omega$, every isomorphism between Boolean algebras $P(\omega)/I$ and $P(\omega)/J$ has a continuous representation' is relatively consistent with ZFC. In this model every…

Logic · Mathematics 2012-11-16 Ilijas Farah , Saharon Shelah

We prove that it is consistent with $\mathfrak c>\aleph_2$ that all automorphisms of $\mathcal P(\omega)/\mbox{fin}$ are trivial.

Logic · Mathematics 2022-07-22 Alan Dow

We show that many nice properties of a theory $T$ follow from the corresponding properties of its reducts to finite subsignatures. If $\{ T_i \}_{i \in I}$ is a directed family of conservative expansions of first-order theories and each…

Logic · Mathematics 2015-08-26 Alice Medvedev

In 1869, Jordan proved that the set $\mathcal{T}$ of all finite group that can be represented as the automorphism group of a tree is containing the trivial group and it is closed under taken direct product of groups of lower order in…

Group Theory · Mathematics 2021-04-07 Somayeh Madani , Ali Reza Ashrafi

A finite tree $T$ with $|V(T)| \geq 2$ is called {\it automorphism-free} if there is no non-trivial automorphism of $T$. Let $\mathcal{AFT}$ be the poset with the element set of all finite automorphism-free trees (up to graph isomorphism)…

Combinatorics · Mathematics 2013-03-08 Ilhee Kim , Ringi Kim , Paul Seymour

A condition, in two variants, is given such that if a property P satisfies this condition, then every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The result is used to…

Logic · Mathematics 2013-04-15 Vera Koponen

Given a countable o-minimal theory T, we characterize the Borel complexity of isomorphism for countable models of T up to two model-theoretic invariants. If T admits a nonsimple type, then it is shown to be Borel complete by embedding the…

Logic · Mathematics 2015-10-19 Richard Rast , Davender Singh Sahota

We study valued fields equipped with an automorphism. We prove that all of them have an extension admitting an equivariant cross-section of the valuation. In residual characteristic zero, and in the presence of such a cross-section, we show…

Logic · Mathematics 2025-12-18 Jan Dobrowolski , Francesco Gallinaro , Rosario Mennuni

Our main result is the determination of the respective groups $ Aut_\mathbb{Z}(S) $ of cohomologically trivial automorphisms and $ Aut_\mathbb{Q}(S) $ of numerically trivial automorphisms for the reducible fake quadrics, that is, the…

Algebraic Geometry · Mathematics 2026-01-27 Fabrizio Catanese , Davide Frapporti

In the present paper we shall prove that countable \omega-categorical simple CM-trivial theories and countable \omega-categorical simple theories with strong stable forking are low. In addition, we observe that simple theories of bounded…

Logic · Mathematics 2011-11-04 Daniel Palacin

If $A_n$ is a sequence of C*-algebras, then the C*-algebra $\prod A_n / \bigoplus A_n$ is called a reduced product. We prove, assuming Todorcevic's Axiom and Martin's Axiom, that every isomorphism between two reduced products of separable,…

Logic · Mathematics 2013-03-21 Paul McKenney

It is shown to be consistent that there is a non-trivial autohomeomorphism of beta N while all such autohomeomorphisms are trivial on some open set. The model used is one due to Velickovic in which, coincidentally, Martin's Axiom also…

Logic · Mathematics 2016-09-06 Saharon Shelah , Juris Steprāns
‹ Prev 1 2 3 10 Next ›