Related papers: Notes on planar semimodular lattices. I. Construct…
Experiments have revealed that membrane proteins can form two-dimensional clusters with regular translational and orientational protein arrangements, which may allow cells to modulate protein function. However, the physical mechanisms…
Much study has been done on semigroups which are unions of groups. There are several ways in which a union of groups can be made into a semigroup in which each of the component groups arises as subgroups of the constructed semigroup. An…
We introduce frameworks for constructing global derived moduli stacks associated to a broad range of problems, bridging the gap between the concrete and abstract conceptions of derived moduli. Our three approaches are via differential…
This work studies the relationship between the chains of an algebraic lattice and the order structure of the join-semilattice of its compact elements. The results are presented into four chapters, each corresponding to a paper written in…
Construction $C^\star$ was recently introduced as a generalization of the multilevel Construction C (or Forney's code-formula), such that the coded levels may be dependent. Both constructions do not produce a lattice in general, hence the…
We present an easy construction producing a Kleene lattice K from an arbitrary distributive lattice L and a non-empty subset of L. We show that L can be embedded into K and compute the cardinality of K under certain additional assumptions.…
We construct a natural generalized complex structure on the total space of any bundle endowed with a Chern connection and whose typical fibre is a homogeneous symplectic manifold. This extends known constructions of generalized complex…
We show how to construct linearizations of matrix polynomials $z\mathbf{a}(z)\mathbf{d}_0 + \mathbf{c}_0$, $\mathbf{a}(z)\mathbf{b}(z)$, $\mathbf{a}(z) + \mathbf{b}(z)$ (when $\mathrm{deg}\left(\mathbf{b}(z)\right) <…
We introduce a procedure for constructing a generalized elliptic curve from a genus-one twisted curve, and we use this procedure to define an explicit, modular isomorphism between two compactifications of moduli stacks of elliptic curves…
We classify all Gieseker semi-stable sheaves on the complex projective plane that have dimension 1 and multiplicity 6. We decompose their moduli spaces into strata which occur naturally as quotients modulo actions of certain algebraic…
We show that the free Banach lattice $\mathrm{FBL}(A)$ may be constructed as the completion of $\mathrm{FVL}(A)$ with respect to the maximal lattice seminorm $\nu$ on $\mathrm{FVL}(A)$ with $\nu(a)\le 1$ for all $a\in A$. We present a…
By a rectangular distributive lattice we mean the direct product of two non-singleton finite chains. We prove that the retracts (ordered by set inclusion and together with the empty set) of a rectangular distributive lattice $G$ form a…
This is Part A of four Parts dedicated to modular lattices of finite length. It builds on 1992 notes of the author (available on ResearchGate), and in so doing heeds a wish of the late Gian-Carlo Rota. Part A is in fairly final form and…
We extend the theory of atomized semilattices to the infinite setting. We show that it is well-defined and that every semilattice is atomizable. We also study atom redundancy, focusing on complete and finitely generated semilattices and…
Patch lattices, introduced by G. Cz\'edli and E.T. Schmidt in 2013, are the building stones for slim (and so necessarily finite and planar) semimodular lattices with respect to gluing. Slim semimodular lattices were introduced by G.…
Every stationary action of a strongly irreducible lattice or commensurator of such a latiice in a general semisimple group, with at least one higher-rank connected factor, either has finite stabilizers almost surely or finite index…
This paper studies the differential lattice, defined to be a lattice $L$ equipped with a map $d:L\to L$ that satisfies a lattice analog of the Leibniz rule for a derivation. Isomorphic differential lattices are studied and classifications…
We consider the lattice of coarse structures on a set $X$ and study metrizable, locally finite and cellular coarse structures on $X$ from the lattice point of view.
For a polygonal linkage, we produce a fast navigation algorithm on its configuration space. The basic idea is to approximate the configuration space by the vertex-edge graph of its cell decomposition discovered by the first author. The…
We recall the main types of lattice paths, which are sequences in the lattice of integer coordinates points in the plane. We start with the fundamental central lattice paths and Dyck paths and proceed in elementary terms through recently…