A juggler’s dozen of easy† problems

McNulty, George F.

doi:10.1007/s00012-015-0333-4

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction2

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2015

2020

Publication Types

Select...

Article5

Relationship

Self Cite0

Independent5

Authors

Journals

Cited by 5 publications

(2 citation statements)

References 65 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The finite lattice representation problem asks whether every finite lattice is isomorphic to the congruence lattice of a finite universal algebra. This problem is one of the oldest [12] and most important in universal algebra [1,2,4,10,14,16]. Pálfy and Pudlák [15] have reduced the problem to the question, is every finite lattice isomorphic to an interval in the subgroup lattice of a finite group?…”

Section: Introductionmentioning

confidence: 99%

A Minimal Congruence Lattice Representation For

Bunn¹,

Grow²,

Insall³

et al. 2020

J. Aust. Math. Soc.

View full text Add to dashboard Cite

show abstract

Section: Introductionmentioning

confidence: 99%

A Minimal Congruence Lattice Representation For

Bunn¹,

Grow²,

Insall³

et al. 2020

J. Aust. Math. Soc.

View full text Add to dashboard Cite

show abstract

“…In this paper, we shall make a start on Problem 6 from George McNulty's Dozen Easy Problems [17]: "Which finite automatic algebras are dualizable? "…”

Section: Introductionmentioning

confidence: 99%