اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدExtremal Configurations of Hinge Structures
129
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study body-and-hinge and panel-and-hinge chains in R^d, with two marked points: one on the first body, the other on the last. For a general chain, the squared distance between the marked points gives a Morse-Bott function on a torus configuration space. Maximal configurations, when the distance between the two marked points reaches a global maximum, have particularly simple geometrical characterizations. The three-dimensional case is relevant for applications to robotics and molecular structures.
قيم البحث
اقرأ أيضاً
Motivated by the hinge structure present in protein chains and other molecular conformations, we study the singularities of certain maps associated to body-and-hinge and panel-and-hinge chains. These are sequentially articulated systems where two con
secutive rigid pieces are connected by a hinge, that is, a codimension two axis. The singularities, or critical points, correspond to a dimensional drop in the linear span of the axes, regarded as points on a Grassmann variety in its Pl{u}cker embedding. These results are valid in arbitrary dimension. The three dimensional case is also relevant in robotics.
We prove configuration results for extremal Type II codes, analogous to the configuration results of Ozeki and of the second author for extremal Type II lattices. Specifically, we show that for $n in {8, 24, 32, 48, 56, 72, 96}$ every extremal Type I
I code of length $n$ is generated by its codewords of minimal weight. Where Ozeki and Kominers used spherical harmonics and weighted theta functions, we use discrete harmonic polynomials and harmonic weight enumerators. Along we way we introduce $tfrac12$-designs as a discrete analog of Venkovs spherical designs of the same name.
For every positive integer $t$ we construct a finite family of triple systems ${mathcal M}_t$, determine its Tur{a}n number, and show that there are $t$ extremal ${mathcal M}_t$-free configurations that are far from each other in edit-distance. We al
so prove a strong stability theorem: every ${mathcal M}_t$-free triple system whose size is close to the maximum size is a subgraph of one of these $t$ extremal configurations after removing a small proportion of vertices. This is the first stability theorem for a hypergraph problem with an arbitrary (finite) number of extremal configurations. Moreover, the extremal hypergraphs have very different shadow sizes (unlike the case of the famous Turan tetrahedron conjecture). Hence a corollary of our main result is that the boundary of the feasible region of ${mathcal M}_t$ has exactly $t$ global maxima.
We show that if L is an extremal even unimodular lattice of rank 40r with r=1,2,3 then L is generated by its vectors of norms 4r and 4r+2. Our result is an extension of Ozekis result for the case r=1.
We consider moduli spaces of cyclic configurations of $N$ lines in a $2n$-dimensional symplectic vector space, such that every set of $n$ consecutive lines generates a Lagrangian subspace. We study geometric and combinatorial problems related to thes
e moduli spaces, and prove that they are isomorphic to quotients of spaces of symmetric linear difference operators with monodromy $-1$. The symplectic cross-ratio is an invariant of two pairs of $1$-dimensional subspaces of a symplectic vector space. For $N = 2n+2$, the moduli space of Lagrangian configurations is parametrized by $n+1$ symplectic cross-ratios. These cross-ratios satisfy a single remarkable relation, related to tridiagonal determinants and continuants, given by the Pfaffian of a Gram matrix.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
