A general framework for island systems

DOI10.14232/ACTASM-013-279-7MaRDI QIDQ2973098zbMATH OpenOpenAlexFDO

Authors Stephan Foldes, Eszter K. Horváth, Tamás Waldhauser, Sándor Radeleczki

Publication date 31 March 2017

Published in Acta Scientiarum Mathematicarum (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1210.1741, http://publicatio.bibl.u-szeged.hu/17320/1/2015_4.pdf

zbMATH Keywords

admissible systemCD-independent setsCDW-independent setsconnected subgraphconvex subgraphdistant systemformal conceptheight functionisland domainisland systempoint-to-set proximity relationprime implicantprojective planeproximity domain

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Structural characterization of families of graphs (05C75) Combinatorics of partially ordered sets (06A07)

Abstract: The notion of an island defined on a rectangular board is an elementary combinatorial concept that occurred first in [G. Cz'edli, The number of rectangular islands by means of distributive lattices, European J. Combin. 30 (2009), 208-215]. Results of this paper were starting points for investigations exploring several variations and various aspects of this notion. In this paper we introduce a general framework for islands that subsumes all earlier studied concepts of islands on finite boards, moreover we show that the prime implicants of a Boolean function, the formal concepts of a formal context, convex subgraphs of a simple graph, and some particular subsets of a projective plane also fit into this framework. We axiomatize those cases where islands have the comparable or disjoint property, or they are distant, introducing the notion of a connective island domain and of a proximity domain, respectively. In the general case the maximal systems of islands are characterised by using the concept of an admissible system. We also characterise all possible island systems in the case of island domains and proximity domains.

Recommendations

• Elementary proof techniques for the maximum number of islands
• A note on systems of rectangular islands: the continuous case
• Systems of islands with continuous height functions
• The minimum sizes of maximal systems of brick islands
• The number of square islands on a rectangular sea
• The size of maximal systems of square islands
• Islands: from coding theory to enumerative combinatorics and to lattice theory -- overview and open problems
• The number of brick islands by means of distributive lattices

Cited in

(7)

• Systems of islands with continuous height functions
• The number of square islands on a rectangular sea
• A note on systems of rectangular islands: the continuous case
• CD-independent subsets in meet-distributive lattices.
• Islands: from coding theory to enumerative combinatorics and to lattice theory -- overview and open problems
• Elementary proof techniques for the maximum number of islands
• The possible number of islands on the sea

This page was built for publication: A general framework for island systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2973098)