Gaussian binomials and the number of sublattices
From MaRDI portal
(Redirected from Publication:5359233)
Abstract: The purpose of this short communication is to make some observations on the connections between various existing formulas of counting the number of sublattices of a fixed index in an -dimensional lattice and their connection with the Gaussian binomials.
Recommendations
- Generalized binomial coefficients and the subset-subspace problem
- Gauss sums and multinomial coefficients
- Binomial sums, moments and invariant subspaces
- Gauss sums and binomial coefficients
- scientific article; zbMATH DE number 3859129
- Some identities of Gaussian binomial coefficients
- Binomial determinants and lattice
- Gaussian Binomial Coefficients in Group Theory, Field Theory, and Topology
- scientific article; zbMATH DE number 6473252
- Analogues of the binomial coefficient theorems of Gauss and Jacobi
Cited in
(8)- Representing and counting the subgroups of the group \(\mathbb{Z}_m \times \mathbb{Z}_n\)
- Dirac pairings, one-form symmetries and Seiberg-Witten geometries
- Alternative formulae for the number of sublattices
- On the number of perfect lattices
- scientific article; zbMATH DE number 6473252 (Why is no real title available?)
- Euclid meets Popeye: the Euclidean algorithm for 2 2 matrices
- Counting subgroups of the groups \({\mathbb{Z}}_{n_1} \times \cdots \times{\mathbb{Z}}_{n_k}\): a survey
- On subgroup graphs of finite abelian groups
This page was built for publication: Gaussian binomials and the number of sublattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5359233)
