The number of triangular islands on a triangular grid
From MaRDI portal
Using lattice theory, \textit{G.~Czédli} [Eur. J. Comb. 30, No 1, 208--215 (2009; Zbl 1187.05024)] has obtained a sharp upper bound for the number of rectangular islands. His methods are applied in the paper under review to estimate the number \(f(n)\) of triangular islands on a triangular grid with the side length \(n\): \((n^2 + 3n)/5 \leq f(n) \leq (3n^2 + 9n + 2)/14\). The lower bound is obtained by induction on \(n\), using explicit constructions.
Recommendations
Cites work
- On averaging Frankl's conjecture for large union-closed-sets
- On maximal instantaneous codes
- On the scope of averaging for Frankl's conjecture
- The number of brick islands by means of distributive lattices
- The number of rectangular islands by means of distributive lattices
- Weakly independent subsets in lattices
Cited in
(12)- The size of maximal systems of square islands
- An upper bound for the number of planar lattice triangulations
- Cardinality of height function's range in case of maximally many rectangular islands -- computed by cuts
- The number of rectangular islands by means of distributive lattices
- Systems of islands with continuous height functions
- Counting the number of isosceles triangles in rectangular regular grids
- The number of square islands on a rectangular sea
- Notes on systems of triangular islands
- CD-independent subsets in meet-distributive lattices.
- Elementary proof techniques for the maximum number of islands
- The possible number of islands on the sea
- Cut approach to islands in rectangular fuzzy relations
This page was built for publication: The number of triangular islands on a triangular grid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1046809)