Related papers: Tukey reduction among analytic directed orders

We study topological groups $G$ for which the universal minimal $G$-system $M(G)$, or the universal irreducible affine $G$-system $IA(G)$ are tame. We call such groups intrinsically tame and convexly intrinsically tame. These notions are…

We clarify the mathematical structure underlying unitary $t$-designs. These are sets of unitary matrices, evenly distributed in the sense that the average of any $t$-th order polynomial over the design equals the average over the entire…

Tikhonov regularization is one of the most commonly used methods of regularization of ill-posed problems. In the setting of finite element solutions of elliptic partial differential control problems, Tikhonov regularization amounts to…

Solecki has shown that a broad natural class of $G_{\delta}$ ideals of compact sets can be represented through the ideal of nowhere dense subsets of a closed subset of the hyperspace of compact sets. In this note we show that the closed…

We propose a general analytical framework for single-facility continuous location problems under spatial demand uncertainty. In contrast to classical formulations based on discrete or regionally aggregated demands, the proposed model…

We further investigate the weak topology generated by the irreducible unitary representations of a group $G$. A deep result due to Ernest \cite{Ernest1971} and Hughes \cite{Hughes1973} asserts that every weakly compact subset of a locally…

A polyhedral convex set optimization problem is given by a set-valued objective mapping from the $n$-dimensional to the $q$-dimensional Euclidean space whose graph is a convex polyhedron. This problem can be seen as the most elementary…

Matrix-valued optimization tasks, including those involving symmetric positive definite (SPD) matrices, arise in a wide range of applications in machine learning, data science and statistics. Classically, such problems are solved via…

In this paper we provide an approximation \`a la Ambrosio-Tortorelli of some classical minimization problems involving the length of an unknown one-dimensional set, with an additional connectedness constraint, in dimension two. We introduce…

A topological measure on a locally compact space is a set function on open and closed subsets which is finitely additive on the collection of open and compact sets, inner regular on open sets, and outer regular on closed sets. Almost all…

Compactness is one of the most versatile tools in the analysis of nonlinear PDEs and systems. Usually, compactness is established by means of some embedding theorem between functional spaces. Such theorems, in turn, rely on appropriate…

The method of alternating projections (MAP) is a common method for solving feasibility problems. While employed traditionally to subspaces or to convex sets, little was known about the behavior of the MAP in the nonconvex case until 2009,…

The Shapley-Folkman theorem shows that Minkowski averages of uniformly bounded sets tend to be convex when the number of terms in the sum becomes much larger than the ambient dimension. In optimization, Aubin and Ekeland [1976] show that…

The aim of these lecture notes is, after having quickly described various compactifications of the Teichm\"{u}ller space of a compact connected oriented surface minus finitely many points, to give a construction, by the equivariant Gromov…

In many areas of applied mathematics, engineering, and social and natural sciences, decentralization of information is a key aspect determining how to approach a problem. In this review article, we study information structures in a…

Standard sweep algorithms require an order of discrete points in Euclidean space, and rely on the property that, at a given point, all points in the halfspace below come earlier in this order. We are motivated by the problem of…

We consider arrangements of tropical hyperplanes where the apices of the hyperplanes are taken to infinity in certain directions. Such an arrangement defines a decomposition of Euclidean space where a cell is determined by its `type' data,…

Clustering problems are fundamental to unsupervised learning. There is an increased emphasis on fairness in machine learning and AI; one representative notion of fairness is that no single demographic group should be over-represented among…

To sum high energy leading logarithms in a consistent way, one has to impose the strong ordering in both projectile rapidity and dense target rapidity simultaneously, which results in a kinematically improved Balitsky-Kovchegov(BK)…

This paper provides a full geometric development of a new technique called un-reduction, for dealing with dynamics and optimal control problems posed on spaces that are unwieldy for numerical implementation. The technique, which was…