Results 31 to 40 of about 6,492 (203)
Stokes posets and serpent nests [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 30 pages, 12 ...
Frédéric Chapoton
doaj +1 more source
Open Mathematics, 2006 AbstractThis article extends a paper of Abraham and Bonnet which generalised the famous Hausdorff characterisation of the class of scattered linear orders. They gave an inductively defined hierarchy that characterised the class of scattered posets which do not have infinite incomparability antichains (i.e. have the FAC).
Džamonja Mirna, Thompson Katherine
doaj +4 more sources
Algorithmica, 2012 We describe an algorithm for compressing a partially ordered set, or \emph{poset}, so that it occupies space matching the information theory lower bound (to within lower order terms), in the worst case. Using this algorithm, we design a succinct data structure for representing a poset that, given two elements, can report whether one precedes the other ...
J. Ian Munro, Patrick K. Nicholson
openaire +5 more sources
, 2013 Let X be a finite set. This paper describes some topological and combinatorial properties of the poset \Omega_X of order relations on X. In particular, the homotopy type of all the intervals in \Omega_X is precisely determined, and the Möbius function of \Omega_X is computed.
openaire +4 more sources
Poset limits and exchangeable random posets [PDF]
Combinatorica, 2011 36 ...
openaire +3 more sources
The topology of the permutation pattern poset [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 The set of all permutations, ordered by pattern containment, forms a poset. This extended abstract presents the first explicit major results on the topology of intervals in this poset.
Peter McNamara, Einar Steingrımsson
doaj +1 more source
Journal of Combinatorics, 2019 Let $G$ be an acylic directed graph. For each vertex $g \in G$, we define an involution on the independent sets of $G$. We call these involutions flips, and use them to define a new partial order on independent sets of $G$. Trim lattices generalize distributive lattices by removing the graded hypothesis: a graded trim lattice is a distributive lattice,
Thomas, Hugh, Williams, Nathan
openaire +3 more sources
The Journal of Symbolic Logic, 2009 AbstractHirschfeldt and Shore have introduced a notion of stability for infinite posets. We define an arguably more natural notion called weak stability, and we study the existence of infinite computable or low chains or antichains, and of infinite chains and antichains, in infinite computable stable and weakly stable posets.
Jockusch, Jr., Carl G. +4 more
openaire +4 more sources
Locally Quasi-Convex Compatible Topologies on a Topological Group
Axioms, 2015 For a locally quasi-convex topological abelian group (G,τ), we study the poset \(\mathscr{C}(G,τ)\) of all locally quasi-convex topologies on (G) that are compatible with (τ) (i.e., have the same dual as (G,τ) ordered by inclusion.
Lydia Außenhofer +2 more
doaj +1 more source
Pattern-avoiding Dyck paths [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 We introduce the notion of $\textit{pattern}$ in the context of lattice paths, and investigate it in the specific case of Dyck paths. Similarly to the case of permutations, the pattern-containment relation defines a poset structure on the set of all Dyck
Antonio Bernini +3 more
doaj +1 more source