首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 343 毫秒
1.
We prove 2 7/9v for 3-partite hypergraphs. (This is an improvement of the trivial bound 3v.)  相似文献   

2.
This paper proves the existence of resolvable block designs with divisibility into groups GD(v; k, m; 1, 2) without repeated blocks and with arbitrary parameters such that 1 = k, (v–1)/(k–1) 2 vk–2 (and also 1 k/2, (v–1)/(2(k–1)) 2 vk–2 in case k is even) k 4 andp=1 (mod k–1), k < p for each prime divisor p of number v. As a corollary, the existence of a resolvable BIB-design (v, k, ) without repeated blocks is deduced with X = k (and also with = k/2 in case of even k) k , where a is a natural number if k is a prime power and=1 if k is a composite number.Translated from Matematicheskie Zametki, Vol. 19, No. 4, pp. 623–634, April, 1976.  相似文献   

3.
Moser-type estimates for functions whose gradient is in the Lorentz space L(n, q), 1q, are given. Similar results are obtained for solutions uH inf0 sup1 of Au=(f i ) x i , where A is a linear elliptic second order differential operator and |f|L(n, q), 2q.Work partially supported by MURST (40%).  相似文献   

4.
G. Herden  A. Pallack 《Order》2001,18(2):191-200
Let (Z,) be a chain and let (Z,) be its dual chain. Then the length l(Z) of (Z,) is the least upper bound of all cardinal numbers which can be order-embedded into (Z,) or (Z,). In particular, a chain is said to be short if its length is not greater than the smallest infinite cardinal. In this paper we shall prove that the cardinality |Z| of a chain (Z,) cannot be smaller than l(Z) and not greater than 2 l(Z). The inequality |Z|2 l(Z) is an immediate consequence of a general theorem which combines the structure of a chain with its length. In case of a short chain it follows that its structure may be rather complicated but that its cardinality cannot be greater than the cardinality of the real line.  相似文献   

5.
Summary We study a class of generalized gamma functions k (z) which relate to the generalized Euler constants k (basically the Laurent coefficients of(s)) as (z) does to the Euler constant. A new series expansion for k is derived, and the constant term in the asymptotic expansion for log k (z) is studied in detail. These and related constants are numerically computed for 1 k 15.  相似文献   

6.
Let n be n-dimensional Euclidean space, and let : [0, L] n and : [0, L] n be closed rectifiable arcs in n of the same total length L which are parametrized via their arc length. is said to be a chord-stretched version of if for each 0s tL, |(t)–(s)| |(t)–(s)|. is said to be convex if is simple and if ([0, L]) is the frontier of some plane convex set. Individual work by Professors G. Choquet and G. T. Sallee demonstrated that if were simple then there existed a convex chord-stretched version of . This result led Professor Yang Lu to conjecture that if were convex and were a chord-stretched version of then and would be congruent, i.e. any chord-stretching map of a convex arc is an isometry. Professor Yang Lu has proved this conjecture in the case where and are C 2 curves. In this paper we prove the conjecture in general.  相似文献   

7.
We prove the following.THEOREM. Let be the fundamental group of a finite graph of groups with finitely generated vertex groups G v having asdim G v n for all vertices v. Then asdim n+1.This gives the best possible estimate for the asymptotic dimension of an HNN extension and the amalgamated product.  相似文献   

8.
We study a family of topologies {s}0 on the space lp, 0s is the protective topology on lp generated by the family of multipliers my:lpls, my(x)=x · y, where y ranges over the space lp and 1/p + 1/q=1/s. Here ls is taken with its standard topology generated by the norm for s 1 or a pseudonorm if 0s}0sp is strictly increasing and that all the topologies s, 0s are not locally convex when 0Matematicheskie Metody i Fiziko-Mekhanicheskie Polya, Issue 35, 1992, pp. 194–198.  相似文献   

9.
The most well-known application of Montgomery's weighted sieve is to the so-called Brun-Titchmarsh inequality, which was proved byH. L. Montgomery andR. C. Vaughan in the form (x, k, l)2x((k)log(x/k))–1 for 1k<x, (k, l)=1, (x, k, l) being the number of primespx andpl modk, (k) being Euler's function. In this paper an upper estimate is given for a certain class of two-dimensional sieve problems, among them bounds for the number of twin primes and the number of Goldbach representations.  相似文献   

10.
Summary We prove a variational inequality linking the values of the free energy per site at different temperatures. This inequality is based on the Legendre transform of the free energy of two replicas of the system. We prove that equality holds when1/ and fails when 1/ <1. We deduce from this that the mean entropy per site of the uniform distribution with respect to the distribution of the coupling i 1 i 2 = i between two replicas is null when 01/ and strictly positive when 1/ <1. We exhibit thus a new secondary critical phenomenon within the high temperature region 01. We given an interpretation of this phenomenon showing that the fluctuations of the law of the coupling with the interactions remains strong in the thermodynamic limit when>1/ . We also use our inequality numerically within the low temperature region to improve (slightly) the best previously known lower bounds for the free energy and the ground state energy per site.  相似文献   

11.
Let denote a bipartite distance-regular graph with diameter D 3 and valency k 3. Let 0 > 1 ··· > D denote the eigenvalues of and let q h ij (0 h, i, j D) denote the Krein parameters of . Pick an integer h (1 h D – 1). The representation diagram = h is an undirected graph with vertices 0,1,...,D. For 0 i, j D, vertices i, j are adjacent in whenever i j and q h ij 0. It turns out that in , the vertex 0 is adjacent to h and no other vertices. Similarly, the vertex D is adjacent to D – h and no other vertices. We call 0, D the trivial vertices of . Let l denote a vertex of . It turns out that l is adjacent to at least one vertex of . We say l is a leaf whenever l is adjacent to exactly one vertex of . We show has a nontrivial leaf if and only if is the disjoint union of two paths.  相似文献   

12.
We prove that, in at-(v,k,) design with 2tk, a block-transitive automorphism group is point-primitive as soon asv>(( k 2 )–1)2.  相似文献   

13.
Let G be a finite permutation group on a set with no fixed points in and let m and k be integers with 0 < m < k. For a finite subset of the movement of is defined as move() = maxgG| g \ |. Suppose further that G is not a 2-group and that p is the least odd prime dividing |G| and move() m for all k-element subsets of . Then either || k + m or k (7m – 5) / 2, || (9m – 3)/2. Moreover when || > k + m, then move() m for every subset of .  相似文献   

14.
In this paper, we prove that the Hardy spaceH p (), 1p<, over a strictly pseudoconvex domain in n with smooth boundary is quasi-coherent. More precisely, we show that Toeplitz tuplesT with suitable symbols onH p () have property (). This proof is based on a well known exactness result for the tangential Cauchy-Riemann complex.  相似文献   

15.
For unbounded domains with external power-type peaks, we propose a method for the approximation of functionsf(x) w p r () by polynomial splines in the metricw p r (), 1pq, and present the corresponding estimates.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 46, No. 9, pp. 1224–1233, September, 1994.  相似文献   

16.
We will establish the following improved Krasnosel'skii theorems for the dimension of the kernel of a starshaped set: For each k and d, 0 k d, define f(d,k) = d+1 if k = 0 and f(d,k) = max{d+1,2d–2k+2} if 1 k d.Theorem 1. Let S be a compact, connected, locally starshaped set in Rd, S not convex. Then for a k with 0 k d, dim ker S k if and only if every f(d, k) lnc points of S are clearly visible from a common k-dimensional subset of S.Theorem 2. Let S be a nonempty compact set in Rd. Then for a k with 0 k d, dim ker S k if and only if every f (d, k) boundary points of S are clearly visible from a common k-dimensional subset of S. In each case, the number f(d, k) is best possible for every d and k.  相似文献   

17.
Winfried Geyer 《Order》1993,10(4):363-373
In this paper, we consider the following reconstruction problem: Given two ordered sets (G, ) and (M, ) representing join- and meet-irreducible elements, respectively together with three relationsJ,, onG×M modelling comparability (gm) and maximal noncomparability with respect tog (gm, butgm*) and with respect tom (gm, butgm*). We determine necessary and sufficient conditions for the existence of a finite latticeL and injections :GJ(L) and :MM(L) such that the given order relations and the abstract relations coincide with the one induced by the latticeL.  相似文献   

18.
Let (x) denote the number of those integers n with (n) x, where denotes the Euler function. Improving on a well-known estimate of Bateman (1972), we show that (x)-Ax R(x), where A=(2)(3)/(6) and R(x) is essentially of the size of the best available estimate for the remainder term in the prime number theorem.  相似文献   

19.
If (O) is a quadratic cone in PG(3,q), with vertex x, then a flock of (O) is a partition of (O)-{x} into q disjoint conics. With such a flock there correspond a translation plane of order q 2 and a generalized quadrangle of order (q 2, q). Here we determine all flocks of (O) for q 8.  相似文献   

20.
Let M be the complete module of a purely real algebraic field of degree n 3, let be a lattice in this module, and let F(X) be its form. We use to denote any lattice for which we have = , where is a nondiagonal matrix for which – I . With each lattice we can associate a factorizable formF (X) in a natural manner. We denote the complete set of forms corresponding to the set {} by {F (X)}. It is proved that for any > 0 there exists an > 0 such that for eachF (X) {F } we have |F (X0)| for some integer vector X0 0.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova Akademii Nauk SSSR, Vol. 185, pp. 5–12, 1990.In conclusion, the author would like to express his deep gratitude to B. F. Skubenko for stating the problem and for his constant attention.  相似文献   

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

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