The number of triangular islands on a triangular grid (Q1046809): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The number of rectangular islands by means of distributive lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On averaging Frankl's conjecture for large union-closed-sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly independent subsets in lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the scope of averaging for Frankl's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal instantaneous codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3653811 / rank
 
Normal rank

Latest revision as of 08:35, 2 July 2024

scientific article
Language Label Description Also known as
English
The number of triangular islands on a triangular grid
scientific article

    Statements

    The number of triangular islands on a triangular grid (English)
    0 references
    0 references
    29 December 2009
    0 references
    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.
    0 references
    0 references
    0 references
    0 references
    0 references
    lattice
    0 references
    distributive lattice
    0 references
    weakly independent subset
    0 references
    weak basis
    0 references
    full segment
    0 references
    triangular island
    0 references
    triangular grid
    0 references
    0 references