Related papers: From linear programming to colliding particles
This is a study of localised structures in one-dimensional cellular automata, with the elementary cellular automaton Rule 54 as a guiding example. A formalism for particles on a periodic background is derived, applicable to all…
A common feature of wall-bounded turbulent particle-laden flows is enhanced particle concentrations in a thin layer near the wall due to a phenomenon known as turbophoresis. Even at relatively low bulk volume fractions, particle-particle…
For a linear equality constrained convex optimization problem involving two objective functions with a ``nonsmooth" + ``nonsmooth" composite structure, we study two algorithms derived from a mixed-order dynamical system which incorporates…
Linear optimization problems are investigated whose parameters are uncertain. We apply coherent distortion risk measures to capture the possible violation of a restriction. Each risk constraint induces an uncertainty set of coefficients,…
We present a new optimization-theoretic approach to analyzing Follow-the-Leader style algorithms, particularly in the setting where perturbations are used as a tool for regularization. We show that adding a strongly convex penalty function…
The linearized collision operator of the Boltzmann equation can in a natural way be written as a sum of a positive multiplication operator, the collision frequency, and an integral operator. Compactness of the integral operator for…
We propose a combinatorial method for computing explicit solutions to multi-parametric quadratic programs, which can be used to compute explicit control laws for linear model predictive control. In contrast to classical methods, which are…
We present a combinatorial isomorphism between Stasheff associahedra and an inductive cone construction of those complexes given by Loday. We give an alternate description of certain polytopes, known as multiplihedra, which arise in the…
An assosiahedron $\mathcal{K}^n$, known also as Stasheff polytope, is a multifaceted combinatorial object, which, in particular, can be realized as a convex hull of certain points in $\mathbf{R}^{n}$, forming $(n-1)$-dimensional polytope. A…
Geometric hitting set problems, in which we seek a smallest set of points that collectively hit a given set of ranges, are ubiquitous in computational geometry. Most often, the set is discrete and is given explicitly. We propose new…
In this paper, we propose a $p$-norm rule, which is a generalization of the steepest-edge rule, as a pivoting rule for the simplex method. For a nondegenerate linear programming problem, we show upper bounds for the number of iterations of…
Maximum bipartite matching is a fundamental algorithmic problem which can be solved in polynomial time. We consider a natural variant in which there is a separation constraint: the vertices on one side lie on a path or a grid, and two…
We consider the problem of minimizing a convex function over the intersection of finitely many simple sets which are easy to project onto. This is an important problem arising in various domains such as machine learning. The main difficulty…
The LHC data have unveiled unexpected features in proton-proton (pp) collisions, namely, collective-like behavior and strangeness enhancement. Originally, these new effects were discovered only in high-multiplicity pp collisions. However,…
Every polyhedral cone can be described either by its facets or by its extreme rays. Computation of one description from the other is a problem that can be very complex, i.e. one encounter the combinatorial explosion. We present here several…
Selection rules are often considered a hallmark of symmetry. When a symmetry is broken, e.g., by an external perturbation, the system exhibits selection rule deviations which are often analyzed by perturbation theory. Here, we employ…
We present two results on slime mold computations. In wet-lab experiments (Nature'00) by Nakagaki et al. the slime mold Physarum polycephalum demonstrated its ability to solve shortest path problems. Biologists proposed a mathematical…
The study of the combinatorial diameter of a polyhedron is a classical topic in linear-programming theory due to its close connection with the possibility of a polynomial simplex-method pivot rule. The 2-sum operation is a classical…
We aim at computing the derivative of the solution to a parametric optimization problem with respect to the involved parameters. For a class broader than that of strongly convex functions, this can be achieved by automatic differentiation…
Kinetics of collision processes with linear mixing rules are investigated analytically. The velocity distribution becomes self-similar in the long time limit and the similarity functions have algebraic or stretched exponential tails. The…