Related papers: From linear programming to colliding particles
This paper introduces a new method to solve the problem of the approximation of the diagonal for face-coherent families of polytopes. We recover the classical cases of the simplices and the cubes and we solve it for the associahedra, also…
To solve a linear program, the simplex method follows a path in the graph of a polytope, on which a linear function increases. The length of this path is an key measure of the complexity of the simplex method. Numerous previous articles…
Multilevel self-assembly involving small structured groups of nano-particles provides new routes to development of functional materials with a sophisticated architecture. Apart from the inter-particle forces, the geometrical shapes and…
Stochastic dynamic matching problems have recently gained attention in the stochastic-modeling community due to their diverse applications, such as supply-chain management and kidney exchange programs. In this paper, we study a matching…
Consider a collection of particles interacting through an attractive-repulsive potential given as a difference of power laws and normalized so that its unique minimum occurs at unit separation. For a range of exponents corresponding to mild…
We address combinatorial problems that can be formulated as minimization of a partially separable function of discrete variables (energy minimization in graphical models, weighted constraint satisfaction, pseudo-Boolean optimization, 0-1…
We study the dynamics of three particles in a finite interval, in which two light particles are separated by a heavy ``piston'', with elastic collisions between particles but inelastic collisions between the light particles and the interval…
Abstract polymer models are systems of weighted objects, called polymers, equipped with an incompatibility relation. An important quantity associated with such models is the partition function, which is the weighted sum over all sets of…
We show that the shadow vertex simplex algorithm can be used to solve linear programs in strongly polynomial time with respect to the number $n$ of variables, the number $m$ of constraints, and $1/\delta$, where $\delta$ is a parameter that…
Soft particles such as microgels and core-shell particles can undergo significant and anisotropic deformations when adsorbed to a liquid interface. This, in turn, leads to a complex phase behavior upon compression. Here we develop a…
In this paper, we analyze the simplex method with the largest distance rule and derive upper bounds on the number of different basic feasible solutions generated. The pivoting rule was proposed by Pan [10], and in some cases, it was…
The concept of representing a polytope that is associated with some combinatorial optimization problem as a linear projection of a higher-dimensional polyhedron has recently received increasing attention. In this paper (written for the…
We introduce a simple dynamical rule in which each particle locates a particle that is farthest from it and moves towards it. Repeated application of this algorithm results in the formation of unusual dynamical patterns: during the process…
We investigate the combinatorics of max-pooling layers, which are functions that downsample input arrays by taking the maximum over shifted windows of input coordinates, and which are commonly used in convolutional neural networks. We…
We use a new approach to derive dielectric mixing rules for macroscopically homogeneous and isotropic multicomponent mixtures of anisotropic inhomogeneous dielectric particles. Two factors of anisotropy are taken into account, the shape of…
Scaffold proteins organize cellular processes by bringing signaling molecules into interaction, sometimes by forming large signalosomes. Several of these scaffolds are known to polymerize. Their assemblies should therefore not be understood…
An $S$-hypersimplex for $S \subseteq \{0,1, \dots,d\}$ is the convex hull of all $0/1$-vectors of length $d$ with coordinate sum in $S$. These polytopes generalize the classical hypersimplices as well as cubes, crosspolytopes, and…
Systems of equations are invariant under "polydimensional transformations" which reshuffle the geometry such that what is a line or a plane is dependent upon the frame of reference. This leads us to propose an extension of Clifford calculus…
This is a survey on algorithmic questions about combinatorial and geometric properties of convex polytopes. We give a list of 35 problems; for each the current state of knowledege on its theoretical complexity status is reported. The…
We explore some connections between association schemes and the analyses of the semidefinite programming (SDP) based convex relaxations of combinatorial optimization problems in the Lov\'{a}sz--Schrijver lift-and-project hierarchy. Our…