{"?xml":{"@version":"1.0"},"edm:RDF":{"@xmlns:dc":"http://purl.org/dc/elements/1.1/","@xmlns:edm":"http://www.europeana.eu/schemas/edm/","@xmlns:wgs84_pos":"http://www.w3.org/2003/01/geo/wgs84_pos","@xmlns:foaf":"http://xmlns.com/foaf/0.1/","@xmlns:rdaGr2":"http://rdvocab.info/ElementsGr2","@xmlns:oai":"http://www.openarchives.org/OAI/2.0/","@xmlns:owl":"http://www.w3.org/2002/07/owl#","@xmlns:rdf":"http://www.w3.org/1999/02/22-rdf-syntax-ns#","@xmlns:ore":"http://www.openarchives.org/ore/terms/","@xmlns:skos":"http://www.w3.org/2004/02/skos/core#","@xmlns:dcterms":"http://purl.org/dc/terms/","edm:WebResource":[{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-XMP48E8S/9aafb8a5-1889-4922-9649-942fc9df2cd6/PDF","dcterms:extent":"381 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-XMP48E8S/123b6e68-32f4-4950-baa2-a03ad7efa500/TEXT","dcterms:extent":"32 KB"}],"edm:TimeSpan":{"@rdf:about":"2008-2025","edm:begin":{"@xml:lang":"en","#text":"2008"},"edm:end":{"@xml:lang":"en","#text":"2025"}},"edm:ProvidedCHO":{"@rdf:about":"URN:NBN:SI:doc-XMP48E8S","dcterms:isPartOf":[{"@rdf:resource":"https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR"},{"@xml:lang":"sl","#text":"Ars mathematica contemporanea"}],"dcterms:issued":"2019","dc:creator":["Chaiken, Seth","Hanusa, Christopher R. H.","Zaslavsky, Thomas"],"dc:format":[{"@xml:lang":"sl","#text":"letnik:16"},{"@xml:lang":"sl","#text":"številka:2"},{"@xml:lang":"sl","#text":"str. 549-561"}],"dc:identifier":["ISSN:1855-3966","COBISSID_HOST:18811737","URN:URN:NBN:SI:doc-XMP48E8S"],"dc:language":"en","dc:publisher":{"@xml:lang":"sl","#text":"Univerza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologije"},"dc:subject":[{"@xml:lang":"en","#text":"arrangement of hyperplanes"},{"@xml:lang":"en","#text":"Ehrhart theory"},{"@xml:lang":"sl","#text":"Ehrhartova teorija"},{"@xml:lang":"en","#text":"inside-out polytope"},{"@xml:lang":"sl","#text":"izvihani politop"},{"@xml:lang":"sl","#text":"nenapadajoče se šahovske figure"},{"@xml:lang":"en","#text":"nonattacking chess pieces"},{"@xml:lang":"sl","#text":"označeni graf"},{"@xml:lang":"sl","#text":"razporeditev hiperravnin"},{"@xml:lang":"en","#text":"signed graph"}],"dcterms:temporal":{"@rdf:resource":"2008-2025"},"dc:title":{"@xml:lang":"sl","#text":"A q-queens problem|"},"dc:description":[{"@xml:lang":"sl","#text":"The number of ways to place ?$q$? nonattacking queens, bishops, or similar chess pieces on an ?$n \\times n$? square chessboard is essentially a quasipolynomial function of ?$n$? (by Part I of this series the authors, Electron. J. Comb. 21, No. 3, Research Paper P3.33, 28 p. (2014)). The period of the quasipolynomial is difficult to settle. Here we prove that the empirically observed period 2 for three to ten bishops is the exact period for every number of bishops greater than 2. The proof depends on signed graphs and the Ehrhart theory of inside-out polytopes"},{"@xml:lang":"sl","#text":"Število načinov, na katere lahko postavimo ?$q$? nenapadajočih se kraljic, lovcev ali podobnih šahovskih figur na šahovnico ?$n \\times n$?, je v bistvu kvazipolinomska funkcija števila ?$n$? (dokažemo v 1. članku iz te serije the authors, Electron. J. Comb. 21, No. 3, Research Paper P3.33, 28 p. (2014)). Periodo kvazipolnoma je težko določiti. Dokažemo, da je empirično opažena perioda 2 za tri do deset lovcev natančna vrednost periode za vsako število lovcev, ki je večje od 2. Dokaz je odvisen od označenih grafov in Ehrhartove teorije izvihanih politopov"}],"edm:type":"TEXT","dc:type":[{"@xml:lang":"sl","#text":"znanstveno časopisje"},{"@xml:lang":"en","#text":"journals"},{"@rdf:resource":"http://www.wikidata.org/entity/Q361785"}]},"ore:Aggregation":{"@rdf:about":"http://www.dlib.si/?URN=URN:NBN:SI:doc-XMP48E8S","edm:aggregatedCHO":{"@rdf:resource":"URN:NBN:SI:doc-XMP48E8S"},"edm:isShownBy":{"@rdf:resource":"http://www.dlib.si/stream/URN:NBN:SI:doc-XMP48E8S/9aafb8a5-1889-4922-9649-942fc9df2cd6/PDF"},"edm:rights":{"@rdf:resource":"http://creativecommons.org/licenses/by/4.0/"},"edm:provider":"Slovenian National E-content Aggregator","edm:intermediateProvider":{"@xml:lang":"en","#text":"National and University Library of Slovenia"},"edm:dataProvider":{"@xml:lang":"sl","#text":"Univerza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije"},"edm:object":{"@rdf:resource":"http://www.dlib.si/streamdb/URN:NBN:SI:doc-XMP48E8S/maxi/edm"},"edm:isShownAt":{"@rdf:resource":"http://www.dlib.si/details/URN:NBN:SI:doc-XMP48E8S"}}}}