On the public citation graph
Every finite lattice can be embedded in a finite partition lattice
0 signed · 114 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1017/s0305004100013463openalex-snapshot
On the Structure of Abstract Algebras
inferredcites →https://doi.org/10.1090/pspum/002/0136558openalex-snapshot
Generalized partitions and lattice embedding theorems
inferredcites →https://doi.org/10.1090/s0002-9904-1946-08602-4openalex-snapshot
Lattices, equivalence relations, and subgroups
inferredcites →https://doi.org/10.1090/s0002-9939-1956-0078960-4openalex-snapshot
Two Embedding Theorems for Finite Lattices
inferredcites →https://doi.org/10.1090/s0002-9939-1976-0392717-9openalex-snapshot
Finite Four-Generated Simple Lattices Contain All Finite Lattices
inferredcites →https://doi.org/10.7146/math.scand.a-10850openalex-snapshot
Algebras Whose Congruence Lattices are Distributive.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-8176-4462-8openalex-snapshot
The Congruences of a Finite Lattice: A "Proof-by-Picture" Approach
inferred← citeshttps://doi.org/10.1007/978-1-4899-3558-8_28openalex-snapshot
Dilworth’s Completion, Submodular Functions, and Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4899-3558-8_47openalex-snapshot
Dilworth’s Proof of the Embedding Theorem
inferred← citeshttps://doi.org/10.1007/978-3-030-01162-8_6openalex-snapshot
Algebraic Representation, Dualities and Beyond
inferred← citeshttps://doi.org/10.1007/978-3-032-03364-2_23openalex-snapshot
The E-Base of Finite Semidistributive Lattices
inferred← citeshttps://doi.org/10.1007/978-3-319-11478-1_6openalex-snapshot
Lattices, Closure Operators, and Galois Connections
inferred← citeshttps://doi.org/10.1007/978-3-319-38798-7_14openalex-snapshot
Sectionally Complemented Lattices
inferred← citeshttps://doi.org/10.1007/978-3-642-21774-6openalex-snapshot
From Objects to Diagrams for Ranges of Functors
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_68openalex-snapshot
Comparator Circuits over Finite Bounded Posets
inferred← citeshttps://doi.org/10.1007/bf01190437openalex-snapshot
A property of finite algebras havingM n 's as congruence lattices
inferred← citeshttps://doi.org/10.1007/bf01221790openalex-snapshot
Bjarni J�nsson's contributions in algebra
inferred← citeshttps://doi.org/10.1007/bf01221791openalex-snapshot
A perspective on algebraic representations of lattices
inferred← citeshttps://doi.org/10.1007/bf01894188openalex-snapshot
On the use of ordered sets in problems of comparison and consensus of classifications
inferred← citeshttps://doi.org/10.1007/bf01980215openalex-snapshot
Simple congruence lattices of finite graphs
inferred← citeshttps://doi.org/10.1007/bf02483117openalex-snapshot
General Lattice Theory: 1979 Problem Update
inferred← citeshttps://doi.org/10.1007/bf03549817openalex-snapshot
Notes on planar semimodular lattices. V. Cover-preserving embeddings of finite semimodular lattices into simple semimodular lattices
inferred← citeshttps://doi.org/10.1007/bfb0063444openalex-snapshot
Every finite algebra with congruence lattice M 7 has principal congruences
inferred← citeshttps://doi.org/10.1007/bfb0076217openalex-snapshot
Embeddings and extensions of embeddings in the r.e. tt and wtt-degrees
inferred← citeshttps://doi.org/10.1007/pl00000330openalex-snapshot
On the representation of lattices by subgroup lattices
inferred← citeshttps://doi.org/10.1007/s00012-004-1881-1openalex-snapshot
Finite lattices and congruences. A survey
inferred← citeshttps://doi.org/10.1007/s00012-005-1934-0openalex-snapshot
On lattices of convex sets in $${\mathbb{R}}^{n}$$
inferred← citeshttps://doi.org/10.1007/s00012-015-0333-4openalex-snapshot
A juggler’s dozen of easy† problems
inferred← citeshttps://doi.org/10.1007/s00012-018-0559-zopenalex-snapshot
Tight embedding of modular lattices into partition lattices: progress and program
inferred← citeshttps://doi.org/10.1007/s00012-019-0606-4openalex-snapshot
$$\Lambda $$-Ultrametric spaces and lattices of equivalence relations
inferred← citeshttps://doi.org/10.1007/s00012-020-00672-8openalex-snapshot
Lattice universality of locally finite 2-groups
inferred← citeshttps://doi.org/10.1007/s00013-011-0283-9openalex-snapshot
A Boolean algebra of characteristic subgroups of a finite group
inferred← citeshttps://doi.org/10.1007/s00233-012-9385-3openalex-snapshot
Modular and lower-modular elements of lattices of semigroup varieties
inferred← citeshttps://doi.org/10.1007/s00233-012-9403-5openalex-snapshot
Identities and quasiidentities in the lattice of overcommutative semigroup varieties
inferred← citeshttps://doi.org/10.1007/s10114-023-1531-1openalex-snapshot
The Best Extending Cover-preserving Geometric Lattices of Semimodular Lattices
inferred← citeshttps://doi.org/10.1007/s10958-025-07710-7openalex-snapshot
Frobenius and Sylvester Inequalities for the Chainable Rank
inferred← citeshttps://doi.org/10.1007/s11083-013-9304-6openalex-snapshot
Finite Intervals in the Lattice of Topologies
inferred← citeshttps://doi.org/10.1007/s11083-016-9397-9openalex-snapshot
Burnside Orders, Burnside Algebras and Partition Lattices
inferred← citeshttps://doi.org/10.1007/s11083-017-9426-3openalex-snapshot
The Homomorphism Lattice Induced by a Finite Algebra
inferred← citeshttps://doi.org/10.1007/s11083-019-09489-0openalex-snapshot
On Lattice Representations with Dcc Posets
inferred← citeshttps://doi.org/10.1007/s11202-005-0015-0openalex-snapshot
Computability potential scales of n-element algebras with restrictions on arity
inferred← citeshttps://doi.org/10.1007/s11537-022-2073-5openalex-snapshot
The lattice of varieties of monoids
inferred← citeshttps://doi.org/10.1016/0012-365x(81)90207-7openalex-snapshot
Recent results in partition (Ramsey) theory for finite lattices
inferred← citeshttps://doi.org/10.1016/0012-365x(83)90195-4openalex-snapshot
On representing Mn's by congruence lattice of finite algebras
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90235-lopenalex-snapshot
Cover preserving embedding of modular lattices into partition lattices
inferred← citeshttps://doi.org/10.1016/0021-8693(88)90230-xopenalex-snapshot
On Feit's examples of intervals in subgroup lattices
inferred← citeshttps://doi.org/10.1016/0021-8693(89)90171-3openalex-snapshot
Intervals in subgroup lattices of infinite groups
inferred← citeshttps://doi.org/10.1016/0022-0000(86)90019-xopenalex-snapshot
Partition semantics for relations
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90078-topenalex-snapshot
The p-T-degrees of the recursive sets: lattice embeddings, extensions of embeddings and the two-quantifier theory
inferred← citeshttps://doi.org/10.1016/b978-0-444-87759-8.50035-3openalex-snapshot
PERFECT CHAMBER SYSTEMS
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50010-5openalex-snapshot
10.1016/b978-044488002-4/50010-5
inferred← citeshttps://doi.org/10.1016/b978-044488355-1/50008-6openalex-snapshot
Dimensional Linear Spaces
inferred← citeshttps://doi.org/10.1016/j.aim.2010.05.001openalex-snapshot
A cover-preserving embedding of semimodular lattices into geometric lattices
inferred← citeshttps://doi.org/10.1016/j.disc.2014.04.017openalex-snapshot
Finite convex geometries of circles
inferred← citeshttps://doi.org/10.1016/j.ejc.2013.07.012openalex-snapshot
Representing finite convex geometries by relatively convex sets
inferred← citeshttps://doi.org/10.1016/j.ic.2018.02.002openalex-snapshot
Comparator Circuits over Finite Bounded Posets
inferred← citeshttps://doi.org/10.1016/j.laa.2017.03.032openalex-snapshot
A geometric study of cores of idempotent stochastic matrices
inferred← citeshttps://doi.org/10.1016/s0001-8708(02)00011-7openalex-snapshot
Join-semidistributive lattices and convex geometries
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70465-8openalex-snapshot
Substructure Lattices of Models of Peano Arithmetic
inferred← citeshttps://doi.org/10.1016/s0166-8641(99)00050-4openalex-snapshot
Every lattice with 1 and 0 is embeddable in the lattice of topologies of some set by an embedding which preserves the 1 and 0
inferred← citeshttps://doi.org/10.1016/s0168-0072(96)00037-1openalex-snapshot
Strong polynomial-time reducibility
inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00067-5openalex-snapshot
Lattice representations for computability theory
inferred← citeshttps://doi.org/10.1016/s0196-8858(03)00090-3openalex-snapshot
Problems related to type-A and type-B matrices of chromatic joins
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73839-8openalex-snapshot
Ensembles Ordonnes Et Taxonomie Mathematique
inferred← citeshttps://doi.org/10.1017/s0013091524000178openalex-snapshot
Minimal monoids generating varieties with complex subvariety lattices
inferred← citeshttps://doi.org/10.1023/b:allo.0000028929.28946.d6openalex-snapshot
Sublattices of Lattices of Convex Subsets of Vector Spaces
inferred← citeshttps://doi.org/10.1070/rm1991v046n05abeh002854openalex-snapshot
Solved problems in the Kourovka Notebook
inferred← citeshttps://doi.org/10.1090/pcms/013/09openalex-snapshot
Poset topology: Tools and applications
inferred← citeshttps://doi.org/10.1090/s0002-9939-1988-0962797-6openalex-snapshot
𝑀_{𝑛} as a 0,1-sublattice of 𝐶𝑜𝑛𝐴 does not force the term condition
inferred← citeshttps://doi.org/10.1090/s0002-9939-1991-1039528-7openalex-snapshot
Varieties with Cofinal Sets: Examples and Amalgamation
inferred← citeshttps://doi.org/10.1090/s0002-9939-99-04671-7openalex-snapshot
Congruence-preserving extensions of finite lattices to sectionally complemented lattices
inferred← citeshttps://doi.org/10.1090/s0002-9947-1987-0882702-4openalex-snapshot
Lattice Embeddings in the Recursively Enumerable Truth Table Degrees
inferred← citeshttps://doi.org/10.1090/s0002-9947-1994-1211411-0openalex-snapshot
Varieties of Commutative Semigroups
inferred← citeshttps://doi.org/10.1109/sct.1989.41804openalex-snapshot
The P-T-degrees of the recursive sets: lattice embeddings, extensions of embeddings and the two quantifier theory
inferred← citeshttps://doi.org/10.1112/blms.12392openalex-snapshot
Varieties of monoids with complex lattices of subvarieties
inferred← citeshttps://doi.org/10.1112/jlms/54.1.199openalex-snapshot
Descriptive Complexity and Reflective Properties of Combinatorial Configurations
inferred← citeshttps://doi.org/10.1134/s008154381207005xopenalex-snapshot
Embedding lattices into derived lattices
inferred← citeshttps://doi.org/10.1142/s0218196718400131openalex-snapshot
The lattice of flats of a boolean representable simplicial complex
inferred← citeshttps://doi.org/10.1155/s0161171298000325openalex-snapshot
Quasiorders, principal topologies, and partially ordered partitions
inferred← citeshttps://doi.org/10.14232/actasm-015-586-2openalex-snapshot
Lattices embeddable in three-generated lattices
inferred← citeshttps://doi.org/10.14232/actasm-020-126-7openalex-snapshot
Four-element generating sets of partition lattices and their direct products
inferred← citeshttps://doi.org/10.14232/actasm-021-303-1openalex-snapshot
(1 + 1 + 2)-generated lattices of quasiorders
inferred← citeshttps://doi.org/10.14232/phd.11171openalex-snapshot
On subuniverses of lattices and semilattices
inferred← citeshttps://doi.org/10.1515/dema-2015-0039openalex-snapshot
Lattices of Annihilators in Commutative Algebras Over Fields
inferred← citeshttps://doi.org/10.15826/umj.2025.1.004openalex-snapshot
A PAIR OF FOUR-ELEMENT HORIZONTAL GENERATING SETS OF A PARTITION LATTICE
inferred← citeshttps://doi.org/10.20944/preprints201804.0157.v1openalex-snapshot
Topological Information Data Analysis: Poincare-Shannon Machine and Statistical Physic of Finite Heterogeneous Systems
inferred← citeshttps://doi.org/10.21136/cmj.1995.128508openalex-snapshot
On infinite partition representations and their finite quotients
inferred← citeshttps://doi.org/10.2178/jsl/1286198152openalex-snapshot
Infinite substructure lattices of models of Peano Arithmetic
inferred← citeshttps://doi.org/10.2307/2046978openalex-snapshot
M n as a 0, 1-Sublattice of Con A Does not Force the Term Condition
inferred← citeshttps://doi.org/10.2307/2275710openalex-snapshot
Embedding lattices into the wtt-degrees below 0′
inferred← citeshttps://doi.org/10.3103/s1066369x09030013openalex-snapshot
Lattices of semigroup varieties
inferred← citeshttps://doi.org/10.3390/e13030683openalex-snapshot
On a Connection between Information and Group Lattices
inferred← citeshttps://doi.org/10.3390/e21090881openalex-snapshot
The Poincaré-Shannon Machine: Statistical Physics and Machine Learning Aspects of Information Cohomology
inferred← citeshttps://doi.org/10.48550/arxiv.1204.4305openalex-snapshot
Congruence lattices of finite algebras
inferred← citeshttps://doi.org/10.48550/arxiv.1704.03715openalex-snapshot
Tight embedding of modular lattices into partition lattices: progress and program
inferred← citeshttps://doi.org/10.48550/arxiv.1907.06486openalex-snapshot
The Poincaré-Boltzmann Machine: from Statistical Physics to Machine Learning and back
inferred← citeshttps://doi.org/10.48550/arxiv.2103.03145openalex-snapshot
A Ramsey Theorem for Graded Lattices
inferred← citeshttps://doi.org/10.48550/arxiv.2108.03773openalex-snapshot
Length-preserving extensions of semimodular lattices by lowering join-irreducible elements
inferred← citeshttps://doi.org/10.5486/pmd.2021.9024openalex-snapshot
Four-generated direct powers of partition lattices and authentication
inferred← citeshttps://doi.org/10.70930/tac/hvovv7msopenalex-snapshot
Copower Objects and their Applications to Finiteness in Topoi
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.