Shrawan Kumar
We prove that the orbit closure of the determinant is not normal. A similar result is obtained for the orbit closure of the permanent multiplied by a power of a linear form.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We initiate a study of determinantal representations with symmetry. We show that Grenet's determinantal representation for the permanent is optimal among determinantal representations respecting left multiplication by permutation and diagonal matrices (roughly half the symmetry group of the permanent). In particular, if any optimal determinantal representation of the permanent must be polynomially related to one with such symmetry, then Valiant's conjecture on permanent v. determinant is true.
We show that the product rank of the $3\times 3$ determinant is $5$, and the product rank of the $3\times 3$ permanent is $4$. As a corollary, we obtain that the tensor ranks of the $3 \times 3$ determinant and permanent are $5$ and $4$, respectively. We show moreover that the border product rank of the $n \times n$ permanent is larger than $n$ for any $n\geq 3$.
The method of shifted partial derivatives was used to prove a super-polynomial lower bound on the size of depth four circuits needed to compute the permanent. We show that this method alone cannot prove that the padded permanent $\ell^{n-m} perm_m$ cannot be realized inside the $GL_{n^2}$-orbit closure of the determinant $ det_n$ when $n>2m^2+2m$. Our proof relies on several simple degenerations of the determinant polynomial, Macaulay's theorem that gives a lower bound on the growth of an ideal, and a lower bound estimate from Gupta et. al. regarding the shifted partial derivatives of the dete…
Recursive Koszul flattenings of determinant and permanent tensors
本文递归运用 Koszul 展平方法推导行列式与积和式张量的张量秩新下界，实现两类张量按秩完全分离，并确定四阶情形的精确秩。
Let $D_{m,n}^r$ and $P_{m,n}^r$ denote the subschemes of $\mathbb{P}^{mn-1}$ given by the $r\times r$ determinants (respectively the $r\times r$ permanents) of an $m\times n$ matrix of indeterminates. In this paper, we study the geometry of the Fano schemes $\mathbf{F}_k(D_{m,n}^r)$ and $\mathbf{F}_k(P_{m,n}^r)$ parametrizing the $k$-dimensional planes in $\mathbb{P}^{mn-1}$ lying on $D_{m,n}^r$ and $P_{m,n}^r$, respectively. We prove results characterizing which of these Fano schemes are smooth, irreducible, and connected; and we give examples showing that they need not be reduced. We show th…
Let $d(N )$ (resp. $p(N )$) be the number of summands in the determinant (resp. permanent) of an $N\times N$ circulant matrix $A = (a_{ij} )$ given by $a_{ij} = X_{i+j}$ where $i + j$ should be considered $\mod N$ . This short note is devoted to prove that $d(N ) = p(N )$ if and only if $N$ is a prime power. We then give an application to homogeneous monomial ideals failing the Weak Lefschetz property.
We investigate the space of syzygies of the apolar ideals $\det_n^\perp$ and ${\rm perm}_n^\perp$ of the determinant $\det_n$ and permanent ${\rm perm}_n$ polynomials. Shafiei had proved that these ideals are generated by quadrics and provided a minimal generating set. Extending on her work, in characteristic distinct from two, we prove that the space of relations of $\det_n^{\perp}$ is generated by linear relations and we describe a minimal generating set. The linear relations of ${\rm perm}_n^{\perp}$ do not generate all relations, but we provide a minimal generating set of linear and quadra…
The permanent versus determinant conjecture is a major problem in complexity theory that is equivalent to the separation of the complexity classes VP_{ws} and VNP. Mulmuley and Sohoni (SIAM J. Comput., 2001) suggested to study a strengthened version of this conjecture over the complex numbers that amounts to separating the orbit closures of the determinant and padded permanent polynomials. In that paper it was also proposed to separate these orbit closures by exhibiting occurrence obstructions, which are irreducible representations of GL_{n^2}(C), which occur in one coordinate ring of the orbi…
We show the existence of a large family of representations supported by the orbit closure of the determinant. However, the validity of our result is based on the validity of the celebrated `Latin Square Conjecture' due to Alon-Tarsi or more precisely on the validity of an equivalent `column Latin Square Conjecture' due to Huang-Rota.
The boundary of the orbit of the 3 by 3 determinant polynomial
本研究针对3阶行列式多项式，刻画其经变量线性变换所得多项式集合的极限点，解决了J. M. Landsberg提出的相关问题。
Singularities of orthogonal and symplectic determinantal varieties
本文研究正交与辛行列式簇的奇点，证明辛情形下轨道闭包正规且具有有理奇点，并精确刻画正交情形下的例外情况。
I survey methods from differential geometry, algebraic geometry and representation theory relevant for the permanent v. determinant problem from computer science, an algebraic analog of the P v. NP problem.
We describe noncommutative desingularizations of determinantal varieties, determinantal varieties defined by minors of generic symmetric matrices, and pfaffian varieties defined by pfaffians of generic anti-symmetric matrices. For maximal minors of square matrices and symmetric matrices, this gives a non-commutative crepant resolution. Along the way, we describe a method to calculate the quiver with relations for any non-commutative desingularizations coming from exceptional collections over partial flag varieties.
The goal of this article is to compare the coefficients in the expansion of the permanent with those in the expansion of the determinant of a three-lines circulant matrix. As an application we prove a conjecture concerning the minimality of Galois-Togliatti systems.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。