Resolutions of convex geometries

DOI10.37236/10328zbMath1477.52001arXiv2103.01581OpenAlexW3217237242WikidataQ114023892 ScholiaQ114023892MaRDI QIDQ2665967

Alfio Giarlotta, Jean-Paul Doignon, W. Stephen Watson, Domenico Cantone

Publication date: 22 November 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2103.01581

zbMATH Keywords

resolutionaffine convex geometriesconvex geometriyprimitive convex geometries

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Axiomatic and generalized convexity (52A01) Combinatorial aspects of finite geometries (05B25) Combinatorial geometries and geometric closure systems (51D20)

Related Items (1)

Convex rough sets on finite domains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unavoidable induced subgraphs in large graphs with no homogeneous sets
• A class of infinite convex geometries
• Interval decomposition lattices are balanced
• \((m, n)\)-rationalizable choices
• The pseudo-transitivity of preference relations: strict and weak \((m,n)\)-Ferrers properties
• Prime orders all of whose prime suborders are selfdual
• The affine representation theorem for abstract convex geometries
• A use for frequently rediscovering a concept
• Greedoids
• Extreme point axioms for closure spaces
• Counting combinatorial choice rules
• Choice functions and extensive operators
• Choice functions over a finite set: A summary
• The theory of convex geometries
• Partitive hypergraphs
• The Dilworth theorems. Selected papers of Robert P. Dilworth. Edited by Kenneth P. Bogart, Ralph Freese and Joseph P. S. Kung
• Choice functions and abstract convex geometries
• Strict \((m, 1)\)-Ferrers properties
• Ordered sets
• A discrete duality between nonmonotonic consequence relations and convex geometries
• Choice resolutions
• Ultracritical and hypercritical binary structures
• A general algorithmic scheme for modular decompositions of hypergraphs and applications
• Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
• Statement of precedence and a comment on IIA terminology
• Representing finite convex geometries by relatively convex sets
• Recognition of prime graphs from a prime subgraph
• Über die X-Summe von gerichteten Graphen
• Ordered Sets
• Lattices of Algebraic Subsets and Implicational Classes
• Convex Geometries
• Bases of Closure Systems
• Learning Spaces
• Lattice Theory: Foundation
• Set Operads in Combinatorics and Computer Science
• Convexity in Graphs and Hypergraphs
• General theory of best variants choice: Some aspects
• Path Independence, Rationality, and Social Choice
• Knowledge Spaces
• An Algorithm for the Modular Decomposition of Hypergraphs
• Rational Selection of Decision Functions
• The duality between the anti-exchange closure operators and the path independent choice operators on a finite set
• The computational complexity of antimatroid properties
• Locally complete path independent choice functions and their lattices
• Antimatroids of finite character

This page was built for publication: Resolutions of convex geometries