Perfect ideals over the Gaussian integers
✍ Scribed by Miriam Hausman; Harold N. Shapiro
- Publisher
- John Wiley and Sons
- Year
- 1976
- Tongue
- English
- Weight
- 664 KB
- Volume
- 29
- Category
- Article
- ISSN
- 0010-3640
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A new algorithm is presented for computing the solution of a Hankel system with integer entries by means of structured matrix techniques. By combining subresultant theory and factorization properties of Hankel matrices, we prove that this algorithm has a Boolean sequential cost which is almost optim
The purpose of this paper is twofold. First, we generalize the results of Pless and Qian and those of Pless, Sole ´, and Qian for cyclic ޚ 4 -codes to cyclic ޚ p m -codes. Second, we establish connections between this new development and the results on cyclic ޚ p m -codes obtained by Calderban
We introduced the sum graph of a set S of positive integers as the graph G+(S) having S as its node set, with two nodes adjacent whenever their sum is in S. Now we study sum graphs over all the integers so that S may contain positive or negative integers on zero. A graph so obtained is called an int