807 research outputs found
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 of , we study the number of points of needed to guarantee the
existence of an -partition of the points such that the intersection of the
convex hulls of the parts contains at least points of . 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
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
Helly numbers of Algebraic Subsets of
We study -convex sets, which are the geometric objects obtained as the
intersection of the usual convex sets in with a proper subset
. We contribute new results about their -Helly
numbers. We extend prior work for , , and ; we give sharp bounds on the -Helly numbers in
several new cases. We considered the situation for low-dimensional and for
sets that have some algebraic structure, in particular when is an
arbitrary subgroup of or when 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
Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of -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 convex constraints which is a relaxation of the
original. Calafiore and Campi provided an explicit estimate on the size 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 .
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 of . The key elements are
generalizations of Helly's theorem where the convex sets are required to
intersect . The size of samples in both algorithms will
be directly determined by the -Helly numbers.
Motivated by the first half of the paper, for any subset , we introduce the notion of an -optimization problem, where the
variables take on values over . It generalizes continuous, integer, and
mixed-integer optimization. We illustrate with examples the expressive power of
-optimization to capture sophisticated combinatorial optimization problems
with difficult modular constraints. We reinforce the evidence that
-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
.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
Coupling between static friction force and torque for a tripod
If a body is resting on a flat surface, the maximal static friction force
before motion sets in is reduced if an external torque is also applied. The
coupling between the static friction force and static friction torque is
nontrivial as our studies for a tripod lying on horizontal flat surface show.
In this article we report on a series of experiments we performed on a tripod
and compare these with analytical and numerical solutions. It turns out that
the coupling between force and torque reveals information about the microscopic
properties at the onset to sliding.Comment: 7 pages, 4 figures, revte
Coupling between static friction force and torque
We show that the static friction force which must be overcome to render a
sticking contact sliding is reduced if an external torque is also exerted. As a
test system we study a planar disk lying on horizontal flat surface. We perform
experiments and compare with analytical results to find that the coupling
between static friction force and torque is nontrivial: It is not determined by
the Coulomb friction laws alone, instead it depends on the microscopic details
of friction. Hence, we conclude that the macroscopic experiment presented here
reveals details about the microscopic processes lying behind friction.Comment: 6 pages, 4 figures, revte
Quantitative Combinatorial Geometry for Continuous Parameters
We prove variations of Carathéodory’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ász’s colorful Helly’s theorem, Bárány’s colorful Carathéodory’s theorem, and the colorful Tverberg’s theorem
- …