Related papers: Max filtering with reflection groups

The group of combinatorial self-similarities of a pseudometric space $(X, d)$ is the maximal subgroup of the symmetric group $\mathbf{Sym} (X)$ whose elements preserve the four-point equality $d(x,y)=d(u,v)$. Let us denote by $\mathcal{IP}$…

We present two algorithms for large-scale low-rank Euclidean distance matrix completion problems, based on semidefinite optimization. Our first method works by relating cliques in the graph of the known distances to faces of the positive…

This paper proposes a variant of the method of Gu\'edon and Verhynin for estimating the cluster matrix in the Mixture of Gaussians framework via Semi-Definite Programming. A clustering oriented embedding is deduced from this estimate. The…

Let Q be a Dynkin quiver of type A. The bounded derived category of the path algebra of Q has an autoequivalence given by the composition of the Auslander-Reiten translate and the square of the shift functor. We classify the maximal rigid…

We consider immersions admitting uniform representations as an L-Lipschitz graph. In codimension 1, we show compactness for such immersions for arbitrary fixed finite L and uniformly bounded volume. The same result is shown in arbitrary…

From optimal transport to robust dimensionality reduction, a plethora of machine learning applications can be cast into the min-max optimization problems over Riemannian manifolds. Though many min-max algorithms have been analyzed in the…

We propose an approach for capturing the signal variability in hyperspectral imagery using the framework of the Grassmann manifold. Labeled points from each class are sampled and used to form abstract points on the Grassmannian. The…

Graph embedding is a powerful method in parallel computing that maps a guest network $G$ into a host network $H$. The performance of an embedding can be evaluated by certain parameters, such as the dilation, the edge congestion and the…

We study and classify a class of representations (called generalized geometric representations) of a Coxeter group of finite rank. These representations can be viewed as a natural generalization of the geometric representation. The…

We give lower bound estimates for the macroscopic scale of coarse differentiability of Lipschitz maps from a Carnot group with the Carnot-Carath\'{e}odory metric $(G,\dcc)$ to a few different classes of metric spaces. Using this result, we…

We consider the action of a real reductive group G on a Kaehler manifold Z which is the restriction of a holomorphic action of the complexified group G^C. We assume that the induced action of a compatible maximal compact subgroup U of G^C…

In this paper, we study a number of well-known combinatorial optimization problems that fit in the following paradigm: the input is a collection of (potentially inconsistent) local relationships between the elements of a ground set (e.g.,…

Let $p:S\to S_g$ be a finite $G$-covering of a closed surface of genus $g\geq 1$ and let $B$ its branch locus. To this data, it is associated a representation of a finite index subgroup of the mapping class group…

If B is an infinite subset of omega and X is a topological group, let C^X_B be the set of all x in X such that <x^n : n in B> converges to 1. If F is a filter of infinite sets, let D^X_F be the union of all the C^X_B for B in F. The C^X_B…

The notion of a glider representation of a chain of normal subgroups of a group is defined by a new structure, i.e. a fragment for a suitable filtration on the group ring. This is a special case of general glider representations defined for…

We investigate rational $G$-modules $M$ for a linear algebraic group $G$ over an algebraically closed field $k$ of characteristic $p > 0$ using filtrations by sub-coalgebras of the coordinate algebra $k[G]$ of $G$. Even in the special case…

We introduce and study the notion of an outer bi-Lipschitz extension of a map between Euclidean spaces. The notion is a natural analogue of the notion of a Lipschitz extension of a Lipschitz map. We show that for every map $f$ there exists…

In recent years, several algorithms, which approximate matrix decomposition, have been developed. These algorithms are based on metric conservation features for linear spaces of random projection types. We show that an i.i.d sub-Gaussian…

Submodular functions and their optimization have found applications in diverse settings ranging from machine learning and data mining to game theory and economics. In this work, we consider the constrained maximization of a submodular…

We say that a finite metric space $X$ can be embedded almost isometrically into a class of metric spaces $C$, if for every $\epsilon > 0$ there exists an embedding of $X$ into one of the elements of $C$ with the bi-Lipschitz distortion less…