Publication Search Results

Publications of the Computational Algebra Research Group

10. Harrison M. Explicit solution by radicals, gonal maps and plane models of algebraic curves of genus 5 or 6, Journal of Symbolic Computation, 51 (2013), 3–21.

11. Creutz B. A Grunwald-Wang type theorem for abelian varieties, Acta Arithmetica, 154 (2012), no. 4, 353–370.

12. Gehringer MM, Adler L, Roberts AA, Moffitt MC, Mihali TK, Mills TJT, Fieker C, Neilan BA. Nodularin, a cyanobacterial toxin, is synthesized in planta by symbiotic Nostoc sp., The ISME Journal, 6 (2012), no. 10, 1834–1847.

13. Creutz B, Miller RL. Second isogeny descents and the Birch and Swinnerton-Dyer conjectural formula, Journal of Algebra, 372 (2012), 673–701.

14. Boyden JA, Muller RD, Gurnis M, Torsvik TH, Clark JA, Turner M, Ivey-Law H, Watson RJ, Cannon JJ. Next-generation plate-tectonic reconstructions using GPlates, Geoinformatics: Cyberinfrastructure for the Solid Earth Sciences, Earth sciences; Geographical information systems (GIS) & remote sensing, Cambridge University Press, USA, (2011), 388. ISBN 978-0-521-89715-0

15. Creutz B. Potential Sha for abelian varieties, Journal of Number Theory, 131 (2011), 2162–2174.

16. Steel A. Computing with algebraically closed fields, Journal of Symbolic Computation, 45 (2010), 342–372. MR2578343

17. Gehringer MM, Pengelly JL, Cuddy WS, Fieker C, Forster PI, Neilan BA. Host Selection of Symbiotic Cyanobacteria in 31 Species of the Australian Cycad Genus: Macrozamia (Zamiaceae), Molecular Plant - Microbe Interactions, 23 (2010), no. 6, 811–822.

18. Cannon JJ, Donnelly S, Fieker C, Watkins M. Magma - A tool for number theory, Lecture Notes in Computer Science, 6327 (2010), 253–255.

19. Fieker C, Stehlé D. Short bases of Lattices over number fields, Lecture Notes in Computer Science, 6197 (2010), 157–173.

20. Cohen AM, Murray SH. An algorithm for Lang's theorem, Journal of Algebra, 322 (2009), no. 3, 675. MR2531217

21. Nebe G, Steel A. Recognition of division algebras, Journal of Algebra, 322 (2009), 903–909. MR2531228

22. Fieker C. Minimizing representations over number fields II: Computations in the Brauer group, Journal of Algebra, 322 (2009), 752–763.

23. Belabas K, Hoeij M, Kluners J, Steel A. Factoring polynomials over global fields, Journal de th'eorie des nombres de Bordeaux, 21 (2009), no. 1, 15–39. MR2537701

24. Horn P, Roozemond DA. OpenMath in SCIEnce: SCSCP and POPCORN, Intelligent Computer Mathematics, MKM2009, J. Carette, L. Dixon, C. Sacerdoti Coen, S. Watt (eds.), Lecture Notes in Computer Science, Springer, Berlin, (2009), 474–479. ISBN 978-3-642-02613-3

25. in 't panhuis J, Postma E, Roozemond DA. Extremal Presentations for Classical Lie Algebras, Journal of Algebra, 322 (2009), no. 2, 295–326. MR2529091

26. Cohen AM, Roozemond DA. Computing Chevalley bases in small characteristics, Journal of Algebra, 322 (2009), no. 3, 703–721. MR2531218

27. An J, Cannon JJ, O'Brien EA, Unger WR. The Alperin weight conjecture and Dade's conjecture for the simple group \(\mathrm{Fi}_{24}'\), LMS Journal of computation and mathematics, 11 (2008), 100–145. MR2410917

28. Pujol X, Stehlé D. Rigorous and efficient short lattice vectors enumeration, Advances in Cryptology – Asiacrypt 2008, Asiacrypt 2008, Lynn Batten (ed.), LNCS, Springer, Berlin, (2008), 0000.

29. Cohen AM, Haller S, Murray SH. Computing in unipotent and reductive algebraic groups, LMS Journal of Computational Mathematics, 11 (2008), 343–366. MR2452553

30. Akhavi A, Stehlé D. Speeding-up Lattice Reduction with Random Projections, LATIN 2008, LATIN 2008, E. Laber (ed.), LNCS, Springer, New York, (2008), 293–305.

31. Fieker C, Pohst ME. A lower regulator bound for number fields, Journal of Number Theory, 128 (2008), 2767–2775. MR2441075

32. Fieker C, Klueners J. Galoisgruppen in Magma, Computeralgebra Rundbrief, 43 (2008), 11–12.

33. Dembélé L, Donnelly S. Computing Hilbert Modular Forms over Fields with Nontrivial Class Group, Lecture Notes in Computer Science, 5011 (2008), 371–386. MR2467859

34. Cannon JJ, Holt DF. The transitive permutation groups of degree 32, Experimental Mathematics, 17 (2008), no. 3, 307–314. MR2455702

35. Freundt S, Horn P, Konovalov A, Linton S, Roozemond DA. Symbolic Computation Software Composability, Intelligent Computer Mathematics, Calculemus 2008, S. Autexier, J. Campbell, J. Rubio, V. Sorge, M. Suzuki, F. Wiedijk (eds.), Lecture Notes in Computer Science, Springer, Berlin, (2008), 285–295. ISBN 978-3-540-85109-7

36. Cohen AM, Ivanyos G, Roozemond DA. Simple Lie Algebras having Extremal Elements, Indagationes Mathematicae, 19 (2008), no. 2, 177–188.

37. Murray SH. Representations of parabolic and Borel subgroups, Communications in Algebra, 35 (2007), no. 2, 455–459. MR2294610

38. Fieker C, Graaf W. Finding integral linear dependencies of algebraic numbers and algebraic Lie algebras, London Mathematical Society Journal of Computational Mathematics, 10 (2007), 271–287.

39. Fieker C. Sparse representation for cyclotomic fields, Experimental Mathematics, 16 (2008), no. 4, 493–500.

40. Unger WR. Computing the soluble radical of a permutation group, Journal of Algebra, 300 (2006), no. 1, 305–315. MR2228650

41. Cannon JJ, Holt DF. Computing conjugacy class representatives in permutation groups, Journal of Algebra, 300 (2006), no. 1, 213–222. MR2228644

42. Fieker C, Pohst ME. Dependency of units in number fields, Mathematics of Computation, 75 (2006), no. 255, 1507–1518. MR2219041

43. Unger WR. Computing the character table of a finite group, Journal of Symbolic Computation, 41 (2006), no. 8, 847–862. MR2246713

44. Voight J. Computing CM points on Shimura curves arising from cocompact arithmetic triangel groups, Algorithmic Number Theory: ANTS-VII, 7th International Symposium, ANTS-VII, Florian Hess, Sebastian Pauli, Michael Post (eds.), Lecture Notes in Computer Science, 4076 Springer-Verlag, Berlin, (2006), 406–420. ISBN 3-540-36075-1 MR2282939

45. Stehlé D. On the randomness of bits generated by sufficiently smooth functions, Algorithmic Number Theory: ANTS-VII, 7th International Symposium, ANTS-VII, Florian Hess, Sebastian Pauli, Michael Post (eds.), Lecture Notes in Computer Science, 4076 Springer-Verlag, Berlin, (2006), 257–274. ISBN 3-540-36075-1 MR2282929

46. Harrison M, Schicho J. Rational parametrisation for degree 6 del pezzo surfaces using Lie algebras, Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation: ISSAC ' 06, ISSAC '06: International symposium on symbolic and algebraic computation, Jean-Guillaume Dumas (ed.), Symbolic and Algebraic Computation, ACM, New York, (2006), 132–137. ISBN 1-59593-276-3 MR2289111

47. Fieker C. Applications of the class field theory of global fields, Discovering Mathematics with Magma. Reducing the Abstract to the Concrete, Algorithms and Computation in Mathematics, Springer, Berlin, (2006), 31–62. ISBN 3-540-37632-1 MR2278922

48. Roney-Dougal CM, Unger WR. Computing the primitive permutation groups of degree less than 1000, Discovering Mathematics with Magma. Reducing the Abstract to the Concrete, Algorithms and Computation in Mathematics, Springer, Berlin, (2006), 243–260. ISBN 3-540-37632-1 MR2278931

49. Steel A. Conquering inseparability: primary decomposition and multivariate factorization over algebraic function fields of positive characteristic, Journal of Symbolic Computation, 40 (2005), no. 3, 1053–1075. MR2167699

50. Cannon JJ, Holt DF, Slattery M, Steel A. Computing subgroups of bounded index in a finite group, Journal of Symbolic Computation, 40 (2005), no. 2, 1013–1022. MR2167681

51. Cohen A, Murray SH, Taylor DE. Computing in groups of Lie type, Mathematics of Computation, 73 (2004), 1477–1498. MR2047097

52. Fieker C. Minimizing representations over number fields, Journal of Symbolic Computation, 38 (2004), 833–842. MR2094558

53. Cannon JJ, Holt DF. Computing maximal subgroups of finite groups, Journal of Symbolic Computation, 37 (2004), 589–609. MR2094616

54. Steel A, Ramnarine KV, Criton A, Davidson F, Allan PL, Humphries N, Routh HF, Fish PJ, Hoskins PR. Angle-dependence and reproducibility of dual-beam vector Doppler ultrasound in the common carotid arteries of normal volunteers, Ultrasound in Medicine and Biology, 94 (2004), 271–276.

55. Cannon JJ, Eick B, Leedham-Green CR. Special polycyclic generating sequences for finite soluble groups, Journal of Symbolic Computation, 38 (2004), no. 5, 1445–1460. MR2168723

56. Roney-Dougal CM, Unger WR. The affine primitive permutation groups of degree less than 1000, Journal of Symbolic Computation, 35 (2003), 421–439. 2004e:20002

57. Fieker C, Kluners J. Minimal discriminants for fields with small Frobenius groups as Galois groups, Journal of Number Theory, 99 (2003), 318–337. 2004f:11147

58. Cannon JJ, Holt D. Automorphism group computation and isomorphism testing in finite groups, Journal of Symbolic Computation, 35 (2003), 241–267. 2004c:20035

59. Cohen A, Murray SH, Pollet M, Sorge V. Certifying solutions to permutation group problems, Automated Deduction, CADE-19, F. Baader (ed.), Lecture Notes in Artificial Intelligence, Springer, Berlin, (2003), 257–273. ISBN 3-540-40559-3

60. Holmes PE, Linton SA, Murray SH. Product replacement in the Monster group, Experimental Mathematics, 12 (2003), no. 1, 123–126. 2003h:20003

61. Fieker C. Ueber Magma, Computeralgebra Rundbrief, 32 (2003), 12–13.

62. Steel A. A new scheme for computing with algebraically closed fields, ANTS-V Proceedings, 5th International Symposium, ANTS-V, Claus Fieker, David R Kohel (eds.), Lecture Notes in Computer Science, Springer, Berlin Heidelberg, (2002), 491–505. ISBN 3-540-43863-7 MR2041106

63. Fieker C, Kohel DR. ANTS-V Proceedings, Lecture Notes in Computer Science, Springer, Berlin Heidelberg, (2002), 515.

64. Cannon JJ, Unger WR. Magma, Handbook of Computer Algebra, foundations, applications, systems, Springer, Berlin, (2002), –.

65. Leedham-Green CR, Murray SH. Variants of product replacement, Computational and statistical group theory, Statistical methods in group theory, Robert Gilman, Vladimir Shpilrain, Alexei G. Myasnikov (eds.), Contemporary Mathematics, American Mathematical Society, Providence, (2002), 97–104. MR1929718

66. Combe D, Palmer WD, Unger WR. Bhaskar Rao designs and the alternating group \(A_4\), Australasian Journal of Combinatorics, 24 (2001), 275–283. 2002f:05027

67. Cannon JJ, Cox BC, Holt DF. Computing the subgroups of a permutation group, Computational Algebra and Number Theory, 31 (2001), 149–161. 2002e:20008

68. Fieker C. Computing class fields via the Artin map, Mathematics of Computation, 70 (2001), 1293–1303. MR1826583

69. Murray SH. Conjugacy classes in maximal parabolic subgroups of general linear groups, Journal of Algebra, 233 (2000), 135–155. 2002f:20069

70. Fieker C, Friedrichs C. On reconstruction of algebraic numbers, Algorithmic Number Theory, 4th International Symposium, ANTS-IV, Wieb Bosma (ed.), Lecture Notes in Computer Science, Springer-Verlag, Berlin Heidelberg, (2000), 285 – 296. ISBN 3 540 67695 3 2002g:11181

71. Kemper G, Steel A. Some algorithms in invariant theory of finite groups, Computational Methods for Representations of Groups and Algebras, Progress in Mathematics, 173 Birkhauser Verlag, Basel, Switzerland, (1999), 267–285. ISBN 3-7643-6063-1 2000j:13009

72. Kemper G, Steel A. Some algorithms in invariant theory of finite groups, Progress in Mathematics, 173 (1998), 267–285. 2000j:13009

73. Bosma W, Cannon JJ, Steel A. Lattices of compatibility embedded finite fields, Journal of Symbolic Computation, 24 (1997), no. 3/4, 351–369. 99a:11143

74. Bosma W, Cannon JJ, Playoust CE. The magma algebra system I: the user language, Journal of Symbolic Computation, 24 (1997), no. 3/4, 235–265. MR1484478

75. Cannon JJ, Playoust CE. Using the magma computer algebra system in abstract algebra courses, Journal of Symbolic Computation, 23 (1997), no. 5/6, 459–484.

76. Cannon JJ, Holt DF. Computing chief series, composition series and socles in large permutation groups, Journal of Symbolic Computation, 24 (1997), no. 3/4, 285–301. 98m:20009

77. Cannon JJ, Cox BC, Holt DF. Computing Sylow subgroups in permutation groups, Journal of Symbolic Computation, 24 (1997), no. 3/4, 303–316. 98m:20010

78. Steel A. A new algorithm for the computation of canonical forms of matrices over fields, Journal of Symbolic Computation, 24 (1997), no. 3/4, 409–432. 98m:65070

79. Cannon JJ, Souvignier B. An the computation of conjugacy classes in permutation groups, Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, ISSAC 97, Wolfgang W. Kuchlin (ed.), ISSAC 97, ACM Press (Association for Computing Machinery, Inc.), New York, U.S.A, (1997), 392–399. ISBN 0 89791 875 4 MR1810005

80. Cannon JJ, Playoust CE. Magma: a new computer algebra system, Euromath Bulletin, 2 (1996), 113–144. MR1413180

81. Bailey G. Xvoigt: An interactive absorption line fitting program for the X window system, Publications of the Astronomical Society of Australia, 12 CSIRO Publications, Melbourne, (1995), 239–243.

82. Celler F, Leedham-Green CR, Murray SH, Niemeyer AC, O'Brien EA. Generating random elements of a finite group, Communications in Algebra, 23 (1995), no. 13, 4931–4948. MR1356111

83. Murray SH, O'Brien EA. Selecting base points for the Schreier-Sims algorithm for matrix groups, Journal of Symbolic Computation, 19 (1995), no. 6, 577–584. MR1370623

84. Butler G, Cannon JJ. On Holt's algorithm, Journal of Symbolic Computation, 15 (1993), MR1281200

85. Bosma W, Cannon JJ. A Handbook of Cayley Functions, 1st edn (1991), 1–243.

86. Butler G, Cannon JJ. Computing Sylow subgroups of permutation groups via homomorphic images of centralizers, Journal of Symbolic Computation, 12 (1991), 443–458. 92m:20002

87. Cameron PJ, Cannon JJ. Recognizing doubly transitive groups, Journal of Symbolic Computation, 12 (1991), 459–474. 92m:20003

88. Butler G, Cannon JJ. The design of Cayley — a language for modern algebra, Design and Implementation of Symbolic Computation Systems, Miola A (ed.), Lecture Notes in Computer Science, 429 Springer, (1990), 10–19.

89. Butler G, Cannon JJ. Computing in permutation and matrix groups III : Sylow subgroups, Journal of Symbolic Computation, 8 (1989), 241–252. 90i:20003

90. Butler G, Cannon JJ. Cayley version 4: The user language, Proceedings of the 1988 International Symposium on Symbolic and Algebraic Computation, International Symposium on Symbolic and Algebraic Computation, Rome, July 4–8, 1988, Gianni P (ed) (ed.), Lecture Notes in Computer Science, 358 (1988), MR1053754

91. Butler G, Cannon JJ. The design of Cayley — A language for modern algebra, Proceedings of the ACM SIGPLAN 88 Conference on Programming Language Design. Atlanta, Georgia, (1988), MR1053754

92. Unger WR, Wehrhahn KH. Species of ordered partitions, Ars Combinatoria, 21-A (1986), 141–146. 87j:05018

93. Cannon JJ, Richardson JS. Cayley — Teaching Group Theory by Computer, SIGSAM Bulletin, 18 (1984), 15–18.

94. Cannon JJ. An introduction to the group theory language Cayley, Computational Group Theory, Atkinson MD (ed.), Academic Press, London, (1984), 145–183. MR0760656

95. Cannon JJ. A computational toolkit for finite permutation groups, Proceedings of the Rutgers Group Theory Year, 1983 - 1984, Aschbacher M et al (ed.), CUP, New York, (1984), 1–18.

96. Butler G, Cannon JJ. Computing with permutation and matrix groups I: Normal closure, commutator subgroups, series, Mathematics of Computation, 39 (1982), 671–680.

97. Cannon JJ. The basis of a computer system for modern algebra, Proceedings of the 1981 ACM Symposium on Symbolic and Algebraic Computation, Snowbird, Utah, August, 1981, SYMSAC '81, Assoc. Comp. Mach., New York, (1981), 1–5.

98. Cannon JJ. Effective procedures for the recognition of primitive groups, Proceedings of Symposia in Pure Mathematics, 37 (1980), 487–493. MR0604626

99. Cannon JJ. Software tools for group theory, Proceedings of Symposia in Pure Mathematics, 37 (1980), 495–502. MR0604627

100. Cannon JJ, McKay J, Young. Presentations for simple groups of order less than \(10^5\), Communications in Algebra, 7 (1979), 1397–1406. 80e:20023

101. Cannon JJ. A draft description of the group theory language Cayley, Proceedings of the 1976 ACM Symposium on Symbolic and Algebraic Computation, Yorktown Heights, N.Y., August 1976, Jenks RD (ed.), Assoc. Comp. Mach., New York, (1976), 66–84.

102. Cannon JJ. On the teaching of mathematics for the social sciences, Proceedings of a Conference on Mathematics needed for Particular Social Sciences, Canberra, May 1974, Australian Academy of Social Sciences, (1976), 228–237.

103. Cannon JJ. A general purpose group theory program, Proc. Second Internal. Conf. Theory of Groups, Canberra, 1973, Lecture Notes in Mathematics, 372 Springer-Verlag, Berlin, (1974), 204–217. MR0354823

104. Cannon JJ, Havas G. Defining relations for the Held-Higman-Thompson simple group, Bulletin of the Australian Mathematical Society, 11 (1974), 43–46. 50:13242

105. Cannon JJ. Construction of defining relations for finite groups, Discrete Mathematics, 5 (1973), 104–129.

106. Cannon JJ, Dimino, Havas G, Watson. Implementation and analysis of the Todd-Coxeter algorithm, Mathematics of Computation, 27 (1973), 463–490. 49:390

107. Cannon JJ. Graphs and defining relations, Proceedings of the First Australian Conference on Combinatorial Theory, Newcastle, June, 1972, University of Newcastle Research Associates, (1972), 215–233. MR0376872

108. Cannon JJ. Computing the ideal structure of finite semigroups, Numerische Mathematik, 18 (1971), 254–266. 45:6950

109. Cannon JJ. Computing local structure of large finite groups, SIAM-AMS Proceedings, 4 (1971), 161–176. MR0367027

110. Cannon JJ. Some combinatorial and symbol manipulation programs in group theory, In Computational Problems in Abstract Algebra, Leech J (ed.), Pergamon, (1970), 199–203. MR0263913

111. Cannon JJ. Computers in group theory: A survey, Communications of the ACM, 12 (1969), 1–12.

112. James R, Cannon JJ. Computation of isomorphism classes of \(p\)-groups, Mathematics of Computation, 23 (1969), 135–140. 39:313

113. Cannon JJ. A critique of algebraic programming languages, SIGSAM Bulletin, 12 (1969), 18–27.

114. Cannon JJ. Manipulation in algebraic structures: Commutative and non-commutative polynomial rings, Mathematical Algorithms, 3 (1968), 156–175. 40:6805

Number of matches: 114

Page 1 of 1

Select page: 1

The University of Sydney - School of Mathematics and Statistics

Publication Search Results

Publications of the Computational Algebra Research Group

Sitemap