Exploració per tema "Combinatorial analysis"
Ara es mostren els items 41-60 de 162
-
Decomposition spaces in combinatorics
(2016-12)
Report de recerca
Accés obertA decomposition space (also called unital 2-Segal space) is a simplicial object satisfying an exactness condition weaker than the Segal condition: just as the Segal condition expresses (up to homotopy) composition, the new ... -
Decompositions of a rectangle into non-congruent rectangles of equal area
(2021-06)
Article
Accés obertIn this paper, we deal with a simple geometric problem: Is it possible to partition a rectangle into k non-congruent rectangles of equal area? This problem is motivated by the so-called ‘Mondrian art problem’ that asks a ... -
Digraphs with walks of equal length between vertices
(1984)
Text en actes de congrés
Accés obert -
Disecciones de un polígono en el plano proyectivo
(Universidad de Valladolid, 2006)
Comunicació de congrés
Accés restringit per política de l'editorialEn 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 ... -
Distance mean-regular graphs
(2016)
Article
Accés obertWe introduce the concept of distance mean-regular graph, which can be seen as a generalization of both vertex-transitive and distance-regular graphs. Let G be a graph with vertex set V , diameter D, adjacency matrix A, and ... -
Does evidence support the high expectations placed in precision medicine? A bibliographic review
(2018-01-09)
Article
Accés obertBackground: Precision medicine is the Holy Grail of interventions that aretailored to a patient’s individual characteristics. However, the conventional design of randomized trials assumes that each individual benefits ... -
DVALon: una herramienta para diagramas de Voronoi y grafos de proximidad de alcance limitado
(Prensas Universitarias de Zaragoza, 2009)
Text en actes de congrés
Accés obertPresentamos 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
(RBA Libros, 2011-06-01)
Llibre
Accés restringit per política de l'editorialMuchas 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 ... -
Empty triangles in good drawings of the complete graph
(2015)
Article
Accés obertA good drawing of a simple graph is a drawing on the sphere or, equivalently, in the plane in which vertices are drawn as distinct points, edges are drawn as Jordan arcs connecting their end vertices, and any pair of edges ... -
Encoding and avoiding 2-connected patterns in polygon dissections and outerplanar graphs
(2018-12-01)
Article
Accés obertLet ¿={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 ... -
Enumeració de mapes planaris
(Universitat Politècnica de Catalunya, 2020-07)
Treball Final de Grau
Accés obertAl llarg d'aquest treball s'estudiarà l'enumeració dels mapes planaris arrelats i mapes planaris arrelats bipartits amb n arestes a partir del mètode simbòlic i mètode quadràtic introduït per Tutte. A més, aquests dos ... -
Enumeration and limit laws of dissections on a cylinder
(2010-09-28)
Article
Accés obertWe 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 chordal planar graphs and maps
(Universitat Politècnica de Catalunya, 2022-05)
Projecte Final de Màster Oficial
Accés obertWe determine the number of labelled chordal planar graphs with $n$ vertices, which is asymptotically $c_1\cdot n^{-5/2} \gamma^n n!$ for a constant $c_1>0$ and $\gamma \approx 11.89235$. We also determine the number of ... -
Enumeration of labelled 4-regular planar graphs II: asymptotics
(2023-05)
Article
Accés obertThis 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 planar maps using Generating Functions
(Universitat Politècnica de Catalunya, 2020-10)
Projecte Final de Màster Oficial
Accés obertUna enumeració és un llistat complet d'objectes d'una col·lecció. Comptem des que neixem però, especialment quan els tamanys creixen i creixen sense límits, necessitem el que ``oximorònicament" es coneix com a Mètodes ... -
Enumeration of rooted 3-connected bipartite planar maps
(2024-03-07)
Article
Accés obertWe 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, ... -
Equivalent characterizations of the spectra of graphs and applications to measures of distance-regularity
(2020-09)
Article
Accés obertThe spectrum of a graph usually provides a lot of information about its combinatorial structure. Moreover,from the spectrum, the so-called predistance polynomials can be defined, as a generalization, for any graph, of the ... -
Erdös i la teoria de Ramsey
(2011-03-02)
Audiovisual
Accés obert -
Erdös y los enteros
(2011-03-02)
Audiovisual
Accés obert -
Existence of spanning F-free subgraphs with large minimum degree
(2016-12-07)
Article
Accés restringit per política de l'editorialLet 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 ...
