English
Related papers

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

200 papers

It is shown that the lattices of flats of boolean representable simplicial complexes are always atomistic, but semimodular if and only if the complex is a matroid. A canonical construction is introduced for arbitrary finite atomistic…

Combinatorics · Mathematics 2015-10-20 Stuart Margolis , John Rhodes , Pedro V. Silva

The systematic study of planar semimodular lattices started in 2007 with a series of papers by G. Gr\"atzer and E. Knapp. These lattices have connections with group theory and geometry. A planar semimodular lattice $L$ is {\it slim} if…

Rings and Algebras · Mathematics 2021-03-09 Gábor Czédli , George Grätzer

Questions that seek to determine whether a hyperplane arrangement property, be it geometric, arithmetic or topological, is of a combinatorial nature (that is determined by the intersection lattice) are abundant in the literature. To tackle…

Algebraic Geometry · Mathematics 2021-11-02 Benoît Guerville-Ballé

Let $L$ be a lattice of finite length and let $d$ denote the minimum path length metric on the covering graph of $L$. For any $\xi=(x_1,\dots,x_k)\in L^k$, an element $y$ belonging to $L$ is called a median of $\xi$ if the sum…

Rings and Algebras · Mathematics 2019-11-07 Gábor Czédli , Robert C. Powers , Jeremy M. White

A planar semimodular lattice is slim if it does not contain $M_3$ as a sublattice. An SPS lattice is a slim, planar, semimodular lattice. A recent result of G\'abor Cz\'edli proves that there is an eight element (planar) distributive…

Rings and Algebras · Mathematics 2014-04-29 George Grätzer

The ability to assemble mesoscopic colloidal lattices above a surface is important for fundamental studies related with nucleation and crystallization, but also for a variety of technological applications in photonics and micro-engineering.…

Soft Condensed Matter · Physics 2019-08-27 Pietro Tierno

We classify strongly modular lattices with longest and second longest possible shadow.

Number Theory · Mathematics 2007-05-23 Gabriele Nebe

It may be possible to reinvent how microelectronics are made using a two step process: (1) Synthesizing modular, nanometer-scale components -- transistors, sensors, and other devices -- and suspending them in a liquid "ink" for storage or…

Computers and Society · Computer Science 2023-03-21 Michael Filler , Benjamin Reinhardt

This paper is the first part of a study devoted to description of modular elements in the lattices of semigroup and epigroup varieties. We provide strengthened necessary and sufficient conditions under which a semigroup or epigroup variety…

Group Theory · Mathematics 2025-11-25 Vyacheslav Yu. Shaprynski\vı , Dmitry V. Skokov

We construct a metrizable semitopological semilattice $X$ whose partial order $P=\{(x,y)\in X\times X:xy=x\}$ is a non-closed dense subset of $X\times X$. As a by-product we find necessary and sufficient conditions for the existence of a…

General Topology · Mathematics 2021-11-01 Taras Banakh , Serhii Bardyla , Alex Ravsky

The standard method for constructing generating vectors for good lattice point sets is the component-by-component construction. Numerical experiments have shown that the generating vectors found by these constructions sometimes tend to have…

Numerical Analysis · Mathematics 2015-12-16 Helene Laimer

We show that there are uncountably many countable lattices. We give a discussion of which such lattices can be modular or distributive. The method applies to show that certain other classes of structures also have uncountably many…

Logic · Mathematics 2014-06-03 A. Abogatma , J. K. Truss

In the paper we describe derivations of some classes of Leibniz algebras. It is shown that any derivation of a simple Leibniz algebra can be written as a combination of three derivations. Two of these ingredients are a Lie algebra…

Rings and Algebras · Mathematics 2014-12-16 I. S. Rakhimov , K. K. Masutova , B. A. Omirov

The concept of a $\lambda$-lattice was introduced by V. Sn\'a\v sel in order to generalize some lattice concepts for directed posets whose elements need not have suprema or infima. We extend the concept of semimodularity from lattices to…

Rings and Algebras · Mathematics 2019-09-12 Ivan Chajda , Helmut Länger

We construct Euclidean lattices whose sets of minimal vectors support some large equiangular families of lines, using notably reduction modulo~$2$ of lattices. %as considered in \cite{Ma1} and \cite{Ma2}. We also consider some related…

Number Theory · Mathematics 2024-03-15 Jacques Martinet

In this paper we discuss Chasles's construction on ellipsoid to draw the semi-axes from a complete system of conjugate diameters. We prove that there is such situation when the construction is not planar (the needed points cannot be…

Metric Geometry · Mathematics 2017-10-23 Ákos G. Horváth , István Prok

The simplest way to generate a lattice of convex sets is to consider an initial set of points and draw segments, triangles, and any convex hull from it, then intersect them to obtain new points, and so forth. The result is an infinite…

Combinatorics · Mathematics 2024-07-25 Carles Cardó

This article focuses on the relationship between pseudo-t-norms and the structure of lattices. First, we establish a necessary and sufficient condition for the existence of a left-continuous t-norm on the ordinal sum of two disjoint…

Representation Theory · Mathematics 2025-06-10 Peng He , Xue-ping Wang

A basic class of constructions is considered, in connection with bilipschitz mappings in particular.

Classical Analysis and ODEs · Mathematics 2012-10-18 Stephen Semmes

Let $L$ be a slim, planar, semimodular lattice (slim means that it does not contain an ${\mathsf M}_3$-sublattice). We call the interval $I = [o, i]$ of $L$ \emph{rectangular}, if there are complementary $a, b \in I$ such that $a$ is to the…

Rings and Algebras · Mathematics 2022-07-05 George Grätzer