English
Related papers

Related papers: Embeddings into the generic poset

200 papers

We introduce a formal definition of a pattern poset which encompasses several previously studied posets in the literature. Using this definition we present some general results on the M\"obius function and topology of such pattern posets.…

Combinatorics · Mathematics 2018-06-08 Jason P. Smith

We develop a theory of limits of finite posets in close analogy to the recent theory of graph limits. In particular, we study representations of the limits by functions of two variables on a probability space, and connections to…

Combinatorics · Mathematics 2009-02-03 Svante Janson

In this paper, we show that any finite simplicial complex is homeomorphic to the inverse limit of a sequence of finite posets, which is an extension of Claders result.

Combinatorics · Mathematics 2025-10-23 Jing-Wen Gao , Xiao-Song Yang

We use a classical result of McCord and reduction methods of finite spaces to prove a generalization of Thomason's theorem on homotopy colimits over posets. In particular this allows us to characterize the homotopy colimits of diagrams of…

Algebraic Topology · Mathematics 2014-07-23 Ximena Fernandez , Elias Gabriel Minian

We show that there are four infinite prime graphs such that every infinite prime graph with no infinite clique embeds one of these graphs. We derive a similar result for infinite prime posets with no infinite chain or no infinite antichain.

Combinatorics · Mathematics 2008-12-09 Maurice Pouzet , Imed Zaguia

Partially ordered sets (posets) play a universal role as an abstract structure in many areas of mathematics. For finite posets, an explicit enumeration of distinct partial orders on a set of unlabelled elements is known only up to a…

Combinatorics · Mathematics 2025-04-15 Christoph Minz

We prove that the automorphism group of a Fra\"iss\'e structure M equipped with a notion of stationary independence is universal for the class of automorphism groups of substructures of M. Furthermore, we show that this applies to certain…

Logic · Mathematics 2015-01-20 Isabel Müller

We classify finite posets with a particular sorting property, generalizing a result for rectangular arrays. Each poset is covered by two sets of disjoint saturated chains such that, for any original labeling, after sorting the labels along…

Combinatorics · Mathematics 2007-05-23 Bridget Eileen Tenner

Motivated by the theory of correspondence functors, we introduce the notion of {\em germ} in a finite poset, and the notion of {\em germ extension} of a poset. We show that any finite poset admits a largest germ extension called its {\em…

Combinatorics · Mathematics 2020-12-10 Serge Bouc

We argue that it makes sense to talk about ``typical'' properties of lattices, and then show that there is, up to isomorphism, a unique countable lattice L* (the Fraisse limit of the class of finite lattices) that has all ``typical''…

Rings and Algebras · Mathematics 2008-01-09 Martin Goldstern

Earlier an arbitrary poset $P$ was proved to be isomorphic to the collection of subsets of a space $M$ with two closures which are closed in the first closure and open in the other. As a space $M$ for this representation an algebraic dual…

General Topology · Mathematics 2007-05-23 R. Breslav , A. Stavrova , R. R. Zapatrin

We show that every finite poset is isomorphic to a saturated subset of the spectrum of a Noetherian unique factorization domain. In addition, we show that every finite poset is isomorphic to a saturated subset of the spectrum of a…

Commutative Algebra · Mathematics 2023-09-15 Cory H. Colbert , S. Loepp

An $N$-free poset is a poset whose comparability graph does not embed an induced path with four vertices. We use the well-quasi-order property of the class of countable $N$-free posets and some labelled ordered trees to show that a…

Combinatorics · Mathematics 2023-01-09 Davoud Abdi

Let A, B, S be categories, let F:A-->S and G:B-->S be functors. We assume that for "many" objects a in A, there exists an object b in B such that F(a) is isomorphic to G(b). We establish a general framework under which it is possible to…

Category Theory · Mathematics 2011-05-11 Pierre Gillibert , Friedrich Wehrung

If an automorphism f of a structure M is such that fix(f^k) = fix(f) for all positive k, then M|fix(f) is a substructure of M. The possible isomorphism types of such M|fix(f) are characterized when M is countable and arithmetically…

Logic · Mathematics 2022-11-18 James H. Schmerl

We consider the coset poset associated with the families of proper subgroups, proper subgroups of finite index, and proper normal subgroups of finite index. We investigate under which conditions those coset posets have contractible…

Group Theory · Mathematics 2019-10-15 Kai-Uwe Bux , Cora Welsch

In a category with enough limits and colimits, one can form the universal automorphism on an endomorphism in two dual senses. Sometimes these dual constructions coincide, as in the categories of finite sets, finite-dimensional vector…

Category Theory · Mathematics 2024-05-02 Tom Leinster

We show that for any metric space $M$ satisfying certain natural conditions, there is a finitely generated group $G$, an ultrafilter $\omega $, and an isometric embedding $\iota $ of $M$ to the asymptotic cone ${\rm Cone}_\omega (G)$ such…

Group Theory · Mathematics 2007-05-23 A. G. Erschler , D. V. Osin

Let $M$ be a Fra\"{i}ss\'{e} structure (a countably infinite ultrahomogeneous structure). We refer to the class of structures embeddable in $M$ as the $\omega$-age of $M$. We consider the following two properties of $M$: we say that $M$ has…

Logic · Mathematics 2026-04-23 Rob Sullivan , Jeroen Winkel

A poset is representable if it can be embedded in a field of sets in such a way that existing finite meets and joins become intersections and unions respectively (we say finite meets and joins are preserved). More generally, for cardinals…

Logic · Mathematics 2016-08-31 Rob Egrot