<?xml version="1.0"?><rdf: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</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-XMP48E8S/123b6e68-32f4-4950-baa2-a03ad7efa500/TEXT"><dcterms:extent>32 KB</dcterms:extent></edm:WebResource><edm:TimeSpan rdf:about="2008-2025"><edm:begin xml:lang="en">2008</edm:begin><edm:end xml:lang="en">2025</edm:end></edm:TimeSpan><edm:ProvidedCHO rdf:about="URN:NBN:SI:doc-XMP48E8S"><dcterms:isPartOf rdf:resource="https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR" /><dcterms:issued>2019</dcterms:issued><dc:creator>Chaiken, Seth</dc:creator><dc:creator>Hanusa, Christopher R. H.</dc:creator><dc:creator>Zaslavsky, Thomas</dc:creator><dc:format xml:lang="sl">letnik:16</dc:format><dc:format xml:lang="sl">številka:2</dc:format><dc:format xml:lang="sl">str. 549-561</dc:format><dc:identifier>ISSN:1855-3966</dc:identifier><dc:identifier>COBISSID_HOST:18811737</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-XMP48E8S</dc:identifier><dc:language>en</dc:language><dc:publisher xml:lang="sl">Univerza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologije</dc:publisher><dcterms:isPartOf xml:lang="sl">Ars mathematica contemporanea</dcterms:isPartOf><dc:subject xml:lang="en">arrangement of hyperplanes</dc:subject><dc:subject xml:lang="en">Ehrhart theory</dc:subject><dc:subject xml:lang="sl">Ehrhartova teorija</dc:subject><dc:subject xml:lang="en">inside-out polytope</dc:subject><dc:subject xml:lang="sl">izvihani politop</dc:subject><dc:subject xml:lang="sl">nenapadajoče se šahovske figure</dc:subject><dc:subject xml:lang="en">nonattacking chess pieces</dc:subject><dc:subject xml:lang="sl">označeni graf</dc:subject><dc:subject xml:lang="sl">razporeditev hiperravnin</dc:subject><dc:subject xml:lang="en">signed graph</dc:subject><dcterms:temporal rdf:resource="2008-2025" /><dc:title xml:lang="sl">A q-queens problem|</dc:title><dc:description xml:lang="sl">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</dc:description><dc:description xml:lang="sl">Š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</dc:description><edm:type>TEXT</edm:type><dc:type xml:lang="sl">znanstveno časopisje</dc:type><dc:type xml:lang="en">journals</dc:type><dc:type rdf:resource="http://www.wikidata.org/entity/Q361785" /></edm:ProvidedCHO><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:provider><edm:intermediateProvider xml:lang="en">National and University Library of Slovenia</edm:intermediateProvider><edm:dataProvider xml:lang="sl">Univerza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije</edm:dataProvider><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" /></ore:Aggregation></rdf:RDF>