首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
n-bathycenters     
Does there exist a polygon with the property that for a suitable point p in the plane every ray with endpoint p intersects the polygon in exactly n connected components? Does there exist a polygon with the property that there are two such points, or three, or a segment of such points? For polygon P call a point p with the property that every ray from p intersects P in exactly n connected components n-isobathic with respect to P. Define the n-bathycenter of a polygon P as the set of all points p that are n-isobathic with respect to P. Further define a set S to be an n-bathycenter if there exists a polygon P of which S is the n-bathycenter. This paper deals with the characterization of 2- and 3-bathycenters, together with some results on the general case.  相似文献   

2.
For r=1,2 the rectangular arrays of zeros and ones with r rows and n columns, with mi zeros and ri changes in the ith row, and with si vertical changes between the ith and (i+1)st rows, i=1,…,r-1, are enumerated. The number of arrays of zeros and ones with 3 rows and n columns, with ri changes in the ith row, i=1,2,3, and with si vertical changes between the ith and (i+1)st rows, i=1,2, is also determined.  相似文献   

3.
At the 4th International Graph Theory Conference 1980, G. Chartrand posed the following problem: If a (connected) graph G contains spanning trees with m and n pendant vertices, respectively, with m < n, does G contain a spanning tree with k pendant vertices for every integer k, where m < k < n? Recently, S. Schuster showed that the answer is yes. Several variations of this interpolation theorem will be given including the following generalization: If a connected graph G contains connected spanning subgraphs of size r with m and n pendant vertices, respectively, with m < n, then G contains a connected spanning subgraph of size r with k pendant vertices for every integer k, where m < k < n.  相似文献   

4.
Let D and E be two real intervals. We consider transformations that map polynomials with zeros in D into polynomials with zeros in E. A general technique for the derivation of such transformations is presented. It is based on identifying the transformation with a parametrised distribution φ (x, µ), xE, µ ∈ D, and forming the bi-orthogonal polynomial system with respect to φ. Several examples of such transformations are given.  相似文献   

5.
Let N be a nest on a complex Banach space X with NN complemented in X whenever N-=N, and let AlgN be the associated nest algebra. We say that an operator Z∈AlgN is an all-derivable point of AlgN if every linear map δ from AlgN into itself derivable at Z (i.e. δ(A)B+Aδ(B)=δ(Z) for any A,BA with AB=Z) is a derivation. In this paper, it is shown that if Z∈AlgN is an injective operator or an operator with dense range, or an idempotent operator with ran(Z)∈N, then Z is an all-derivable point of AlgN. Particularly, if N is a nest on a complex Hilbert space, then every idempotent operator with range in N, every injective operator as well as every operator with dense range in AlgN is an all-derivable point of the nest algebra AlgN.  相似文献   

6.
With each metric space (X,d) we can associate a bornological space (X,Bd) where Bd is the set of all subsets of X with finite diameter. Equivalently, Bd is the set of all subsets of X that are contained in a ball with finite radius. If the metric d can attain the value infinite, then the set of all subsets with finite diameter is no longer a bornology. Moreover, if d is no longer symmetric, then the set of subsets with finite diameter does not coincide with the set of subsets that are contained in a ball with finite radius. In this text we will introduce two structures that capture the concept of boundedness in both symmetric and non-symmetric extended metric spaces.  相似文献   

7.
Let G(n, k) denote the graph of the Johnson Scheme J(n, k), i.e., the graph whose vertices are all k-subsets of a fixed n-set, with two vertices adjacent if and only if their intersection is of size k ? 1. It is known that G(n, k) is a distance regular graph with diameter k. Much work has been devoted to the question of whether a distance regular graph with the parameters of G(n, k) must isomorphic to G(n, k). In this paper, this question is settled affirmatively for n ≥ 20. In fact the result is proved with weaker conditions.  相似文献   

8.
Let a and b be positive and relatively prime integers. We show that the following are equivalent: (i) d is a dead end in the (symmetric) Cayley graph of Z with respect to a and b, (ii) d is a Frobenius value with respect to a and b (it cannot be written as a non-negative or non-positive integer linear combination of a and b), and d is maximal (in the Cayley graph) with respect to this property. In addition, for given integers a and b, we explicitly describe all such elements in Z. Finally, we show that Z has only finitely many dead ends with respect to any finite symmetric generating set. In Appendix A we show that every finitely generated group has a generating set with respect to which dead ends exist.  相似文献   

9.
Let p>0, and let Ep denote the cone of negative plurisubharmonic functions with finite pluricomplex p-energy. We prove that the vector space δEp=EpEp, with the vector ordering induced by the cone Ep is σ-Dedekind complete, and equipped with a suitable quasi-norm it is a non-separable quasi-Banach space with a decomposition property with control of the quasi-norm. Furthermore, we explicitly characterize its topological dual. The cone Ep in the quasi-normed space δEp is closed, generating, and has empty interior.  相似文献   

10.
In this paper, we introduce the notion of f-harmonic map with potential H with respect to the functional E f,H . We use the stress-energy tensor to obtain some monotonicity formulas and Liouville type theorems for f-harmonic maps with potential H under some conditions on f and H.  相似文献   

11.
For a fixed pair of integers r, s ≥ 2, all positive integers m and n are determined which have the property that if the edges of Km,n (a complete bipartite graph with parts n and m) are colored with two colors, then there will always exist a path with r vertices in the first color or a path with s vertices in the second color.  相似文献   

12.
Let V be a nonsingular vector space over a field K of characteristic 2 with |K|>3. Suppose K is perfect and π is an element in the special orthogonal group SO(V)=Ω(V) with dimB(π)=2d. The length of π with respect to the symmetry commutators is d if B(π) is not totally isotropic; otherwise it is d+1.  相似文献   

13.
Baum  Dieter  Kalashnikov  Vladimir 《Queueing Systems》2004,46(3-4):231-247
We analyze spatial MAP/G/∞-, spatial MAP/G/c/01 and spatial Cox/G/∞-stations with group arrivals over some Polish space X (with Borel σ-algebra X), including the aspect of customer motion in space. For models with MAP-input, characteristic differential equations are set up that describe the dynamics of phase dependent random functions Q r;ij (u,t;S′), where Q r;ij (u,t;S′) is the probability to observe, at time ut, the number r of those customers in some source set S′∈X, who will be in a destination set SX at time t. For Cox/G/∞-stations, i.e., infinite server stations with doubly stochastic input, the arrival intensities as well as service times may depend on some general stochastic process (J t ) t≥0 with countable state space. For that case we obtain explicit expressions for space–time distributions as well as stationary and non-stationary characteristics.  相似文献   

14.
We give a method of counting the number of curves with a given type of singularity in a suitably ample linear series on a smooth surface using punctual Hilbert schemes. The types of singularities for which our results suffice include the topological type with local equation xa+yb with ?a?3b. We work out the example of curves with the analytic type of singularity with local equation x2+yn for 1<n<9.  相似文献   

15.
Given partitions R and S with the same weight, the Robinson-Schensted-Knuth correspondence establishes a bijection between the class A(R,S) of (0, 1)-matrices with row sum R and column sum S and pairs of Young tableaux of conjugate shapes λ and λ, with S?λ?R. An algorithm for constructing a matrix in A(R,S) whose insertion tableau has a prescribed shape λ, with S?λ?R, is provided. We generalize some recent constructions due to R. Brualdi for the extremal cases λ=S and λ=R.  相似文献   

16.
A tree with at most m leaves is called an m-ended tree.Kyaw proved that every connected K1,4-free graph withσ4(G)n-1 contains a spanning 3-ended tree.In this paper we obtain a result for k-connected K1,4-free graphs with k 2.Let G be a k-connected K1,4-free graph of order n with k 2.Ifσk+3(G)n+2k-2,then G contains a spanning 3-ended tree.  相似文献   

17.
We prove that if G is a compact Lie group, Y a G-space equipped with a topological local convex structure compatible with the action of G, then Y is a G-ANE for metrizable G-spaces. If, in addition, Y has a G-fixed point and admits a global convex structure compatible with the action of G, then Y is a G-AE. This is applied to show that certain hyperspaces related to the Banach–Mazur compacta are equivariant absolute extensors.  相似文献   

18.
C 1(K) is the space of real continuous functions onK endowed with the usualL 1,-norm where \(K = \overline {\operatorname{int} K}\) is compact inR m · U is a finite-dimensional subspace ofC 1,(K). The metric projection ofC 1,(K) ontoU contains a continuous selection with respect toL 1, -convergence if and only ifU is a unicity (Chebyshev) space forC 1,(K). Furthermore, ifK is connected andU is not a unicity space forC 1,(K), then there is no continuous selection with respect toL -convergence. An example is given of aU and a disconnectedK with no continuous selection with respect toL 1-convergence, but many continuous selections with respect toL -convergence.  相似文献   

19.
The weighted averages of a sequence (c k ), c k ?? ?, with respect to the weights (p k ), p k ?? 0, with {fx135-1} are defined by {fx135-2} while the weighted average of a measurable function f: ?+ ?? ? with respect to the weight function p(t) ?? 0 with {fx135-3}. Under mild assumptions on the weights, we give necessary and sufficient conditions under which the finite limit ?? n ?? L as n ?? ?? or ??(t) ?? L as t ?? ?? exists, respectively. These characterizations may find applications in probability theory.  相似文献   

20.
The permutizer of a subgroup H in a group G is defined as the subgroup generated by all cyclic subgroups of G that permute with H. Call H permuteral in G if the permutizer of H in G coincides with G; H is called strongly permuteral in G if the permutizer of H in U coincides with U for every subgroup U of G containing H. We study the finite groups with given systems of permuteral and strongly permuteral subgroups and find some new characterizations of w-supersoluble and supersoluble groups.  相似文献   

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

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