Related papers: A uniform refinement property for congruence latti…
The goal of the paper is to introduce a version of Schubert calculus for each dihedral reflection group W. That is, to each "sufficiently rich'' spherical building Y of type W we associate a certain cohomology theory and verify that, first,…
A coincidence site lattice is a sublattice formed by the intersection of a lattice $\Gamma$ in $\mathbb{R}^d$ with the image of $\Gamma$ under a linear isometry. Such a linear isometry is referred to as a linear coincidence isometry of…
We resolve the problem of optimal regularity and Uhlenbeck compactness for affine connections in General Relativity and Mathematical Physics. First, we prove that any affine connection $\Gamma$, with components $\Gamma \in L^{2p}$ and…
Uniform interpolation properties are defined for equational consequence in a variety of algebras and related to properties of compact congruences on first the free and then the finitely presented algebras of the variety. It is also shown,…
A variety V has Boolean factor congruences (BFC) if the set of factor congruences of every algebra in V is a distributive sublattice of its congruence lattice; this property holds in rings with unit and in every variety which has a…
Let $L$ be a planar semimodular lattice. We call $L$ \emph{slim}, if it has no $\mthree$ sublattice. Let us define an \emph{SPS lattice} as a slim, planar, semimodular lattice $L$. In 2016, I proved a property of congruences of SPS lattices…
Let $L$ denote a finite lattice with at least two points and let $A$ denote the incidence algebra of $L$. We prove that $L$ is distributive if and only if $A$ is an Auslander regular ring, which gives a homological characterisation of…
Since their introduction by G. Gr\"atzer and E. Knapp in 2007, more than four dozen papers have been devoted to finite slim planar semimodular lattices (in short, SPS lattices or slim semimodular lattices) and to some related fields. In…
We characterize commutative idempotent involutive residuated lattices as disjoint unions of Boolean algebras arranged over a distributive lattice. We use this description to introduce a new construction, called gluing, that allows us to…
We introduce the blockwise gluing construction. This describes residuated integral chains which can be decomposed into (possibly) partial algebras, stacked one on top of the other, and such that elements in a certain component multiply in…
It is, by now, classical that lattices in higher rank semisimple groups have various rigidity properties. In this work, we add another such rigidity property to the list: uniform stability with respect to the family of unitary operators on…
In a previous paper {GN2} an effective solution of the lattice point counting problem in general domains in semisimple S-algebraic groups and affine symmetric varieties was established. The method relies on the mean ergodic theorem for the…
Let $\mathbf{F}=\left\langle F,R\right\rangle $ be a finite Kripke frame. A congruence of $\mathbf{F}$ is a bisimulation of $\mathbf{F}$ that is also an equivalence relation on F. The set of all congruences of $\mathbf{F}$ is a lattice…
For large ranks, there is no good algorithm that decides whether a given lattice has an orthonormal basis. But when the lattice is given with enough symmetry, we can construct a provably deterministic polynomial-time algorithm to accomplish…
While studying some properties of linear operators in a Euclidean Jordan algebra, Gowda, Sznajder and Tao have introduced generalized lattice operations based on the projection onto the cone of squares. In two recent papers of the authors…
It is well known by analysts that a concept lattice has an exponential size in the data. Thus, as soon as he works with real data, the size of the concept lattice is a fundamental problem. In this chapter, we propose to investigate factor…
The homogeneous coordinate ring of a Schubert variety (a Schubert cycle for short) is an algebra with straightening law generated by a distributive lattice. This paper gives a simple method to study the set of all the join-irreducible…
We study the perfect matching lattice of a matching covered graph $G$, generated by the incidence vectors of its perfect matchings. Building on results of Lov\'asz and de Carvalho, Lucchesi, and Murty, we give a polynomial-time algorithm…
An open question akin to the slice-ribbon conjecture asks whether every ribbon knot can be represented as a symmetric union. Next to this basic existence question sits the question of uniqueness of such representations. Eisermann and Lamm…
For a slim, planar, semimodular lattice $L$ and covering square~$S$, G.~Cz\'edli and E.\,T.~Schmidt introduced the fork extension, $L[S]$, which is also a slim, planar, semimodular lattice. We investigate when a congruence of $L$ extends to…