<?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-VA5HIRMR/f35e75b0-c58c-466f-bc15-841dc1137dbf/PDF"><dcterms:extent>393 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-VA5HIRMR/cab90708-615c-470e-81a0-de61b207970b/TEXT"><dcterms:extent>46 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-VA5HIRMR"><dcterms:isPartOf rdf:resource="https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR" /><dcterms:issued>2021</dcterms:issued><dc:creator>Chan, Brian Tianyao</dc:creator><dc:format xml:lang="sl">številka:2</dc:format><dc:format xml:lang="sl">letnik:21</dc:format><dc:format xml:lang="sl">str. 201-217</dc:format><dc:identifier>DOI:10.26493/1855-3974.2260.c0e</dc:identifier><dc:identifier>COBISSID_HOST:112346371</dc:identifier><dc:identifier>ISSN:1855-3966</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-VA5HIRMR</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">balanced tableaux</dc:subject><dc:subject xml:lang="sl">granatiranje</dc:subject><dc:subject xml:lang="sl">Hallov pogoj v zvezi s problemom porok</dc:subject><dc:subject xml:lang="en">non-CayleyHall’s marriage condition</dc:subject><dc:subject xml:lang="sl">ravnotežene tablice</dc:subject><dc:subject xml:lang="en">shelling</dc:subject><dcterms:temporal rdf:resource="2008-2025" /><dc:title xml:lang="sl">A generalization of balanced tableaux and marriage problems with unique solutions|</dc:title><dc:description xml:lang="sl">We consider families of finite sets that we call flagged and that have been characterized by Chang as being the families of sets that admit unique solutions to Hall’s marriage problem and we consider generalizations of Edelman and Greene’s balanced tableaux previously investigated by Viard. In this paper, we introduce a natural generalization of Edelman and Greene’s balanced tableaux that involves families of sets that satisfy Hall’s marriage condition and certain words in ?$m^n$?, then prove that flagged families can be characterized by a strong existence condition relating to this generalization. As a consequence of this characterization, we show that the arithmetic mean of the sizes of subclasses of such generalized tableaux is given by a generalization of the hook-length formula</dc:description><dc:description xml:lang="sl">Obravnavamo družine končnih množic, ki jih imenujemo označene z zastavico; Chang jih je karakteriziral kot družine množic, ki imajo enolične rešitve Hallovega problema porok. Obravnavamo tudi posplošitve Edelmanovih in Greeneovih tablic, ki jih je obravnaval že Viard. V tem članku vpeljemo naravno posplošitev Edelmanovih in Greeneovih uravnoteženih tablic, ki vključuje družine množic, ki zadoščajo Hallovemu pogoju porok in določene besede v ?$m^n$?, nato pa pokažemo, da se da z zastavicami označene družine karakterizirati z močnim eksistenčnim pogojem, ki se nanaša na to posplošitev. Na osnovi te karakterizacije pokažemo, da se da aritmetično sredino velikosti podrazredov teh posplošenih tablic izraziti s posplošitvijo formule za dolžino kljuk</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-VA5HIRMR"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:doc-VA5HIRMR" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:doc-VA5HIRMR/f35e75b0-c58c-466f-bc15-841dc1137dbf/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-VA5HIRMR/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:doc-VA5HIRMR" /></ore:Aggregation></rdf:RDF>