Related papers: A lexicographic shellability characterization of g…
A main goal in lattice theory is the construction of dense lattices. Most of the remarkable dense lattices in small dimensions have an additional symmetry, they are modular, i.e. similar to their dual lattice. Extremal lattices are densest…
A graph is called matching covered if for its every edge there is a maximum matching containing it. It is shown that minimal matching covered graphs contain a perfect matching.
Characteristic Lie rings for Toda type 2+1 dimensional lattices are defined. Some properties of these rings are studied. Infinite sequence of special kind modules are introduced. It is proved that for known integrable lattices these modules…
Let X be a projective surface, let \sigma be an automorphism of X, and let L be a \sigma-ample invertible sheaf on X. We study the properties of a family of subrings, parameterized by geometric data, of the twisted homogeneous coordinate…
Protein folds are highly designable, in the sense that many sequences fold to the same conformation. In the present work we derive an expression for the designability in a 20 letter lattice model of proteins which, relying only on the…
A graph is said to be globally rigid if almost all embeddings of the graph's vertices in the Euclidean plane will define a system of edge-length equations with a unique (up to isometry) solution. In 2007, Jackson, Servatius and Servatius…
For a finite lattice $\Lambda$, $\Lambda$-ultrametric spaces are a convenient language for describing structures equipped with a family of equivalence relations. When $\Lambda$ is finite and distributive, there exists a generic…
A new graph-based order parameter is introduced for the characterization of atomistic structures. The order parameter is universal to any material/chemical system, and is transferable to all structural geometries. Three sets of data are…
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…
Graphical (Linear) Algebra is a family of diagrammatic languages allowing to reason about different kinds of subsets of vector spaces compositionally. It has been used to model various application domains, from signal-flow graphs to Petri…
A set of vertices $S$ \emph{resolves} a connected graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The \emph{metric dimension} of $G$ is the minimum cardinality of a resolving set of $G$.…
We affirm a conjecture of Sacks [1972] by showing that every countable distributive lattice is isomorphic to an initial segment of the hyperdegrees, $\mathcal{D}_{h}$. In fact, we prove that every sublattice of any hyperarithmetic lattice…
Epitaxial heterostructures composed of complex oxides have fascinated researchers for over a decade as they offer multiple degrees of freedom to unveil emergent many-body phenomena often unattainable in bulk. Recently, apart from…
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…
A lattice is called periodic extreme if it cannot locally be modified to yield a better periodic sphere packing. It is called strict periodic extreme if its sphere packing density is an isolated local optimum among periodic point sets. In…
Sponges were recently proposed as a generalization of lattices, focussing on joins/meets of sets, while letting go of associativity/transitivity. In this work we provide tools for characterizing and constructing sponges on metric spaces and…
An extremal element $x$ in a Lie algebra $\mathfrak{g}$ is an element for which the space $[x, [x, \mathfrak{g}]]$ is contained in the linear span of $x$. Long root elements in classical Lie algebras are examples of extremal elements. Lie…
A convex geometric graph $G$ is said to be packable if there exist edge-disjoint copies of $G$ in the complete convex geometric graph $K_n$ covering all but $o(n^2)$ edges. We prove that every convex geometric graph with cyclic chromatic…
A lambda colouring (or $L(2,1)-$colouring) of a graph is an assignment of non-negative integers (with minimum assignment $0$) to its vertices such that the adjacent vertices must receive integers at least two apart and vertices at distance…
Correlation matrices are standardized covariance matrices. They form an affine space of symmetric matrices defined by setting the diagonal entries to one. We study the geometry of maximum likelihood estimation for this model and linear…