Related papers: Probabilistic analysis of the Grassmann condition …

The following class of problems arose out of vain attempts to show that the Pascal's triangle adic transformation has trivial spectrum. Partition a set of size $N$ into sets of size $S \equiv S(N)$ (ignoring leftovers). What is the…

If $X \subset \mathbb P^n$ is a reduced subscheme, we say that $X$ admits an unexpected hypersurface of degree $t$ for multiplicity $m$ if the imposition of having multiplicity $m$ at a general point $P$ fails to impose the expected number…

Intrinsic volumes of convex sets are natural geometric quantities that also play important roles in applications, such as linear inverse problems with convex constraints, and constrained statistical inference. It is a well-known fact that,…

Let (M, g) be a pseudo Riemannian manifold. We consider four geometric structures on M compatible with g: two almost complex and two almost product structures satisfying additionally certain integrability conditions. For instance, if r is a…

It is well known that an $m$-dimensional Riemannian manifold can be locally isometrically embedded into the $m+1$-dimensional Euclidean space if and only if there exists a symmetric 2-tensor field satisfying the Gauss and Codazzi equations.…

Semi-Riemannian manifolds that satisfy (homogeneous) linear differential conditions of arbitrary order on the curvature are analyzed. They include, in particular, the spaces with (higher-order) recurrent curvature, (higher-order) symmetric…

The first two authors of this paper asserted in Lemma 4 of "New Farkas-type constraint qualifications in convex infinite programming" (DOI: 10.1051/cocv:2007027) that a given reverse convex inequality is consequence of a given convex system…

Fix any $\lambda\in\mathbb{C}$. We say that a set $S\subseteq\mathbb{C}$ is $\lambda$-$convex$ if, whenever $a$ and $b$ are in $S$, the point $(1-\lambda)a+\lambda b$ is also in $S$. If $S$ is also (topologically) closed, then we say that…

The Gauss-Minkowski correspondence in $\mathbb{R}^2$ states the existence of a homeomorphism between the probability measures $\mu$ on $[0,2\pi]$ such that $\int_0^{2\pi} e^{ix}d\mu(x)=0$ and the compact convex sets (CCS) of the plane with…

A commutative associative algebra A with an identity over the field of real numbers which has a basis, where all elements are invertible, is considered in the work. Moreover, among matrixes consisting of the structure constants of A, there…

Motivated by a constrained minimization problem, it is studied the gradient flows with respect to Hessian Riemannian metrics induced by convex functions of Legendre type. The first result characterizes Hessian Riemannian structures on…

Let \Gamma be a structure with a finite relational signature and a first-order definition in (R;*,+) with parameters from R, that is, a relational structure over the real numbers where all relations are semi-algebraic sets. In this article,…

We present a novel approach to Riemannian interpolation on the Grassmann manifold. Instead of relying on the Riemannian normal coordinates, i.e. the Riemannian exponential and logarithm maps, we approach the interpolation problem with an…

Ill-posed linear inverse problems appear frequently in various signal processing applications. It can be very useful to have theoretical characterizations that quantify the level of ill-posedness for a given inverse problem and the degree…

Connes' non-commutative geometry (NCG) is a generalization of Riemannian geometry that is particularly apt for expressing the standard model of particle physics coupled to Einstein gravity. In a previous paper, we suggested a reformulation…

This paper provides a local convergence analysis of the proximal augmented Lagrangian method (PALM) applied to a class of non-convex conic programming problems. Previous convergence results for PALM typically imposed assumptions such as…

GROUSE (Grassmannian Rank-One Update Subspace Estimation) is an iterative algorithm for identifying a linear subspace of R^n from data consisting of partial observations of random vectors from that subspace. This paper examines local…

We study the random graph G_{n,\lambda/n} conditioned on the event that all vertex degrees lie in some given subset S of the non-negative integers. Subject to a certain hypothesis on S, the empirical distribution of the vertex degrees is…

The problem of recovering the configuration of points from their partial pairwise distances, referred to as the Euclidean Distance Matrix Completion (EDMC) problem, arises in a broad range of applications, including sensor network…

A characterization of the proximal normal cone is obtained and a separation theorem for convex subsets of Riemannian manifolds is established. Moreover, the convexity of the distance function $d_S$ for a convex subset $S$ in the cases where…