𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Apolarity and Generic Canonical Forms

✍ Scribed by Richard Ehrenborg

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
175 KB
Volume
213
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.

✦ Synopsis

The notion of S S-algebra is introduced. The theory of apolarity and generic canonical forms for polynomials is generalized to S S-algebras over the complex field ‫.ރ‬ We apply this theory to the problem of finding the essential rank of general, symmetric, and skew-symmetric tensors. Upper bounds for the essential ranks are found by different combinatorial coverings.

📜 SIMILAR VOLUMES

Apolarity and Canonical Forms for Homoge
Apolarity and Canonical Forms for Homogeneous Polynomials
✍ Richard Ehrenborg; Gian-Carlo Rota 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 702 KB

Käre Bernt Lindström, Gratulerar på Din sextioårs dag. Vi hoppas att denna artikel kommer falla Dig i smaken. Vi börjar med en kort studie i algebraiska matroider, och fortsätter med att bevisa relationen mellan Jacobianen av en mängd algebraiska funktioner och deras algebraiska oberoende. Med detta

Log–canonical forms and log canonical si
Log–canonical forms and log canonical singularities
✍ Hubert Flenner; Mikhail Zaidenberg 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 275 KB

## Abstract For a normal subvariety __V__ of ℂ^__n__^ with a good ℂ\*–action we give a simple characterization for when it has only log canonical, log terminal or rational singularities. Moreover we are able to give formulas for the plurigenera of isolated singular points of such varieties and of t

On generic forms of complementary graphs
On generic forms of complementary graphs
✍ J.W. Moon; S.D. Bedrosian 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 250 KB

Each graph may be associated with a certainfunction called its genericform. If one knows the generic forms of given graphs, then one can easily determine the number of spanning trees in graphs obtained from a complete multi-graph either (1) by adding, or (2) by deleting the edges of disjoint copies