相关论文: A probabilistic algorithm for the secant defect of…

Let $X\subset \mathbb{P}^r$ be an integral and non-degenerate variety. Set $n:= \dim (X)$. We prove that if the $(k+n-1)$-secant variety of $X$ has (the expected) dimension $(k+n-1)(n+1)-1<r$ and $X$ is not uniruled by lines, then $X$ is…

We develop an accelerated gradient descent algorithm on the Grassmann manifold to compute the subspace spanned by a number of leading eigenvectors of a symmetric positive semi-definite matrix. This has a constant cost per iteration and a…

The new identifiable case appeared in \cite{AGMO}, together with the analysis on simultaneous identifiability of pairs of ternary forms recently developed in \cite{BG}, suggested the following conjecture towards a complete classification of…

We introduce a family of proximal discontinuous Galerkin methods for variational inequalities, focusing on the obstacle problem as a didactic example. Each member of this family is born from applying a different well-known nonconforming…

This paper studies the defectivity of secant varieties of Segre varieties. We prove that there exists an asymptotic lower estimate for the greater non-defective secant variety (without filling the ambient space) of any given Segre variety.…

In this paper we prove, using a refinement of Terracini's Lemma, a sharp lower bound for the degree of (higher) secant varieties to a given projective variety, which extends the well known lower bound for the degree of a variety in terms of…

We prove that Schubert varieties in potentially different Grassmannians are isomorphic as varieties if and only if their corresponding Young diagrams are identical up to a transposition. We also discuss a generalization of this result to…

We prove (with a mild restriction on the multidegrees) that all secant varieties of Segre-Veronese varieties with $k>2$ factors, $k-2$ of them being $\mathbb{P}^1$, have the expected dimension. This is equivalent to compute the dimension of…

The syndrome decoding problem has been proposed as a computational hardness assumption for code based cryptosystem that are safe against quantum computing. The problem has been reduced to finding the codeword with the smallest non-zero…

Gaussian mixture models (GMMs) are ubiquitous in statistical learning, particularly for unsupervised problems. While full GMMs suffer from the overparameterization of their covariance matrices in high-dimensional spaces, spherical GMMs…

The Green-Lazarsfeld Secant Conjecture is a generalization of Green's Conjecture on syzygies of canonical curves to the cases of arbitrary line bundles. We establish the Green-Lazarsfeld Secant Conjecture for curves of genus g in all the…

In this paper, we develop an adaptive Generalized Multiscale Discontinuous Galerkin Method (GMs-DGM) for a class of high-contrast flow problems, and derive a-priori and a-posteriori error estimates for the method. Based on the a-posteriori…

We consider the problem of flexible modeling of higher order hidden Markov models when the number of latent states and the nature of the serial dependence, including the true order, are unknown. We propose Bayesian nonparametric methodology…

Let $X^{(n,m)}_{(1,d)}$ denote the Segre-Veronese embedding of $\mathbb{P}^n \times \mathbb{P}^m$ via the sections of the sheaf $\mathcal{O}(1,d)$. We study the dimensions of higher secant varieties of $X^{(n,m)}_{(1,d)}$ and we prove that…

We construct a divided difference operator using GKM theory. This generalizes the classical divided difference operator for the cohomology of the complete flag variety. This construction proves a special case of a recent conjecture of…

Grebinski and Kucherov (1998) and Alon et al. (2004-2005) study the problem of learning a hidden graph for some especial cases, such as hamiltonian cycle, cliques, stars, and matchings. This problem is motivated by problems in chemical…

We obtain a combinatorial expression for the coefficients of the boundary map of real isotropic and odd orthogonal Grassmannians providing a natural generalization of the formulas already obtained for Lagrangian and maximal isotropic…

We compute the equation of the 7-secant variety to the Veronese variety (P^4,O(3)), its degree is 15. This is the last missing invariant in the Alexander-Hirschowitz classification. It gives the condition to express a homogeneous cubic…

The cage problem concerns finding $(k,g)$-graphs, which are $k$-regular graphs with girth $g$, of the smallest possible number of vertices. The central goal is to determine $n(k,g)$, the minimum order of such a graph, and to identify…

We propose a new algorithm for tensor decomposition, based on Jennrich's algorithm, and apply our new algorithmic ideas to blind deconvolution and Gaussian mixture models. Our first contribution is a simple and efficient algorithm to…