Packing problems, dimensions and the tensor product of complete lattices

DOI10.1007/978-3-030-86982-3_11zbMath1495.68219OpenAlexW2885226994MaRDI QIDQ2670899

Stefan E. Schmidt, Christian D. Jäkel

Publication date: 1 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-86982-3_11

zbMATH Keywords

VC-dimensioncomplete ortholatticepacking problemtensor productformal concept analysiscardinal productorder-two dimension

Mathematics Subject Classification ID

Knowledge representation (68T30) Complete lattices, completions (06B23) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Optimization problems on posets with regard to formal concept analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tensorial decomposition of concept lattices
• The maximum clique problem
• Varieties generated by lattices of breadth two
• Negations and contrapositions of complete lattices
• From graphs to ortholattices and equivariant maps
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• An Algorithm for the Vertex Packing Problem
• VC-dimensions for graphs (extended abstract)

This page was built for publication: Packing problems, dimensions and the tensor product of complete lattices