اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThe set of forms with bounded strength is not closed
126
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The strength of a homogeneous polynomial (or form) $f$ is the smallest length of an additive decomposition expressing it whose summands are reducible forms. We show that the set of forms with bounded strength is not always Zariski-closed. In particular, if the ground field has characteristic $0$, we prove that the set of quartics with strength $leq3$ is not Zariski-closed for a large number of variables.
قيم البحث
اقرأ أيضاً
We prove that strength and slice rank of homogeneous polynomials of degree $d geq 5$ over an algebraically closed field of characteristic zero coincide generically. To show this, we establish a conjecture of Catalisano, Geramita, Gimigliano, Harbourn
e, Migliore, Nagel and Shin concerning dimensions of secant varieties of the varieties of reducible homogeneous polynomials. These statements were already known in degrees $2leq dleq 7$ and $d=9$.
We construct a linear system non-local game which can be played perfectly using a limit of finite-dimensional quantum strategies, but which cannot be played perfectly on any finite-dimensional Hilbert space, or even with any tensor-product strategy.
In particular, this shows that the set of (tensor-product) quantum correlations is not closed. The constructed non-local game provides another counterexample to the middle Tsirelson problem, with a shorter proof than our previous paper (though at the loss of the universal embedding theorem). We also show that it is undecidable to determine if a linear system game can be played perfectly with a finite-dimensional strategy, or a limit of finite-dimensional quantum strategies.
In most online problems with delay, clairvoyance (i.e. knowing the future delay of a request upon its arrival) is required for polylogarithmic competitiveness. In this paper, we show that this is not the case for set cover with delay (SCD) -- specifi
cally, we present the first non-clairvoyant algorithm, which is $O(log n log m)$-competitive, where $n$ is the number of elements and $m$ is the number of sets. This matches the best known result for the classic online set cover (a special case of non-clairvoyant SCD). Moreover, clairvoyance does not allow for significant improvement - we present lower bounds of $Omega(sqrt{log n})$ and $Omega(sqrt{log m})$ for SCD which apply for the clairvoyant case. In addition, the competitiveness of our algorithm does not depend on the number of requests. Such a guarantee on the size of the universe alone was not previously known even for the clairvoyant case - the only previously-known algorithm (due to Carrasco et al.) is clairvoyant, with competitiveness that grows with the number of requests. For the special case of vertex cover with delay, we show a simpler, deterministic algorithm which is $3$-competitive (and also non-clairvoyant).
We determine the Waring ranks of all sextic binary forms using a Geometric Invariant Theory approach. In particular, we shed new light on a claim by E. B. Elliott at the end of the 19th century concerning the binary sextics with Waring rank 3.
The goal of this paper is to start a study of aCM and Ulrich sheaves on non-integral projective varieties. We show that any aCM vector bundle of rank two on the double plane is a direct sum of line bundles. As a by-product, any aCM vector bundle of r
ank two on a sufficiently high dimensional quadric hypersurface also splits. We consider aCM and Ulrich vector bundles on a multiple hyperplanes and prove the existence of such bundles that do not split, if the multiple hyperplane is linearly embedded into a sufficiently high dimensional projective space. Then we restrict our attention to the double plane and give a classification of aCM sheaves of rank at most $3/2$ on the double plane and describe the family of isomorphism classes of them.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
