首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 718 毫秒
1.
We obtain a few structural theorems for circulant weighing matrices whose weight is the square of a prime number. Our results provide new schemes to search for these objects. We also establish the existence status of several previously open cases of circulant weighing matrices. More specifically we show their nonexistence for the parameter pairs (n, k) (here n is the order of the matrix and k its weight) = (147, 49), (125, 25), (200, 25), (55, 25), (95, 25), (133, 49), (195, 25), (11 w, 121) for w < 62.  相似文献   

2.
LetS n be the partial sums of -mixing stationary random variables and letf(x) be a real function. In this note we give sufficient conditions under which the logarithmic average off(S n / n ) converges almost surely to f(x)d(x). We also obtain strong approximation forH(n)= k=1 n k –1 f(S k /k)=logn f(x)d(x) which will imply the asymptotic normality ofH(n)/log1/2 n. But for partial sums of i.i.d. random variables our results will be proved under weaker moment condition than assumed for -mixing random variables.  相似文献   

3.
Summary Let denote the class of infinite product probability measures = 1× 2× defined on an infinite product of replications of a given measurable space (X, A), and let denote the subset of for which (A) =0 or 1 for each permutation invariant event A. Previous works by Hewitt and Savage, Horn and Schach, Blum and Pathak, and Sendler (referenced in the paper) discuss very restrictive sufficient conditions under which a given member , of belongs to . In the present paper, the class is shown to possess several closure properties. E.g., if and 0 n for some n 1, then 0× 1× 2×.... While the current results do not permit a complete characterization of they demonstrate conclusively that is a much larger subset of than previous results indicated. The interesting special case X={0,1} is discussed in detail.Research supported by the National Science Foundation under grant No. MCS75-07556  相似文献   

4.
We shall give a further application of Hermite-Mahler polynomials to the consideration ofp-adic exponential function. An effective lower bound is obtained for max {| – | p ,P(e )| p }, where is an algebraic number satisfying || p <p –/(p–1), and 0 is ap-adic number with | | p depending on the degree of the polynomialPZ[y]. The bound obtained implies the transcendence ofe if ap-adic number satisfying 0 < || p <p –/(p–1) is algebraic or can be well approximated by algebraic numbers.This work was carried out while the author was a research fellow of the Alexander von Humboldt Foundation.  相似文献   

5.
The equation x=uv, wherex Rn andu GM n (Mn is the ring of all n × n real matrices), is considered. The equation is called weakly controllable if for arbitrary pointsa, b R n these exist pointsa and b' as near toa and b, respectively, as we like and a control transforming a into b. In this note algebraic criteria are given for the complete and the weak controllability of such equations in the case where the limiting set G is closed with respect to the operation of matrix multiplication and the G-module Rn is semisimple.Translated from Matematicheskie Zametki, Vol. 23, No. 2, pp. 253–259, February, 1978.  相似文献   

6.
The secretary problem with a known prior distribution of the number of candidates is considered. Ifp(i)=p(N=i),i [, ] , where=inf{i :p(i) > 0} and=sup{i :p(i)0}, is the prior distribution of the numberN of candidates it will be shown that, if the optimal stopping rule is of the simple form, then the optimal stopping indexj=min satisfies asymptotically (as ) the equationj=exp .The probability of selecting the best object by the corresponding policy will be (j-1) p(i)/i. We also give an example of the distributionp for which the optimal stopping rule consists of a stopping set with two islands. We present an asymptotical solution for this example.  相似文献   

7.
We treat n-dimensional compact minimal submanifolds of complex projective space when the maximal holomorphic tangent subspace is (n − 1)-dimensional and we give a sufficient condition for such submanifolds to be tubes over totally geodesic complex subspaces. Authors’ addresses: Mirjana Djorić, Faculty of Mathematics, University of Belgrade, Studentski trg 16, pb. 550, 11000 Belgrade, Serbia; Masafumi Okumura, 5-25-25 Minami Ikuta, Tama-ku, Kawasaki, Japan  相似文献   

8.
LetE be a vector lattice of real-valued functions defined on a setX, and (E):={{f1}:fE}. Among others, it is shown that, under some additional assumptions onE, every measure that integrates all functionsfE is (E)--smooth iffX is (E)-complete. An application of this general result to various topological situations yields some new measure-theoretic characterizations of realcompact, Borel-complete andN-compact spaces, respectively.  相似文献   

9.
LetH 1 andH 2 be Hilbert spaces and letN be an algebraic subspace ofH 1 . The least-squares problem for a linear relationLH 1 H 2 restricted to an algebraic cosetS:=g+N, g H 1 , is considered. Various characterizations of a minimizer are derived in the form of inclusion relations that incorporate the constraints, and conditions under which a minimizer exists are developed. In particular, it is shown that generalized forms of the normal equations for constrained least-squares problems become normal inclusions that involve a multivalued adjoint. The setting includes large classes of constrained least-squares minimization problems and optimal control problems subject to generalized boundary conditions.An application of the abstract theory is given to a singular control problem involving ordinary differential equations with generalized boundary conditions, where the control may generate multiresponses. Characterizations of an optimal solution are developed in the form of inclusions that involve either an integrodifferential equation or a differential equation, and adjoint subspaces and/or solutions of certain linear equations.Research supported by the United States Army under Contract No. DAAG-29-83-K-0109.  相似文献   

10.
Summary We discuss in this paper a non-homogeneous Poisson process A driven by an almost periodic intensity function. We give the stationary version A * and the Palm version A 0 corresponding to A *. Let (T i ,i) be the inter-point distance sequence in A and (T i 0 ,i) in A 0. We prove that forj, the sequence (T i+j,i) converges in distribution to (T i 0 ,i). If the intensity function is periodic then the convergence is in variation.  相似文献   

11.
The notion pasting sum (P i , i ) of two R 2-planes (or Salzmann planes) (P i , i ) is developed. Necessary and sufficient conditions for it to be an R 2-plane again are given. The notion is applied to classify all flat projective planes whose collineation group contains a sub-group with (isomorphism type of , fixed element configuration)=(2, x).  相似文献   

12.
The existence of a weighing matrix of order 33 and weight 25 has been open so far. We actually construct such a circulant matrix, thereby obtaining circulant matrices of order 33t with weight 25, for each positive integer t. Consequently a missing entry in Craigen's table of weighing matrices can now be filled with a positive response. © 1999 John Wiley & Sons, Inc. J Combin Designs 7: 11–15, 1999  相似文献   

13.
Let S be a set of n moving points in the plane. We give new efficient and compact kinetic data structures for maintaining the diameter, width, and smallest area or perimeter bounding rectangle of S . If the points in S move with algebraic motions, these structures process O(n 2+\eps ) events. We also give constructions showing that Ω(n 2 ) combinatorial changes are possible for these extent functions even if each point is moving with constant velocity. We give a similar construction and upper bound for the convex hull, improving known results. Received April 25, 2000, and in revised form September 25, 2000. Online publication May 4, 2001.  相似文献   

14.
The search for chromatically unique graphs   总被引:64,自引:0,他引:64  
The number of vertex-colourings of a simple graphG in not more than colours is a polynomial in. This polynomial, denoted byP(G, ), is called the chromatic polynomial ofG. A graphG is said to be chromatically unique, in short-unique, ifH G for any graphH withP(H, ) = P(G, ). Since the appearance of the first paper on-unique graphs by Chao and Whitehead in 1978, various families of and several results on such graphs have been obtained successively, especially during the last five years. It is the aim of this expository paper to give a survey on most of the works done on-unique graphs. A number of related problems and conjectures are also included.1980 Mathematical Subject Classification. Primary 05C15This work was done while the author was visiting the Department of Mathematics, National University of Singapore.  相似文献   

15.
For a site & (with enough points), we construct a topological space X(&) and a full embedding * of the category of sheaves on & into those on X (&) (i.e., a morphism of toposes :Sh (X(&)) Sh(&)). The embedding will be shown to induce a full embedding of derived categories, hence isomorphisms H*(&,A) = H*(X(&), *A) for any Abelian sheaf A on &. As a particular case, this will give for any scheme Y a topological space X (Y) and a functorial isomorphism between the étale cohomology H*(Y ét,A) and the ordinary sheaf cohomology H*(X((Y),),*A), for any sheaf A for the étale topology on Y.  相似文献   

16.
An edge-incentric d-simplex is defined to be a d-simplex S which admits a (d − 1)-sphere that touches all the edges of S internally. The center of such a sphere is called the edge-incenter of S and is denoted by . Equivalently, S is edge-incentric if and only if its vertices are the centers of d + 1 (d − 1)-spheres in mutual external touch, and for this reason one may call such an S a balloon d-simplex. An orthocentric d-simplex is a d-simplex in which the altitudes are concurrent. The point of concurrence is called the orthocenter and is denoted by . The spaces of edge-incentric and of orthocentric d-simplices have the same dimension d in the sense that a d-simplex in either space can be parametrized, up to shape, by d numbers. Edge-incentric and orthocentric tetrahedra are the first two of the four special classes of tetrahedra studied in [1, Chapter IX.B, pp. 294–333]. The degree of regularity implied by the coincidence of two or more centers of a general d-simplex is investigated in [8], where it is shown that the coincidence of the centroid , the circumcenter , and the incenter does not imply much regularity. For an orthocentric d-simplex S, however, it is proved in [9] that if any two of the centers , and coincide, then S is regular. In this paper, the same question is addressed for edge-incentric d-simplices. Among other things, it is proved that if any three of the centers , and of an edge-incentric d-simplex S coincide, then S is regular, and it is also shown that none of the coincidences , and implies regularity (except when d ≤ 3, d ≤ 4, and d ≤ 6, respectively). In contrast with the afore-mentioned results for orthocentric d-simplices, this emphasizes once more the feeling that, regarding many important properties, orthocentric d-simplices are the true generalizations of triangles. Several open questions are posed. Received: June 19, 2006.  相似文献   

17.
We give simple necessary and sufficient conditions for self-affine tiles in R 2 to be homeomorphic to a disk. Received October 10, 2000, and in revised form February 16, 2001, and April 25, 2001. Online publication July 25, 2001.  相似文献   

18.
In this paper we introduce two tree-width-like graph invariants. The first graph invariant, which we denote by =(G), is defined in terms of positive semi-definite matrices and is similar to the graph invariant (G), introduced by Colin de Verdière in [J. Comb. Theory, Ser. B., 74:121–146, 1998]. The second graph invariant, which we denote by (G), is defined in terms of a certain connected subgraph property and is similar to (G), introduced by van der Holst, Laurent, and Schrijver in [J. Comb. Theory, Ser. B., 65:291–304, 1995]. We give some theorems on the behaviour of these invariants under certain transformations. We show that =(G)=(G) for any graph G with =(G)4, and we give minimal forbidden minor characterizations for the graphs satisfying =(G)k for k=1,2,3,4.This paper is extracted from two chapters of [7]. This work was done while the author was at the Centrum voor Wiskunde en Informatica, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands.  相似文献   

19.
In this paper we consider a special kind of binary trees where each right edge is associated with a positive number and each left edge with a positive number( ). Given, and the number of nodesn, an optimal tree is one which minimizes the total weighted path length. An algorithm for constructing an optimal tree for given, , n is presented, based on which bounds for balances and total weighted path lengths of optimal trees are derived.  相似文献   

20.
Given a unital C*-algebra and a right C*-module over , we consider the problem of finding short smooth curves in the sphere = {x ∈ : 〈x, x〉 = 1}. Curves in are measured considering the Finsler metric which consists of the norm of at each tangent space of . The initial value problem is solved, for the case when is a von Neumann algebra and is selfdual: for any element x 0 ∈ and any tangent vector ν at x 0, there exists a curve γ(t) = e tZ (x 0), Z ∈ , Z* = −Z and ∥Z∥ ≤ π, such that γ(0) = x 0 and (0) = ν, which is minimizing along its path for t ∈ [0, 1]. The existence of such Z is linked to the extension problem of selfadjoint operators. Such minimal curves need not be unique. Also we consider the boundary value problem: given x 0, x 1 ∈ , find a curve of minimal length which joins them. We give several partial answers to this question. For instance, let us denote by f 0 the selfadjoint projection Ix 0x 0, if the algebra f 0 f 0 is finite dimensional, then there exists a curve γ joining x 0 and x 1, which is minimizing along its path.   相似文献   

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

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