activity
20122021
most citedA note on finite lattices with many congruences

14 citations · 17 across the 7 of their papers we have counts for

collaborators

22 papers

math.RA2021

Length-preserving extensions of semimodular lattices by lowering join-irreducible elements

Gábor Czédli

We prove that if is a join-irreducible element of a semimodular lattice of finite length and in such that does not cover , then can be "lowered" to a c…

math.CO2021

Revisiting Faigle geometries from a perspective of semimodular lattices

Gábor Czédli

In 1980, U. Faigle introduced a sort of finite geometries on posets that are in bijective correspondence with finite semimodular lattices. His result has almost been forgotten in l…

math.RA2021

Absolute retracts for finite distributive lattices and slim semimodular lattices

Gábor Czédli, Ali Molkhasi

We describe the absolute retracts for the following classes of finite lattices: (1) slim semimodular lattices, (2) finite distributive lattices, and for each positive integer ,…

math.RA20213 cited

Slim patch lattices as absolute retracts and maximal lattices

Gábor Czédli

Patch lattices, introduced by G. Czédli and E.T. Schmidt in 2013, are the building stones for slim (and so necessarily finite and planar) semimodular lattices with respect to gluin…

math.CO2021

(1+1+2)-generated lattices of quasiorders

Delbrin Ahmed, Gábor Czédli

A lattice is -generated if it has a four-element generating set such that exactly two of the four generators are comparable. We prove that the lattice Quo of all quas…

math.LO2021

Cyclic congruences of slim semimodular lattices and non-finite axiomatizability of some finite structures

Gábor Czédli

We give a new proof of the fact that finite bipartite graphs cannot be axiomatized by finitely many first-order sentences among FINITE graphs. (This fact is a consequence of a gene…