Related papers: Balanced d-lattices are complemented
The absolute upper bound on the number of equiangular lines that can be found in $\mathbf{R}^d$ is $d(d+1)/2$. Examples of sets of lines that saturate this bound are only known to exist in dimensions $d=2,3,7$ or $23$. By considering the…
In a 1998 paper with H. Lakser, the authors proved that every finite distributive lattice $D$ can be represented as the congruence lattice of a finite \emph{semimodular lattice}. Some ten years later, the first author and E. Knapp proved a…
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…
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…
The set of all perfect matchings of a plane (weakly) elementary bipartite graph equipped with a partial order is a poset, moreover the poset is a finite distributive lattice and its Hasse diagram is isomorphic to $Z$-transformation directed…
A balanced configuration of points on the sphere $S^2$ is a (finite) set of points which are in equilibrium if they act on each other according any force law dependent only on the distance between two points. The configuration is…
A flat of a matroid is cyclic if it is a union of circuits. The cyclic flats of a matroid form a lattice under inclusion. We study these lattices and explore matroids from the perspective of cyclic flats. In particular, we show that every…
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…
A coupled cell network describes interacting (coupled) individual systems (cells). As in networks from real applications, coupled cell networks can represent inhomogeneous networks where different types of cells interact with each other in…
The Sasaki projection was introduced as a mapping from the lattice of closed subspaces of a Hilbert space onto one of its segments. To use this projection and its dual so-called Sasaki operations were introduced by the second two authors.…
In [MR21], the first two authors introduced the notion of an accurate arrangement, a particular notion of freeness. In this paper, we consider a special subclass, where the property of accuracy stems from a flag of flats in the intersection…
Balancedly splittable Hadamard matrices are introduced and studied. A connection is made to the Hadamard diagonalizable strongly regular graphs, maximal equiangular lines set, and unbiased Hadamard matrices. Several construction methods are…
We utilize the Bruns-Lakser completion to introduce Bruns-Lakser towers of a meet-semilattice. This machinery enables us to develop various hierarchies inside the class of bounded distributive lattices, which measure $\kappa$-degrees of…
We study $b$-property of a sublattice (or an order ideal) $F$ of a vector lattice $E$. In particular, $b$-property of $E$ in $E^\delta$, the Dedekind completion of $E$, $b$-property of $E$ in $E^u$, the universal completion of $E$, and…
We study well-rounded lattices which come from ideals in quadratic number fields, generalizing some recent results of the first author with K. Petersen. In particular, we give a characterization of ideal well-rounded lattices in the plane…
A class of languages C is perfect if it is closed under Boolean operations and the emptiness problem is decidable. Perfect language classes are the basis for the automata-theoretic approach to model checking: a system is correct if the…
We construct several families of perfect sublattices with minimum $4$ of $\mathbb Z^d$. In particular, the number of $d-$dimensional perfect integral lattices with minimum $4$ grows faster than $d^k$ for every exponent $k$.
We discuss some aspects of the continuum limit of some lattice models, in particular the $2D$ $O(N)$ models. The continuum limit is taken either in an infinite volume or in a box whose size is a fixed fraction of the infinite volume…
Bilattices (that is, sets with two lattice structures) provide an algebraic tool to model simultaneously the validity of, and knowledge about, sentences in an appropriate language. In particular, certain bilattices have been used to model…
A $(d-1)$-dimensional simplicial complex is called balanced if its underlying graph admits a proper $d$-coloring. We show that many well-known face enumeration results have natural balanced analogs (or at least conjectural analogs).…