Related papers: From linear programming to colliding particles
Minijets provide useful information on parton interactions in the low transverse-momentum (low-$p_T$) region. Because minijets produce clusters, we study the clustering properties of produced particles in high-energy $pp$ collisions as a…
In this paper, we present a mixed-integer linear programming (MILP) formulation of a piecewise, polyhedral relaxation (PPR) of a multilinear term using its convex hull representation. Based on the solution of the PPR, we also present a MILP…
We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…
We study finite particle systems on the one-dimensional integer lattice, where each particle performs a continuous-time nearest-neighbour random walk, with jump rates intrinsic to each particle, subject to an exclusion interaction which…
We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of…
The goal of this paper is to design a simplex algorithm for linear programs on lattice polytopes that traces `short' simplex paths from any given vertex to an optimal one. We consider a lattice polytope $P$ contained in $[0,k]^n$ and…
We study mixing times of the symmetric and asymmetric simple exclusion process on the segment where particles are allowed to enter and exit at the endpoints. We consider different regimes depending on the entering and exiting rates as well…
A combinatorial simplex algorithm is an instance of the simplex method in which the pivoting depends on combinatorial data only. We show that any algorithm of this kind admits a tropical analogue which can be used to solve mean payoff…
This work is motivated by two problems: 1) The approach of manifolds and spaces by triangulations. 2) The complexity growth in sequences of polyhedra. Considering both problems as related, new criteria and methods for approximating smooth…
We study a linearly transformed particle method for the aggregation equation with smooth or singular interaction forces. For the smooth interaction forces, we provide convergence estimates in $L^1$ and $L^\infty$ norms depending on the…
A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose vertices are among the vertices of the polytope. Triangulations are dissections that have the additional property that the set of all its simplices…
We investigate some combinatorial properties of convex polytopes simple in edges. For polytopes whose nonsimple vertices are located sufficiently far one from another, we prove an analog of the Hard Lefschetz theorem. It implies Stanley's…
We define a class of probability distributions that we call simplicial mixture models, inspired by simplicial complexes from algebraic topology. The parameters of these distributions represent their topology and we show that it is possible…
Learning arguably involves the discovery and memorization of abstract rules. The aim of this paper is to study associative memory mechanisms. Our model is based on high-dimensional matrices consisting of outer products of embeddings, which…
The motion of a freely rotating prolate spheroid in a simple shear flow of a dilute polymeric solution is examined in the limit of large particle aspect ratio, $\kappa$. A regular perturbation expansion in the polymer concentration, $c$, a…
Pivoting methods are of vital importance for linear programming, the simplex method being the by far most well-known. In this paper, a primal-dual pair of linear programs in canonical form is considered. We show that there exists a sequence…
We survey the main results of approximation theory for adaptive piecewise polynomial functions. In such methods, the partition on which the piecewise polynomial approximation is defined is not fixed in advance, but adapted to the given…
Computational methods for electromagnetic and light scattering can be used for the calculation of optical forces and torques. Since typical particles that are optically trapped or manipulated are on the order of the wavelength in size,…
In [1], two of the present authors along with P. Raman attempted to extend the Amplituhedron program for scalar field theories [2] to quartic scalar interactions. In this paper we develop various aspects of this proposal. Using recent…
In this paper we shall illustrate that each polytopal moment-angle complex can be understood as the intersection of the minima of corresponding Siegel leaves and the unit sphere, with respect to the maximum norm. Consequently, an…