相关论文: A complete and continuous map of the Lattice Isome…
A periodic lattice in Euclidean 3-space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…
A periodic lattice in Euclidean space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…
This paper develops geographic-style maps containing 2D lattices in all known crystals parameterised by recent complete invariants. Motivated by rigid crystal structures, lattices are considered up to rigid motion and uniform scaling. The…
Lattices in three dimensions are oft studied from the ``reciprocal space'' perspective of diffraction. Today, the full lattice of a crystal can often be inferred from direct-space information about three sets of non-parallel lattice planes.…
Aiming at the study of critical phenomena in the presence of boundaries with a non-trivial shape we discuss how lattices with an adaptive lattice spacing can be implemented. Since the parameters of the Hamiltonian transform non-trivially…
Three-dimensional lattices are fundamental to solid-state physics. The description of a lattice with an atomic basis constitutes the necessary information to predict solid phase properties and evolution. Here, we present a new algorithm for…
We consider all compatible topologies of an arbitrary finite-dimensional vector space over a non-trivial valuation field whose metric completion is a locally compact space. We construct the canonical lattice isomorphism between the lattice…
Using the combinatorics of two interpenetrating face centered cubic lattices together with the part of calculus naturally encoded in combinatorial topology, we construct from first principles a lattice model of 3D incompressible…
IFISS is an established MATLAB finite element software package for studying strategies for solving partial differential equations (PDEs). IFISS3D is a new add-on toolbox that extends IFISS capabilities for elliptic PDEs from two to three…
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…
One of the basic problems in discrete geometry is to determine the most efficient packing of congruent replicas of a given convex set $K$ in the plane or in space. The most commonly used measure of efficiency is density. Several types of…
The isoperimetric problem is one of the oldest in geometry and it consists of finding a surface of minimum area that encloses a given volume $V$. It is particularly important in physics because of its strong relation with stability, and…
Lattice radial quantization is introduced as a nonperturbative method intended to numerically solve Euclidean conformal field theories that can be realized as fixed points of known Lagrangians. As an example, we employ a lattice shaped as a…
The lattice size of a lattice polytope is a geometric invariant which was formally introduced in the context of simplification of the defining equation of an algebraic curve, but appeared implicitly earlier in geometric combinatorics.…
We describe surjective linear isometries and linear isometry groups of a large class of Lipschitz-free spaces that includes e.g. Lipschitz-free spaces over any graph. We define the notion of a Lipschitz-free rigid metric space whose…
We study the Lattice Isomorphism Problem (LIP), in which given two lattices L_1 and L_2 the goal is to decide whether there exists an orthogonal linear transformation mapping L_1 to L_2. Our main result is an algorithm for this problem…
$\SLR$ geometry is one of the eight 3-dimensional Thurston geometries, it can be derived from the 3-dimensional Lie group of all $2\times 2$ real matrices with determinant one. Our aim is to describe and visualize the {\it regular infinite…
We introduce the concept of basis for a lattice. This basis plays a vital role to determine the completeness and consistency of the lattice. Weighted lattices are introduced and its complexity is formulated. Some axiomatic systems,…
Let $L$ be a lattice of full rank in $n$-dimensional real space. A vector in $L$ is called $i$-sparse if it has no more than $i$ nonzero coordinates. We define the $i$-th successive sparsity level of $L$, $s_i(L)$, to be the minimal $s$ so…
Recently, a class of mechanical lattices with reconfigurable, zero-stiffness structures has been proposed, called Totimorphic lattices. In this work, we introduce a computational framework that enables continuous reprogramming of a…