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

By using a result from the numerical algebraic geometry package Bertini we show that (up to high numerical accuracy) a specific set of degree 6 and degree 9 polynomials cut out the secant variety $\sigma_{4}(\mathbb{P}^{2}\times \mathbb{P}…

We prove a conjecture stated by Catalisano, Geramita, and Gimigliano in 2002, which claims that the secant varieties of tangential varieties to the $d$th Veronese embedding of the projective $n$-space $\mathbb{P}^n$ have the expected…

In this paper, we generalise several recent results by Archer and Geary on descents in powers of permutations, and confirm all their conjectures. Specifically, for all $k\in\mathbb{Z}^+$, we prove explicit formulas for the expected numbers…

We initiate the study of average intersection theory in real Grassmannians. We define the expected degree $\textrm{edeg} G(k,n)$ of the real Grassmannian $G(k,n)$ as the average number of real $k$-planes meeting nontrivially $k(n-k)$ random…

New classes of modules of equations for secant varieties of Veronese varieties are defined using representation theory and geometry. Some old modules of equations (catalecticant minors) are revisited to determine when they are sufficient to…

We present a derivative-based algorithm for nonlinearly constrained optimization problems that is tolerant of inaccuracies in the data. The algorithm solves a semi-smooth set of nonlinear equations that are equivalent to the first-order…

We give an almost asymptotically sharp bound for the non secant defectiveness and identifiability of Segre-Veronese varieties. We also provide new examples of defective Segre-Veronese varieties.

To each subvariety $X$ in projective $n$-space of codimension $m$ we associate an integer sequence of length $m + 1$ from $1$ to the degree of $X$ recording the maximal cardinalities of finite, reduced intersections of $X$ with linear…

We discuss the problem of determining the complete weight hierarchy of linear error correcting codes associated to Grassmann varieties and, more generally, to Schubert varieties in Grassmannians. The problem is partially solved in the case…

This is a survey primarily about determining the border rank of tensors, especially those relevant for the study of the complexity of matrix multiplication. This is a subject that on the one hand is of great significance in theoretical…

We show that the parameters of a $k$-mixture of inverse Gaussian or gamma distributions are algebraically identifiable from the first $3k-1$ moments, and rationally identifiable from the first $3k+2$ moments. Our proofs are based on…

The iterated Johnson bound is the best known upper bound on a size of an error-correcting code in the Grassmannian $\mathcal{G}_q(n,k)$. The iterated Sch\"{o}nheim bound is the best known lower bound on the size of a covering code in…

We propose a weak Galerkin(WG) finite element method for solving the one-dimensional Burgers' equation. Based on a new weak variational form, both semi-discrete and fully-discrete WG finite element schemes are established and analyzed. We…

We formulate the Secant Conjecture, which is a generalization of the Shapiro Conjecture for Grassmannians. It asserts that an intersection of Schubert varieties in a Grassmannian is transverse with all points real, if the flags defining the…

Subspace learning and matrix factorization problems have great many applications in science and engineering, and efficient algorithms are critical as dataset sizes continue to grow. Many relevant problem formulations are non-convex, and in…

Let X be the random variable that counts the number of triangles in the random graph G(n,p). We show that for some absolute constant c, the probability that X deviates from its expectation by at least \lambda \var(X)^{1/2} is at most…

We introduce an inductive method for the study of the uniqueness of decompositions of tensors, by means of tensors of rank 1. The method is based on the geometric notion of weak defectivity. For three-dimensional tensors of type (a, b, c),…

The main computational challenge in Bayesian inference is to compute integrals against a high-dimensional posterior distribution. In the past decades, variational inference (VI) has emerged as a tractable approximation to these integrals,…

We classify complex projective varieties of dimension $2r \geq 8$ swept out by a family of codimension two grassmannians of lines $\mathbb{G}(1,r)$. They are either fibrations onto normal surfaces such that the general fibers are isomorphic…

We study the secant varieties of the Veronese varieties and of Veronese reembeddings of a smooth projective variety. We give some conditions, under which these secant varieties are set-theoretically cut out by determinantal equations. More…