English
Related papers

Related papers: On scattered posets with finite dimension

200 papers

We show that a finite collection of stable subgroups of a finitely generated group has finite height, finite width and bounded packing. We then use knowledge about intersections of conjugates to characterize finite families of…

Geometric Topology · Mathematics 2017-02-06 Yago Antolín , Mahan Mj , Alessandro Sisto , Samuel J. Taylor

We examine properties of generic automorphisms of the random poset, with the goal of explicitly characterizing them. We associate to each automorphism an auxiliary first-order structure, consisting of the random poset equipped with an…

Logic · Mathematics 2021-01-01 Dakota Thor Ihli

A monoid $M$ generated by a set $S$ of symbols can be described as the set of equivalence classes of finite words in $S$ under some relations that specify when some contiguous sequence of symbols can be replaced by another. If $a,b\in S$, a…

Combinatorics · Mathematics 2011-01-26 Matthew J. Samuel

We initiate the study of model structures on (categories induced by) lattice posets, a subject we dub homotopical combinatorics. In the case of a finite total order $[n]$, we enumerate all model structures, exhibiting a rich combinatorial…

Algebraic Topology · Mathematics 2023-04-20 Scott Balchin , Kyle Ormsby , Angélica M. Osorno , Constanze Roitzheim

Traditionally a tiling is defined with a finite number of finite forbidden patterns. We can generalize this notion considering any set of patterns. Generalized tilings defined in this way can be studied with a dynamical point of view,…

Discrete Mathematics · Computer Science 2009-02-11 Nathalie Aubrun , Mathieu Sablik

We introduce so-called consistent posets which are bounded posets with an antitone involution ' where the lower cones of x,x' and of y,y' coincide provided x,y are different form 0,1 and, moreover, if x,y are different form 0 then their…

Logic · Mathematics 2020-06-30 Ivan Chajda , Helmut Länger

In this paper we show that the set of closure relations on a finite poset P forms a supersolvable lattice, as suggested by Rota. Furthermore this lattice is dually isomorphic to the lattice of closed sets in a convex geometry (in the sense…

Combinatorics · Mathematics 2016-09-06 Michael Hawrylycz , Victor Reiner

We develop a novel tool to study the fixed point property of finite posets using a topological approach. Our tool is a construction which turns out to induce an endofunctor of the homotopy category of finite $T_0$--spaces. We study many…

Algebraic Topology · Mathematics 2019-07-09 Ana Gargantini , Miguel Ottina

Let $(P,\leq)$ be a finite poset (partially ordered set), where $P$ has cardinality $n$. Consider linear extensions of $P$ as permutations $x_1x_2\cdots x_n$ in one-line notation. For distinct elements $x,y\in P$, we define…

Combinatorics · Mathematics 2018-02-02 Emily J. Olson , Bruce E. Sagan

We consider problems concerning the partial order structure of the set of spreading models of Banach spaces. We construct examples of spaces showing that the possible structure of these sets include certain classes of finite semi-lattices…

Functional Analysis · Mathematics 2007-05-23 S. J. Dilworth , E. Odell , B. Sari

We define combinatorially a partial order on the set partitions and show that it is equivalent to the Bruhat-Chevalley-Renner order on the upper triangular matrices. By considering subposets consisting of set partitions with a fixed number…

Combinatorics · Mathematics 2018-06-12 Mahir Bilen Can , Yonah Cherniavsky

For a class of random partitions of an infinite set a de Finetti-type representation is derived, and in one special case a central limit theorem for the number of blocks is shown.

Probability · Mathematics 2007-05-23 Alexander Gnedin

In this paper we describe a novel a procedure to build a linear order from an arbitrary poset which (i) preserves the original ordering and (ii) allows to extend monotonic and antitonic mappings defined over the original poset to monotonic…

Discrete Mathematics · Computer Science 2010-06-15 Nicolas Madrid Labrador , Umberto Straccia

A finite poset (partially ordered set) $P$ with ${\hat 0}$ is called of distributive type if every interval $[{\hat 0}, a]$, $a \in P$, of $P$ is a distributive lattice. From a viewpoint of ASL's (algebras with straightening laws), the…

Commutative Algebra · Mathematics 2026-02-17 Takayuki Hibi , Seyed Amin Seyed Fakhari

This paper has been withdrawn by the authors due to a crucial computational error. In this paper we deal with the finite case. We prove that a finite bounded ordered set can be represented as the order of principal congruences of a finite…

Rings and Algebras · Mathematics 2013-04-02 G. Grätzer , E. T. Schmidt

We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…

Combinatorics · Mathematics 2010-09-06 Jan Hubicka

We construct different classes of lumpings for a family of Markov chain products which reflect the structure of a given finite poset. We use essentially combinatorial methods. We prove that, for such a product, every lumping can be obtained…

Combinatorics · Mathematics 2013-10-15 Daniele D'Angeli , Alfredo Donno

Given a countable model of set theory, we study the structure of its generic multiverse, the collection of its forcing extensions and ground models, ordered by inclusion. Mostowski showed that any finite poset embeds into the generic…

The class of poset metrics is very large and contains some interesting families of metrics. A family of metrics, based on posets which are formed from disjoint chains which have the same size, is examined. A necessary and sufficient…

Information Theory · Computer Science 2015-03-19 Tuvi Etzion

It is known that nontrivial ultraproducts of complete partially ordered sets (posets) are almost never complete. We show that complete additivity of functions is preserved in ultraproducts of posets. Since failure of this property is…

Logic · Mathematics 2016-09-29 H. Andréka , Z. Gyenis , I. Németi