On the public citation graph

On the Frattini sublattice of a lattice

0 signed · 20 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.2307/1969001openalex-snapshot
Free Lattices
inferredcites →https://doi.org/10.2969/jmsj/00230228openalex-snapshot
On Maximal Proper Sublattices.
inferredcites →https://doi.org/10.4064/cm-21-2-191-196openalex-snapshot
Relatively free lattices
inferredcites →https://doi.org/10.4153/cjm-1962-035-1openalex-snapshot
The Lattice of Subalgebras of a Boolean Algebra

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-642-11928-6_7openalex-snapshot
Lattice Drawings and Morphisms
inferred← citeshttps://doi.org/10.1007/bf01194539openalex-snapshot
Maximal and completely meet irreducible sublattices of a distributive lattice
inferred← citeshttps://doi.org/10.1007/bf01233919openalex-snapshot
Maximal sublattices of finite distributive lattices
inferred← citeshttps://doi.org/10.1007/bf01235173openalex-snapshot
The Frattini sublattice of a finite distributive lattice
inferred← citeshttps://doi.org/10.1007/bf01246623openalex-snapshot
S-verklebte Summen von Verb�nden
inferred← citeshttps://doi.org/10.1007/bf02115815openalex-snapshot
Deciding Frattini is NP-complete
inferred← citeshttps://doi.org/10.1007/bf02483727openalex-snapshot
On the purity of the lattice of sublattices of a finite distributive lattice
inferred← citeshttps://doi.org/10.1007/bf02485236openalex-snapshot
On the frattini sublattice of a finite distributive lattice
inferred← citeshttps://doi.org/10.1007/bf02485383openalex-snapshot
An algorithm for determining Φ(L) in finite distributive lattices
inferred← citeshttps://doi.org/10.1007/bf02945121openalex-snapshot
The Frattini sublattice of a distributive lattice
inferred← citeshttps://doi.org/10.1007/bf02945131openalex-snapshot
Frattini sublattices of distributive lattices
inferred← citeshttps://doi.org/10.1007/bf02945132openalex-snapshot
On the Frattini sublattice of a finite modular planar lattice
inferred← citeshttps://doi.org/10.1016/s0079-8169(08)61359-8openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1017/s0013091500017806openalex-snapshot
Maximal subalgebras of Heyting algebras
inferred← citeshttps://doi.org/10.1017/s1446788700000355openalex-snapshot
Maximal sublattices and Frattini sublattices of bounded lattices
inferred← citeshttps://doi.org/10.3836/tjm/1270213877openalex-snapshot
On the Strong Purity of the Sublattice-Lattice of a Finite Distributive Lattice
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.