A use for frequently rediscovering a concept

@article{Monjardet1985AUF,
  title={A use for frequently rediscovering a concept},
  author={Bernard Monjardet},
  journal={Order},
  year={1985},
  volume={1},
  pages={415-417}
}
Quasiplanar Diagrams and Slim Semimodular Lattices
TLDR
A bijection allows one to describe finite posets of order dimension at most 2 by finite slim semimodular lattices, and it is obtained that there are exactly (n−2)! quasiplanar diagrams of size n. Expand
Finite convex geometries of circles
  • G. Czédli
  • Computer Science, Mathematics
  • Discret. Math.
  • 2014
TLDR
It is proved that if the circles are collinear and they are arranged in a “concave way”, then they determine a convex geometry of convex dimension at most 2, and each finite convex geometries can be represented this way. Expand
Convexities on ordered structures have their Krein--Milman theorem
We show analogues of the classical Krein-Milman theorem for several ordered algebraic structures, especially in a semilattice (non-linear) framework. In that case, subsemilattices are seen as convexExpand
Length-preserving extensions of semimodular lattices by lowering join-irreducible elements
We prove that if e is a join-irreducible element of a semimodular lattice L of finite length and h < e in L such that e does not cover h, then e can be “lowered” to a covering of h by taking aExpand
Resolutions of Convex Geometries
Convex geometries (Edelman and Jamison, 1985) are finite combinatorial structures dual to union-closed antimatroids or learning spaces. We define an operation of resolution for convex geometries,Expand
A Discrete Duality Between Nonmonotonic Consequence Relations and Convex Geometries
TLDR
A duality between nonmonotonic consequence relations and well-founded convex geometries is presented, which is an extension of an existingDuality between path independent choice functions and convex Geometries that has been developed independently by Koshevoy and by Johnson and Dean. Expand
On the number of atoms in three-generated lattices
As the main achievement of the paper, we construct a three-generated, 2-distributive, atomless lattice that is not finitely presented. Also, the paper contains the following three observations.Expand
A convex combinatorial property of compact sets in the plane and its roots in lattice theory
K. Adaricheva and M. Bolat have recently proved that if $U_0$ and $U_1$ are circles in a triangle with vertices $A_0,A_1,A_2$, then there exist $j\in \{0,1,2\}$ and $k\in\{0,1\}$ such that $U_{1-k}$Expand
Circles and crossing planar compact convex sets
  • G. Czédli
  • Mathematics
  • Acta Scientiarum Mathematicarum
  • 2019
Let $K_0$ be a compact convex subset of the plane $\mathbb R^2$, and assume that whenever $K_1\subseteq \mathbb R^2$ is congruent to $K_0$, then $K_0$ and $K_1$ are not crossing in a natural senseExpand
Description of closure operators in convex geometries of segments on the line
Convex geometry is a closure space $(G,\phi)$ with the anti-exchange property. A classical result of Edelman and Jamison (1985) claims that every finite convex geometry is a join of several linearExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 24 REFERENCES
Ordered Sets and Social Sciences
Problems of modeling, of analysis and of aggregation of preferences provide important examples to illustrate the connections between ordered sets and social sciences. We review these problemsExpand
The Subposet Lattice and the Order Polynomial
The structure of the lattice of all subposets of a fixed poset is explored. This lattice is then used to prove some identities for the order polynomial of that poset.
The lattice of convex sets of an oriented matroid
Abstract Using the theory of the anti-exchange closure the structure of the lattice of convex sets of an acyclic oriented matroid is described. A new expression for the characteristic polynomial ofExpand
Meet-distributive lattices and the anti-exchange closure
This paper defines the anti-exchange closure, a generalization of the order ideals of a partially ordered set. Various theorems are proved about this closure. The main theorem presented is that aExpand
Convexity in directed graphs
Abstract In this paper the concept of convexity in directed graphs is described. It is shown that the set of convex subgraphs of a directed graph G partially ordered by inclusion forms a complete,Expand
...
1
2
3
...