首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
A-setS in a symmetric 2-(v, k, ) design is a subset which every block meets in 0, 1 or points such that for any point ofS there is a unique block meetingS at that point only. Ovoids in three-dimensional projective spaces are examples of-secs. It is shown that if has a-set then is a geometroid withv=u 2+u+1 andk=u+1, whereu–1. The cases whenu is–1, and+1 are investigated and some open problems discussed.  相似文献   

2.
Stoll's construction [7] of Lévy Brownian motion l on d as a white noise integral is used to obtain an action functional I(x) defined for the surfaces x of l. This provides a Cameron-Martin formula for translation of Lévy measure , and also a large deviation principle for scaled Lévy measures . Proofs follow the lines of [2], where nonstandard techniques were used to give natural proofs of the corresponding results for Wiener measure.The research for this paper was supported partly by a grant from the SERC.  相似文献   

3.
For every uncountable regular cardinal and any cardinal,P denotes the set . Furthermore, < denotes=" the=" binary=" operation=" defined=">P byx<> iffxy¦x<>.By anideal over P we mean a proper, non-principal,-complete ideal overP extending the ideal dual to the filter generated by . For any idealI overP ,I + denotes the setP I, andI * the filter dual toI.  相似文献   

4.
We develop a method for extending results about ultrafilters into a more general setting. In this paper we shall be mainly concerned with applications to cardinality logics. For example, assumingV=L, Gödel's Axiom of Constructibility, we prove that if > then the logic with the quantifier there exist many is (,)-compact if and only if either is weakly compact or is singular of cofinality<. As a corollary, for every infinite cardinals and , there exists a (,)-compact non-(,)-compact logic if and only if either < orcf<cf or < is weakly compact.Counterexamples are given showing that the above statements may fail, ifV=L is not assumed.However, without special assumptions, analogous results are obtained for the stronger notion of [,]-compactness.  相似文献   

5.
An integer partition {1,2,..., v } is said to be graphical if there exists a graph with degree sequence i . We give some results corcerning the problem of deciding whether or not almost all partitions of even integer are non-graphical. We also give asymptotic estimates for the number of partitions with given rank.  相似文献   

6.
Summary In this paper, we study oscillatory stochastic integrals of the form where is a non zero parameter andg a square integrable function. We study integrability properties of () and its behavior as a function of , using stochastic calculus techniques: martingale theory, representation of Itô for a random variable of the Wiener space, lemma of Garsia-Rodemich-Rumsey .... We also obtain limit theorems in law related to the variables () based upon an asymptotic version of a theorem of Knight on orthogonal continuous martingales.We consider the random measure, image by the Brownian motion of the unbounded measure 1[0,] (s)g(s) ds; we prove the existence and the continuity of an occupation time density.Finally, under a stronger integrability condition ong, we show the existence of a density for the law of (), using Malliavin's calculus.  相似文献   

7.
A construction of a pair of strongly regular graphs n and n of type L 2n–1(4n–1) from a pair of skew-symmetric association schemes W, W of order 4n–1 is presented. Examples of graphs with the same parameters as n and n, i.e., of type L 2n–1(4n–1), were known only if 4n–1=p 3, where p is a prime. The first new graph appearing in the series has parameters (v, k, )=(225, 98, 45). A 4-vertex condition for relations of a skew-symmetric association scheme (very similar to one for the strongly regular graphs) is introduced and is proved to hold in any case. This has allowed us to check the 4-vertex condition for n and n, thus to prove that n and n are not rank three graphs if n>2.  相似文献   

8.
An equidistant permutation array (E.P.A.)A(r, v) is av × r array in which every row is a permutation of the integers 1, 2, ,r such that any two distinct rows have precisely columns in common. In this paper we introduce the concept of orthogonality for E.P.A.s. A special case of this is the well known idea of a set of pairwise orthogonal latin squares. We show that a set of these arrays is equivalent to a particular type of resolvable (r, )-design. It is also shown that the cardinality of such a set is bounded byr – with the upper bound being obtained only if = 0. A brief survey of related orthogonal systems is included. In particular, sets of pairwise orthogonal symmetric latin squares, sets of orthogonal Steiner systems and sets of orthogonal skeins.  相似文献   

9.
We consider the equation (pu)-qu+wu = f in (0,1) subject to homogenous boundary conditions at x = 0 and x = 1, e.g., u(0) = u(1) = 0. Let 1 be the first eigenvalue of the corresponding Sturm-Liouville problem. If f 0 but 0 then it is known that there exists > 0 (independent on f) such that for (1, 1 + ] any solution u must be negative. This so-called uniform anti-maximum principle (UAMP) goes back to Clément, Peletier [4]. In this paper we establish the sharp values of for which (UAMP) holds. The same phenomenon, including sharp values of , can be shown for the radially symmetric p-Laplacian on balls and annuli in n provided 1 n < p. The results are illustrated by explicitly computed examples.  相似文献   

10.
This work is an attempt to give a complete survey of all known results about pseudo (v, k, )-designs. In doing this, the author hopes to bring more attention to his conjecture given in Section 6; an affirmative answer to this conjecture would settle completely the existence and construction problem for a pseudo (v, k, )-design in terms of the existence of an appropriate (v, k, )-design.  相似文献   

11.
There are 2 n-1 ways in which a tree on n vertices can be oriented. Each of these can be regarded as the (Hasse) diagram of a partially ordered set. The maximal and minimal widths of these posets are determined. The maximal width depends on the bipartition of the tree as a bipartite graph and it can be determined in time O(n). The minimal width is one of [/2] or [/2]+1, where is the number of leaves of the tree. An algorithm of execution time O(n + 2 log ) to construct the minimal width orientation is given.This research was partially funded by the National Science and Engineering Research Council of Canada under Grant Number A4219.  相似文献   

12.
Summary We consider the two-dimensional Helmholtz equation u+u=0 inD with the boundary conditionsu=0 on D. D is the Swiss Cross — a region consisting of five unit squares. A method based on the concept of Coherence is utilized to determine an approximation for the first eigenvalue= 1 more accurate than calculated by classical difference methods. The numerical result is used to illustrate isoperimetric upper and lower bounds for 1, and to test some conjectures on its relations with torsional rigidity.Dedicated to the memory of Professor Lathar Collatz  相似文献   

13.
We prove a higher integrability result for the gradient of solutions to some degenerate elliptic PDEs, whose model arises in the study of mappings with finite distortion.The nonnegative function which measures the degree of degeneracy of ellipticity bounds lies in the exponential class, i.e. is integrable for some > 0.Our result states that if is sufficiently large, then the gradient of a finite energy solution actually belongs to the Zygmund space LplogL, 1.  相似文献   

14.
A -hyperfactorization ofK 2n is a collection of 1-factors ofK 2n for which each pair of disjoint edges appears in precisely of the 1-factors. We call a -hyperfactorizationtrivial if it contains each 1-factor ofK 2n with the same multiplicity (then =(2n–5)!!). A -hyperfactorization is calledsimple if each 1-factor ofK 2n appears at most once. Prior to this paper, the only known non-trivial -hyperfactorizations had one of the following parameters (or were multipliers of such an example)
(i)  2n=2 a +2, =1 (for alla3); cf. Cameron [3];
(ii)  2n=12, =15 or 2n=24, =495; cf. Jungnickel and Vanstone [8].
In the present paper we show the existence of non-trivial simple -hyperfactorizations ofK 2n for alln5.  相似文献   

15.
We study nonselfadjoint spectral problems for ordinary differential equationsN(y)–P(y)=0 with -linear boundary conditions where the orderp of the differential operatorP is less than the ordern ofN. The present paper addresses the question of the completeness of the eigenfunctions and associated functions in the Sobolev spacesW 2 k (0,1) fork=0,1,...,n. To this end we associate a pencil – of operators acting fromL 2(0,1) to the larger spaceL 2x(0,1) n with the given problem. We establish completeness results for normal problems in certain finite codimensional subspaces ofW 2 k (0,1) which are characterized by means of Jordan chains in 0 of the adjoint of the compact operator = –1.Dedicated to Professor Heinz Langer on the occasion of his 60th birthday  相似文献   

16.
LetB be the Banach algebra of all bounded linear operators on the weighted Lebesgue spaceL p (T, ) with an arbitrary Muckenhoupt weight on the unit circleT, and the Banach subalgebra ofB generated by the operators of multiplication by piecewise continuous coefficients and the operatorse h,S T e h, –1 I (hR, T) whereS T is the Cauchy singular integral operator ande h,(t)=exp(h(t+)/(t–)),tT. The paper is devoted to a symbol calculus, Fredholm criteria and an index formula for the operators in the algebra and its matrix analogue . These shift-invariant algebras arise naturally in studying the algebras of singular integral operators with coefficients admitting semi-almost periodic discontinuities and shifts being diffeomorphisms ofT onto itself with second Taylor derivatives.Partially supported by CONACYT grant, Cátedra Patrimonial, No. 990017-EX and by CONACYT project 32726-E, México.  相似文献   

17.
We study (s, k, 1, 2)-translation divisible designs with 10 in the singular and semi-regular case. Precisely, we describe singular (s, k, 1, 2)-TDD's by quasi-partitions of suitable quotient groups or subgroups of their translation groups. For semi-regular (s, k, 1, 2)-TDD's (and, more general, for the case 2>1) we prove that their translation groups are either Frobenius groups or p-groups of exponent p. Some examples are given for the singular, semi-regular and regular case.  相似文献   

18.
A topological spaceX whose topology is the order topology of some linear ordering onX, is called aninterval space. A space in which every closed subspace is homeomorphic to a clopen subspace, is called aCO space and a space isscattered if every non-empty subspace has an isolated point. We regard linear orderings as topological spaces, by equipping them with their order topology. IfL andK are linear orderings, thenL *, L+K, L · K denote respectively the reverse ordering ofL, the ordered sum ofL andK and the lexicographic order onL x K (so · 2=+). Ordinals are considered as linear orderings, and cardinals are initial ordinals. For cardinals , l 0, letL(K,)=K+1+*.Theorem: Let X be a compact interval scattered space. Then X is a CO space if and only if X is homeomorphic to a space of the form +1+1 L(K i i), where is any ordinal, n , for every ii,i are regular cardinals and Kii, and if n>0, then max({Ki:i相似文献   

19.
Let p be an odd prime. For any CM number field K containing a primitive pth-root of unity, class field theory and Kummer theory put together yield the well known reflection inequality + between the plus and minus parts of the -invariant of K. Greenbergs conjecture asserts that + is always trivial. We study here a weak form of this conjecture, namely += if and only if +==0.  相似文献   

20.
We study the boundary value problem in Ω, u = 0 on ∂Ω, where Ω is a bounded domain in with smooth boundary, λ is a positive real number, and the continuous functions p 1, p 2, and q satisfy 1 < p 2(x) < q(x) < p 1(x) < N and for any . The main result of this paper establishes the existence of two positive constants λ0 and λ1 with λ0 ≤ λ1 such that any is an eigenvalue, while any is not an eigenvalue of the above problem.  相似文献   

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

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