Counting squared grid patterns with Pólya Theory

##plugins.themes.bootstrap3.article.main##

##plugins.themes.bootstrap3.article.sidebar##

Published 25-11-2018
María Merino Maestre
Imanol Unanue Gual

Abstract

This work is a sequel of papers Yurramendi (2013) and Merino and Yurramendi (2014), where some mathematical formulae for counting the number of non equivalent binary rectangular grids have been obtained. The aim of this work is the explanation and generalization of those mathematical formulae based on Burnside and Polya's theory of counting. Grids with more than two colors are calculated and, moreover, for known occurrencies of all the colors, the way for obtaining the non-equivalent grids number is shown. This article is based on the Mathematics Final Degree Dissertation by Imanol Unanue Gual from UPV/EHU.
Abstract 379 | PDF (Euskara) Downloads 392

##plugins.themes.bootstrap3.article.details##

Keywords

Burnside's theory, Polya's theory, equivalent matrices, OEIS, symmetry

Section
Ale Arrunta