Related papers: Non-rigidity degrees of root lattices and their du…

We introduce the dimension monoid of a lattice L, denoted by Dim L. The monoid Dim L is commutative and conical, the latter meaning that the sum of any two nonzero elements is nonzero. Furthermore, Dim L is given along with the dimension…

By a 1997 result of R. Freese, an $n$-element lattice has at most $2^{n-1}$ congruences. This motivates us to define the congruence density cd$(L)$ of a finite $n$-element lattice as $|$Con$(L)|/2^{n-1}$, where $|$Con$(L)|$ is the number of…

We show that a solvable real rigid Lie algebra is not completelt rigid, by constructing an example of minimal dimension where the external torus is not spanned by $ad$-semisimple derivations over $\mathbb{R}$. We analyze the real forms of…

The lattice dimension of a graph G is the minimal dimension of a cubic lattice in which G can be isometrically embedded. We prove that the lattice dimension of a tree with n leaves is $\lceil n/2 \rceil$.

Let $\Delta$ be an $n$-dimensional lattice polytope. The smallest non-negative integer $i$ such that $k \Delta$ contains no interior lattice points for $1 \leq k \leq n - i$ we call the degree of $\Delta$. We consider lattice polytopes of…

We provide a complete characterization of pairs of full-rank lattices in $\mathbb{R}^{d}$ which admit common connected fundamental domains of the type $N\left[ 0,1\right) ^{d}$ where $N$ is an invertible matrix of order $d.$ Using our…

We study the maximum dimension $d=d(n,p)$ for which an Erd\H{o}s-R\'enyi $G(n,p)$ random graph is $d$-rigid. Our main results reveal two different regimes of rigidity in $G(n,p)$ separated at $p_c=C_*\log n/n,~C_*=2/(1-\log 2)$ -- the point…

The highest possible minimal norm of a unimodular lattice is determined in dimensions n <= 33. There are precisely five odd 32-dimensional lattices with the highest possible minimal norm (compared with more than 8*10^20 in dimension 33).…

Given a finite lattice $L$ that can be embedded in the recursively enumerable (r.e.) Turing degrees $\mathcal{R}_{\mathrm{T}}$, it is not known how one can characterize the degrees $\mathbf{d}\in\mathcal{R}_{\mathrm{T}}$ below which $L$ can…

A nilmanifold resp. solvmanifold is a compact homogeneous space of a connected and simply-connected nilpotent resp. solvable Lie group by a lattice, i.e. a discrete co-compact subgroup. There is an easy criterion for nilpotent Lie groups…

Let $S = K[x_1, ..., x_n ]$ be a polynomial ring over a field $K$, and $E = K < y_1, ..., y_n >$ an exterior algebra. The "linearity defect" $ld_E(N)$ of a finitely generated graded $E$-module $N$ measures how far $N$ departs from…

We argue that a system of straight rigid rods of length k on square lattice with only hard-core interactions shows two phase transitions as a function of density, rho, for k >= 7. The system undergoes a phase transition from the low-density…

The problem of enumerating spanning trees on graphs and lattices is considered. We obtain bounds on the number of spanning trees $N_{ST}$ and establish inequalities relating the numbers of spanning trees of different graphs or lattices. A…

A root lattice is a finite rank $\mathbb{Z}$-lattice generated by elements $x$ satisfying $x\cdot x=2$. It is well-known that the root lattices have an $ADE$ classification and they play a prominent role in the study of even unimodular…

The description of complex solvable Leibniz algebras whose nilradical is a naturally graded filiform algebra is already known. Unfortunately, a mistake was made in that description. Namely, in the case where the dimension of the solvable…

Let F be a family of subsets of {1,2,...,n}. The width-degree of an element x in at least one member of F is the width of the family {U in F | x in U}. If F has maximum width-degree at most k, then F is locally k-wide. Bounds on the size of…

Let E be an integral lattice. We first discuss some general properties of an SDC lattice, i.e., a sum of two diagonal copies of E in E \bot E. In particular, we show that its group of isometries contains a wreath product. We then specialize…

In this note we prove a lower bound for the rank of 2-dimensional generic rigidity matroid for regular graphs of degree four and five. Also, we give examples to show the order of the bound we give is sharp.

In this paper we focus on algebraic aspects of contractions of Lie and Leibniz algebras. The rigidity of algebras plays an important role in the study of their varieties. The rigid algebras generate the irreducible components of this…

The article establishes a long list of rigidity properties of lattices in G = SO(n,1) with n>=3 and G = SU(n,1) with n>=2 that are analogous to superrigidity of lattices in higher-rank Lie groups. The arguments are set in the context of…