oalib

Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99

Submit

Any time

2019 ( 268 )

2018 ( 336 )

2017 ( 351 )

2016 ( 541 )

Custom range...

Search Results: 1 - 10 of 205762 matches for " Pablo Soberón "
All listed articles are free for downloading (OA Articles)
Page 1 /205762
Display every page Item
Balanced Convex Partitions of Measures in $\mathbb{R}^d$
Pablo Soberón
Mathematics , 2010, DOI: 10.1112/S0025579311001914
Abstract: We will prove the following generalization of the ham sandwich Theorem, conjectured by Imre B\'ar\'any. Given a positive integer $k$ and $d$ nice measures $\mu_1, \mu_2,..., \mu_d$ in $\mathbb{R}^d$ such that $\mu_i (\mathds{R}^d) = k$ for all $i$, there is a partition of $\mathbb{R}^d$ in $k$ interior-disjoint convex parts $C_1, C_2,..., C_k$ such that $\mu_i (C_j) = 1$ for all $i,j$. If $k=2$ this gives the ham sandwich Theorem.
Helly-type theorems for the diameter
Pablo Soberón
Mathematics , 2015,
Abstract: We study versions of Helly's theorem that guarantee that the intersection of a family of convex sets in $R^d$ has a large diameter. This includes colourful, fractional and $(p,q)$ versions of Helly's theorem. In particular, the fractional and $(p,q)$ versions work with conditions where the corresponding Helly theorem does not. We also include variants of Tverberg's theorem, B\'ar\'any's point selection theorem and the existence of weak epsilon-nets for convex sets with diameter estimates.
Equal coefficients and tolerance in coloured Tverberg partitions
Pablo Soberón
Mathematics , 2012,
Abstract: The coloured Tverberg theorem was conjectured by B\'ar\'any, Lov\'{a}sz and F\"uredi and asks whether for any d+1 sets (considered as colour classes) of k points each in R^d there is a partition of them into k colourful sets whose convex hulls intersect. This is known when d=1,2 or k+1 is prime. In this paper we show that (k-1)d+1 colour classes are necessary and sufficient if the coefficients in the convex combination in the colourful sets are required to be the same in each class. We also examine what happens if we want the convex hulls of the colourful sets to intersect even if we remove any r of the colour classes. Namely, if we have (r+1)(k-1)d+1 colour classes of k point each, there is a partition of them into k colourful sets such that they intersect using the same coefficients regardless of which r colour classes are removed. We also investigate the relation of the case k=2 and the Gale transform, obtaining a variation of the coloured Radon theorem.
Computing the partition function for graph homomorphisms with multiplicities
Alexander Barvinok,Pablo Soberón
Mathematics , 2014,
Abstract: We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions for independent sets, perfect matchings, Hamiltonian cycles and dense subgraphs in graphs as well as for graph colorings. This allows us to tell apart in quasi-polynomial time graphs that are sufficiently far from having a structure of a given type (i.e., independent set of a given size, Hamiltonian cycle, etc.) from graphs that have sufficiently many structures of that type, even when the probability to hit such a structure at random is exponentially small.
Computing the partition function for graph homomorphisms
Alexander Barvinok,Pablo Soberón
Mathematics , 2014,
Abstract: We introduce the partition function of edge-colored graph homomorphisms, of which the usual partition function of graph homomorphisms is a specialization, and present an efficient algorithm to approximate it in a certain domain. Corollaries include efficient algorithms for computing weighted sums approximating the number of k-colorings and the number of independent sets in a graph, as well as an efficient procedure to distinguish pairs of edge-colored graphs with many color-preserving homomorphisms G --> H from pairs of graphs that need to be substantially modified to acquire a color-preserving homomorphism G --> H.
Quantitative $(p,q)$ theorems in combinatorial geometry
David Rolnick,Pablo Soberón
Mathematics , 2015,
Abstract: We show quantitative versions of classic results in discrete geometry, where the size of a convex set is determined by some non-negative function. We give versions of this kind for the selection theorem of B\'ar\'any, the existence of weak epsilon-nets for convex sets and the $(p,q)$ theorem of Alon and Kleitman. These methods can be applied to functions such as the volume, surface area or number of points of a discrete set. We also give general quantitative versions of the colorful Helly theorem for continuous functions.
Positive-fraction intersection results and variations of weak epsilon-nets
Alexander Magazinov,Pablo Soberón
Mathematics , 2015,
Abstract: Given a finite set $X$ of points in $R^n$ and a family $F$ of sets generated by the pairs of points of $X$, we explore conditions for the sets that allow us to guarantee the existence of a positive-fraction subfamily $F'$ of $F$ for which the sets have non-empty intersection. This allows us to show the existence of weak epsilon-nets for these families. We also prove a topological variation of weak epsilon-nets for convex sets.
Measure Partitions Using Hyperplanes with Fixed Directions
Roman Karasev,Edgardo Roldán-Pensado,Pablo Soberón
Mathematics , 2014,
Abstract: We study nested partitions of $R^d$ obtained by successive cuts using hyperplanes with fixed directions. We establish the number of measures that can be split evenly simultaneously by taking a partition of this kind and then distributing the parts among $k$ sets. This generalises classical necklace splitting results and their more recent high-dimensional versions. With similar methods we show that in the plane, for any $t$ measures there is a path formed only by horizontal and vertical segments using at most $t-1$ turns that splits them by half simultaneously, and optimal mass-partitioning results for chessboard-colourings of $R^d$ using hyperplanes with fixed directions.
An extension of a theorem by Yao & Yao
Edgardo Roldán-Pensado,Pablo Soberón
Mathematics , 2011,
Abstract: In this paper we study $N_d(k)$ the smallest positive integer such that any nice measure $\mu$ in $\R^d$ can be partitioned in $N_d(k)$ parts of equal measure so that every hyperplane avoids at least $k$ of them. A theorem of Yao and Yao \cite{YY1985} states that $N_d(1) \le 2^d$. Among other results, we obtain the bounds $N_d(2) \le 3 \cdot 2^{d-1}$ and $N_d(1) \ge C \cdot 2^{d/2}$ for some constant $C$. We then apply these results to a problem on the separation of points and hyperplanes.
Helly's Theorem: New Variations and Applications
Nina Amenta,Jesús A. De Loera,Pablo Soberón
Mathematics , 2015,
Abstract: This survey presents recent Helly-type geometric theorems published since the appearance of the last comprehensive survey, more than ten years ago. We discuss how such theorems continue to be influential in computational geometry and in optimization.
Page 1 /205762
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.