Browsing by Subject "Combinatorial analysis"
Now showing items 120 of 121

A branchandprice algorithm for the Aperiodic MultiPeriod Service Scheduling Problem
(Elsevier, 20171216)
Article
Open AccessThis paper considers the multiperiod service scheduling problem with an aperiodic service policy. In this problem, a set of customers who periodically require service over a finite time horizon is given. To satisfy the ... 
A combinatorial method for the evaluation of yield of faulttolerant systemsonchip
(2003)
Conference report
Open AccessIn this paper we develop a combinatorial method for the evaluation of yield of faulttolerant systemsonchip. The method assumes that defects are produced according to a model in which defects are lethal and affect given ... 
A connection between Inverse Problems and Nonstandard Analysis
(Universitat Politècnica de Catalunya, 201810)
Master thesis
Restricted access  author's decisionNonstandard analysis was born in the decade of 1960 an attempt to give a formal context to the Leibniz approach to differential calculus, in particular in order to provide a rigorous foundation to the notions of infinitesimal ... 
A finite version of the Kakeya problem
(20160602)
Article
Open AccessLet L be a set of lines of an affine space over a field and let S be a set of points with the property that every line of L is incident with at least N points of S. Let D be the set of directions of the lines of L considered ... 
A novel model for arc territory design: promoting Eulerian districts
(20150101)
Article
Open AccessThe problem of district design for the implementation of arc routing activities is addressed. The aim is to partition a road network into a given number of sectors to facilitate the organization of the operations to be ... 
A Random Features Model for Contextual Multiarmed Bandits with Nonlinear Reward Function
(Universitat Politècnica de Catalunya, 202006)
Bachelor thesis
24 months embargo 
A sufficient degree condition for a graph to contain all trees of size k
(Springer Verlag, 201101)
Article
Restricted access  publisher's policyThe ErdősSó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 ... 
Activities and coefficients of the Tutte polynomial
(Universitat Politècnica de Catalunya, 201901)
Master thesis
Open AccessMatroids are combinatorial objects that capture abstractly the essence of dependence. The Tutte polynomial, defined for matroids and graphs, has a numerous amount of information about these structures. In this thesis, we ... 
Algebraic characterizations of bipartite distanceregular graphs
(Iniciativa Digital Politècnica, 2011)
Conference report
Open AccessBipartite 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, 20190704)
Bachelor thesis
Open AccessEl problema de la dominació independent ponderada és un problema NPhard 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 algebraic fractal approach to Collatz Conjecture
(Universitat Politècnica de Catalunya, 201905)
Bachelor thesis
Open AccessThe Collatz conjecture is one of the most easytostate unsolved problems in Mathematics today. It states that after a finite number of iterations of the Collatz function, defined by C(n) = n/2 if n is even, and by C(n) = ... 
An algebraic framework for DiffieHellman assumptions
(201701)
Article
Open AccessWe put forward a new algebraic framework to generalize and analyze Di eHellman like Decisional Assumptions which allows us to argue about security and applications by considering only algebraic properties. Our D`;kMDDH ... 
An analogue of Vosper's theorem for extension fields
(20171101)
Article
Open AccessWe are interested in characterising pairs S, T of Flinear subspaces in a field extension L/F such that the linear span ST of the set of products of elements of S and of elements of T has small dimension. Our central result ... 
An ROBDDbased combinatorial method for the evaluation of yield of defecttolerant systemsonchip
(200902)
Article
Open AccessIn this paper, we develop a combinatorial method for the evaluation of the functional yield of defecttolerant systemson 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
(20140507)
Article
Open AccessUsing 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 ... 
Approximation schemes for randomly sampling colorings
(Universitat Politècnica de Catalunya, 201910)
Master thesis
Open AccessGraph colouring is arguably one of the most important issues in Graph Theory. However, many of the questions that arise in the area such as the chromatic number problem or counting the number of proper colorings of a graph ... 
Arcs and tensors
(20190801)
Article
Open AccessTo an arc A of PG(k1,q) of size q+k1t we associate a tensor in ¿¿k,t(A)¿¿k1 , where ¿k,t denotes the Veronese map of degree t defined on PG(k1,q) . As a corollary we prove that for each arc A in PG(k1,q) of size ... 
Bijections for Baxter families and related objects
(201104)
Article
Open AccessThe Baxter number can be written as $B_n = \sum_0^n \Theta_{k,nk1}$. These numbers have first appeared in the enumeration of socalled Baxter permutations; $B_n$ is the number of Baxter permutations of size $n$, and ... 
Binary labelings for plane quadrangulations and their relatives
(2010)
Article
Open AccessMotivated 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 ... 
cCritical graphs with maximum degree three
(John Wiley and Sons, Inc., 1995)
Part of book or chapter of book
Restricted access  publisher's policyLet $G$ be a (simple) gtoph with maximum degree three and chromatic index four. A 3edgecoloring of G is a coloring of its edges in which only three colors are used. Then a vertex is conflicting when some edges incident ...