Quantitative combinatorial geometry for continuous parameters

We prove variations of Carath\'eodory's, Helly's and Tverberg's theorems where the sets involved are measured according to continuous functions such as the volume or diameter. Among our results, we present continuous quantitative versions of Lov\'asz's colorful Helly theorem, B\'ar\'any's colorful Carath\'eodory's theorem, and the colorful Tverberg theorem.Comment: 22 pages. arXiv admin note: substantial text overlap with arXiv:1503.0611

Quantitative Tverberg, Helly, & Carath\'eodory theorems

This paper presents sixteen quantitative versions of the classic Tverberg, Helly, & Caratheodory theorems in combinatorial convexity. Our results include measurable or enumerable information in the hypothesis and the conclusion. Typical measurements include the volume, the diameter, or the number of points in a lattice.Comment: 33 page

Space Representation of Stochastic Processes with Delay

We show that a time series $x_t$ evolving by a non-local update rule $x_t = f (x_{t-n},x_{t-k})$ with two different delays $k<n$ can be mapped onto a local process in two dimensions with special time-delayed boundary conditions provided that $n$ and $k$ are coprime. For certain stochastic update rules exhibiting a non-equilibrium phase transition this mapping implies that the critical behavior does not depend on the short delay $k$. In these cases, the autocorrelation function of the time series is related to the critical properties of directed percolation.Comment: 6 pages, 8 figure

Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of SS-optimization

The scenario approach developed by Calafiore and Campi to attack chance-constrained convex programs utilizes random sampling on the uncertainty parameter to substitute the original problem with a representative continuous convex optimization with $N$ convex constraints which is a relaxation of the original. Calafiore and Campi provided an explicit estimate on the size $N$ of the sampling relaxation to yield high-likelihood feasible solutions of the chance-constrained problem. They measured the probability of the original constraints to be violated by the random optimal solution from the relaxation of size $N$. This paper has two main contributions. First, we present a generalization of the Calafiore-Campi results to both integer and mixed-integer variables. In fact, we demonstrate that their sampling estimates work naturally for variables restricted to some subset $S$ of $\mathbb R^d$. The key elements are generalizations of Helly's theorem where the convex sets are required to intersect $S \subset \mathbb R^d$. The size of samples in both algorithms will be directly determined by the $S$-Helly numbers. Motivated by the first half of the paper, for any subset $S \subset \mathbb R^d$, we introduce the notion of an $S$-optimization problem, where the variables take on values over $S$. It generalizes continuous, integer, and mixed-integer optimization. We illustrate with examples the expressive power of $S$-optimization to capture sophisticated combinatorial optimization problems with difficult modular constraints. We reinforce the evidence that $S$-optimization is "the right concept" by showing that the well-known randomized sampling algorithm of K. Clarkson for low-dimensional convex optimization problems can be extended to work with variables taking values over $S$.Comment: 16 pages, 0 figures. This paper has been revised and split into two parts. This version is the second part of the original paper. The first part of the original paper is arXiv:1508.02380 (the original article contained 24 pages, 3 figures

Helly numbers of Algebraic Subsets of Rd\mathbb R^d

We study $S$-convex sets, which are the geometric objects obtained as the intersection of the usual convex sets in $\mathbb R^d$ with a proper subset $S\subset \mathbb R^d$. We contribute new results about their $S$-Helly numbers. We extend prior work for $S=\mathbb R^d$, $\mathbb Z^d$, and $\mathbb Z^{d-k}\times\mathbb R^k$; we give sharp bounds on the $S$-Helly numbers in several new cases. We considered the situation for low-dimensional $S$ and for sets $S$ that have some algebraic structure, in particular when $S$ is an arbitrary subgroup of $\mathbb R^d$ or when $S$ is the difference between a lattice and some of its sublattices. By abstracting the ingredients of Lov\'asz method we obtain colorful versions of many monochromatic Helly-type results, including several colorful versions of our own results.Comment: 13 pages, 3 figures. This paper is a revised version of what was originally the first half of arXiv:1504.00076v

Dynamic wetting with two competing adsorbates

We study the dynamic properties of a model for wetting with two competing adsorbates on a planar substrate. The two species of particles have identical properties and repel each other. Starting with a flat interface one observes the formation of homogeneous droplets of the respective type separated by nonwet regions where the interface remains pinned. The wet phase is characterized by slow coarsening of competing droplets. Moreover, in 2+1 dimensions an additional line of continuous phase transition emerges in the bound phase, which separates an unordered phase from an ordered one. The symmetry under interchange of the particle types is spontaneously broken in this region and finite systems exhibit two metastable states, each dominated by one of the species. The critical properties of this transition are analyzed by numeric simulations.Comment: 11 pages, 12 figures, final version published in PR

Maximal Localisation in the Presence of Minimal Uncertainties in Positions and Momenta

Small corrections to the uncertainty relations, with effects in the ultraviolet and/or infrared, have been discussed in the context of string theory and quantum gravity. Such corrections lead to small but finite minimal uncertainties in position and/or momentum measurements. It has been shown that these effects could indeed provide natural cutoffs in quantum field theory. The corresponding underlying quantum theoretical framework includes small `noncommutative geometric' corrections to the canonical commutation relations. In order to study the full implications on the concept of locality it is crucial to find the physical states of then maximal localisation. These states and their properties have been calculated for the case with minimal uncertainties in positions only. Here we extend this treatment, though still in one dimension, to the general situation with minimal uncertainties both in positions and in momenta.Comment: Latex, 21 pages, 2 postscript figure

Quantitative Tverberg theorems over lattices and other discrete sets

This paper presents a new variation of Tverberg's theorem. Given a discrete set $S$ of $R^d$, we study the number of points of $S$ needed to guarantee the existence of an $m$-partition of the points such that the intersection of the $m$ convex hulls of the parts contains at least $k$ points of $S$. The proofs of the main results require new quantitative versions of Helly's and Carath\'eodory's theorems.Comment: 16 pages. arXiv admin note: substantial text overlap with arXiv:1503.0611

Entanglement versus mutual information in quantum spin chains

The quantum entanglement $E$ of a bipartite quantum Ising chain is compared with the mutual information $I$ between the two parts after a local measurement of the classical spin configuration. As the model is conformally invariant, the entanglement measured in its ground state at the critical point is known to obey a certain scaling form. Surprisingly, the mutual information of classical spin configurations is found to obey the same scaling form, although with a different prefactor. Moreover, we find that mutual information and the entanglement obey the inequality $I\leq E$ in the ground state as well as in a dynamically evolving situation. This inequality holds for general bipartite systems in a pure state and can be proven using similar techniques as for Holevo's bound.Comment: 10 pages, 3 figure