Permanent formulae from the Veronesean

DOI10.1007/s10623-012-9618-1zbMath1301.15007OpenAlexW2101538406WikidataQ56806476 ScholiaQ56806476MaRDI QIDQ1952259

David G. Glynn

Publication date: 30 May 2013

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-012-9618-1

zbMATH Keywords

symmetric tensorpermanentpolarization identitymatrixVeronesean

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Determinants, permanents, traces, other special matrix functions (15A15) Algebraic combinatorics (05E99) Other types of codes (94B60) Projective techniques in algebraic geometry (14N05)

Related Items (1)

Majorization and the time complexity of linear optical networks

Cites Work

• The complexity of computing the permanent
• A condition for arcs and MDS codes
• The permanent of a square matrix
• Some notes on Feinberg's k-independence problem
• On a generalization of linear independence in finite-dimensional vector spaces
• Veroneseans, power subspaces and independence
• Higher Order Independence in Matroids
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Permanent formulae from the Veronesean