首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
The automorphism group of the Steiner triple system of order v 3 (mod 6), obtained from the Bose construction using any Abelian Group G of order 2s + 1, is determined. The main result is that if G is not isomorphic to Z 3 n × Z 9 m , n 0, m 0, the full automorphism group is isomorphic to Hol(G) × Z 3, where Hol(G) is the Holomorph of G. If G is isomorphic to Z 3 n × Z 9 m , further automorphisms occur, and these are described in full.  相似文献   

2.
The lattice of all the closed, invariant subspaces of the Volterra integration operator onL 2[0, 1] is equal to {B(a):a[0, 1]}, whereB(a)={fL 2[0, 1]:f=0 a.e. on [0,a]}. In order to extend this result to Banach function spaces we study the Volterra-type operatorV that was introduced in [7] for the case ofL p -spaces. Our main result characterizesL-closed subspaces of a Banach function spaceL that are invariant underV, whereL denotes the associate space ofL. In particular, if the norm ofL is order continuous and ifV is injective, then all the closed, invariant subspaces ofV are determined.This work was supported by the Research Ministry of Slovenia.  相似文献   

3.
Flores  Julio  Ruiz  César 《Positivity》2003,7(4):303-321
We prove that each positive operator from a Köthe function-space E() to a Banach lattice F with a narrow majorant is itself narrow provided the norm on F is order continuous. We also prove that every l 2-strictly singular regular operator from L p[0,1], 1p < , to a Banach lattice F is narrow, provided F has an order continuous norm.  相似文献   

4.
We study the possible order types of chains of ideals in an ordered set. Our main result is this. Given an indecomposable countable order type , there is a finite listA 1 , ...,A n of ordered sets such that for every ordered setP the setJ(P) of ideals ofP, ordered by inclusion, contains a chain of type if and only ifP contains a subset isomorphic to one of theA 1 #x03B1; , ...,A n . The finiteness of the list relies on the notion of better quasi-ordering introduced by Nash-Williams and the properties of scattered chains obtained by Laver.The results presented. here constitute the second chapter of the third cycle thesis presented by the second author before the Claude Bernard University, Lyon (July 1983).  相似文献   

5.
A subset X of a group G is said to be large (on the left) if, for any finite set of elements g1,l... ,gkin G, an intersection of the subsets giX=gimid x in X is not empty, that is, limits{i=1} {k}giX . It is proved that a group in which elements of order 3 form a large subset is in fact of exponent 3. This result follows from the more general theorem on groups with a largely splitting automorphism of order 3, thus answering a question posed by Jaber amd Wagner in [1]. For groups with a largely splitting automorphism of order 4, it is shown that if His a normal -invariant soluble subgroup of derived length d then the derived subgroup [H,H] is nilpotent of class bounded in terms of d. The special case where =1 yields the same result for groups that are largely of exponent 4.  相似文献   

6.
Summary LetS be a minimal surface of general type over,K the canonical divisor ofS. LetG be an abelian automorphism group ofS. IfK 2140, then the order ofG is at most 52K 2+32. Examples are also provided with an abelian automorphism group of order 12K 2+96.The automorphism groups for a complex algebraic curve of genusg2 have been thoroughly studied by many authors, including many recent ones. In particular, various bounds have been established for the order of such groups: for example, the order of the total automorphism group is 84(g–1) [Hu], that of an abelian subgroup is 4g+4 [N], while the order of any automorphism is 4g+2 ([W], see also [Ha]).It is an intriguing problem to generalise these bounds to higher dimensions. For example, for surfaces of general type, it is well known that the automorphism groups are finite, and the bound of the orders of these groups depends only on the Chern numbers of the surface [A].In the attempts to such generalisations, the order of abelian subgroups has a special importance. Due to Jordan's theorem on group representations (and its followers), a bound on the order of abelian subgroups induces a bound on that of the whole automorphism group, although bounds thus obtained are generally far from satisfactory. In [H-S], it is shown that for surfaces of general type, the order of such an abelian subgroup is bounded by the square of the Chern numbers times a constant.The purpose of this article is to give a further analysis to the abelian case for surfaces of general type, in proving that the order is bounded linearly by the Chern numbers of the surface, in good analogy with the case of curves. More precisely, our main result is the following.Oblatum 11-IX-1989 & 29-I-1990  相似文献   

7.
The fractional Brownian density process is a continuous centered Gaussian ( d )-valued process which arises as a high-density fluctuation limit of a Poisson system of independent d-dimensional fractional Brownian motions with Hurst parameter H. ( ( d ) is the space of tempered distributions). The main result proved in the paper is that if the intensity measure of the (initial) Poisson random measure on d is either the Lebesgue measure or a finite measure, then the density process has self-intersection local time of order k 2 if and only if Hd < k/(k – 1). The latter is also the necessary and sufficient condition for existence of multiple points of order k for d-dimensional fractional Brownian motion, as proved by Talagrand12. This result extends to a non-Markovian case the relationship known for (Markovian) symmetric -stable Lévy processes and their corresponding density processes. New methods are used in order to overcome the lack of Markov property. Other properties of the fractional Brownian density process are also given, in particular the non-semimartingale property in the case H 1/2, which is obtained by a general criterion for the non-semimartingale property of real Gaussian processes that we also prove.  相似文献   

8.
This paper studies a two-person constant sum perfect information game, the End Play Game, arising from an abstraction of end play in bridge. This game was described by Emanuel Lasker who called it whistette. The game uses a deck of cards consisting of a single totally ordered suit of 2n cards. The deck is divided into two hands A and B of n cards each, held by players Left and Right, and one player is designated as having the lead. The player on lead chooses one of his cards, and the other player after seeing this card selects one of his own to play. The player with the higher card wins a trick and obtains the lead. The cards in the trick are removed from each hand, and play then continues until all cards are exhausted. Each player strives to maximize his trick total, and the value of the game to each player is the number of tricks he takes. The strategy of this game seems to be quite complicated, despite its simple appearance. This paper studies partial orderings on hands. One partial order recognizes regularities in the value function that persist when extra cards are added to hands. A pair of hands (A * , B * ) dominates a pair of hands (A, B) for Left, if for any set of extra cards (C 1, C 2) added to the deck such that A B (which equals A * B * ) is a block of consecutive cards in the expanded deck A B {C 1 , C 2} the value of (A C 1, B C 2) to Left always is at least as much as the value to Left of (A * C 1, B * C 2) both when Left has the lead in both games and when Right has the lead in both games. The main result is that ({4, 1}, {3, 2}) dominates ({3, 2}, {4, 1}). Note that with just four cards the hands {4, 1} and {3, 2} are of identical value — they both take one trick independent of the lead or how the hands are played. The dominance result shows that {4, 1} is preferable to {3, 2} when other cards are present. We show that the dominance relation gives a partial order that is not a total order on hands of 3 or more cards. We also study the total point count ordering, which gives a rough estimate for the value of a hand. We derive upper and lower bounds for the value of a hand with given point count.  相似文献   

9.
A boundary problem for the Klein-Gordon equation in the strip 0tT is considered with the boundary condition : the initial state att = 0 and the final state att=T. It is proven that the problem admits of an infinite number of solutions. The same result holds for a generic 2nd order hyperbolic equation in 2-variables. Using the result for the wave operator in 3-space dimensions we give a method to reconstruct functions whose integral on all unit spheres inR 3 is a given function.  相似文献   

10.
We prove the existence of a limit in H m (D)of iterations of a double layer potential constructed from the Hodge parametrix on a smooth compact manifold with boundary, X, and a crack S D, D being a domain in X. Using this result we obtain formulas for Sobolev solutions to the Cauchyproblem in D with data on S, for an elliptic operator A of order m 1, whenever these solutions exist.This representation involves the sum of a series whose terms are iterationsof the double layer potential. A similar regularisation is constructed also for a mixed problem in D.  相似文献   

11.
Boboc  Nicu  Bucur  Gheorghe 《Potential Analysis》2001,14(3):275-288
If S is an H-cone and P:SS is a localizable dilation operator on S (i.e., P is additive increasing, contractive, continuous in order from below and s(Ps+tPt+Pf)S, s,tS,f(SS)+), then it is proved that its adjoint P *:S *S * (i.e., P *=P) is also a localizable dilation operator. This is an improvement of a result obtained by G. Mokobodzki in the frame of excessive functions.  相似文献   

12.
An estimate for multivariate interpolation II   总被引:1,自引:0,他引:1  
Suppose u is a function on a domain Ω in all of whose mth order distributional derivatives are in Lp(Ω) and m is sufficiently large to imply that u is continuous. If the values of u on a sufficiently dense, but not necessarily regular, grid of points are in lp we obtain an estimate of the Lp(Ω) norm of u in terms of the lp norm of these values and the Lp norms of its mth order derivatives. This result is useful in obtaining error estimates for certain interpolation schemes.  相似文献   

13.
We give a formulation, via (1, –1) matrices, of Mathon's construction for conference matrices and derive a new family of conference matrices of order 592t+1 + 1,t 0. This family produces a new conference matrix of order 3646 and a new Hadamard matrix of order 7292. In addition we construct new families of Hadamard matrices of orders 692t+1 + 2, 1092t+1 + 2, 8499 t ,t 0;q 2(q + 3) + 2 whereq 3 (mod 4) is a prime power and 1/2(q + 5) is the order of a skew-Hadamard matrix); (q + 1)q 29 t ,t 0 (whereq 7 (mod 8) is a prime power and 1/2(q + 1) is the order of an Hadamard matrix). We also give new constructions for Hadamard matrices of order 49 t 0 and (q + 1)q 2 (whereq 3 (mod 4) is a prime power).This work was supported by grants from ARGS and ACRB.Dedicated to the memory of our esteemed friend Ernst Straus.  相似文献   

14.
In this paper we present upper bounds on the minimal mass of a non-trivial stationary 1-cycle. The results that we obtain are valid for all closed Riemannian manifolds. The first result is that the minimal mass of a stationary 1-cycle on a closed n-dimensional Riemannian manifold Mn is bounded from above by (n + 2)!d/4, where d is the diameter of a manifold Mn. The second result is that the minimal mass of a stationary 1-cycle on a closed Riemannian manifold Mn is bounded from above by where where is the filling radius of a manifold, and where is its volume.  相似文献   

15.
This paper presents a rigidity result of real hyperbolic quotients inanalogy to Min-Oo's result in Math. Ann. 285(4) (1989),527–539, but without the spin condition. In order to prove this,we use special Killing forms on the exterior form bundle. Moreover, wemake an assumption on the sectional curvature to obtain the necessaryeigenvalue estimates of the curvature endomorphism in theBochner–Weitzenböck formula of k M.  相似文献   

16.
This paper is a survey on the existence and non-existence of ovoids and spreads in the known finite generalized quadrangles. It also contains the following new results. We prove that translation generalized quadrangles of order (s,s 2), satisfying certain properties, have a spread. This applies to three known infinite classes of translation generalized quadrangles. Further a new class of ovoids in the classical generalized quadranglesQ(4, 3 e ),e3, is constructed. Then, by the duality betweenQ(4, 3 e ) and the classical generalized quadrangleW (3 e ), we get line spreads of PG(3, 3 e ) and hence translation planes of order 32e . These planes appear to be new. Note also that only a few classes of ovoids ofQ(4,q) are known. Next we prove that each generalized quadrangle of order (q 2,q) arising from a flock of a quadratic cone has an ovoid. Finally, we give the following characterization of the classical generalized quadranglesQ(5,q): IfS is a generalized quadrangle of order (q,q 2),q even, having a subquadrangleS isomorphic toQ(4,q) and if inS each ovoid consisting of all points collinear with a given pointx ofS\S is an elliptic quadric, thenS is isomorphic toQ(5,q).  相似文献   

17.
We consider the shadow minimization problem (SMP) for Cartesian powers P n of a Macaulay poset P. Our main result is a local-global principle with respect to the lexicographic order L n . Namely, we show that under certain conditions the shadow of any initial segment of the order L n for n 3 is minimal iff it is so for n = 2. These conditions include such poset properties as additivity, shadow increasing, final shadow increasing and being rank-greedy. We also show that these conditions are essentially necessary for the lexicographic order to provide nestedness in the SMP.  相似文献   

18.
Generalizing an idea of Kantor [7], Johnson and Wilke [5] introduced elusive sets of functions over GF(q) to represent translation planes of order q 2 that admit a collineation group of order q 2 in the linear translation complement and whose kern contains GF(q). In this paper we determine explicitly all elusive sets for q even. We obtain another translation plane of order 82.Deicated to Professors Adriano Barlotti and Luigi Antonio Rosati on the occasion of their 60th birthdayThis research was supported in part by a grant from the M.P.I. (40% funds).  相似文献   

19.
The squareG 2 of a graphG has the same point set asG, and two points ofG 2 are adjacent inG 2 if and only if their distance inG is at most two. The result thatG 2 is Hamiltonian ifG is two-connected, has been established early in 1971. A conjecture (ofA. Bondy) followed immediately: SupposeG 2 to have a Hamiltonian cycle; is it true that for anyvV(G), there exist cyclesC j containingv and having arbitrary lengthj, 3j|V(G)|. The proof of this conjecture is one of the two main results of this paper. The other main result states that ifG 2 contains a Hamiltonian pathP(v, w) joining the pointsv andw, thenG 2 contains for anyj withd G 2 (v, w)j|V(G)|–1 a pathP j (v, w) of lengthj joiningv andw. By this, a conjecture ofF. J. Faudree andR. H. Schelp is proved and generalized for the square of graphs.However, to prove these two results extensive preliminary work is necessary in order to make the proof of the main results transparent (Theorem 1 through 5); and Theorem 3 plays a central role for the main results. As can be seen from the statement of Theorem 3, the following known results follow in a stronger form: (a) IfG is two-connected, thenG 2 is Hamiltonian-connected; (b) IfG is two-connected, thenG 2 is 1-Hamiltonian.Dedicated to Prof. Dr. E. Hlawka on the occasion of his 60th birthday  相似文献   

20.
Dirac proved that a graph G is hamiltonian if the minimum degree , where n is the order of G. Let G be a graph and . The neighborhood of A is for some . For any positive integer k, we show that every (2k ? 1)‐connected graph of order n ≥ 16k3 is hamiltonian if |N(A)| ≥ n/2 for every independent vertex set A of k vertices. The result contains a few known results as special cases. The case of k = 1 is the classic result of Dirac when n is large and the case of k = 2 is a result of Broersma, Van den Heuvel, and Veldman when n is large. For general k, this result improves a result of Chen and Liu. The lower bound 2k ? 1 on connectivity is best possible in general while the lower bound 16k3 for n is conjectured to be unnecessary. © 2006 Wiley Periodicals, Inc. J Graph Theory 53: 83–100, 2006  相似文献   

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

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