Exploració per tema "Combinatorial analysis"
Ara es mostren els items 21-40 de 162
-
Arcs and tensors
(2019-08-01)
Article
Accés obertTo an arc A of PG(k-1,q) of size q+k-1-t we associate a tensor in ¿¿k,t(A)¿¿k-1 , where ¿k,t denotes the Veronese map of degree t defined on PG(k-1,q) . As a corollary we prove that for each arc A in PG(k-1,q) of size ... -
Asymptotics in the schema of simple varieties of trees
(Universitat Politècnica de Catalunya, 2022-05)
Projecte Final de Màster Oficial
Accés obertWe study the functional equation y(x) = xA(y(x)) satisfied by the generating functions in the schema of simple varieties of trees. The radii of convergence r, R of y, A respectively satisfy y(r) <= R. In the subcritical ... -
Big Ramsey degrees of 3-uniform hypergraphs
(2019)
Text en actes de congrés
Accés obertGiven a countably infinite hypergraph $\mathcal R$ and a finite hypergraph $\mathcal A$, the \emph{big Ramsey degree} of $\mathcal A$ in $\mathcal R$ isthe least number $L$ such that, for every finite $k$ and every ... -
Bijections for Baxter families and related objects
(2011-04)
Article
Accés obertThe Baxter number can be written as $B_n = \sum_0^n \Theta_{k,n-k-1}$. These numbers have first appeared in the enumeration of so-called Baxter permutations; $B_n$ is the number of Baxter permutations of size $n$, and ... -
Bijective enumeration of constellations in higher genus
(Universitat Politècnica de Catalunya, 2021-02-19)
Treball Final de Grau
Accés obert
Realitzat a/amb: École Polytechnique ParisBousquet-Mélou i Schaeffer donaren el 2000 una enumeració bijectiva de certs mapes anomenats constel·lacions. El 2019, Lepoutre va descriure una bijecció entre mapes biacoloribles de gènere arbitrari i certs mapes unicel·lulars ... -
Binary labelings for plane quadrangulations and their relatives
(2010)
Article
Accés obertMotivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two ... -
c-Critical graphs with maximum degree three
(John Wiley and Sons, Inc., 1995)
Capítol de llibre
Accés restringit per política de l'editorialLet $G$ be a (simple) gtoph with maximum degree three and chromatic index four. A 3-edge-coloring of G is a coloring of its edges in which only three colors are used. Then a vertex is conflicting when some edges incident ... -
Center of maximum-sum matchings of bichromatic points
(Elsevier, 2024-03-01)
Article
Accés restringit per política de l'editorialLet R and B be two point sets in the plane with . Let be a perfect matching that matches points of R with points of B and maximizes , the total Euclidean distance of the matched pairs. In this paper, we prove that there ... -
Characterizations of classes of graphs by forbidden minors
(Universitat Politècnica de Catalunya, 2011)
Projecte Final de Màster Oficial
Accés obertEn aquest treball tractem el problema de descriure classes de grafs especificades per un menor prohibit. Concretament, presentem resultats de Wagner que caracteritzen grafs sense K5 o bé K3,3 com a menor. També donem ... -
Classical and modern approaches for Plünnecke-type inequalities
(Universitat Politècnica de Catalunya, 2015-09)
Treball Final de Grau
Accés obertThe main objective of this thesis is to present and prove Plünnecke's Inequality, a theorem that gives bounds for sumsets in commutative groups. An introduction to the theory of set addition is presented. Three different ... -
Combinatorial and analytic techniques for lattice path enumeration
(Universitat Politècnica de Catalunya, 2022-01)
Treball Final de Grau
Accés obertThis bachelor s degree thesis studies two type of combinatorial objects. The first ones are exact models of which we can get exact counting formulas, whereas the second type of models are the ones of which we don t have ... -
Combinatorics in the Art of the Twentieth Century
(2017)
Text en actes de congrés
Accés obertThis paper is motivated by a question I asked myself: How can combinatorial structures be used in a work of art? Immediately, other questions arose: Whether there are artists that work or think combinatorially? If so, what ... -
Combinatòria d'escales musicals i acords
(Universitat Politècnica de Catalunya, 2021-05)
Treball Final de Grau
Accés obertEn aquest treball es realitza un estudi de diferents conjunts i successions de notes musicals, com són les escales, els acords i les fileres de tons. Fent servir eines matemàtiques de la branca de la combinatòria es resolen ... -
Continued fractions, lattice paths and asymptotics
(Universitat Politècnica de Catalunya, 2021-02-18)
Treball Final de Grau
Accés obert
Realitzat a/amb: Technische Universität WienLes fraccions contínues permeten descriure de forma natural les funcions generadores de camins etiquetats en una graella amb alçada fitada. Diversos problemes combinatoris presenten una bijecció natural amb aquests camins ... -
Convex quadrangulations of bichromatic point sets
(2020-06-05)
Article
Accés obertWe consider quadrangulations of red and blue points in the plane where each face is convex and no edge connects two points of the same color. In particular, we show that the following problem is NP-hard: Given a finite set ... -
Corrigendum to"On the limiting distribution of the metric dimension for random forests" [European J. Combin. 49 (2015) 68-89]
(2017-07-22)
Article
Accés obertIn the paper ”On the limiting distribution of the metric dimension for random forests” the metric dimension ß(G) of sparse G(n, p) with p = c/n and c < 1 was studied (Theorem 1.2). In the proof of this theorem, for the ... -
Coverage with k-transmitters in the presence of obstacles
(Springer Verlag, 2010)
Text en actes de congrés
Accés restringit per política de l'editorialFor a fixed integer k ≥ 0, a k-transmitter is an omnidirectional wireless transmitter with an infinite broadcast range that is able to penetrate up to k “walls”, represented as line segments in the plane. We develop lower ... -
Cyclically ordering bases in matroids
(Universitat Politècnica de Catalunya, 2023-06)
Projecte Final de Màster Oficial
Accés obertThis work provides an introductory overview of matroid theory, providing examples and investigating base exchanges. The work introduces fundamental concepts, and provides illustrations to visualize and clarify this concepts. ... -
Data wrangling, computational burden, automation, robustness and accuracy in ecological inference forecasting of R×C tables
(Institut d'Estadística de Catalunya, 2023-06-12)
Article
Accés obertThis paper assesses the two current major alternatives for ecological inference, based on a multinomial-Dirichlet Bayesian model and on mathematical programming. Their performance is evaluated in a database made up of ... -
Decomposition of bounded degree graphs into C4-free subgraphs
(2014-10-15)
Article
Accés obertWe prove that every graph with maximum degree ∆ admits a partition of its edges into O(√∆) parts (as ∆→∞) none of which contains C4 as a subgraph. This bound is sharp up to a constantfactor. Our proof uses an iterated ...
