Character polynomials and the Möbius function
✍ Scribed by H. Pahlings
- Publisher
- Springer
- Year
- 1995
- Tongue
- English
- Weight
- 484 KB
- Volume
- 65
- Category
- Article
- ISSN
- 0003-889X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A classical conjecture of Bouniakowsky says that a non-constant irreducible polynomial in Z[T ] has infinitely many prime values unless there is a local obstruction. Replacing Z where is a finite field, the obvious analogue of Bouniakowsky's conjecture is false. All known counterexamples can be exp
We introduce the concept of a bounded below set in a lattice. This can be used to give a generalization of Rota's broken circuit theorem to any finite lattice. We then show how this result can be used to compute and combinatorially explain the Mo bius function in various examples including non-cross