<?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-AWOS2M7H/dce78ab0-b751-484e-81cf-baeb5d47d3e0/PDF"><dcterms:extent>398 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-AWOS2M7H/1fbf1148-92a6-432d-af7d-cef6724dd41d/TEXT"><dcterms:extent>39 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-AWOS2M7H"><dcterms:isPartOf rdf:resource="https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR" /><dcterms:issued>2019</dcterms:issued><dc:creator>Hibi, Takayuki</dc:creator><dc:creator>Li, Nan</dc:creator><dc:creator>Li, Teresa Xueshan</dc:creator><dc:creator>Mu, Lili</dc:creator><dc:creator>Tsuchiya, Akiyoshi</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. 299-317</dc:format><dc:identifier>ISSN:1855-3966</dc:identifier><dc:identifier>COBISSID_HOST:18752601</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-AWOS2M7H</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="sl">delno urejena množica</dc:subject><dc:subject xml:lang="en">order-chain polytope</dc:subject><dc:subject xml:lang="en">poset</dc:subject><dc:subject xml:lang="en">unimodular equivalence</dc:subject><dc:subject xml:lang="sl">unimodularna ekvivalenca</dc:subject><dc:subject xml:lang="sl">urejenostno-verižni politop</dc:subject><dc:subject xml:lang="en">volume</dc:subject><dcterms:temporal rdf:resource="2008-2025" /><dc:title xml:lang="sl">Order-chain polytopes|</dc:title><dc:description xml:lang="sl">Given two families ?$X$? and ?$Y$? of integral polytopes with nice combinatorial and algebraic properties, a natural way to generate a new class of polytopes is to take the intersection ?$\mathcal P = \mathcal P_1 \cap \mathcal P_2$?, where ?$\mathcal P_1 \in X,\ \mathcal P_2 \in Y$?. Two basic questions then arise: 1) when ?$\mathcal P$? is integral and 2) whether ?$\mathcal P$? inherits the "old type" from ?$\mathcal P_1,\ \mathcal P_2$? or has a "new type", that is, whether ?$\mathcal P$? is unimodularly equivalent to a polytope in ?$X \cup Y$? or not. In this paper, we focus on the families of order polytopes and chain polytopes. Following the above framework, we create a new class of polytopes which are named order-chain polytopes. When studying their volumes, we discover a natural relation with Ehrenborg and Mahajan's results on maximizing descent statistics</dc:description><dc:description xml:lang="sl">Če sta dani dve družini ?$X$? in ?$Y$? celoštevilskih politopov z lepimi kombinatoricnimi in algebrajskimi lastnostmi, je en način za generiranje novega razreda politopov ta, da tvorimo presek ?$\mathcal P = \mathcal P_1 \cap \mathcal P_2$?, kjer je ?$\mathcal P_1 \in X,\ \mathcal P_2 \in Y$?. Tedaj se pojavita dve vprašanji: 1) kdaj je ?$\mathcal P$? celoštevilski in 2) ali ?$\mathcal P$? podeduje "stari tip" od ?$\mathcal P_1,\ \mathcal P_2$? ali pa ima "nov tip", tj. ali je ?$\mathcal P$? unimodularno ekvivalenten politopu v ?$X \cup Y$? ali ne. V tem članku se osredotočimo na družini urejenostnih politopov in verižnih politopov. Sledeč zgornjemu okvirju, ustvarimo nov razred politopov, urejenostno-verižne politope. Ko študiramo njihove prostornine, odkrijemo naravno zvezo z Ehrenborgovimi in Mahajanovimi rezultati v zvezi z maksimiziranjem statistike spusta</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-AWOS2M7H"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:doc-AWOS2M7H" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:doc-AWOS2M7H/dce78ab0-b751-484e-81cf-baeb5d47d3e0/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-AWOS2M7H/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:doc-AWOS2M7H" /></ore:Aggregation></rdf:RDF>