中文
相关论文

相关论文: The asymptotic leading term for maximum rank of te…

200 篇论文

We exhibit, for each even degree, a ternary form of rank strictly greater than the maximum rank of monomials. Together with an earlier result in the odd case, this gives the lower bound…

代数几何 · 数学 2017-06-15 Alessandro De Paris

To our knowledge at the time of writing, the maximum Waring rank for the set of all ternary forms of degree $d$ (with coefficients in an algebraically closed field of characteristic zero) is known only for $d\le 4$. The best upper bound…

代数几何 · 数学 2015-05-29 Alessandro De Paris

In this paper we introduce the open Waring rank of a form of degree d in n variables and prove the that this rank in bounded from above by \binom{n+d-2}{d-1} - \binom{n+d-6}{d-3} whenever n, d >= 3. This proves the same upper bound for the…

交换代数 · 数学 2013-05-31 Joachim Jelisiejew

A notion of open rank, related with generic power sum decompositions of forms, has recently been introduced in the literature. The main result here is that the maximum open rank for plane quartics is eight. In particular, this gives the…

代数几何 · 数学 2018-04-10 Edoardo Ballico , Alessandro De Paris

We prove that if a degree-$d$ homogeneous polynomial $f$ has border Waring rank $\underline{\mathrm{WR}}({f}) = r$, then its Waring rank is bounded by \[ {\mathrm{WR}}({f}) \leq d \cdot r^{O(\sqrt{r})}. \] This result significantly improves…

计算复杂性 · 计算机科学 2025-02-06 Amir Shpilka

We show that a real homogeneous polynomial f(x,y) with distinct roots and degree d greater or equal than 3 has d real roots if and only if for any (a,b) not equal to (0,0) the polynomial af_x+bf_y has d-1 real roots. This answers to a…

代数几何 · 数学 2010-06-29 Antonio Causa , Riccardo Re

At the time of writing, the general problem of finding the maximal Waring rank for homogeneous polynomials of fixed degree and number of variables (or, equivalently, the maximal symmetric rank for symmetric tensors of fixed order and in…

代数几何 · 数学 2016-06-14 Alessandro De Paris

We describe some forms with greater Waring rank than previous examples. In $3$ variables we give forms of odd degree with strictly greater rank than the ranks of monomials, the previously highest known rank. This narrows the possible range…

代数几何 · 数学 2015-08-07 Jarosław Buczyński , Zach Teitler

Let $\sigma_b(X_{m,d}(\mathbb {C}))(\mathbb {R})$, $b(m+1) < \binom{m+d}{m}$, denote the set of all degree $d$ real homogeneous polynomials in $m+1$ variables (i.e. real symmetric tensors of format $(m+1)\times ... \times (m+1)$, $d$ times)…

代数几何 · 数学 2013-07-10 Edoardo Ballico

The set ${\cal P}^{m\times n}_{r,d}$ of $m \times n$ complex matrix polynomials of grade $d$ and (normal) rank at most $r$ in a complex $(d+1)mn$ dimensional space is studied. For $r = 1, \dots , \min \{m, n\}-1$, we show that ${\cal…

数值分析 · 数学 2016-12-14 Andrii Dmytryshyn , Froilán M. Dopico

The Waring rank of the generic $d \times d$ determinant is bounded above by $d \cdot d!$. This improves previous upper bounds, which were of the form an exponential times the factorial. Our upper bound comes from an explicit power sum…

代数几何 · 数学 2020-04-15 Garritt Johns , Zach Teitler

We define the \emph{curvilinear rank} of a degree $d$ form $P$ in $n+1$ variables as the minimum length of a curvilinear scheme, contained in the $d$-th Veronese embedding of $\mathbb{P}^n$, whose span contains the projective class of $P$.…

代数几何 · 数学 2015-07-07 Edoardo Ballico , Alessandra Bernardi

Given nonnegative integers $n$ and $d$, where $n \gg d$, what is the minimum number $r$ such that there exist linear forms $\ell_1, \ldots, \ell_r \in \mathbb{C}[x_1, \ldots, x_n]$ so that $\ell_1^d + \cdots + \ell_r^d$ is supported exactly…

数据结构与算法 · 计算机科学 2019-06-10 Kevin Pratt

We give an upper bound in O(d ^((n+1)/2)) for the number of critical points of a normal random polynomial with degree d and at most n variables. Using the large deviation principle for the spectral value of large random matrices we obtain…

数值分析 · 数学 2010-07-12 Jean-Pierre Dedieu , Gregorio Malajovich

We show that over the field of complex numbers, \emph{every} homogeneous polynomial of degree $d$ can be approximated (in the border complexity sense) by a depth-$3$ arithmetic circuit of top fan-in at most $d+1$. This is quite surprising…

计算复杂性 · 计算机科学 2018-04-11 Mrinal Kumar

Matrices of rank at most k are defined by the vanishing of polynomials of degree k + 1 in their entries (namely, their (k + 1)-times-(k + 1)-subdeterminants), regardless of the size of the matrix. We prove a qualitative analogue of this…

代数几何 · 数学 2015-01-14 Jan Draisma , Jochen Kuttler

What is the maximum possible value of the lead coefficient of a degree $d$ polynomial $Q(x)$ if $|Q(1)|,|Q(2)|,\ldots,|Q(k)|$ are all less than or equal to one? More generally we write $L_{d,[x_k]}(x)$ for what we prove to be the unique…

数论 · 数学 2015-06-11 Karl Levy

The symmetric subrank of homogeneous polynomial is the largest number of terms in a diagonal form to which it can be specialized by a (typically non-invertible) linear variable substitution. Building on earlier work by Derksen-Makam-Zuiddam…

代数几何 · 数学 2026-04-15 Benjamin Biaggi , Jan Draisma , Koen de Nooij , Immanuel van Santen

We give the stratification by the symmetric tensor rank of all degree $d \ge 9$ homogeneous polynomials with border rank $5$ and which depend essentially on at least 5 variables, extending previous works (A. Bernardi, A. Gimigliano, M.…

代数几何 · 数学 2017-02-08 Edoardo Ballico

We prove an asymptotically tight bound (asymptotic with respect to the number of polynomials for fixed degrees and number of variables) on the number of semi-algebraically connected components of the realizations of all realizable sign…

组合数学 · 数学 2009-07-14 Saugata Basu , Richard Pollack , Marie-Francoise Roy
‹ 上一页 1 2 3 10 下一页 ›