Related papers: How Fast Can You Escape a Compact Polytope?
We present a master equation approach to the \emph{narrow escape time} (NET) problem, i.e. the time needed for a particle contained in a confining domain with a single narrow opening, to exit the domain for the first time. We introduce a…
We construct a tractable model to describe the rate at which a knotted polymer is ejected from a spherical capsid via a small pore. Knots are too large to fit through the pore and must reptate to the end of the polymer for ejection to…
In this short note, we propose a new and short approach to polynomial escape rates, which can be applied to various open systems with intermittency. The tool of our approach is the maximal large deviations developed in \cite{mldp}.
The Periodic Event Scheduling Problem (PESP) is the central mathematical tool for periodic timetable optimization in public transport. PESP can be formulated in several ways as a mixed-integer linear program with typically general integer…
In this paper we investigate the intrinsic sequential time complexity of universal elimination procedures for arbitrary continuous data structures encoding input and output objects of elimination theory (i.e. polynomial equation systems)…
We study the computational complexity of determining the Hausdorff distance of two polytopes given in halfspace- or vertex-presentation in arbitrary dimension. Subsequently, a matching problem is investigated where a convex body is allowed…
The Sequential Multiple Knapsack Problem is a special case of Multiple knapsack problem in which the items sizes are divisible. A characterization of the optimal solutions of the problem and a description of the convex hull of all the…
We derive rigorously the short-time escape probability of a quantum particle from its compactly supported initial state, which has a discontinuous derivative at the boundary of the support. We show that this probability is liner in time,…
We introduce the class of constant probability (CP) programs and show that classical results from probability theory directly yield a simple decision procedure for (positive) almost sure termination of programs in this class. Moreover,…
The combinatorial diameter of a polytope $P$ is the maximum value of a shortest path between two vertices of $P$, where the path uses the edges of $P$ only. In contrast to the combinatorial diameter, the circuit diameter of $P$ is defined…
The evasion paths problem asks when a dynamically changing space can be navigated: imagine guards are patrolling a region, for instance, and we need to stay outside their view. We use the Bousfield-Kan spectral sequence for homotopy inverse…
A conservative class of constraint satisfaction problems CSPs is a class for which membership is preserved under arbitrary domain reductions. Many well-known tractable classes of CSPs are conservative. It is well known that lexleader…
In our paper, we consider the following general problems: check feasibility, count the number of feasible solutions, find an optimal solution, and count the number of optimal solutions in $P \cap Z^n$, assuming that $P$ is a polyhedron,…
Motivated by the problem of bounding the number of iterations of the Simplex algorithm we investigate the possible lengths of monotone paths followed by the Simplex method inside the oriented graphs of polyhedra (oriented by the objective…
We study a catching-up algorithm for a class of differential inclusions driven by maximal monotone operators with continuous perturbations. Using a decomposition of the monotone operator into the closed convex hull of its single-valued part…
The relaxed maximum entropy problem is concerned with finding a probability distribution on a finite set that minimizes the relative entropy to a given prior distribution, while satisfying relaxed max-norm constraints with respect to a…
We consider a dynamical system given by an area-preserving map on a two-dimensional phase plane and consider a one-dimensional line of initial conditions within this plane. We record the number of iterates it takes a trajectory to escape…
The Continuous p-Dispersion Problem (CpDP) with boundary constraints asks for the placement of a fixed number of points in a compact subset of Euclidean space such that the minimum distance between any two points, as well as the points and…
We develop a new numerical method for approximating the infinite time reachable set of strictly stable linear control systems. By solving a linear program with a constraint that incorporates the system dynamics, we compute a polytope with…
We close three open problems in the separation complexity of valid inequalities for the knapsack polytope. Specifically, we establish that the separation problems for extended cover inequalities, (1,k)-configuration inequalities, and weight…