English
Related papers

Related papers: Notes on planar semimodular lattices. I. Construct…

200 papers

We propose a construction of lattices from codes corresponding to lattices of type $A_n$, $D_n$ and $E_n$. This construction is a generalization of construction A of lattices from $p$-ary codes corresponding to a lattice of type $A_{p-1}$.…

Number Theory · Mathematics 2025-02-28 Riku Higa

This article is the second part of an essay dedicated to lattices freely generated by posets within a variety. The first part dealt with four easy varieties while this part is concerned with finitely generated varieties. Here we present a…

Combinatorics · Mathematics 2010-07-12 Jean Yves Semegni , Marcel Wild

There is a family of constructions to produce orthomodular structures from modular lattices, lattices that are M and M*-symmetric, relation algebras, the idempotents of a ring, the direct product decompositions of a set or group or…

Quantum Algebra · Mathematics 2013-11-13 John Harding , Taewon Yang

We propose a construction of lattices from (skew-) polynomial codes, by endowing quotients of some ideals in both number fields and cyclic algebras with a suitable trace form. We give criteria for unimodularity. This yields integral and…

Information Theory · Computer Science 2020-04-06 Grégory Berhuy , Frédérique Oggier

A lattice L is slim if it is finite and the set of its join-irreducible elements contains no three-element antichain. Slim, semimodular lattices were previously characterized by G. Cz\'edli and E.T. Schmidt as the duals of the lattices…

Rings and Algebras · Mathematics 2012-08-31 Gábor Czédli , Tamás Dékány , László Ozsvárt , Nóra Szakács , Balázs Udvari

For many equation-theoretical questions about modular lattices, Hall and Dilworth give a useful construction: Let $L_0$ be a lattice with largest element $u_0$, $L_1$ be a lattice disjoint from $L_0$ with smallest element $v_1$, and $a \in…

Combinatorics · Mathematics 2024-12-12 Christian Herrmann , Dale R. Worley

A lattice L is slim if it is finite and the set of its join-irreducible elements contains no three-element antichain. We prove that there exists a positive constant C such that, up to similarity, the number of planar diagrams of these…

Rings and Algebras · Mathematics 2024-11-01 Gábor Czédli

This article present a new, direct and simple formula for constructing Mignotte sequences.

Cryptography and Security · Computer Science 2024-12-23 Marek Putresza

We present an improved orderly algorithm for constructing all unlabelled lattices up to a given size, that is, an algorithm that constructs the minimal element of each isomorphism class relative to some total order. Our algorithm employs a…

Combinatorics · Mathematics 2019-12-23 Volker Gebhardt , Stephen Tawn

A vertical 2-sum of a two-coatom lattice $L$ and a two-atom lattice $U$ is obtained by removing the top of $L$ and the bottom of $U$, and identifying the coatoms of $L$ with the atoms of $U$. This operation creates one or two nonisomorphic…

Combinatorics · Mathematics 2020-07-08 Jukka Kohonen

We analyse various structural and order-theoretical aspects of abstract separation systems and partial lattices, as well as the relationship between the different submodularity conditions one can impose on them.

Combinatorics · Mathematics 2025-05-20 Christian Elbracht , Jay Lilian Kneip , Maximilian Teegen

Part B (of a project involving four Parts) is about "bases of lines", a concept introduced by C. Herrmann and the author in the late 80's. Bases of lines attempt to describe a given modular lattice in a geometric way akin to how projective…

Combinatorics · Mathematics 2022-02-10 Marcel Wild

In this paper, we present an algorithmic approach to design and construct planar truss structures based on symmetric lattices using modular elements. The method of assembly is similar to Leonardo grids as they both rely on the property of…

Graphics · Computer Science 2021-06-22 Anantha Natarajan , Jiaqi Cui , Ergun Akleman , Vinayak Krishnamurthy

Lattices are simplified by removing some of their doubly irreducible elements, resulting in smaller lattices called racks. All vertically indecomposable modular racks of $n \le 40$ elements are listed, and the numbers of all modular…

Combinatorics · Mathematics 2025-04-16 Jukka Kohonen

We characterize factor congruences in semilattices by using generalized notions of order ideal and of direct sum of ideals. When the semilattice has a minimum (maximum) element, these generalized ideals turn into ordinary (dual) ideals.

Logic · Mathematics 2010-11-11 Pedro Sánchez Terraf

A (Hasse) diagram of a finite partially ordered set (poset) P will be called quasiplanar if for any two incomparable elements u and v, either v is on the left of all maximal chains containing u, or v is on the right of all these chains.…

Rings and Algebras · Mathematics 2013-01-01 Gábor Czédli

We show how to construct a cubic partial cube from any simplicial arrangement of lines or pseudolines in the projective plane. As a consequence, we find nine new infinite families of cubic partial cubes as well as many sporadic examples.

Combinatorics · Mathematics 2007-06-13 David Eppstein

In this article, we prove that finite semidistributive lattices are dismantlable if and only if they are planar. This extends a well-known result by Kelly and Rival that states the same property for finite distributive lattices. Moreover,…

Combinatorics · Mathematics 2015-07-03 Henri Mühle

We construct a sequence of geodesics on the modular surface such that the complement of the canonical lifts to the unit tangent bundle are arithmetic 3-manifolds.

Geometric Topology · Mathematics 2024-03-13 José Andrés Rodríguez Migueles , Tali Pinsky , Jessica S. Purcell

In this note, I find a new property of the congruence lattice, Con$L$, of an SPS lattice $L$ (slim, planar, semimodular, where "slim" is the absence of~$\mathsf M_3$ sublattices) with more than $2$ elements: \emph{there are at least two…

Rings and Algebras · Mathematics 2021-04-29 G. Grätzer