On Lattices Embeddable into Lattices of Order-Convex Sets. II Star-like Posets

Marina Semenova , Anna Zamojska-Dzienio


We find a syntactic characterization of the class \$\\textbackslash\mathrm\\\textbackslash\mathbf\SUB\\(\\textbackslash\mathcal\S\)\\textbackslash\cap\\textbackslash\mathrm\Fin\\$ of finite lattices embeddable into convexity lattices of a certain class of posets which we call star-like posets and which is a proper subclass in the class of N-free posets. The characterization implies that the class \$\\textbackslash\mathrm\\\textbackslash\mathbf\SUB\\(\\textbackslash\mathcal\S\)\\textbackslash\cap\\textbackslash\mathrm\Fin\\$ forms a pseudovariety.
Author Marina Semenova - [Sobolev Institute of Mathematics of the Siberian Branch of the Russian Academy of Sciences]
Marina Semenova,,
, Anna Zamojska-Dzienio (FMIS / DAST)
Anna Zamojska-Dzienio,,
- Department of Analysis and Sigularity Theory
Journal seriesOrder, ISSN 0167-8094, 1572-9273, (0 pkt)
Issue year2011
Keywords in English06A05, 06B05, 06B15, 06B20, 08C15, Convex, Convex and Discrete Geometry, Embedding, Geometry, Join-semidistributive, Lattice, N-free, Poset, Theory of Computation, Tree-like, Variety
URL http://link.springer.com/article/10.1007/s11083-010-9189-6
Score (nominal)0
Publication indicators Scopus Citations = 0; WoS Citations = 0
Citation count*
Share Share

Get link to the record

* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.
Are you sure?