Skip to main navigation Skip to search Skip to main content

Discrete sets with minimal moment of inertia

  • Université du Québec à Montréal

Research output: Contribution to journal › Journal Article › peer-review

1 Citation (Scopus)

Abstract

We analyze the moment of inertia I (S), relative to the center of gravity, of finite plane lattice sets S. We classify these sets according to their roundness: a set S is rounder than a set T if I (S) < I (T). We introduce the notion of quasi-discs and show that roundest sets are strongly-convex quasi-discs in the discrete sense. We use weakly unimodal partitions and an inequality for the radius to make a table of roundest discrete sets up to size 40. Surprisingly, it turns out that the radius of the smallest disc containing a roundest discrete set S is not necessarily the radius of S as a quasi-disc. Crown

Original languageEnglish
Pages (from-to)31-42
Number of pages12
JournalTheoretical Computer Science
Volume406
Issue number1-2
DOIs
Publication statusPublished - 28 Oct 2008
Externally publishedYes

Keywords

  • Discrete sets
  • Lattice paths
  • Moment of inertia
  • Polyominoes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Discrete sets with minimal moment of inertia'. These topics are generated from the title and abstract of the publication. Together, they form a unique fingerprint.

Cite this