OpenAlex ·
Non-dyadic Laver algebras
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2610.06106
- Original
- Read it at the publisher
- Topics
Abstract
We study finite Laver algebras, the generalizations of Laver tables on sets of cardinality not of the form $2^n$. We characterize the conditions under which projections and embeddings between Laver algebras exist and show that there are $2^{\aleph_0}$ pairwise non-isomorphic direct limits of finite Laver algebras.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Computational Complexity
An AI-Assisted Formalization of the Poincaré Conjecture
Sharp Riesz capacity inequalities and the Pólya--Szegő conjecture
Character expansions and affine Jacobi-Trudi identities
Resolving Erdős-Ulam Monochromatic Union-Closed Family Conjectures
Computations of the slice genus and the unknotting number of links via machine learning
Get the few papers worth your time in Computational Complexity every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.