Now showing items 1-20 of 77

• #### A combinatorial method for the evaluation of yield of fault-tolerant systems-on-chip ﻿

(2003)
Conference report
Open Access
In this paper we develop a combinatorial method for the evaluation of yield of fault-tolerant systems-on-chip. The method assumes that defects are produced according to a model in which defects are lethal and affect given ...
• #### A Random Features Model for Contextual Multi-armed Bandits with Non-linear Reward Function ﻿

(Universitat Politècnica de Catalunya, 2020-06)
Bachelor thesis
24 months embargo
• #### A solution to the tennis ball problem ﻿

(2005)
Article
Open Access
We present a complete solution to the so-called tennis ball problem, which is equivalent to counting the number of lattice paths in the plane that use North and East steps and lie between certain boundaries. The solution ...
• #### A sufficient degree condition for a graph to contain all trees of size k ﻿

(Springer Verlag, 2011-01)
Article
Restricted access - publisher's policy
The Erdős-Sós conjecture says that a graph G on n vertices and number of edges e(G) > n(k− 1)/2 contains all trees of size k. In this paper we prove a sufficient condition for a graph to contain every tree of size k ...
• #### A survey on the missing Moore graph ﻿

(Elsevier, 2019)
Article
Open Access
This is a survey on some known properties of the possible Moore graph (or graphs) ¿ with degree 57 and diameter 2. Moreover, we give some new results about it, such as the following. When we consider the distance partition ...
• #### Advanced analytics through FPGA based query processing and deep reinforcement learning ﻿

(Universitat Politècnica de Catalunya, 2019-02-12)
Doctoral thesis
Open Access
Today, vast streams of structured and unstructured data have been incorporated in databases, and analytical processes are applied to discover patterns, correlations, trends and other useful relationships that help to take ...
• #### Algebraic characterizations of bipartite distance-regular graphs ﻿

(Iniciativa Digital Politècnica, 2011)
Conference report
Open Access
Bipartite graphs are combinatorial objects bearing some interesting symmetries. Thus, their spectra—eigenvalues of its adjacency matrix—are symmetric about zero, as the corresponding eigenvectors come into pairs. Moreover, ...
• #### Algorithms for the weighted independent domination problem ﻿

(Universitat Politècnica de Catalunya, 2019-07-04)
Bachelor thesis
Open Access
El problema de la dominació independent ponderada és un problema NP-hard d'optimització combinatòria en grafs. Aquest problema només ha estat abordat a la literatura per enfocaments de programació lineal entera, heurístiques ...
• #### An ROBDD-based combinatorial method for the evaluation of yield of defect-tolerant systems-on-chip ﻿

(2009-02)
Article
Open Access
In this paper, we develop a combinatorial method for the evaluation of the functional yield of defect-tolerant systems-on chip (SoC). The method assumes that random manufacturing defects are produced according to a model ...
• #### Analytic combinatorics of chord and hyperchord diagrams with k crossings ﻿

(2014-05-07)
Article
Open Access
Using methods from Analytic Combinatorics, we study the families of perfect matchings, partitions, chord diagrams, and hyperchord diagrams on a disk with a prescribed number of crossings. For each family, we express the ...
• #### Arcs and tensors ﻿

(2019-08-01)
Article
Open Access
To 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 ...
• #### Bijections for Baxter families and related objects ﻿

(2011-04)
Article
Open Access
The 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)
Bachelor thesis
Open Access
Covenantee:   École Polytechnique Paris
Bousquet-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
Open Access
Motivated 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 ...
• #### Combinatorics in the Art of the Twentieth Century ﻿

(2017)
Conference report
Open Access
This 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 ...
• #### Continued fractions, lattice paths and asymptotics ﻿

(Universitat Politècnica de Catalunya, 2021-02-18)
Bachelor thesis
Open Access
Covenantee:   Technische Universität Wien
Les 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 ...
• #### Coverage with k-transmitters in the presence of obstacles ﻿

(Springer Verlag, 2010)
Conference report
Restricted access - publisher's policy
For 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 ...
• #### Decomposition of bounded degree graphs into C4-free subgraphs ﻿

(2014-10-15)
Article
Open Access
We 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 ...
• #### Decomposition spaces in combinatorics ﻿

(2016-12)
External research report
Open Access
A 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 ...