Now showing items 21-40 of 90

    • Disecciones de un polígono en el plano proyectivo 

      Noy Serrano, Marcos; Rué Perna, Juan José (Universidad de Valladolid, 2006)
      Conference lecture
      Restricted access - publisher's policy
      En este trabajo obtenemos expresiones explícitas de las funciones generadoras de las triangulaciones y cuadrangulaciones del espacio topológico correspondiente a la supresión de un n-ágono del plano proyectivo real. En el ...
    • Domino tilings of the Aztec Diamond 

      Rué Perna, Juan José (2015-12-01)
      Article
      Open Access
      Imagine you have a cutout from a piece of squared paper and a pile of dominoes, each of which can cover exactly two squares of the squared paper. How many different ways are there to cover the entire paper cutout with ...
    • Dynamic programming for graphs on surfaces 

      Rué Perna, Juan José; Sau, Ignasi; Thilikos, Dimitrios (Springer, 2010)
      Conference report
      Open Access
      We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique applies to general families of problems where ...
    • Dynamic programming for graphs on surfaces 

      Rué Perna, Juan José; Sau, Ignasi; Thilikos, Dimitrios (2014-02-01)
      Article
      Open Access
      We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique applies to general families of problems where standard ...
    • El arte de contar: combinatoria y enumeración 

      Rué Perna, Juan José (RBA Libros, 2011-06-01)
      Book
      Restricted access - publisher's policy
      Muchas de las preguntas más importantes de las matemáticas modernas requieren dominar un arte muy especial: el de contar. La rama de las matemáticas que ha hecho del enumerar un arte se llama combinatoria, y de la mano de ...
    • Enumerating simplicial decompositions of surfaces with boundaries 

      Bernardi, Olivier; Rué Perna, Juan José (2012-04-02)
      Article
      Open Access
      It is well-known that the triangulations of the disc with n + 2 vertices on its boundary are counted by the nth Catalan number C(n) = 1 n+1 (2n n ) . This paper deals with the generalisation of this problem to any compact ...
    • Enumeration and limit laws of dissections on a cylinder 

      Rué Perna, Juan José (2010-09-28)
      Article
      Open Access
      We compute the generating function for triangulations on a cylinder, with the restriction that all vertices belong to its boundary and that the intersection of a pair of different faces is either empty, a vertex or an edge. ...
    • Enumeration of labeled 4-regular planar graphs 

      Noy Serrano, Marcos; Requile, Clement; Rué Perna, Juan José (2017-08-01)
      Article
      Open Access
      In this extended abstract, we present the first combinatorial scheme for counting labeled 4-regular planar graphs through a complete recursive decomposition. More precisely, we show that the exponential generating function ...
    • Enumeration of labelled 4-regular planar graphs 

      Noy Serrano, Marcos; Requilé, Clément; Rué Perna, Juan José (2019-08-01)
      Article
      Open Access
      We present the first combinatorial scheme for counting labelled 4-regular planar graphs through a complete recursive decomposition. More precisely, we show that the exponential generating function of labelled 4-regular ...
    • Enumeration of labelled 4-regular planar graphs II: asymptotics 

      Noy Serrano, Marcos; Requile, Clement; Rué Perna, Juan José (2023-05)
      Article
      Open Access
      This work is a follow-up of the article (Noy et al., 2019), where the authors solved the problem of counting labelled 4-regular planar graphs. In this paper, we obtain a precise asymptotic estimate for the number of labelled ...
    • Enumeration of rooted 3-connected bipartite planar maps 

      Noy Serrano, Marcos; Requile, Clement; Rué Perna, Juan José (2024-03-07)
      Article
      Open Access
      We provide the first solution to the problem of counting rooted 3-connected bipartite planar maps. Our starting point is the enumeration of bicoloured planar maps according to the number of edges and monochromatic edges, ...
    • Examen FQ 2019 

      Rué Perna, Juan José (Universitat Politècnica de Catalunya, 2019-05-31)
      Exam
      Restricted access to the UPC academic community
    • Examen MQ 2019 

      Rué Perna, Juan José (Universitat Politècnica de Catalunya, 2019-04-05)
      Exam
      Restricted access to the UPC academic community
    • FQ primavera 2018 

      Espona Dones, Margarida; López Masip, Susana Clara; Rué Perna, Juan José (Universitat Politècnica de Catalunya, 2018-06-11)
      Exam
      Restricted access to the UPC academic community
    • FQ tardor 2018 

      Rué Perna, Juan José; Espona Dones, Margarida (Universitat Politècnica de Catalunya, 2018-01-08)
      Exam
      Restricted access to the UPC academic community
    • Further results on random cubic planar graphs 

      Noy Serrano, Marcos; Requilé, Clément; Rué Perna, Juan José (2020-06)
      Article
      Open Access
      We provide precise asymptotic estimates for the number of several classes of labeled cubic planar graphs, and we analyze properties of such random graphs under the uniform distribution. This model was first analyzed by ...
    • Graph classes with given 3-connected components: asymptotic counting, limit laws and critical phenomena 

      Giménez Llach, Omer; Noy Serrano, Marcos; Rué Perna, Juan José (Edicions de la Universitat de Lleida (UdL), 2008)
      Conference lecture
      Restricted access - publisher's policy
      Consider a family T of 3-connected graphs, and let G be the class of graphs whose 3-connected components are graphs in T . We present a general framework for analyzing such graphs classes based on singularity analysis of ...
    • Introducció a l'anàlisi real : 100 problemes resolts 

      Boza Rocho, Santiago; Rivero Salgado, Óscar; Rué Perna, Juan José (Iniciativa Digital Politècnica. Oficina de Publicacions Acadèmiques Digitals de la UPC, 2022-10)
      Book
      Restricted access to the UPC academic community
      Aquest llibre conté una selecció de problemes resolts, així com un compendi de problemes sense resolució, corresponents a l’assignatura d’anàlisi real del grau de matemàtiques que s’imparteix a la Facultat de Matemàtiques ...
    • Introducció matemàtica a la computació quàntica 

      Rué Perna, Juan José; Xambó Descamps, Sebastián (2013)
      Article
      Open Access
    • Isolated cycles of critical random graphs 

      Noy Serrano, Marcos; Rasendrahasina, Vonjy; Ravelomanana, Vlady; Rué Perna, Juan José (Society for Industrial and Applied Mathematics (SIAM), 2017)
      Conference report
      Open Access
      Consider the Erdos-Renyi random graph G(n, M) built with n vertices and M edges uniformly randomly chosen from the set of n2 edges. Let L be a set of positive integers. For any number of edges M 6n/2 + O(n 2/3 ), we compute ...