Semi-invariants of binary forms and symmetrized graph-monomials
Commutative Algebra
2021-04-16 v2 Combinatorics
Number Theory
Abstract
This article provides a method for constructing invariants and semi-invariants of a binary -ic form over a field characteristics or . A practical and broadly applicable sufficient condition for ensuring nontriviality of the symmetrization of a graph-monomial is established. This allows construction of infinite families of invariants (especially, skew-invariants) and families of -linearly independent semi-invariants. These constructions are very useful in the quantum physics of Fermions. Additionally, they permit us to establish a new polynomial-type lower bound on the coefficient of in for all sufficiently large integers and .
Keywords
Cite
@article{arxiv.1809.00369,
title = {Semi-invariants of binary forms and symmetrized graph-monomials},
author = {Shashikant Mulay},
journal= {arXiv preprint arXiv:1809.00369},
year = {2021}
}