Related papers: Optimal line packings from finite group actions
We consider the integrable family of symmetric boundary-driven interacting particle systems that arise from the non-compact XXX Heisenberg model in one dimension with open boundaries. In contrast to the well-known symmetric exclusion…
The classical fuel-optimal two-impulse rendezvous problem between Keplerian orbits is revisited from a family-based perspective. Conventional approaches often yield isolated optimal solutions whose mutual relationships remain unclear; yet,…
We call a family $\{Y_1,\dots,Y_I\}$ in Euclidean space an equidistance spacing if $\|y_i - y_j\| = 1$ whenever $y_i \in Y_i, y_j \in Y_j$ and $i \neq j$. In other words, choosing a representative from each set produces a complete distance…
We introduce a new class of line arrangements in the projective plane, called nearly supersolvable, and show that any arrangement in this class is either free or nearly free. More precisely, we show that the minimal degree of a Jacobian…
This paper deals with exploiting symmetry for solving linear and integer programming problems. Basic properties of linear representations of finite groups can be used to reduce symmetric linear programming to solving linear programs of…
The desirable properties when constructing collections of subspaces often include the algebraic constraint that the projections onto the subspaces yield a resolution of the identity like the projections onto lines spanned by vectors of an…
We propose a numerical algorithm for computing approximately optimal solutions of the matching for teams problem. Our algorithm is efficient for problems involving large number of agent categories and allows for non-discrete agent type…
We provide new stable linearizability constructions for regular actions of finite groups on homogeneous spaces and low-dimensional quadrics.
We present a toolkit of directed distances between quantile functions. By employing this, we solve some new optimal transport (OT) problems which e.g. considerably flexibilize some prominent OTs expressed through Wasserstein distances.
We develop an optimization framework for identifying ideal Mixed Binary Linear Programs (MBLP) which is linear when using known input data and nonconvex quadratic over parametric input data. These techniques are applied to various…
This paper is a tutorial in a general and explicit procedure to simplify semidefinite programs which are invariant under the action of a symmetry group. The procedure is based on basic notions of representation theory of finite groups. As…
We use the lexicographic order to define a hierarchy of primal and dual bounds on the optimum of a bounded integer program. These bounds are constructed using lex maximal and minimal feasible points taken under different permutations. Their…
This is an overview of Erlangen Programme at Large. Study of objects and properties, which are invariant under a group action, is very fruitful far beyond the traditional geometry. In this paper we demonstrate this on the example of the…
We consider Heisenberg groups equipped with a sub-Finsler metric. Using methods of optimal control theory we prove that in this geometric setting the infinite geodesics are horizontal lines under the assumption that the sub-Finsler metric…
We construct the first examples of finitely presented simple groups of orientation-preserving homeomorphisms of the real line. Our examples are also of type $F_{\infty}$, have infinite geometric dimension, and admit a nontrivial homogeneous…
In this article we give the realization of the Klein's Program for geometrical structures (Riemannian spaces and fiber bundles with connection) with arbitrary variable curvature within the framework of infinite deformed groups. These groups…
The square of a skew-symmetric matrix is a symmetric matrix whose eigenvalues have even multiplicities. When the matrices have rank two, they represent the Grassmannian of lines, and the squaring operation takes Pl\"ucker coordinates to…
Two averaging algorithms are considered which are intended for choosing an optimal plane and an optimal circle approximating a group of points in three-dimensional Euclidean space.
Ensuring fairness in matching algorithms is a key challenge in allocating scarce resources and positions. Focusing on Optimal Transport (OT), we introduce a novel notion of group fairness requiring that the probability of matching two…
We describe the first nearly linear-time approximation algorithms for explicitly given mixed packing/covering linear programs, and for (non-metric) fractional facility location. We also describe the first parallel algorithms requiring only…