Converse Lagrange theorem orders and supersolvable orders
| dc.contributor.author | MacHale, Desmond | |
| dc.contributor.author | Manning, Joseph | |
| dc.date.accessioned | 2021-10-08T13:55:44Z | |
| dc.date.available | 2021-10-08T13:55:44Z | |
| dc.date.issued | 2016 | |
| dc.date.updated | 2021-10-08T13:26:07Z | |
| dc.description.abstract | For finite groups, we investigate both converse Lagrange theorem (CLT) orders and supersolvable (SS) orders, and see that the latter form a proper subset of the former. We focus on the difference between these two sets of orders, reformulate the work of earlier authors algorithmically, and construct a computer program to enumerate such NSS-CLT orders. We establish several results relating to NSS and CLT orders and, working from our computer-generated data, propose a pair of conjectures and obtain a complete characterization of the most common form of NSS-CLT order. | en |
| dc.description.status | Peer reviewed | en |
| dc.description.version | Published Version | en |
| dc.format.mimetype | application/pdf | en |
| dc.identifier.articleid | 16.8.7 | en |
| dc.identifier.citation | MacHale, D. and Manning, J. (2016) 'Converse Lagrange theorem orders and supersolvable rders', Journal of Integer Sequences, 19 (8), 16.8.7, (11 pp). | en |
| dc.identifier.endpage | 11 | en |
| dc.identifier.issn | 1530-7638 | |
| dc.identifier.issued | 8 | en |
| dc.identifier.journaltitle | Journal of Integer Sequences | en |
| dc.identifier.startpage | 1 | en |
| dc.identifier.uri | https://hdl.handle.net/10468/12071 | |
| dc.identifier.volume | 19 | en |
| dc.language.iso | en | en |
| dc.publisher | University of Waterloo | en |
| dc.relation.uri | https://cs.uwaterloo.ca/journals/JIS/vol19.html | |
| dc.rights | © The Authors 2016. | en |
| dc.subject | Supersolvable (SS) orders | en |
| dc.subject | Lagrange theorem (CLT | en |
| dc.title | Converse Lagrange theorem orders and supersolvable orders | en |
| dc.type | Article (peer-reviewed) | en |
