The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Computational Problems in Abstract Algebra
Abstract
Defining relations for subgroups of finite index of groups
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The algebraic theory of semigroups
Clifford, A. H., & Preston, G. B. (1964) · CERN Document Server (European Organization for Nuclear Research) · Cited by 3,638
Mathematical Description of Linear Dynamical Systems
Kalman, R. E. (1963) · Journal of the Society for Industrial and Applied Mathematics Series A Control · doi:10.1137/0301010 · Cited by 1,738
Representation Theory of Finite Groups and Associative Algebras.
Linton, F. E. J., Curtis, C. W., & Reiner, I. (1965) · The American Mathematical Monthly · doi:10.2307/2311038 · Cited by 957
Effective construction of linear state-variable models from input/output functions.
Ho, B. L., & Kalman, R. E. (1965) · NASA Technical Reports Server (NASA) · Cited by 810
An enumeration of knots and links, and some of their algebraic properties
Conway, J. (1970) · Elsevier eBooks · doi:10.1016/b978-0-08-012975-4.50034-5 · Cited by 704
On Theories with a Combinatorial Definition of "Equivalence"
Newman, M. H. A. (1942) · Annals of Mathematics · doi:10.2307/1968867 · Cited by 664
SOLVABILITY OF GROUPS OF ODD ORDER
Feit, W., & Thompson, J. G. (2012) · Cited by 385
Generators and Relations for Discrete Groups
S., D., Coxeter, H. S. M., & Moser, W. O. J. (1965) · Mathematics of Computation · doi:10.2307/2003966 · Cited by 261
Effective procedures in field theory
Fröhlich, A., & Shepherdson, J. C. (1956) · Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences · doi:10.1098/rsta.1956.0003 · Cited by 249
A Machine-Oriented Logic Based on the Resolution Principle
Robinson, J. A. (1965) · Automation of Reasoning · doi:10.1007/978-3-642-81952-0_26 · Cited by 234
Cited by
On the Vassiliev knot invariants
Bar-Natan, D. (1995) · Topology · doi:10.1016/0040-9383(95)93237-2 · Cited by 951
Equations and Rewrite Rules: A Survey
Huet, G., & Oppen, D. C. (1980) · Formal Language Theory · doi:10.1016/b978-0-12-115350-2.50017-8 · Cited by 714
DERSHOWITZ, N., & JOUANNAUD, J.-P. (1990) · Formal Models and Semantics · doi:10.1016/b978-0-444-88074-1.50011-1 · Cited by 579
Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
Lakshmivarahan, S., Jwo, J.-S., & Dhall, S. K. (1993) · Parallel Computing · doi:10.1016/0167-8191(93)90054-o · Cited by 327
Macro-operators: A weak method for learning
Korf, R. E. (1985) · Artificial Intelligence · doi:10.1016/0004-3702(85)90012-8 · Cited by 287
Metadata
- Authors
- Brown, H., & Leech, J.
- Venue
- Mathematics of Computation
- Publisher
- JSTOR
- Published
- 1971-01
- Volume
- 25
- Issue
- 113
- Pages
- 193
- ISSN
- 0025-5718 (ISSN-L)
- OpenAlex
- W2016433302
- Cited by
- 589
- References
- 17
- FWCI
- 5.58
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Computational Problems in Abstract Algebra. https://app.cochat.ai/papers/10.2307/2005152
- The paper
- Brown, H., & Leech, J. (1971). Computational Problems in Abstract Algebra. Mathematics of Computation. https://doi.org/10.2307/2005152
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.