<?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-14T07:15:32Z</responseDate><request verb="GetRecord" identifier="oai:www.recercat.cat:2117/343834" metadataPrefix="oai_dc">https://recercat.cat/oai/request</request><GetRecord><record><header><identifier>oai:recercat.cat:2117/343834</identifier><datestamp>2026-02-04T08:18:37Z</datestamp><setSpec>com_2072_1033</setSpec><setSpec>col_2072_452950</setSpec></header><metadata><oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
   <dc:title>On the number of coloured triangulations of d-manifolds</dc:title>
   <dc:creator>Chapuy, G.</dc:creator>
   <dc:creator>Perarnau Llobet, Guillem</dc:creator>
   <dc:contributor>Universitat Politècnica de Catalunya. Departament de Matemàtiques</dc:contributor>
   <dc:contributor>Universitat Politècnica de Catalunya. GAPCOMB - Geometric, Algebraic and Probabilistic Combinatorics</dc:contributor>
   <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>Triangulated manifolds</dc:subject>
   <dc:subject>Random complexes</dc:subject>
   <dc:subject>Enumeration</dc:subject>
   <dc:subject>Anàlisi combinatòria</dc:subject>
   <dc:description>This is a post-peer-review, pre-copyedit version of an article published in Discrete and computational geometry. The final authenticated version is available online at: http://dx.doi.org/10.1007/s00454-020-00189-w</dc:description>
   <dc:description>We give superexponential lower and upper bounds on the number of coloured d-dimensional triangulations whose underlying space is an oriented manifold, when the number of simplices goes to infinity and d=3 is fixed. In the special case of dimension 3, the lower and upper bounds match up to exponential factors, and we show that there are 2O(n)nn6 coloured triangulations of 3-manifolds with n tetrahedra. Our results also imply that random coloured triangulations of 3-manifolds have a sublinear number of vertices. The upper bounds apply in particular to coloured d-spheres for which they seem to be the best known bounds in any dimension d=3, even though it is often conjectured that exponential bounds hold in this case. We also ask a related question on regular edge-coloured graphs having the property that each 3-coloured component is planar, which is of independent interest.</dc:description>
   <dc:description>This project has received funding from the European Research Council under the European Union’s Horizon 2020 research and innovation programme (Grant Agreement No. ERC-2016-STG 716083 “CombiTop”). G. Perarnau acknowledges an invitation in Paris funded by the ERC Grant CombiTop, during which this project was advanced.</dc:description>
   <dc:description>Postprint (author's final draft)</dc:description>
   <dc:date>2020-03-11</dc:date>
   <dc:type>Article</dc:type>
   <dc:identifier>Chapuy, G.; Perarnau-Llobet, G. On the number of coloured triangulations of d-manifolds. "Discrete and computational geometry", 11 Març 2020, vol. 65, p. 601-617.</dc:identifier>
   <dc:identifier>0179-5376</dc:identifier>
   <dc:identifier>https://hdl.handle.net/2117/343834</dc:identifier>
   <dc:identifier>10.1007/s00454-020-00189-w</dc:identifier>
   <dc:language>eng</dc:language>
   <dc:rights>Open Access</dc:rights>
   <dc:format>17 p.</dc:format>
   <dc:format>application/pdf</dc:format>
</oai_dc:dc></metadata></record></GetRecord></OAI-PMH>