English

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 NN-ic form over a field kk characteristics 00 or p>Np > N. 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 kk-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 qwq^{w} in (q1)(N+dd)q(q - 1) {N + d \choose d}_{q} for all sufficiently large integers dd and wNd/2w \leq N d / 2.

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}
}
R2 v1 2026-06-23T03:52:04.127Z