ACM Communications in Computer Algebra, Vol. 42, No. 2, June 2008 Poster Abstracts Poster Abstracts from the Eighth Algorithmic Number Theory Symposium, ANTS-8 Communicated by Jonathan Sorenson Computer Science and Software Engineering Butler University Indianapolis, Indiana, 46208 USA sorenson@butler.edu http://www.butler.edu/~sorenson Abstract The following twelve poster abstracts were presented at the ANTS-8 poster session.1 ANTS-8 was held at the Ban Centre in Ban , Alberta Canada, May 17â22, 2008. The conference website, where many of the posters can be viewed online, is http://ants.math. ucalgary.ca/. Calculating Really Big Cyclotomic Polynomials Andrew Arnold and Michael Monagan, Simon Fraser University, ada26@ sfu.ca The nth cyclotomic polynomial, n (z), is the monic polynomial whose (n) distinct roots are the nth complex primitive roots of unity. That is, n (z) = (z e 0 ¤k<n gcd(k,n)=1 2Ïi k n ) The rst ten cyclotomic polynomials are as follows: 1 (z) = z 1 2 (z) = z + 1 3 (z) = z 2 + z + 1 4 (z) = z 2 + 1 5 (z) = z 4 + z 3 + z 2 + z + 1 6 (z) = z 2 z + 1 7 (z)
End of preview. The entire article is 2 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/calculating-really-big-cyclotomic-polynomials-abstract-only-TYydJSl7xl
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Calculating really big cyclotomic polynomials (abstract only)
Arnold, Andrew; Monagan, Michael
Follow ACM Communications in Computer Algebra
, Volume 42 (1-2)
Association for Computing Machinery – Jul 25, 2008
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
