English
Related papers

Related papers: Uncountable homogeneous structures

200 papers

We construct uncountably many discrete groups of type $FP$; in particular we construct groups of type $FP$ that do not embed in any finitely presented group. We compute the ordinary, $\ell^2$- and compactly-supported cohomology of these…

Group Theory · Mathematics 2018-04-27 Ian J. Leary

We call an infinite structure $\mathcal{M}$ sunflowerable if whenever $\mathcal{M}'$ is isomorphic to $\mathcal{M}$ with underlying set $M'$, consisting of finite sets of bounded size, there is an $M_0 \subseteq M'$ such that $M_0$ is a…

Combinatorics · Mathematics 2025-07-29 Nathanael Ackerman , Mary Leah Karker , Mostafa Mirabi

We study the possible structures which can be carried by sets which have no countable subset, but which fail to be `surjectively Dedekind finite', in two possible senses, that there is a surjection to $\omega$, or alternatively, that there…

Logic · Mathematics 2025-09-17 Supakun Panasawatwong , J K Truss

The intended model of the homotopy type theories used in Univalent Foundations is the infinity-category of homotopy types, also known as infinity-groupoids. The problem of higher structures is that of constructing the homotopy types needed…

Logic · Mathematics 2018-07-09 Ulrik Buchholtz

We provide a classification of the homogeneous 3-dimensional permutation structures, i.e. homogeneous structures in a language of 3 linear orders, partially answering a question of Cameron. We also arrive at a natural description of all…

Logic · Mathematics 2020-02-26 Samuel Braunfeld

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

A structure is called weakly oligomorphic if it realizes only finitely many n-ary positive existential types for every n. The goal of this paper is to show that the notions of homomorphism-homogeneity, and weak oligomorphy are not only…

Logic · Mathematics 2017-04-04 Christian Pech , Maja Pech

In this paper, we investigate connections between structures present in every generic extension of the universe $V$ and computability theory. We introduce the notion of {\em generic Muchnik reducibility} that can be used to to compare the…

Logic · Mathematics 2014-12-11 Julia Knight , Antonio Montalban , Noah Schweber

All constructive methods employed in modern mathematics produce only countable sets, even when designed to transcend countability. We show that any constructive argument for uncountability -- excluding diagonalization techniques --…

General Mathematics · Mathematics 2025-05-28 Stanislav Semenov

Let L be a countable language. We say that a countable infinite L-structure M admits an invariant measure when there is a probability measure on the space of L-structures with the same underlying set as M that is invariant under…

Logic · Mathematics 2016-06-29 Nathanael Ackerman , Cameron Freer , Rehana Patel

The non-empty finite subsets of a multiplicatively written monoid form a monoid under setwise multiplication. The same holds for finite subsets containing the identity element. Partly due to their unusual arithmetic properties, these…

Rings and Algebras · Mathematics 2026-05-18 Salvatore Tringali

Measures generated by Iterated Function Systems composed of uncountably many one--dimensional affine maps are studied. We present numerical techniques as well as rigorous results that establish whether these measures are absolutely or…

Dynamical Systems · Mathematics 2011-06-23 Giorgio Mantica

The first part of this article deals with theorems on uniqueness in law for \sigma-finite and constructive countable random sets, which in contrast to the usual assumptions may have points of accumulation. We discuss and compare two…

Probability · Mathematics 2012-07-24 Philip Herriger

We offer a criterion for showing that the automorphism group of an ultrahomogeneous structure is topologically 2-generated and even has a cyclically dense conjugacy class. We then show how finite topological rank of the automorphism group…

Group Theory · Mathematics 2019-08-26 Itay Kaplan , Pierre Simon

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

Building on recent results regarding symmetric probabilistic constructions of countable structures, we provide a method for constructing probability measures, concentrated on certain classes of countably infinite structures, that are…

Logic · Mathematics 2015-11-24 Nathanael Ackerman , Cameron Freer , Jaroslav Nesetril , Rehana Patel

Uniformly finite homology is a coarse invariant for metric spaces; in particular, it is a quasi-isometry invariant for finitely generated groups. In this article, we study uniformly finite homology of finitely generated amenable groups and…

Group Theory · Mathematics 2016-01-20 Matthias Blank , Francesca Diana

Furstenberg--Zimmer structure theory refers to the extension of the dichotomy between the compact and weakly mixing parts of a measure preserving dynamical system and the algebraic and geometric descriptions of such parts to a conditional…

Dynamical Systems · Mathematics 2025-09-30 Asgar Jamneshan

Assuming the Continuum Hypothesis, there is a compact first countable connected space of weight aleph_1 with no totally disconnected perfect subsets. Each such space, however, may be destroyed by some proper forcing order which does not add…

General Topology · Mathematics 2007-05-23 Joan E. Hart , Kenneth Kunen

We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve…