Covariant algebra of the binary nonic and the binary decimic
From MaRDI portal
Publication:5346820
DOI10.1090/conm/686/13778zbMath1366.13006arXiv1509.08749OpenAlexW4299408898MaRDI QIDQ5346820
Publication date: 29 May 2017
Published in: Arithmetic, Geometry, Cryptography and Coding Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.08749
Actions of groups on commutative rings; invariant theory (13A50) Computational aspects in algebraic geometry (14Q99) Theory of modules and ideals in commutative rings (13C99)
Related Items
A minimal integrity basis for the elasticity tensor ⋮ Invariants: Computation and Applications ⋮ About Gordan's algorithm for binary forms ⋮ Computation of minimal covariants bases for 2D coupled constitutive laws ⋮ Combinatorial algorithm for the computation of cyclically standard regular bracket monomials ⋮ Invariant rings of sums of fundamental representations of \(\operatorname{SL}_n\) and colored hypergraphs ⋮ An algebraic independence result related to a conjecture of Dixmier on binary form invariants ⋮ Effective rationality of second-order symmetric tensor spaces
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sylvester versus Gundelfinger
- Using symmetries in the index calculus for elliptic curves discrete logarithm
- SL\(_{2}\)-modules of small homological dimension
- On the Poincaré series of the invariants of binary forms
- Brill-Gordan loci, transvectants and an analogue of the Foulkes conjecture
- Combinatorics, transvectants and superalgebras. An elementary constructive approach to Hilbert's finiteness theorem
- The invariants of the binary nonic
- The invariants of the binary decimic
- The higher transvectants are redundant
- The rise of Cayley's invariant theory (1841--1862)
- Applications of tensor functions in solid mechanics
- The decline of Cayley's invariant theory (1863-1895)
- Cohen-Macaulayness of modules of covariants
- Linear spaces of quadrics and new good codes
- Computation of invariants for reductive groups
- Gordan ideals in the theory of binary forms
- On the polynomial invariants of the elasticity tensor
- Computing invariants of reductive groups in positive characteristic
- Computational invariant theory
- About Gordan's algorithm for binary forms
- \(\mathbb N\)-solutions to linear systems over \(\mathbb Z\)
- Rings of invariants of reductive groups acting on regular rings are Cohen-Macaulay
- Quadratic involutions on binary forms
- Séminaire d'algèbre Paul Dubreil et Marie-Paule Malliavin. Proceedings, Paris 1983/1984 (36ème Année)
- Hyperelliptic curves and their invariants: geometric, arithmetic and algorithmic aspects
- A complete minimal system of covariants for the binary form of degree 7
- Computing invariants of algebraic groups in arbitrary characteristic
- The death of a mathematical theory. A study in the sociology of knowledge
- Invariant theory, old and new
- Gröbner bases of ideals invariant under a commutative group
- Transcending Classical Invariant Theory
- ON THE VOLUME CONJECTURE FOR CLASSICAL SPIN NETWORKS
- The Strain-Energy Function for Anisotropic Elastic Materials
- Analogue of Sylvester-Cayley formula for invariants of ternary form
- Efficient Algorithms for Computing Nœther Normalization
- Série de Poincaré et systèmes de paramètres pour les invariants des formes binaires de degré 7
- The invariant theory of binary forms
- Remarks on Classical Invariant Theory
- Invariants of finite groups and their applications to combinatorics
- The Determination of Galois Groups
- Solving polynomial systems globally invariant under an action of the symmetric group and application to the equilibria of N vortices in the plane
- Advanced Algebra
- Combinatorics and commutative algebra
- Algorithms in invariant theory
- Galois group computation for rational polynomials
