首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 0 毫秒
1.
By multidimensional matrix inversion, combined with an A r extension of Jackson’s 8 φ 7 summation formula by Milne, a new multivariable 8 φ 7 summation is derived. By a polynomial argument this 8 φ 7 summation is transformed to another multivariable 8 φ 7 summation which, by taking a suitable limit, is reduced to a new multivariable extension of the nonterminating 6 φ 5 summation. The latter is then extended, by analytic continuation, to a new multivariable extension of Bailey’s very-well-poised 6 ψ 6 summation formula. Partly supported by FWF Austrian Science Fund grants P17563-N13, and S9607 (the second is part of the Austrian National Research Network “Analytic Combinatorics and Probabilistic Number Theory”).  相似文献   

2.
In this note we study the relation between k R -spaces and k-spaces and prove that a k R -space with a σ-hereditarily closure-preserving k-network consisting of compact subsets is a k-space, and that a k R -space with a point-countable k-network consisting of compact subsets need not be a k-space. This work was supported by the NSF of China (10271056).  相似文献   

3.
Let A and F be artin algebras and ∧UГa paper, we first introduce the notion of k-Gorenstein faithfully balanced selforthogonal bimodule. In this modules with respect to ∧UГ and then characterize it in terms of the U-resolution dimension of some special injective modules and the property of the functors Ext^i (Ext^i (-, U), U) preserving monomorphisms, which develops a classical result of Auslander. As an application, we study the properties of dual modules relative to Gorenstein bimodules. In addition, we give some properties of ∧UГwith finite left or right injective dimension.  相似文献   

4.
In this paper, we introduce p-ideals in semirings. A new form of regularity, which is compatible with p-ideals, is defined. Our aim is to explore the possibilities of establishing an ideal theory in semirings, going alongside the existing literature of semiring theory.AMS Subject Classification (2000): Primary 16Y60  相似文献   

5.
For a (molecular) graph, the first Zagreb index M 1 is equal to the sum of squares of the vertex degrees, and the second Zagreb index M 2 is equal to the sum of products of degrees of pairs of adjacent vertices. In this paper, we study the Zagreb indices of n-vertex connected graphs with k cut vertices, the upper bound for M 1- and M 2-values of n-vertex connected graphs with k cut vertices are determined, respectively. The corresponding extremal graphs are characterized.  相似文献   

6.
John Harding 《Order》2008,25(2):121-129
We show that for any infinite cardinal κ, every complete lattice where each element has at most one complement can be regularly embedded into a uniquely complemented κ-complete lattice. This regular embedding preserves all joins and meets, in particular it preserves the bounds of the original lattice. As a corollary, we obtain that every lattice where each element has at most one complement can be embedded into a uniquely complemented κ-complete lattice via an embedding that preserves the bounds of the original lattice.  相似文献   

7.
We investigate several natural invariants of curves and knots in \mathbbR3{\mathbb{R}^3} . These invariants generalize bridge number and width. As with bridge number, there are connections to the total curvature of a curve.  相似文献   

8.
We obtain the Harnack estimate of the solution to Hk-flow in Euclidean space Rn 1,for k > 0.By using this estimate,we get some corollaries about the translation soliton.  相似文献   

9.
In this paper, we propose approximations to compute the steady-state performance measures of the M/GI/N+GI queue receiving Poisson arrivals with N identical servers, and general service and abandonment-time distributions. The approximations are based on scaling a single server M/GI/1+GI queue. For problems involving deterministic and exponential abandon times distributions, we suggest a practical way to compute the waiting time distributions and their moments using the Laplace transform of the workload density function. Our first contribution is numerically computing the workload density function in the M/GI/1+GI queue when the abandon times follow general distributions different from the deterministic and exponential distributions. Then we compute the waiting time distributions and their moments. Next, we scale-up the M/GI/1+GI queue giving rise to our approximations to capture the behavior of the multi-server system. We conduct extensive numerical experiments to test the speed and performance of the approximations, which prove the accuracy of their predictions.   相似文献   

10.
11.
We prove that a locally compact ANR-space X is a Q-manifold if and only if it has the Disjoint Disk Property (DDP), all points of X are homological Z -points and X has the countable-dimensional approximation property (cd-AP), which means that each map f: KX of a compact polyhedron can be approximated by a map with the countable-dimensional image. As an application we prove that a space X with DDP and cd-AP is a Q-manifold if some finite power of X is a Q-manifold. If some finite power of a space X with cd-AP is a Q-manifold, then X 2 and X × [0, 1] are Q-manifolds as well. We construct a countable family χ of spaces with DDP and cd-AP such that no space Xχ is homeomorphic to the Hilbert cube Q whereas the product X × Y of any different spaces X, Yχ is homeomorphic to Q. We also show that no uncountable family χ with such properties exists. This work was supported by the Slovenian-Ukrainian (Grant No. SLO-UKR 04-06/07)  相似文献   

12.
Plesnik in 1972 proved that an (m - 1)-edge connected m-regular graph of even order has a 1-factor containing any given edge and has another 1-factor excluding any given m - 1 edges. Alder et al. in 1999 showed that if G is a regular (2n + 1)-edge-connected bipartite graph, then G has a 1-factor containing any given edge and excluding any given matching of size n. In this paper we obtain some sufficient conditions related to the edge-connectivity for an n-regular graph to have a k-factor containing a set of edges and (or) excluding a set of edges, where 1 ≤ k ≤n/2. In particular, we generalize Plesnik's result and the results obtained by Liu et al. in 1998, and improve Katerinis' result obtained 1993. Furthermore, we show that the results in this paper are the best possible.  相似文献   

13.
For a k-connected graph, we define the notion of a block by means of local vertex connectivity and prove some properties of blocks that generalize the properties of classical biconnected blocks of a connected graph. We investigate the structure of the decomposition of a k-connected graph by several cuts. Bibliography: 9 titles.Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 293, 2002, pp. 59–93.This revised version was published online in April 2005 with a corrected cover date and article title.  相似文献   

14.
For a finite permutation group G acting on a set Ω, we say that G is k-free if the set-wise stabilizer of every k-subset of Ω is trivial. The purpose of this article is to describe, for all k, the primitive k-free permutation groups. Received: 20 February 2006  相似文献   

15.
The k-out-of-n model is commonly used in reliability theory. In this model the failure of any component of the system does not influence the components still at work. Sequential k-out-of-n systems have been introduced as an extension of k-out-of-n systems where the failure of some component of the system may influence the remaining ones. We consider nonparametric estimation of the cumulative hazard function, the reliability function and the quantile function of sequential k-out-of-n systems. Furthermore, nonparametric hypothesis testing for sequential k-out-of-n-systems is examined. We make use of counting processes to show strong consistency and weak convergence of the estimators and to derive the asymptotic distribution of the test statistics.  相似文献   

16.
The k points that optimally represent a distribution (usually in terms of a squared error loss) are called the k principal points. This paper presents a computationally intensive method that automatically determines the principal points of a parametric distribution. Cluster means from the k-means algorithm are nonparametric estimators of principal points. A parametric k-means approach is introduced for estimating principal points by running the k-means algorithm on a very large simulated data set from a distribution whose parameters are estimated using maximum likelihood. Theoretical and simulation results are presented comparing the parametric k-means algorithm to the usual k-means algorithm and an example on determining sizes of gas masks is used to illustrate the parametric k-means algorithm.  相似文献   

17.
The paper studies the existence of (n + 1)-cliques in k-connected graphs. It is proved that, in a k-connected graph G, such a clique exists, provided that the following conditions are fulfilled: (1) the vertices of every n-clique of G belong to a k-cutset; (2) the removal of certain pairs each of which consists of a vertex and an edge decreases the connectivity of the graph G by 2. Bibliography: 4 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 340, 2006, pp. 76–86.  相似文献   

18.
In this note, we show that the number of composite integers n ≤ x such that φ(n)|n - 1 is at most O(x^1/2(loglog x)^1/2), thus improving earlier results by Pomerance and by Shan.  相似文献   

19.
Let Λ be a finitely generated associative k-algebra where k is an algebraically closed field. For each natural number d, we have the variety of d-dimensional module structures on kd given by the multiplication of the elements from a generating set of Λ. The general linear group Gld(k) acts on this variety by conjugation and the orbits under this action correspond to isomorphism classes of d-dimensional Λ-modules. For two d-dimensional Λ-modules M and N one says that M degenerates to N if the orbit corresponding to N is in the Zariski-closure of the orbit corresponding to M. Now in this situation the stabilizers of the elements in the orbit corresponding to N acts on the orbit corresponding to M. In this paper we characterize degenerations of k[t]/(tr)-modules with the property that for each y in the orbit corresponding to N, there is an xy in the orbit corresponding to M such that the orbit corresponding to M is the disjoint union of orbits of the xy’s under the action of the stabilizer of y where y runs through the orbit corresponding to N. Presented by Idun ReitenMathematics Subject Classifications (2000) 14L30, 16G10.  相似文献   

20.
In this paper, we consider the special case of the question raised by Halmos (see below). In particular, we show that if Tk is p-hyponormal, then T is a subscalar operator of order 4k. As a corollary, we obtain that if Tk is p-hyponormal and σ(T) has nonempty interior in the plane, then T has a nontrivial invariant subspace.  相似文献   

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

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