1079 KB43 KB225 KB4 KB2021Berman, LeahGévay, GáborPisanski, Tomažštevilka:3letnik:4str. 1-18DOI:10.26493/2590-9770.1408.f90ISSN:2590-9770COBISSID_HOST:96599811URN:URN:NBN:SI:doc-9QT912PTenFakulteta za matematiko, naravoslovje in informacijske tehnologijeThe art of discrete and applied mathematicsaksialna afinostAxial affinitygeometric configurationgeometrijska konfiguracijaGrünbaum calculusGrünbaumov računConnected geometric(nk) configurations existfor almost all n|In a series of papers and in his 2009 book on configurations Branko Grünbaum de-scribed a sequence of operations to produce new(n4)configurations from various inputconfigurations. These operations were later called the “Grünbaum Incidence Calculus”. Wegeneralize two of these operations to produce operations on arbitrary(nk)configurations.Using them, we show that for anykthere exists an integerNksuch that for anyn?Nkthere exists a geometric(nk)configuration. We use empirical results fork= 2,3,4, andsome more detailed analysis to improve the upper bound for larger values ofkTEXTznanstveno časopisjejournalsSlovenian National E-content AggregatorNational and University Library of SloveniaUniverza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije