Efficient realizations of closure systems
From MaRDI portal
Publication:6193266
DOI10.1007/s00012-023-00831-7MaRDI QIDQ6193266
Publication date: 12 March 2024
Published in: Algebra Universalis (Search for Journal in Brave)
abelian groupsaffine flatsarityalgebraic closure systemscosets in groupscountably generated subalgebrasternary Mal'cev term
Subalgebras, congruence relations (08A30) Discrete geometry (52C99) Sets with a single binary operation (groupoids) (20N02) (n)-ary systems ((nge 3)) (20N15) Affine analytic geometry (51N10)
Cites Work
- On the Carathéodory number of interval and graph convexities
- Graphs with a minimal number of convex sets
- Helly theorems for 3-Steiner and 3-monophonic convexity in graphs
- Unary polynomials in algebras. I
- Complexity analysis of \(P_3\)-convexity problems on bounded-degree and planar graphs
- A property of the lattice of equational theories
- A Tverberg-type generalization of the Helly number of a convexity space
- Partition numbers for trees and ordered sets
- A note on voting
- Convex, acyclic, and free sets of an oriented matroid
- Convexities related to path properties on graphs
- Open packing, total domination, and the \(P_3\)-Radon number
- Partitioning a graph into convex sets
- The Carathéodory number of the \(P_3\) convexity of chordal graphs
- Der Satz von Radon in konvexen Produktstrukturen. II
- On subalgebra lattices of universal algebras
- Subalgebra systems of powers of partial universal algebras
- Axiomatic convexity theory and relationships between the Carathéodory, Helly, and Radon numbers
- Geodetic Number versus Hull Number in $P_3$-Convexity
- Convex excess in partial cubes
- Lattice Theory: Foundation
- Algebraic Codes on Lines, Planes, and Curves
- The structure of finite algebras
- Representations of Lattices by Sets
- Medical surveillance, frequent sets, and closure operations
- 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
This page was built for publication: Efficient realizations of closure systems
