اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCoincidences in 4 dimensions
100
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The coincidence site lattices (CSLs) of prominent 4-dimensional lattices are considered. CSLs in 3 dimensions have been used for decades to describe grain boundaries in crystals. Quasicrystals suggest to also look at CSLs in dimensions $d>3$. Here, we discuss the CSLs of the root lattice $A_4$ and the hypercubic lattices, which are of particular interest both from the mathematical and the crystallographic viewpoint. Quaternion algebras are used to derive their coincidence rotations and the CSLs. We make use of the fact that the CSLs can be linked to certain ideals and compute their indices, their multiplicities and encapsulate all this in generating functions in terms of Dirichlet series. In addition, we sketch how these results can be generalised for 4--dimensional $Z$--modules by discussing the icosian ring.
قيم البحث
اقرأ أيضاً
The coincidence problem for planar patterns with $N$-fold symmetry is considered. For the N-fold symmetric module with $N<46$, all isometries of the plane are classified that result in coincidences of finite index. This is done by reformulating the p
roblem in terms of algebraic number fields and using prime factorization. The more complicated case $N ge 46$ is briefly discussed and N=46 is described explicitly. The results of the coincidence problem also solve the problem of colour lattices in two dimensions and its natural generalization to colour modules.
This paper considers Platonic solids/polytopes in the real Euclidean space R^n of dimension 3 <= n < infinity. The Platonic solids/polytopes are described together with their faces of dimensions 0 <= d <= n-1. Dual pairs of Platonic polytopes are con
sidered in parallel. The underlying finite Coxeter groups are those of simple Lie algebras of types An, Bn, Cn, F4 and of non-crystallographic Coxeter groups H3, H4. Our method consists in recursively decorating the appropriate Coxeter-Dynkin diagram. Each recursion step provides the essential information about faces of a specific dimension. If, at each recursion step, all of the faces are in the same Coxeter group orbit, i.e. are identical, the solid is called Platonic.
In this paper we construct a new family of lattice packings for superballs in three dimensions (unit balls for the $l^p_3$ norm) with $p in (1, 1.58]$. We conjecture that the family also exists for $p in (1.58, log_2 3 = 1.5849625ldots]$. Like in the
densest lattice packing of regular octahedra, each superball in our family of lattice packings has $14$ neighbors.
This paper investigates the behaviour of the kissing number $kappa(n, r)$ of congruent radius $r > 0$ spheres in $mathbb{S}^n$, for $ngeq 2$. Such a quantity depends on the radius $r$, and we plot the approximate graph of $kappa(n, r)$ with relativel
y high accuracy by using new upper and lower bounds that are produced via semidefinite programming and by using spherical codes, respectively.
This paper provides upper and lower bounds on the kissing number of congruent radius $r > 0$ spheres in $mathbb{H}^n$, for $ngeq 2$. For that purpose, the kissing number is replaced by the kissing function $kappa(n, r)$ which depends on the radius $r
$. After we obtain some theoretical lower and upper bounds for $kappa(n, r)$, we study their asymptotic behaviour and show, in particular, that $lim_{rto infty} frac{log kappa(n,r)}{r} = n-1$. Finally, we compare them with the numeric upper bounds obtained by solving a suitable semidefinite program.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
