<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-04-13T03:15:11Z</responseDate><request verb="GetRecord" identifier="oai:www.recercat.cat:2117/119372" metadataPrefix="qdc">https://recercat.cat/oai/request</request><GetRecord><record><header><identifier>oai:recercat.cat:2117/119372</identifier><datestamp>2025-07-17T15:49:15Z</datestamp><setSpec>com_2072_1033</setSpec><setSpec>col_2072_452951</setSpec></header><metadata><qdc:qualifieddc xmlns:qdc="http://dspace.org/qualifieddc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://purl.org/dc/elements/1.1/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dc.xsd http://purl.org/dc/terms/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dcterms.xsd http://dspace.org/qualifieddc/ http://www.ukoln.ac.uk/metadata/dcmi/xmlschema/qualifieddc.xsd">
   <dc:title>Production matrices and enumeration of geometric graphs</dc:title>
   <dc:creator>Esteban Pascual, Guillermo</dc:creator>
   <dc:subject>Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Combinatòria</dc:subject>
   <dc:subject>Combinatorial analysis</dc:subject>
   <dc:subject>Geometric graph</dc:subject>
   <dc:subject>Production matrix</dc:subject>
   <dc:subject>Riordan array</dc:subject>
   <dc:subject>Combinacions (Matemàtica)</dc:subject>
   <dc:subject>Classificació AMS::05 Combinatorics::05A Enumerative combinatorics</dc:subject>
   <dcterms:abstract>We propose the study of counting problems for geometric graphs defined on point sets in convex position. Many formulae are known, for instance the numbers of triangulations are given by the Catalan numbers. Our approach to that topic is based on generating trees, production matrices, and Riordan arrays. We aim to derive such formulae with the mentioned tools, and also to prove new formulae for the numbers of geometric graphs, as well as relations among them.</dcterms:abstract>
   <dcterms:issued>2018-07</dcterms:issued>
   <dc:type>Master thesis</dc:type>
   <dc:rights>http://creativecommons.org/licenses/by-nc-nd/3.0/es/</dc:rights>
   <dc:rights>Open Access</dc:rights>
   <dc:publisher>Universitat Politècnica de Catalunya</dc:publisher>
</qdc:qualifieddc></metadata></record></GetRecord></OAI-PMH>