Mostra el registre d'ítem simple
Many 2-level polytopes from matroids
dc.contributor.author | Grande, Francesco |
dc.contributor.author | Rué Perna, Juan José |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtiques |
dc.date.accessioned | 2016-04-14T10:55:13Z |
dc.date.available | 2016-10-27T00:30:22Z |
dc.date.issued | 2015-10-26 |
dc.identifier.citation | Grande, F., Rue, J. Many 2-level polytopes from matroids. "Discrete and computational geometry", 26 Octubre 2015, vol. 54, núm. 3, p. 954-979. |
dc.identifier.issn | 0179-5376 |
dc.identifier.uri | http://hdl.handle.net/2117/85655 |
dc.description | The final publication is available at Springer via DOI 10.1007/s00454-015-9735-5 |
dc.description.abstract | The family of 2-level matroids, that is, matroids whose base polytope is 2-level, has been recently studied and characterized by means of combinatorial properties. 2-Level matroids generalize series-parallel graphs, which have been already successfully analyzed from the enumerative perspective. We bring to light some structural properties of 2-level matroids and exploit them for enumerative purposes. Moreover, the counting results are used to show that the number of combinatorially non-equivalent (n-1)(n-1)-dimensional 2-level polytopes is bounded from below by c·n-5/2·¿-nc·n-5/2·¿-n, where c˜0.03791727c˜0.03791727 and ¿-1˜4.88052854¿-1˜4.88052854. |
dc.format.extent | 26 p. |
dc.language.iso | eng |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística |
dc.subject.lcsh | Combinatorial analysis |
dc.subject.other | matroid theory |
dc.subject.other | 2-level polytopes |
dc.subject.other | analytic combinatorics |
dc.subject.other | asymptotic enumeration |
dc.title | Many 2-level polytopes from matroids |
dc.type | Article |
dc.subject.lemac | Anàlisi combinatòria |
dc.identifier.doi | 10.1007/s00454-015-9735-5 |
dc.rights.access | Open Access |
local.identifier.drac | 17548376 |
dc.description.version | Postprint (author's final draft) |
dc.relation.projectid | info:eu-repo/grantAgreement/EC/FP7/630749/EU/Enumeration of discrete structures: algebraic, analytic, probabilistic and algorithmic methods for enriched planar graphs and planar maps/COUNTGRAPH |
local.citation.author | Grande, F.; Rue, J. |
local.citation.publicationName | Discrete and computational geometry |
local.citation.volume | 54 |
local.citation.number | 3 |
local.citation.startingPage | 954 |
local.citation.endingPage | 979 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [3.259]