On the Rank of a Binary Form

被引：0
|
作者：
Gonzalo Comas
Malena Seiguer
机构：
[1] FCEyN-UBA,Departamento de Matematica
来源：
Foundations of Computational Mathematics | 2011年 / 11卷
关键词：
Tensor rank; Waring’s problem; Binary forms; 15A21; 15A69; 14N15; 14M12;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We describe in the space of binary forms of degree d the strata of forms having a given rank. We also give a simple algorithm for determining the rank of a given form.
引用
收藏
页码：65 / 78
页数：13
相关论文
共 50 条
  • [21] CONSEQUENT RANK BINARY DETECTION PROCEDURE
    AKIMOV, PS
    YEFREMOV, VS
    KUBASOV, AN
    IZVESTIYA VYSSHIKH UCHEBNYKH ZAVEDENII RADIOELEKTRONIKA, 1978, 21 (04): : 84 - 88
  • [22] THE WARING RANK OF BINARY BINOMIAL FORMS
    Moncusi, Laura Brustenga, I
    Masuti, Shreedevi K.
    PACIFIC JOURNAL OF MATHEMATICS, 2021, 313 (02) : 327 - 342
  • [23] THE MAXIMUM RANK CORRELATION ESTIMATOR AND THE RANK ESTIMATOR IN BINARY CHOICE MODELS
    WINDMEIJER, FAG
    ECONOMETRIC THEORY, 1994, 10 (02) : 442 - 443
  • [24] An upper bound for the Waring rank of a form
    Joachim Jelisiejew
    Archiv der Mathematik, 2014, 102 : 329 - 336
  • [25] TRILINEAR FORM OF RANK-7
    REVOY, P
    BULLETIN DES SCIENCES MATHEMATIQUES, 1988, 112 (03): : 357 - 368
  • [26] An upper bound for the Waring rank of a form
    Jelisiejew, Joachim
    ARCHIV DER MATHEMATIK, 2014, 102 (04) : 329 - 336
  • [27] Rank Spectrum of Propelinear Perfect Binary Codes
    Guskov, George K.
    Mogilnykh, Ivan Yu.
    Solov'eva, Faina I.
    2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 879 - +
  • [28] Best rank k approximation for binary forms
    Ottaviani, Giorgio
    Tocino, Alicia
    COLLECTANEA MATHEMATICA, 2018, 69 (01) : 163 - 171
  • [29] Adaptation of Rank Binary Detection Procedure.
    Akimov, P.S.
    Izvestiya Vysshikh Uchebnykh Zavedenij. Radioelektronika, 1979, 22 (07): : 31 - 37
  • [30] The Bruhat rank of a binary symmetric staircase pattern
    Du, Zhibin
    da Fonseca, Carlos M.
    OPEN MATHEMATICS, 2016, 14 : 832 - 840
12345