Affordable Access

Publisher Website

Counting subrings of [formula omitted]of indexk

Authors
Journal
Journal of Combinatorial Theory Series A
0097-3165
Publisher
Elsevier
Publication Date
Volume
114
Issue
2
Identifiers
DOI: 10.1016/j.jcta.2006.05.002
Keywords
  • Subrings
  • Lattices
  • Multiplicative Lattices
Disciplines
  • Mathematics

Abstract

Abstract We consider the problem of determining the number of subrings of the ring Z n of a fixed index k, denoted f n ( k ) . We present a decomposition theorem for these subrings and calculate explicit expressions for the Dirichlet series generating function F n ( s ) = ∑ k = 1 ∞ f n ( k ) k − s for n ⩽ 4 and for the generating function Φ p ( x , y ) = ∑ e = 0 ∞ ∑ n = 0 ∞ f n ( p e ) x e y n / n ! modulo p. We also calculate f n ( k ) when k is not divisible by the sixth power of any prime.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

On freely generated [formula omitted]-subrings

on Journal of Pure and Applied Al... Jan 01, 2009

Application of digital sampling techniques for [fo...

on Nuclear Instruments and Method... Jan 01, 2011
More articles like this..