A note on cubic equivalences
نویسندگان
چکیده
منابع مشابه
A note on cubic convolution interpolation
We establish a link between classical osculatory interpolation and modern convolution-based interpolation and use it to show that two well-known cubic convolution schemes are formally equivalent to two osculatory interpolation schemes proposed in the actuarial literature about a century ago. We also discuss computational differences and give examples of other cubic interpolation schemes not pre...
متن کاملA note on cubic polynomial interpolation
“The NURBS Book” [L. Piegl, W. Tiller, The NURBS Book, second edn, Springer, 1997] is very popular in the fields of computer aided geometric design (CAGD) and geometric modeling. In Section 9.5.2 of the book, the well-known problem of the local cubic spline approximation is discussed. The key in local cubic spline approximation is cubic polynomial interpolation. In this short paper, we present ...
متن کاملA Note on Projecting the Cubic Lattice
The theorem is at first surprising, since A has ( n+1 2 ) degrees of freedom, whereas v has only n degrees of freedom (for the explanation see the remark following the proof of Theorem 2). The problem arises from a question in communication theory (see §5), which calls for projections Λv with high packing density. Since both the determinant and minimal norm of a lattice are continuous functions...
متن کاملA Note on Stable Equivalences of Morita Type
We investigate when an exact functor F ∼= − ⊗Λ MΓ : mod-Λ → mod-Γ which induces a stable equivalence is part of a stable equivalence of Morita type. If Λ and Γ are finite dimensional algebras over a field k whose semisimple quotients are separable, we give a necessary and sufficient condition for this to be the case. This generalizes a result of Rickard’s for self-injective algebras. As a corol...
متن کاملA Note on Arboricity of 2-edge-connected Cubic Graphs
The vertex-arboricity a(G) of a graph G is the minimum number of subsets into which the set of vertices of G can be partitioned so that each subset induces a forest. It is well known that a(G) ≤ 3 for any planar graph G, and that a(G) ≤ 2 for any planar graph G of diameter at most 2. The conjecture that every planar graph G without 3-cycles has a vertex partition (V1, V2) such that V1 is an ind...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nagoya Mathematical Journal
سال: 1986
ISSN: 0027-7630,2152-6842
DOI: 10.1017/s0027763000000313