首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
Let be the uniform triangulation generated by the usual three-directional mesh of the plane and let 1 be the unit square consisting of two triangles of . We study the space of piecewise polynomial functions in C k (R 2) with support 1 having a sufficiently high degree n, which are symmetrical with respect to the first diagonal of 1. Such splines are called 1-splines. We first compute the dimension of this space in function of n and k. Then, for any fixed k0, we prove the existence of 1-splines of class C k and minimal degree. These splines are not unique. Finally, we describe an algorithm computing the Bernstein–Bézier coefficients of these splines, and we give an example.  相似文献   

2.
Let * be the equilateral triangulation of the plane and let 1 * be the equilateral triangle formed by four triangles of *. We study the space of piecewise polynomial functions in C k (R 2) with support 1 *, having a sufficiently high degree n and which are invariant with respect to the group of symmetries of 1 *. Such splines are called 1 *-splines. We first compute the dimension of this space in function of n and k. Then, for any fixed k0, we prove the existence of 1 *-splines of class C k and minimal degree, but these splines are not unique. Finally, we describe an algorithm computing the Bernstein–Bézier coefficients of these splines.  相似文献   

3.
A theorem of Lovász asserts that (H)/*(H)r/2 for everyr-partite hypergraphH (where and * denote the covering number and fractional covering number respectively). Here it is shown that the same upper bound is valid for a more general class of hypergraphs: those which admit a partition (V 1, ...,V k ) of the vertex set and a partitionp 1+...+p k ofr such that |eV i |p i r/2 for every edgee and every 1ik. Moreover, strict inequality holds whenr>2, and in this form the bound is tight. The investigation of the ratio /* is extended to some other classes of hypergraphs, defined by conditions of similar flavour. Upper bounds on this ratio are obtained fork-colourable, stronglyk-colourable and (what we call)k-partitionable hypergraphs.Supported by grant HL28438 at MIPG, University of Pennsylvania, and by the fund for the promotion of research at the Technion.This author's research was supported by the fund for the promotion of research at the Technion.  相似文献   

4.
Let T be the domain in N defined by the inequalities O < 1 < ... < N < +. Put N+k = /2(1+k) (k=1,2,3), N+4=1+2, and denote byF() the set of functions x=x(u,v)=(x1(u,v),...,xp(u,v)), (p2) of class , where B is the unit disk u2+v2<1, which maps the circular arcs k={w=ei:k<<K+1} (k=1,..., N+3) into the straight lines containing the edges ak, ak+1 (aN+4=a1) of a polygon IRp. Then we show that the function ()= inf xF() D(x) is analytic in T. This generalizes and sharpens an unproved result of I. Marx and M. Shiffman (see [4]).

Hans Lewy und Charles B. Morrey gewidmet  相似文献   

5.
An ordered orthogonal array OOA(, k, n) is a binary 2 k × n matrix with the property that for each complete -set of columns, each possible -tuple occurs in exactly 2 k rows of those columns (for definition of a complete -set, see below). Constructions of OOA(, k, n) for = 4 and = 5 are given.  相似文献   

6.
Paul Jolissaint 《K-Theory》1989,2(6):723-735
We associate to any length function L on a group a space of rapidly decreasing functions on (in the l 2 sense), denoted by H L (). When H L () is contained in the reduced C*-algebra C r * () of (), then it is a dense *-subalgebra of C r * () and we prove a theorem of A. Connes which asserts that under this hypothesis H L () has the same K-theory as C r * (). We introduce another space of rapidly decreasing functions on (in the l 1 sense), denoted by H L 1, (), which is always a dense *-subalgebra of the Banach algebra l 1(), and we show that H L 1, () has the same K-theory as l 1().  相似文献   

7.
We express the real connective K-theory groups o4k–1(B Q ) ofthe quaternion group Q of order = 2 j 8 in terms of therepresentation theory of Q by showing o4k–1(B Q ) = Sp(S 4k+3/Q )where is any fixed point free representation of Q in U(2k + 2).  相似文献   

8.
Let {X n} be a sequence of i.i.d. random variables and let {k} be a sequence of random indexes. We study the problem of the existence of non-degenerated asymptotic distribution for min{X 1,..., X n}.  相似文献   

9.
Let L|K be a finite Galois extension. Using central simple algebras we deal with the crossed representations of G = Gal(L|K) over L which are defined as mappings X of G into GLn(L) satisfying X = X X. The last equation is the Noetherian equation in case n=1. Furtheron, more general crossed projective representations are considered which obey an equation X X = Xf, where f, L.  相似文献   

10.
Let be the triangulation generated by a uniform three direction mesh of the plane. Let 6 be the Powell-Sabin subtriangulation obtained by subdividing each triangleT by connecting each vertex to the midpoint of the opposite side.Given a smooth functionu, we construct a piecewise polynomial function C r (2) of degreen=2r (resp. 2r+1) forr odd (resp. even) in each triangle of 6, interpolating derivatives ofu up to orderr at the vertices of.  相似文献   

11.
Soient G = exp g un groupe de Lie résoluble exponentiel et H = exp h un sous-groupe connexe de G. Soient un caractère unitaire de H et = IndH G. Soit D(G/H) l'algèbre des opérateurs différentiels G-invariants sur G/H. Une question posée par Duflo et Corwin-Greenleaf consiste à voir si la finitude des multiplicités de est équivalente à la commutativité de D (G/H). Nous répondons positivement à cette question quand H est normal dans G. Lorsque H n'est pas normal, nous préparons le terrain pour d'espaces homogènes nilpotents et nous répondons à la question dans différents cas. Nous étudions finalement l'algèbre D (G) H , des opérateurs différentiels qui laissent l'espace des vecteurs C de invariant et qui commuttent avec l'action de H sur cet espace.  相似文献   

12.
LetG be a vector space over the field of rational numbers andf, g:G -linear mappings. equipped with the usual norm topology. Denote by f , g the initial topologies onG induced byf respectivelyg.Then the following result holds: If there is a nonvoid open setU whose complement contains at least one inner point such thatf –1 U g , then there is ac withf=cg. In particular, iff0, the topologies coincide.Furthermore, a -linear mappingh: (G, f )(G, g ) is continuous if and only if there is a real constantc withg o h=cf.Dedicated to Professor János Aczél on his 60th birthday  相似文献   

13.
Let * be an exact D-optimal design for a given regression model Y = X + Z . In this paper sufficient conditions are given for sesigning how the covariance matrix of Z may be changed so that not only * remains D-optimal but also that the best linear unbiased estimator (BLUE) of stays fixed for the design *, although the covariance matrix of Z * is changed. Hence under these conditions a best, according to D-optimality, BLUE of is known for the model with the changed covariance matrix. The results may also be considered as determination of exact D-optimal designs for regression models with special correlated observations where the covariance matrices are not fully known. Various examples are given, especially for regression with intercept term, polynomial regression, and straight-line regression. A real example in electrocardiography is treated shortly.  相似文献   

14.
Letk and be positive integers, andG a 2-connected graph of ordern with minimum degree and independence number. A cycleC ofG is called aD -cycle if every component ofG – V(C) has order smaller than. The graphG isk-cyclable if anyk vertices ofG lie on a common cycle. A previous result of the author is that if k 2, G isk-connected and every connected subgraphH ofG of order has at leastn +k 2 + 1/k + 1 – vertices outsideH adjacent to at least one vertex ofH, thenG contains aD -cycle. Here it is conjectured that k-connected can be replaced by k-cyclable, and this is proved fork = 3. As a consequence it is shown that ifn 4 – 6, or ifG is triangle-free andn 8 – 10, thenG contains aD 3-cycle orG , where denotes a well-known class of nonhamiltonian graphs of connectivity 2. As an analogue of a result of Nash-Williams it follows that ifn 4 – 6 and – 1, thenG is hamiltonian orG . The results are all best possible and compare favorably with recent results on hamiltonicity of graphs which are close to claw-free.  相似文献   

15.
In the first part of this series, we prove that the tensor product immersionf 1 f 2k of2k isometric spherical immersions of a Riemannian manifoldM in Euclidean space is of-type with k and classify tensor product immersionsf 1 f 2k which are ofk-type. In this article we investigate the tensor product immersionsf 1 f 2k which are of (k+1)-type. Several classification theorems are obtained.  相似文献   

16.
17.
We construct a homology transfer *H*(B) H*(E) for a certain class of proper simplicial maps pE B. Roughly, the important hypothesis is that there is a compact space F, so that all fibres Fx>=p–1(x), xB, are quotient spaces of F, in a certain locally controlled manner. The composition p** H*(B)H*(E)H*(B) is multiplication by the Euler characteristic of F.  相似文献   

18.
Let denote a bipartite distance-regular graph with diameter D 3 and valency k 3. Suppose 0, 1, ..., D is a Q-polynomial ordering of the eigenvalues of . This sequence is known to satisfy the recurrence i – 1 i + i + 1 = 0 (0 > i > D), for some real scalar . Let q denote a complex scalar such that q + q –1 = . Bannai and Ito have conjectured that q is real if the diameter D is sufficiently large.We settle this conjecture in the bipartite case by showing that q is real if the diameter D 4. Moreover, if D = 3, then q is not real if and only if 1 is the second largest eigenvalue and the pair (, k) is one of the following: (1, 3), (1, 4), (1, 5), (1, 6), (2, 4), or (2, 5). We observe that each of these pairs has a unique realization by a known bipartite distance-regular graph of diameter 3.  相似文献   

19.
We prove 2 7/9v for 3-partite hypergraphs. (This is an improvement of the trivial bound 3v.)  相似文献   

20.
We shall develop a method to prove inequalities in a unified manner. The idea is as follows: It is quite often possible to find a continuous functional : n , such that the left- and the right-hand side of a given inequality can be written in the form (u)(v) for suitable points,v=v(u). If one now constructs a map n n , which is functional increasing (i.e. for each x n (which is not a fixed point of ) the inequality (x)<((x)) should hold) one specially gets the chain (u)( u))( 2(u))... n (u)). Under quite general conditions one finds that the sequence { n (u)} n converges tov=v(u). As a consequence one obtains the inequality (u)(v).  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号