How we proved that there are exactly 924 cyclic 7-roots

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

How we proved that there are exactly 924 cyclic 7-roots

Full text

Pdf (597 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 1991 international symposium on Symbolic and algebraic computation table of contents

Bonn, West Germany

Pages: 103 - 111

Year of Publication: 1991

ISBN:0-89791-437-6

Authors

Jörgen Backelin	Dept. of Mathematics, University of Stockholm, 113 85 Stockholm, Sweden
Ralf Fröberg	Dept. of Mathematics, University of Stockholm, 113 85 Stockholm, Sweden

Sponsors

GMD : German Natl Research Ctr for Information Tech. - Gesellschft
German Comp Soc : GI - Gesellshaft for Informatik
SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 21, Citation Count: 4

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/120694.120708 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	G. BaORCK, Functions of modulus on Zp whose Fourier transforms have constan~ modulus, Proc. A. Haar Memorial Conf., Budapest, Colloquia Ma~hematica Societatis J~nos Bolyai 49 (1985), 193-197.
	2	G. BJORCK, Functions of modulus on Z,. whose Fourier transforms have constant modulus, and "cyclic n-roots", Recent Advances in Fourier Analysis and its Applications (J. S. Byrnes and J. F. Byrnes, eds), NATO Adv. Sci. Inst. Set. C: Math. Phys. Sci., Kluwer, 315 131-140.
	3	G. BJottcK, R. FR6BERG, A faster way to count the solutions of inhomogeneous systems of algebraic equations, with applications to cyclic n-roots, to appear in J. Symb. Comp..
	4	G. CARRA'FERRO, L. ROBBIANO, On superG-bases, J. Pure Applied Alg. 68 (1990), 279-292.
	5	Rüdiger Gebauer , H. Michael Möller, On an installation of Buchberger's algorithm, Journal of Symbolic Computation, v.6 n.2-3, p.275-286, Oct./Dec. 1988 [doi>10.1016/S0747-7171(88)80048-8]
	6	U. MEINHOLD, AIgorithmische Aspekte zur Theorie tier Gr6bner-Basen, Beitrhge zur Algebra und Geometrie 27 (1988), 63-81.
	7	D.K. TAYLOR, Ideals generated by monomials in an R-sequence, Ph. D. Thesis. University of Chicago, 1966.

CITED BY 4

	Ioannis Z. Emiris , Ashutosh Rege, Monomial bases and polynomial system solving (extended abstract), Proceedings of the international symposium on Symbolic and algebraic computation, p.114-122, July 20-22, 1994, Oxford, United Kingdom
	Jan Verschelde, Algorithm 795: PHCpack: a general-purpose solver for polynomial systems by homotopy continuation, ACM Transactions on Mathematical Software (TOMS), v.25 n.2, p.251-276, June 1999
	Johannes Grabmeier , Erich Kaltofen , Volker Weispfenning, Cited References, Computer algebra handbook, Springer-Verlag New York, Inc., New York, NY, 2003
	Daniel Lazard, Thirty years of Polynomial System Solving, and now?, Journal of Symbolic Computation, v.44 n.3, p.222-231, March, 2009