The theory of convex geometries
From MaRDI portal
Publication:1065391
DOI10.1007/BF00149365zbMath0577.52001OpenAlexW2313098266MaRDI QIDQ1065391
Robert E. Jamison, Paul H. Edelman
Publication date: 1985
Published in: Geometriae Dedicata (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00149365
Related Items (only showing first 100 items - show all)
Unlabeled sample compression schemes and corner peelings for ample and maximum classes ⋮ Essentiality and convexity in the ranking of opportunity sets ⋮ Topes of oriented matroids and related structures ⋮ On empty convex polygons in a planar point set ⋮ Axioms for convexity ⋮ Networks, Communication and Hierarchy: Applications to Cooperative Games ⋮ Dual greedy polyhedra, choice functions, and abstract convex geometries ⋮ A convex combinatorial property of compact sets in the plane and its roots in lattice theory ⋮ Cooperative games on convex geometries with a coalition structure ⋮ Computing the hull number in toll convexity ⋮ A note on the convexity number of the complementary prisms of trees ⋮ Optimum basis of finite convex geometry ⋮ On weighted sums of numbers of convex polygons in point sets ⋮ A representation of antimatroids by Horn rules and its application to educational systems ⋮ What convex geometries tell about shattering-extremal systems ⋮ Resolutions of convex geometries ⋮ Lattices of regular closed subsets of closure spaces ⋮ A discrete duality between nonmonotonic consequence relations and convex geometries ⋮ A new notion of convexity in digraphs with an application to Bayesian networks ⋮ CONDITIONAL LOGIC IS COMPLETE FOR CONVEXITY IN THE PLANE ⋮ Convex Partitions of Graphs ⋮ Unnamed Item ⋮ Partition coefficients of acyclic graphs ⋮ Convex rough sets on finite domains ⋮ Convex Independence in Permutation Graphs ⋮ Convexity in ordered matroids and the generalized external order ⋮ A bi-preference interplay between transitivity and completeness: reformulating and extending Schmeidler's theorem ⋮ Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements ⋮ A ranking model for the greedy algorithm and discrete convexity ⋮ First-order logic axiomatization of metric graph theory ⋮ Single-peaked compatible preference profiles: Some combinatorial results ⋮ Unnamed Item ⋮ Representing finite convex geometries by relatively convex sets ⋮ Antimatroids, Betweenness, Convexity ⋮ Diversity relations over menus ⋮ On the contour of graphs ⋮ On hierarchies and communication ⋮ Antimatroids and balanced pairs ⋮ Output-polynomial enumeration of all fixed-cardinality ideals of a poset, respectively all fixed-cardinality subtrees of a tree. ⋮ Impartial achievement games on convex geometries ⋮ Algebraic Representation, Dualities and Beyond ⋮ ULD-Lattices and Δ-Bonds ⋮ Choice resolutions ⋮ Quasi-concave functions on meet-semilattices ⋮ Path independent choice and the ranking of opportunity sets ⋮ Coordinatization of finite join-distributive lattices. ⋮ ON THE COMPLEXITY OF COMPUTING VALUES OF RESTRICTED GAMES ⋮ Transformations of discrete closure systems ⋮ The max-flow min-cut property of two-dimensional affine convex geometries ⋮ The core of games on ordered structures and graphs ⋮ Enumeration in convex geometries and associated polytopal subdivisions of spheres ⋮ Transformations of Concept Graphs: ⋮ The average tree permission value for games with a permission tree ⋮ The duality between the anti-exchange closure operators and the path independent choice operators on a finite set ⋮ Mathematics of Plott choice functions ⋮ Combinatorics of lopsided sets ⋮ Coloring copoints of a planar point set ⋮ Partitioning a graph into convex sets ⋮ Interaction indices for games on combinatorial structures with forbidden coalitions ⋮ Toric partial orders ⋮ Unnamed Item ⋮ A new characterization of the path independent choice functions ⋮ Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs ⋮ Going down in (semi)lattices of finite moore families and convex geometries ⋮ Computational and structural aspects of the geodetic and the hull numbers of shadow graphs ⋮ Computational and structural aspects of the geodetic and the hull numbers of shadow graphs ⋮ A Hierarchical Model for Cooperative Games ⋮ Set relations and set systems induced by some families of integral domains ⋮ Augmenting and Decreasing Systems ⋮ Cooperative games on intersection closed systems and the Shapley value ⋮ Violator spaces vs closure spaces ⋮ Unnamed Item ⋮ Alignments closed under a binary product ⋮ Convex Geometries on Root Systems ⋮ On the number of atoms in three-generated lattices ⋮ Description of closure operators in convex geometries of segments on the line ⋮ Finding a Maximum-Weight Convex Set in a Chordal Graph ⋮ Intervals in lattices of \(\kappa\)-meet-closed subsets ⋮ Linear relations for a generalized Tutte polynomial ⋮ The Erdos-Szekeres problem on points in convex position – a survey ⋮ Substitutable choice functions and convex geometry ⋮ A single-element extension of antimatroids ⋮ A class of infinite convex geometries ⋮ Complexity aspects of the triangle path convexity ⋮ Sublattices of lattices of order-convex sets. I: The main representation theorem ⋮ An order theoretic framework for overlapping clustering ⋮ Orders on subsets rationalised by abstract convex geometries ⋮ Trees as semilattices ⋮ Homomorphisms and Ramsey properties of antimatroids ⋮ \(n\)-distributivity, dimension and Carathéodory's theorem ⋮ Alternating Whitney sums and matchings in trees. 1 ⋮ Extreme point axioms for closure spaces ⋮ Polluted river problems and games with a permission structure ⋮ The structure of hemispaces in \({\mathbb{R}}^ n\) ⋮ Well-graded families of relations ⋮ A circuit set characterization of antimatroids ⋮ Branchings in rooted graphs and the diameter of greedoids ⋮ Tableaux and chains in a new partial order of \(S_ n\) ⋮ Convex sets in graphs. II: Minimal path convexity ⋮ Closure lattices
This page was built for publication: The theory of convex geometries
