Exploració per tema "Anàlisi combinatòria"

Ara es mostren els items 21-40 de 81

    • Disecciones de un polígono en el plano proyectivo 

      Noy Serrano, Marcos; Rué Perna, Juan José (Universidad de Valladolid, 2006)
      Comunicació de congrés
      Accés restringit per política de l'editorial
      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 ...

    • DVALon: una herramienta para diagramas de Voronoi y grafos de proximidad de alcance limitado 

      Abellanas, Manuel; Hernández, Gregorio; Moreno, José Luis; Ordóñez, Sergio; Sacristán Adinolfi, Vera (Prensas Universitarias de Zaragoza, 2009)
      Text en actes de congrés
      Accés obert
      Presentamos un estudio de los diagramas de Voronoi de alcance limitado de un conjunto finito de puntos del plano y DVALon, una herramienta para la manipulaci´on de dichos diagramas, los grafos de proximidad de alcance ...

    • El arte de contar: combinatoria y enumeración 

      Rué Perna, Juan José (RBA Libros, 2011-06-01)
      Llibre
      Accés restringit per política de l'editorial
      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 ...

    • Encoding and avoiding 2-connected patterns in polygon dissections and outerplanar graphs 

      Velona, Vasiliki (2018-12-01)
      Article
      Accés obert
      Let ¿={d1,d2,...,dm} be a finite set of 2-connected patterns, i.e. graphs up to vertex relabelling. We study the generating function D¿(z,u1,u2,...,um), which counts polygon dissections and marks subgraph copies of di with ...

    • Enumeration and limit laws of dissections on a cylinder 

      Rué Perna, Juan José (2010-09-28)
      Article
      Accés obert
      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. ...

    • Existence of spanning F-free subgraphs with large minimum degree 

      Perarnau Llobet, Guillem; Reed, Bruce (2016-12-07)
      Article
      Accés restringit per política de l'editorial
      Let F be a family of graphs and let d be large enough. For every d-regular graph G, we study the existence of a spanning F-free subgraph of G with large minimum degree. This problem is well understood if F does not contain ...

    • Gale duality bounds on the location of roots of polynomials with nonnegative coefficients 

      Pfeifle, Julián (2010-04)
      Article
      Accés obert
      We bound the location of roots of polynomials that have nonnegative coefficients with respect to a fixed but arbitrary basis of the vector space of polynomials of degree at most d. For this, we interpret the basis polynomials ...

    • Generar aliniacions d'un club de Tenis Taula 

      López Clavero, Eric (Universitat Politècnica de Catalunya, 2020-01-23)
      Treball Final de Grau
      Accés obert
      Els entrenadors de Tennis Taula s'enfronten setmanalment al problema de decidir quins jugadors competiran a les lligues durant el cap de setmana. Degudes diverses complicacions que es presenten en participar en competicions ...

    • 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)
      Comunicació de congrés
      Accés restringit per política de l'editorial
      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 ...

    • Graph labelings and decompositions by partitioning sets of integers 

      Moragas Vilarnau, Jordi (Universitat Politècnica de Catalunya, 2010-06-14)
      Tesi
      Accés obert
      Aquest treball és una contribució a l'estudi de diferents problemes que sorgeixen de dues àrees fortament connexes de la Teoria de Grafs: etiquetaments i descomposicions. Molts etiquetaments de grafs deuen el seu origen ...

    • Group inverse matrix of the normalized Laplacian on subdivision networks 

      Carmona Mejías, Ángeles; Mitjana Riera, Margarida; Monsó Burgués, Enrique P.J. (Universidad de Cádiz, 2017)
      Text en actes de congrés
      Accés obert

    • Identities for non-crossing graphs and multigraphs 

      Albiol, Rubén; Noy Serrano, Marcos (2008-12)
      Article
      Accés restringit per política de l'editorial
      We refine an identity between the numbers of certain non-crossing graphs and multigraphs, by modifying a bijection found by P. Podbrdský [A bijective proof of an identity for noncrossing graphs, Discrete Math. 260 (2003) ...

    • Implementación de un stack LoRaWAN en un tracker LoRa 

      González Fernández, Ricard (Universitat Politècnica de Catalunya, 2019-10)
      Treball Final de Grau
      Accés restringit per decisió de l'autor

    • Internally perfect matroids 

      Dall, Aaron Matthew (2017-06-16)
      Article
      Accés obert
      In 1977 Stanley proved that the $h$-vector of a matroid is an $\mathcal{O}$-sequence and conjectured that it is a pure $\mathcal{O}$-sequence. In the subsequent years the validity of this conjecture has been shown for a ...

    • Lattice path matroids: structural properties 

      Bonin, Joseph; Mier Vinué, Anna de (2006)
      Article
      Accés obert
      This paper studies structural aspects of lattice path matroids. Among the basic topics treated are direct sums, duals, minors, circuits, and connected flats. One of the main results is a characterization of lattice path ...

    • Many 2-level polytopes from matroids 

      Grande, Francesco; Rué Perna, Juan José (2015-10-26)
      Article
      Accés obert
      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 ...

    • Matching points with things 

      Taslakian, Perouz; Seara Ojea, Carlos; Saumell Mendiola, Maria; Langerman, Stefan; Hurtado Díaz, Fernando Alfredo; Aloupis, Greg; Cardinal, Jean; Collette, Sébastien; Demaine, Erik D.; Demaine, Martin L.; Dulieu, Muriel; Fabila Monroy, Ruy; Hart, Vi (Springer Verlag, 2010)
      Text en actes de congrés
      Accés restringit per política de l'editorial
      Given an ordered set of points and an ordered set of geometric objects in the plane, we are interested in finding a non-crossing matching between point-object pairs. We show that when the objects we match the points to ...

    • Matching random colored points with rectangles 

      Corujo, Josué; Flores Peñaloza, David; Huemer, Clemens; Pérez Lantero, Pablo; Seara Ojea, Carlos (Springer, 2023-03-14)
      Article
      Accés obert
      Given n > 0, let S ¿ [0,1]2 be a set of n points, chosen uniformly at random. Let R¿B be a random partition, or coloring, of S in which each point of S is included in R uniformly at random with probability 1/2. We study ...

    • Maximal independent sets and maximal matchings in series-parallel and related graph classes 

      Drmota, Michael; Ramos Garrido, Lander; Requilé, Clément; Rué Perna, Juan José (2020-01-10)
      Article
      Accés obert
      The goal of this paper is to obtain quantitative results on the number and on the size of maximal independent sets and maximal matchings in several block-stable graph classes that satisfy a proper sub-criticality condition. ...

    • Maximal independent sets and maximal matchings in series-parallel and related graph classes 

      Drmota, Michael; Ramos, Lander; Requilé, Clément; Rué Perna, Juan José (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018)
      Comunicació de congrés
      Accés obert
      We provide combinatorial decompositions as well as asymptotic tight estimates for two maximal parameters: the number and average size of maximal independent sets and maximal matchings in seriesparallel graphs (and related ...