Geometric Tree Graphs of Points in Convex Position (2008)
M. C. Hern, F. Hurtado, A. Marquez, M. Mora, M. Noy, ...
Given a set P of points in the plane, the geometric tree graph of P is de ned as the graph T (P) whose vertices are non-crossing rectilinear spanning trees of P, and where two trees T1 and T2 are...
Ferran Hurtado, Departament Matemática, Aplicada Ii, Carlos Seara, Departament Matemática Aplicada, Saurabh Sethia
In this paper we study the problems of separability of two disjoint point sets in 3D by multiple criteria extending some notions on separability of two disjoint point sets in the plane.
M. Abellanas, D. Matemática Aplicada, F. Hurtado, V. Sacristán, D. Matemàtica, Aplicada Ii, ...
We are given a transportation line where displacements happen at a bigger speed than in the rest of the plane. A shortest time path is a path between two points which takes less or equal time than...
Lattice games are real-valued functions de…ned on a …nite lattice L. The basic players are the nonzero join-irreducible elements of the lattice and the coalitions are its elements. If L is the...
Kovalevskaya, Liapounov, Painleve, Ziglin and the Dierential Galois Theory (2007)
At the light of several recent applications of the dierential Galois theory, in this review I will try make some remarks of some important concepts connected with integrability of complex analytical...
Simple games on closure spaces J.M.Bilbao,E.LebrónandN.Jiménez (2007)
Let N be a …nite set. By a closure space we mean the family of the closed sets of a closure operator on 2 N satisfying the additional condition; =;. A simple game on a closure space L is a function...
Ferran Hurtado, Marc Noy, Aplicada Ii, Jorge Urrutia
this paper is to show that this is indeed the case
M. Abellanas, D. Matemática Aplicada, F. Hurtado, V. Sacristán, D. Matemàtica, Aplicada Ii, ...
We are given a transportation line where displacements happen at a bigger speed than in the rest of the plane. A shortest time path is a path between two points which takes less or equal time than...
on BLOCK ERROR-CORRECTING CODES (2003)
Facultat De, Matemàtiques I Estadística, A Computational Primer, Departament Matemàtica, Aplicada Ii
There is a unique way to teach: to lead the other person through the same experience with which you learned. Óscar Villarroya, cognitive scientist. 1 In this book, the mathematical aspects in our...
Some constrained minimax and maximin location problems (2000)
Ferran Hurtado, Vera Sacristan, Departament Matematica, Aplicada Ii, Godfried Toussaint
In this paper we consider constrained versions of the Euclidean minimax facility location problem. We provide an O(n+m) time algorithm for the problem of constructing the minimum enclosing circle of...
Exponentially Small Estimates for Kam Theorem near an Elliptic Equilibrium Point (1999)
Amadeu Delshams, Pere Gutiérrez, Aplicada Ii
. We give a precise statement of KAM theorem for a Hamiltonian system in a neighborhood of an elliptic equilibrium point. If the frequencies of the elliptic point satisfy a Diophantine condition,...
Characterizing classes defined without equality (1997)
R. Elgueta, Departament Matemàtica, Aplicada Ii
�������� � In this paper we mainly deal with first-order languages without equality and introduce a weak form of equality predicate, the so-called Leibniz equality. This equality is...
Flipping Edges on Triangulations (1996)
F. Hurtado, M. Noy, Aplicada Ii, J. Urrutia
In this paper we study the problem of flipping edges in triangulations of polygons and point sets. We prove that if a polygon Q n has k reflex vertices, then any triangulation of Q n can be...
Bounded-degree graphs have arbitrarily large geometric thickness
David R. Wood, Departament Matemàtica, Aplicada Ii
It is proved that there exist graphs of bounded degree with arbitrarily large queue-number. In particular, for all ∆ ≥ 3 and for all sufficiently large n, there is a simple ∆-regular n-vertex...
Bijections for Baxter Families and Related Objects
Stefan Felsner, Marc Noy, Departament Matemàtica, Aplicada Ii, Éric Fusy, ...
The Baxter number Bn can be written as Bn = � n 0 Θk,n−k−1 with Θk,ℓ = 2 (k + 1) 2 (k + 2)