DOCSLIB.ORG

Polynomial Computer Algebra '2021

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Polynomial Computer Algebra '2021 Russian Academy of Sciences St.Petersburg Department of Steklov Mathematical Institute Euler International Mathematical Institute St.Petersburg Electrotechnical University "LETI" International Conference Polynomial Computer Algebra International Conference on Polynomial Computer Algebra St. Petersburg, April, 2018 Санкт Петербург 2018 ISBN 978-5-9651-1141-1 International Conference Polynomial Computer Algebra '2018 St. Petersburg, Russia April 16-21, 2018 International Euler Institute International Conference Polynomial Computer Algebra '2016; St. Petersburg, April 18-21 2018/ Euler International Mathematical Institute, Ed. by N.N.Vassiliev, VVM Pubishing, 2018, 121 p. The book contains short papers, extended abstracts and abstracts of reports presented at the International Conference on Polynomial Computer Algebra 2018, St.Petersburg, April 2018 © St. Petersburg department of Steklov Institute of Mathematics, RAS, 2018 Agenda April 16 9:30 – 10:20 Registration, coffee 10:20 – 10:30 Opening the conference 10:30 – 11:10 Vladimir Gerdt, Markus Lange-Hegermann, Daniel Robertz Thomas decomposition of differential systems andits implementation in Maple 11:10 – 11:40 Vladimir Kornyak Irreducible Decomposition of Representations of Finite Groups via Polynomial Computer Algebra 11:40 – 12:00 Coffee break 12:00 – 12:30 Ronen Peretz A sharp version of Shimizu’s theorem on entire automorphic functions 12:30 – 13:00 Nikolai Proskurin Notes on character sums and complex functions over finite fields 13:00 – 15:00 Lunch 15:00 – 15:30 Evgenii Mityushov, Natalia Misyura, Svetlana Berestova On finite subgroups of SO(3), regular polyhedrons in R4 and the spherical motion of rigid body 15:30 – 16:00 Alexandr Seliverstov Real cubic hypersurfaces containing no line of singular points 16:00 – 16:30 Coffee break 16:30 – 17:00 Mikhail Babich, Sergey Slavyanov Links between second-order Fuchsian equations and first- order linear systems 17:00 – 17:30 Aleksandr Salatich, Sergey Slavyanov Confluent Heun Equation and equivalent first-order systems 17:30 – 18:00 Maksim Karev Double Hurwitz Numbers 18:30 WELCOME PARTY 3 April 17 10:00 – 10:50 Lorenzo Robbiano Computational Linear and Commutative Algebra 10:50 – 11:20 Coffee break 11:20 – 12:10 Chenqi Mou On the chordality of polynomial sets in triangular decomposition in top-down style 12:10 – 13:00 Dima Grigoriev, Nicolai Vorobjov Upper bounds on Betti numbers of tropical prevarieties 13:00 – 15:00 Lunch 15:00 – 15:20 Sergei Soloviev, Mark Spivakovsky, Nikolay Vassiliev To the memory of Sergei Baranov 15:20 – 16:10 Anatoly Vershik To make simulation on algorithm RSK for Bernoulli sequences 16:10 – 16:40 Coffee break 16:40 – 17:10 Mikhail Malykh, Leonid Sevastianov, Yu Ying Elliptic functions and finite difference method 17:10 – 17:40 Andrei Malyutin What does a random knot look like? 17:40 – 18:10 Vahagn Abgaryan, Arsen Khvedelidze, Astghik Torosyan On a moduli space of the Wigner quasiprobability distributions April 18 10:00 – 10:50 Michela Ceria, Teo Mora Combinatorics of ideals of points: a Cerlienco-Mureddu- like approach for an iterative lex game. 10:50 – 11:20 Alexander Chistov A New Approach to Effective Computation of the Dimension of an Algebraic Variety 11:20 – 11:50 Coffee break 11:50 – 12:30 Martin Kreuzer, Le Ngoc Long, Lorenzo Robbiano On the Cayley-Bacharach Property 4 12:30 – 13:00 Alexander Batkhin q-Analogue of discriminant set and its computation 13:00 – 15:00 Lunch 15:00 – 15:30 Dominik Michels, Vladimir Gerdt, Dmitry Lyakhov, Yuri Blinkov On Strongly Consistent Finite Difference Approximations 15:30 – 16:00 Aleksandr Myll¨ari, Tatiana Myll¨ari,Anna Myullyari, Nikolay Vassiliev On the complexity of trajectories in the equal-mass free-fall three-body problem 16:00 – 16:30 Alexander Tiskin Weighted seaweed braids 16:30 – 17:00 Coffee break 17:00 – 17:30 Darya Chemkaeva, Alexander Flegontov Bifurcation diagrams for polynomial nonlinear ODE 17:30 – 18:00 Ioannis Parasidis, Efthimios Providas Factorization Method for the Second-Order LinearNonlocal Difference Equations 18:30 Chamber music Concert. Euler Institute April 19 10:00 – 10:40 Mark Spivakovsky On the Pierce-Birkhoff conjecture and related problems. 10:40 – 11:20 David R. Stoutemyer, David J. Jeffrey, Robert M.Corless Integration and the specialization problem 11:20 – 11:50 Coffee break 11:50 – 12:30 Nikolai Vavilov Reverse decomposition of unipotents 12:30 – 14:00 Lunch 14:00 Bus Excursion around St.Petersburg The bus will start from the Andersen hotel at 14:00. 19:00 BANQUET 5 April 20 10:00 – 10:40 Fedor Petrov Arithmetic progressions in 2-groups 10:40 – 11:10 Vasilii Duzhin, Nikolay Vassiliev Schutzenberger transformation on graded graphs: Implementation and numerical experiments. 11:10 – 11:40 Coffee break 11:40 – 12:10 Anton Chukhnov, Ilya Posov, Sergei Pozdniakov Computer assisted constructive tasks as tasks with infinite set of solutions for math olympiads and contests 12:10 – 12:40 Victor Edneral, Valery Romanovski Local and Global Integrability of ODEs 12:40 – 14:30 Lunch 14:30 – 15:00 Semjon Adlaj Back to solving the quintic, depression and Galois primes 15:00 – 15:30 Dmitry Pavlov Usage of Automatic Differentiation in Some Practical Problems of Celestial Mechanics 15:30 – 16:00 Dan Aksim, Dmitry Pavlov On the Extension of Adams–Bashforth–Moulton Methods for Numerical Integration of Delay Differential Equations and Application to the Moon’s Orbit 16:00 – 17:00 Free round table discussion, Closing of the Conference, coffee 6 Table of content Vahagn Abgaryan, Arsen Khvedelidze, Astghik Torosyan On a moduli space of the Wigner quasiprobability distributions . 10 Semjon Adlaj Back to solving the quintic, depression and Galois primes . 12 Dan Aksim, Dmitry Pavlov On the Extension of Adams–Bashforth–Moulton Methods for Numerical Integration of Delay Differential Equations and Application to the Moon’s Orbit.................................................. ....................17 Mikhail Babich, Sergey Slavyanov Links between second-order Fuchsian equations and first-order linear systems ................................................... .........................18 Alexander Batkhin q-Analogue of discriminant set and its computation . 20 Michela Ceria, Teo Mora Combinatorics of ideals of points: a Cerlienco-Mureddu- like approach for an iterative lex game. ..........25 Darya Chemkaeva, Alexander Flegontov Bifurcation diagrams for polynomial nonlinear ODE . 29 Alexander Chistov A New Approach to Effective Computation of the Dimension of an Algebraic Variety................................................ .................... 36 Anton Chukhnov, Ilya Posov, Sergei Pozdniakov Computer assisted constructive tasks as tasks with infinite set of solutions for math olympiads and contests. .39 Vasilii Duzhin, Nikolay Vassiliev Schutzenberger transformation on graded graphs: Implementation and numerical experiments.. .41 Victor Edneral, Valery Romanovski Local and Global Integrability of ODEs . 47 Vladimir Gerdt, Markus Lange-Hegermann, Daniel Robertz Thomas decomposition of differential systems andits implementation in Maple ................................................... .........................52 7 Dima Grigoriev, Nicolai Vorobjov Upper bounds on Betti numbers of tropical prevarieties . 54 Maksim Karev Double Hurwitz Numbers . 55 Vladimir Kornyak Irreducible Decomposition of Representations of Finite Groups via Polynomial Computer Algebra . 57 Martin Kreuzer, Le Ngoc Long, Lorenzo Robbiano On the Cayley-Bacharach Property. .62 Mikhail Malykh, Leonid Sevastianov, Yu Ying Elliptic functions and finite difference method . 66 Andrei Malyutin What does a random knot look like? . 69 Dominik Michels, Vladimir Gerdt, Dmitry Lyakhov, Yuri Blinkov On Strongly Consistent Finite Difference Approximations . 72 Evgenii Mityushov, Natalia Misyura, Svetlana Berestova On finite subgroups of SO(3), regular polyhedrons in R4 and the spherical motion of rigid body . .............76 Chenqi Mou On the chordality of polynomial sets in triangular decomposition in top-down style................................................. ......................78 Aleksandr Myll¨ari, Tatiana Myll¨ari, Anna Myullyari, Nikolay Vassiliev On the complexity of trajectories in the equal-mass free-fall three-body problem ................................................... .........................82 Ioannis Parasidis, Efthimios Providas Factorization Method for the Second-Order LinearNonlocal Difference Equations. ................85 Dmitry Pavlov Usage of Automatic Differentiation in Some Practical Problems of Celestial Mechanics . ................ 90 Ronen Peretz A sharp version of Shimizu’s theorem on entire automorphic functions . 91 8 Fedor Petrov Arithmetic progressions in 2-groups . 96 Nikolai Proskurin Notes on character sums and complex functions over finite fields. .97 Lorenzo Robbiano Computational Linear and Commutative Algebra . 104 Aleksandr Salatich, Sergey Slavyanov Confluent Heun Equation and equivalent first-order systems . 105 Alexandr Seliverstov Real cubic hypersurfaces containing no line of singular points . 109 Mark Spivakovsky On the Pierce-Birkhoff conjecture and related problems.. .111 David R. Stoutemyer, David J. Jeffrey, Robert M.Corless Integration and the specialization problem . 113 Alexander Tiskin Weighted seaweed braids . 118 Nikolai Vavilov Reverse decomposition of unipotents . 119 9 On a moduli space of the Wigner quasiprobability distributions Vahagn Abgaryan, Arsen Khvedelidze and Astghik Torosyan Nowadays, due to the quantum engineering needs, a long-standing problem of nding
Load more

Recommended publications
  • On the Classification of Finite Simple Groups
    On the Classification of Finite Simple Groups Niclas Bernhoff Division for Engineering Sciences, Physics and Mathemathics Karlstad University April6,2004 Abstract This paper is a small note on the classification of finite simple groups for the course ”Symmetries, Groups and Algebras” given at the Depart- ment of Physics at Karlstad University in the Spring 2004. 1Introduction In 1892 Otto Hölder began an article in Mathematische Annalen with the sen- tence ”It would be of the greatest interest if it were possible to give an overview of the entire collection of finite simple groups” (translation from German). This can be seen as the starting point of the classification of simple finite groups. In 1980 the following classification theorem could be claimed. Theorem 1 (The Classification theorem) Let G be a finite simple group. Then G is either (a) a cyclic group of prime order; (b) an alternating group of degree n 5; (c) a finite simple group of Lie type;≥ or (d) one of 26 sporadic finite simple groups. However, the work comprises in total about 10000-15000 pages in around 500 journal articles by some 100 authors. This opens for the question of possible mistakes. In fact, around 1989 Aschbacher noticed that an 800-page manuscript on quasithin groups by Mason was incomplete in various ways; especially it lacked a treatment of certain ”small” cases. Together with S. Smith, Aschbacher is still working to finish this ”last” part of the proof. Solomon predicted this to be finished in 2001-2002, but still until today the paper is not completely finished (see the homepage of S.
    [Show full text]
  • Janko's Sporadic Simple Groups
    Janko’s Sporadic Simple Groups: a bit of history Algebra, Geometry and Computation CARMA, Workshop on Mathematics and Computation Terry Gagen and Don Taylor The University of Sydney 20 June 2015 Fifty years ago: the discovery In January 1965, a surprising announcement was communicated to the international mathematical community. Zvonimir Janko, working as a Research Fellow at the Institute of Advanced Study within the Australian National University had constructed a new sporadic simple group. Before 1965 only five sporadic simple groups were known. They had been discovered almost exactly one hundred years prior (1861 and 1873) by Émile Mathieu but the proof of their simplicity was only obtained in 1900 by G. A. Miller. Finite simple groups: earliest examples É The cyclic groups Zp of prime order and the alternating groups Alt(n) of even permutations of n 5 items were the earliest simple groups to be studied (Gauss,≥ Euler, Abel, etc.) É Evariste Galois knew about PSL(2,p) and wrote about them in his letter to Chevalier in 1832 on the night before the duel. É Camille Jordan (Traité des substitutions et des équations algébriques,1870) wrote about linear groups defined over finite fields of prime order and determined their composition factors. The ‘groupes abéliens’ of Jordan are now called symplectic groups and his ‘groupes hypoabéliens’ are orthogonal groups in characteristic 2. É Émile Mathieu introduced the five groups M11, M12, M22, M23 and M24 in 1861 and 1873. The classical groups, G2 and E6 É In his PhD thesis Leonard Eugene Dickson extended Jordan’s work to linear groups over all finite fields and included the unitary groups.
    [Show full text]
  • Biased Tadpoles: a Fast Algorithm for Centralizers in Large Matrix Groups
    Biased Tadpoles: a Fast Algorithm for Centralizers in Large Matrix Groups Daniel Kunkle and Gene Cooperman College of Computer and Information Science Northeastern University Boston, MA, USA [email protected], [email protected] ABSTRACT of basis formula in linear algebra. Given a group G, the def Centralizers are an important tool in in computational group centralizer subgroup of g G is defined as G(g) = h: h h ∈ C { ∈ theory. Yet for large matrix groups, they tend to be slow. G, g = g . } We demonstrate a O(p G (1/ log ε)) black box randomized Note that the above definition of centralizer is well-defined algorithm that produces| a| centralizer using space logarith- independently of the representation of G. Even for permu- mic in the order of the centralizer, even for typical matrix tation group representations, it is not known whether the groups of order 1020. An optimized version of this algorithm centralizer problem can be solved in polynomial time. Nev- (larger space and no longer black box) typically runs in sec- ertheless, in the permutation group case, Leon produced a onds for groups of order 1015 and minutes for groups of or- partition backtrack algorithm [8, 9] that is highly efficient der 1020. Further, the algorithm trivially parallelizes, and so in practice both for centralizer problems and certain other linear speedup is achieved in an experiment on a computer problems also not known to be in polynomial time. Theißen with four CPU cores. The novelty lies in the use of a bi- produced a particularly efficient implementation of partition ased tadpole, which delivers an order of magnitude speedup backtrack for GAP [17].
    [Show full text]
  • New Criteria for the Solvability of Finite Groups
    CORE Metadata, citation and similar papers at core.ac.uk Provided by Elsevier - Publisher Connector JOURNAL OF ALGEBRA 77. 234-246 (1982) New Criteria for the Solvability of Finite Groups ZVI ARAD DePartment of Malhematics, Bar-llan Utzioersity. Kamat-Gun. Israel AND MICHAEL B. WARD Department of Mathemalics, Bucknell University, Lewisburg, Penrtsylcania I7837 Communicared by Waher Feif Received September 27. 1981 1. INTRODUCTION All groups considered in this paper are finite. Suppose 7~is a set of primes. A subgroup H of a group G is called a Hall 7r-subgroup of G if every prime dividing ] HI is an element of x and no prime dividing [G : H ] is an element of 71.When p is a prime, p’ denotes the set of all primes different from p. In Hall’s famous characterization of solvable groups he proves that a group is solvable if and only if it has a Hall p’-subgroup for each prime p (see [6] or [ 7, p. 291]). It has been conjectured that a group is solvable if and only if it has a Hall 2’-subgroup and a Hall 3’subgroup (see [ 11). We verify this conjecture for groups whose composition factors are known simple groups. Along the way we also verify (for groups whose composition factors are known simple groups) a conjecture of Hall’s that if a group has a Hall ( p, q}-subgroup for every pair of primes p, 9, then the group is solvable [7, p. 2911. Thus, if one assumes the classification of finite simple groups, then both of these conjectures are settled in the affirmative.
    [Show full text]
  • Arxiv:1804.05648V2 [Math.GR] 8 Aug 2018 Xml,Ta Si H Prdcsml Ru Fhl.Terlvn Sub Relevant the 104]
    A NEGATIVE ANSWER TO A QUESTION OF ASCHBACHER ROBERT A. WILSON Abstract. We give infinitely many examples to show that, even for simple groups G, it is possible for the lattice of overgroups of a subgroup H to be the Boolean lattice of rank 2, in such a way that the two maximal overgroups of H are conjugate in G. This answers negatively a question posed by Aschbacher. 1. The question In a recent survey article on the subgroup structure of finite groups [1], in the context of discussing open problems on the possible structures of subgroup lattices of finite groups, Aschbacher poses the following specific question. Let G be a finite group, H a subgroup of G, and suppose that H is contained in exactly two maximal subgroups M1 and M2 of G, and that H is maximal in both M1 and M2. Does it follow that M1 and M2 are not conjugate in G? This is Question 8.1 in [1]. For G a general group, he asserts there is a counterexample, not given in [1], so he restricts this question to the case G almost simple, that is S ≤ G ≤ Aut(S) for some simple group S. This is Question 8.2 in [1]. 2. The answer In fact, the answer is no, even for simple groups G. The smallest example seems to be the simple Mathieu group M12 of order 95040. Theorem 1. Let G = M12, and H =∼ A5 acting transitively on the 12 points permuted by M12. Then H lies in exactly two other subgroups of G, both lying in the single conjugacy class of maximal subgroups L2(11).
    [Show full text]
  • Moonshines for L2(11) and M12
    Moonshines for L2(11) and M12 Suresh Govindarajan Department of Physics Indian Institute of Technology Madras (Work done with my student Sutapa Samanta) Talk at the Workshop on Modular Forms and Black Holes @NISER, Bhubaneswar on January 13. 2017 Plan Introduction Some finite group theory Moonshine BKM Lie superalgebras Introduction Classification of Finite Simple Groups Every finite simple group is isomorphic to one of the following groups: (Source: Wikipedia) I A cyclic group with prime order; I An alternating group of degree at least 5; I A simple group of Lie type, including both I the classical Lie groups, namely the groups of projective special linear, unitary, symplectic, or orthogonal transformations over a finite field; I the exceptional and twisted groups of Lie type (including the Tits group which is not strictly a group of Lie type). I The 26 sporadic simple groups. The classification was completed in 2004 when Aschbacher and Smith filled the last gap (`the quasi-thin case') in the proof. Fun Reading: Symmetry and the Monster by Mark Ronan The sporadic simple groups I the Mathieu groups: M11, M12, M22, M23, M24; (found in 1861) I the Janko groups: J1, J2, J3, J4; (others 1965-1980) I the Conway groups; Co1, Co2, Co3; 0 I the Fischer groups; Fi22. Fi23, Fi24; I the Higman-Sims group; HS I the McLaughlin group: McL I the Held group: He; I the Rudvalis group Ru; I the Suzuki sporadic group: Suz; 0 I the O'Nan group: O N; I Harada-Norton group: HN; I the Lyons group: Ly; I the Thompson group: Th; I the baby Monster group: B and Sources: Wikipedia and Mark Ronan I the Fischer-Griess Monster group: M Monstrous Moonshine Conjectures I The j-function has the followed q-series: (q = exp(2πiτ)) j(τ)−744 = q−1+[196883+1] q+[21296876+196883+1] q2+··· I McKay observed that 196883 and 21296876 are the dimensions of the two smallest irreps of the Monster group.
    [Show full text]
  • Anatomy of the Monster: II
    Anatomy of the Monster: II Simon P. Norton DPMMS, Centre for Mathematical Sciences, Cambridge University, Wilberforce Road, Cambridge CB3 0WB and Robert A. Wilson School of Mathematics and Statistics, The University of Birmingham, Edgbaston, Birmingham B15 2TT published in Proc. London Math. Soc. 84 (2002), 581{598 Abstract We describe the current state of progress on the maximal subgroup problem for the Monster sporadic simple group. Any unknown max- imal subgroup is an almost simple group whose socle is in one of 19 specified isomorphism classes. 1 Introduction The Monster group M is the largest of the 26 sporadic simple groups, and has order 808 017 424 794 512 875 886 459 904 961 710 757 005 754 368 000 000 000: 1 It was first constructed by Griess [3], as a group of 196884×196884 matrices. This construction was carried out entirely by hand. In [9] Linton, Parker, Walsh and the second author constructed the 196882-dimensional irreducible representation of the Monster over GF (2). In [4] Holmes and the second author constructed the 196882-dimensional representation over GF (3). Much work has been done on the subgroup structure of the Monster. Un- published work by the first author includes the p-local analysis for p ≥ 5, which was repeated (with corrections) by the second author, and extended to p ≥ 3 (see [20]). The local analysis was completed with Meierfrankenfeld and Shpectorov's solution of the 2-local problem, also unpublished after sev- eral years [10]. The first author has also worked extensively on the non-local subgroups [11].
    [Show full text]
  • On the Symmetric Generation of Finite Groups
    On the Symmetric Generation of Finite Groups by Benjamin Thomas Fairbairn A thesis submitted to The University of Birmingham for the degree of Doctor of Philosophy Z Z s Z Z £C Z hh £ sC (Z( B h ( ¢ s @ £ C s B s @£ C s ¢ B £ C ¢ B @ ¢ £ @ C B £ @C ¢ B @ ¢ BB ss @¢¢ s s School of Mathematics The University of Birmingham November 2008 University of Birmingham Research Archive e-theses repository This unpublished thesis/dissertation is copyright of the author and/or third parties. The intellectual property rights of the author or third parties in respect of this work are as defined by The Copyright Designs and Patents Act 1988 or as modified by any successor legislation. Any use made of information contained in this thesis/dissertation must be in accordance with that legislation and must be properly acknowledged. Further distribution or reproduction in any format is prohibited without the permission of the copyright holder. Abstract In this thesis we discuss some uses and applications of the techniques in Symmetric gen- eration. In Chapter 1 we introduce the notions of symmetric generation. In Chapter 2 we discuss symmetric presentations defined by symmetric generating sets that are preserved by a group acting on them transitively but imprimitively. In Chapter 3 our attention turns to Coxeter groups. We show how the Coxeter-Moser presentations traditionally associated with the families of finite Coxeter groups of types An, Dn and En (ie the “simply laced” Coxeter groups) may be interpreted as symmetric presentations and as such may be naturally arrived at by elementary means.
    [Show full text]
  • Maximal Subgroups of Sporadic Groups Was Pe- Tra (Beth) Holmes, Whose Phd Thesis on ‘Computing in the Monster’ Dates from 2002
    MAXIMAL SUBGROUPS OF SPORADIC GROUPS ROBERT A. WILSON Abstract. A systematic study of maximal subgroups of the sporadic simple groups began in the 1960s. The work is now almost complete, only a few cases in the Monster remaining outstanding. We give a survey of results obtained, and methods used, over the past 50 years, for the classification of maximal subgroups of sporadic simple groups, and their automorphism groups. 1. Introduction The subtitle of the ‘Atlas of Finite Groups’ [7] is ‘Maximal Subgroups and Or- dinary Characters for Simple Groups’. These two aspects of the study of finite simple groups remain at the forefront of research today. The Atlas was dedicated to collecting facts, not to providing proofs. It contains an extensive bibliography, but not citations at the point of use, making it difficult for the casual reader to track down proofs. In the ensuing 30 years, moreover, the landscape has changed dramatically, both with the appearance of new proofs in the literature, and with the ability of modern computer algebra systems to recompute much of the data in the twinkling of an eye. As far as maximal subgroups are concerned, shortly before the publication of the Atlas it became clear that the maximal subgroup project should be extended to almost simple groups. The reason for this is that it is not possible to deduce the maximal subgroups of an almost simple group directly from the maximal subgroups of the corresponding simple group. This was made clear by the examples described in [49], especially perhaps the maximal subgroup S5 of M12:2, which is neither the normalizer of a maximal subgroup of M12, nor the normalizer of the intersection of two non-conjugate maximal subgroups of M12.
    [Show full text]
  • Kimmerle Conjecture for the Held and O'nan Sporadic
    Scientiae Mathematicae Japonicae Online, e-2009, 233–241 233 KIMMERLE CONJECTURE FOR THE HELD AND O’NAN SPORADIC SIMPLE GROUPS V. BOVDI, A. GRISHKOV, A. KONOVALOV Received December 1, 2008 Dedicated to 65th birthday of Professor Pali D¨om¨osi Abstract. Using the Luthar–Passi method, we investigate the Zassenhaus and Kim- merle conjectures for normalized unit groups of integral group rings of the Held and O’Nan sporadic simple groups. We confirm the Kimmerle conjecture for the Held sim- ple group and also derive for both groups some extra information relevant to the classical Zassenhaus conjecture. Let U(ZG) be the unit group of the integral group ring ZG of a finite group G. It is well known that U(ZG)=U(Z) × V (ZG), where V (ZG)= αgg ∈ U(ZG) | αg =1,αg ∈ Z . g∈G g∈G is the normalized unit group of U(ZG). Throughout the paper (unless stated otherwise) the unit is always normalized and not equal to the identity element of G. One of most interesting conjectures in the theory of integral group ring is the conjec- ture (ZC) of H. Zassenhaus [27], saying that every normalized torsion unit u ∈ V (ZG)is conjugate to an element in G within the rational group algebra QG. For finite simple groups, the main tool of the investigation of the Zassenhaus conjecture (ZC) is the Luthar–Passi method, introduced in [21] to solve this conjecture for the alter- nating group A5. Later in [18] M. Hertweck applied it for some other groups using p-Brauer characters, and then extended the previous result by M.
    [Show full text]
  • A Monster Tale: a Review on Borcherds' Proof of Monstrous Moonshine Conjecture
    A monster tale: a review on Borcherds’ proof of monstrous moonshine conjecture by Alan Gerardo Reyes Figueroa Instituto de Matem´atica Pura e Aplicada IMPA A monster tale: a review on Borcherds’ proof of monstrous moonshine conjecture by Alan Gerardo Reyes Figueroa Disserta¸c˜ao Presented in partial fulfillment of the requirements for the degree of Mestre em Matem´atica Instituto de Matem´atica Pura e Aplicada IMPA Maio de 2010 A monster tale: a review on Borcherds’ proof of monstrous moonshine conjecture Alan Gerardo Reyes Figueroa Instituto de Matem´atica Pura e Aplicada APPROVED: 26.05.2010 Hossein Movasati, Ph.D. Henrique Bursztyn, Ph.D. Am´ılcar Pacheco, Ph.D. Fr´ed´eric Paugam, Ph.D. Advisor: Hossein Movasati, Ph.D. v Abstract The Monster M is the largest of the sporadic simple groups. In 1979 Conway and Norton published the remarkable paper ‘Monstrous Moonshine’ [38], proposing a completely unex- pected relationship between finite simple groups and modular functions, in which related the Monster to the theory of modular forms. Conway and Norton conjectured in this paper that there is a close connection between the conjugacy classes of the Monster and the action of certain subgroups of SL2(R) on the upper half plane H. This conjecture implies that extensive information on the representations of the Monster is contained in the classical picture describing the action of SL2(R) on the upper half plane. Monstrous Moonshine is the collection of questions (and few answers) that these observations had directly inspired. In 1988, the book ‘Vertex Operator Algebras and the Monster’ [67] by Frenkel, Lepowsky and Meurman appeared.
    [Show full text]
  • On Self-Orthogonal Designs and Codes Related to Held’S Simple Group
    Advances in Mathematics of Communications doi:10.3934/amc.2018036 Volume 12, No. 3, 2018, 607{628 ON SELF-ORTHOGONAL DESIGNS AND CODES RELATED TO HELD'S SIMPLE GROUP Dean Crnkovic´ and Vedrana Mikulic´ Crnkovic´ Department of Mathematics, University of Rijeka Radmile Matejˇci´c2 51000 Rijeka, Croatia Bernardo G. Rodrigues School of Mathematics, Statistics and Computer Science, University of KwaZulu-Natal University Road Private Bag X54001 Westville Campus Durban 4041, South Africa (Communicated by Mario Osvin Pavcevic) Abstract. A construction of designs acted on by simple primitive groups is used to find some 1-designs and associated self-orthogonal, decomposable and irreducible codes that admit the simple group He of Held as an auto- morphism group. The properties of the codes are given and links with mod- ular representation theory are established. Further, we introduce a method of constructing self-orthogonal binary codes from orbit matrices of weakly self-orthogonal designs. Furthermore, from the support designs of the ob- tained self-orthogonal codes we construct strongly regular graphs with param- eters (21,10,3,6), (28,12,6,4), (49,12,5,2), (49,18,7,6), (56,10,0,2), (63,30,13,15), (105,32,4,12), (112,30,2,10) and (120,42,8,18). 1. Introduction After having constructed Steiner systems from finite groups, Witt in the papers [32, 33] highlights the links between design theory and the theory of finite groups. Further results that are significant for the method of construction used in this paper were the constructions of a 2-(276; 100; 1458) on which Co3 acts doubly transitively on points and primitively on blocks in [12] and that of a 2-(126; 36; 14) design from a primitive group isomorphic to U3(5):2 in [25].
    [Show full text]