中文
相关论文

相关论文: On the Waring Rank of Binary Forms

200 篇论文

A matrix is said to have factor width at most $k$ if it can be written as a sum of positive semidefinite matrices that are non-zero only in a single $k \times k$ principal submatrix. We explore the ``factor-width-$k$ rank'' of a matrix,…

组合数学 · 数学 2025-04-03 Nathaniel Johnston , Shirin Moein , Sarah Plosker

The Waring locus of a form F is the collection of the degree one forms appearing in some minimal sum of powers decomposition of F. In this paper, we give a complete description of Waring loci for several family of forms, such as quadrics,…

代数几何 · 数学 2019-02-07 Enrico Carlini , Maria Virginia Catalisano , Alessandro Oneto

The Matrix Waring problem is if we can write every matrix as a sum of $k$-th powers. Here, we look at the same problem for triangular matrix algebra $T_n(\mathbb{F}_q)$ consisting of upper triangular matrices over a finite field. We prove…

群论 · 数学 2024-04-04 Rahul Kaushik , Anupam Singh

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

We show that if a homogeneous polynomial $f$ in $n$ variables has Waring rank $n+1$, then the corresponding projective hypersurface $f=0$ has at most isolated singularities, and the type of these singularities is completely determined by…

代数几何 · 数学 2020-04-21 Alexandru Dimca , Gabriel Sticlaru

Let $\operatorname{r_{max}}(n,d)$ be the maximum Waring rank for the set of all homogeneous polynomials of degree $d>0$ in $n$ indeterminates with coefficients in an algebraically closed field of characteristic zero. To our knowledge, when…

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

Let $K$ be a number field, ${\mathcal O}_K$ its ring of integers, and $f(x, y) \in {\mathcal O}_K[x, y]$ a binary form with integer coefficents. For any given prime $p \in {\mathcal O}_K$ we determine explicitly a binary form $g$ (resp.…

数论 · 数学 2021-11-10 Elira Curri

The category of all $k$-algebras with a bilinear form, whose objects are all pairs $(R,b)$ where $R$ is a $k$-algebra and $b\colon R\times R\to k$ is a bilinear mapping, is equivalent to the category of unital $k$-algebras $A$ for which the…

环与代数 · 数学 2022-10-18 Alberto Facchini , Leila Heidari Zadeh

In this paper we study the complex simultaneous Waring rank for collections of monomials. For general collections we provide a lower bound, whereas for special collections we provide a formula for the simultaneous Waring rank. Our approach…

代数几何 · 数学 2018-05-08 Enrico Carlini , Emanuele Ventura

Let K be a field of characteristic different from 2 and let V be a vector space of dimension n over K. Let M be a non-zero subspace of symmetric bilinear forms defined on V x V and let r=rank(M) denote the set of different positive integers…

环与代数 · 数学 2018-01-26 Rod Gow

We analyze the problem of determining Waring decompositions of the powers of any quadratic form over the field of complex numbers. Our main goal is to provide information about their rank and also to obtain decompositions whose size is as…

代数几何 · 数学 2025-04-22 Cosimo Flavi

This survey provides a comprehensive overview of the study of the binary and Boolean rank from both a mathematical and a computational perspective, with particular emphasis on their relationship to the real rank. We review the basic…

离散数学 · 计算机科学 2026-01-22 Michal Parnas

This paper studies the problem of decomposing a low-rank matrix into a factor with binary entries, either from $\{\pm 1\}$ or from $\{0,1\}$, and an unconstrained factor. The research answers fundamental questions about the existence and…

数据结构与算法 · 计算机科学 2019-08-01 Richard Kueng , Joel A. Tropp

Motivated by (and using tools from) communication complexity, we investigate the relationship between the following two ranks of a $0$-$1$ matrix: its nonnegative rank and its binary rank (the $\log$ of the latter being the unambiguous…

计算复杂性 · 计算机科学 2016-03-28 Thomas Watson

Motivated by the search for a deeper understanding of tensor rank, in view of its computational complexity applications, we investigate a possible path to determine the maximum symmetric rank in given degree and dimension. We work in terms…

交换代数 · 数学 2023-11-17 Alessandro De Paris

The binary rank of a $0,1$ matrix is the smallest size of a partition of its ones into monochromatic combinatorial rectangles. A matrix $M$ is called $(k_1, \ldots, k_m ; n_1, \ldots, n_m)$ circulant block diagonal if it is a block matrix…

组合数学 · 数学 2022-10-07 Ishay Haviv , Michal Parnas

Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. We study the largest minimum weight $d(n,k)$ among all binary linear complementary dual $[n,k]$ codes. We…

组合数学 · 数学 2020-11-20 Makoto Araya , Masaaki Harada

We describe the algebraic boundaries of the regions of real binary forms with fixed typical rank and of degree at most eight, showing that they are dual varieties of suitable coincident root loci.

代数几何 · 数学 2018-08-28 Maria Chiara Brambilla , Giovanni Staglianò

We study the rank weight hierarchy, thus in particular the rank metric, of cyclic codes over the finite field $\mathbb F_{q^m}$, $q$ a prime power, $m \geq 2$. We establish the rank weight hierarchy for $[n,n-1]$ cyclic codes and…

信息论 · 计算机科学 2014-07-16 Jérôme Ducoat , Frédérique Oggier

Waring's classical problem deals with expressing every natural number as a sum of g(k) k-th powers. Recently there has been considerable interest in similar questions for nonabelian groups, and simple groups in particular. Here the k-th…

群论 · 数学 2007-05-23 Michael Larsen , Aner Shalev