首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
In this paper, we discuss the positivity of the Hermitian form (,)π introduced by Li in Invent. Math. 27 (1989) 237-255. Let (G1,G2) be a type I dual pair with G1 the smaller group. Let π be an irreducible unitary representation in the semistable range of θ(MG1,MG2) (see Communications in Contemporary Mathematics, Vol. 2, 2000, pp. 255-283). We prove that the invariant Hermitian form (,)π is positive semidefinite under certain restrictions on the size of G2 and a mild growth condition on the matrix coefficients of π. Therefore, if (,)π does not vanish, θ(MG1,MG2)(π) is unitary.Theta correspondence over was established by Howe in (J. Amer. Math. Soc. 2 (1989) 535-552). Li showed that theta correspondence preserves unitarity for dual pairs in stable range. Our results generalize the results of Li for type I classical groups (Invent. Math. 27 (1989) 237). The main result in this paper can be used to construct irreducible unitary representations of classical groups of type I.  相似文献   

2.
In this note, we consider all possible extensions G of a non-trivial perfect group H acting faithfully on a K3 surface X. The pair (X,G) is proved to be uniquely determined by G if the transcendental value of G is maximum. In particular, we have , if H is the alternating group A5 and normal in G.  相似文献   

3.
A nonincreasing sequence of nonnegative integers π=(d1,d2,…,dn) is graphic if there is a (simple) graph G of order n having degree sequence π. In this case, G is said to realizeπ. For a given graph H, a graphic sequence π is potentiallyH-graphic if there is some realization of π containing H as a (weak) subgraph. Let σ(π) denote the sum of the terms of π. For a graph H and nZ+, σ(H,n) is defined as the smallest even integer m so that every n-term graphic sequence π with σ(π)≥m is potentially H-graphic. Let denote the complete t partite graph such that each partite set has exactly s vertices. We show that and obtain the exact value of σ(Kj+Ks,s,n) for n sufficiently large. Consequently, we obtain the exact value of for n sufficiently large.  相似文献   

4.
Let B be a von Neumann algebra on a separable Hilbert space H. We show that, if the dimension of B as a linear space is infinite, then it has a proper C∗-subalgebra A whose essential commutant in coincides with the essential commutant of B. Moreover, if π is the quotient map from to the Calkin algebra , then π(A)≠π(B) and {π(A)}″=π(B).  相似文献   

5.
Let f:AB be a covering map. We say that A has e filtered ends with respect to f (or B) if, for some filtration {Kn} of B by compact subsets, Af−1(Kn) “eventually” has e components. The main theorem states that if Y is a (suitable) free H-space, if K<H has infinite index, and if Y has a positive finite number of filtered ends with respect to H?Y, then Y has one filtered end with respect to K?Y. This implies that if G is a finitely generated group and K<H<G are subgroups each having infinite index in the next, then implies that , where is the number of filtered ends of a pair of groups in the sense of Kropholler and Roller.  相似文献   

6.
The generalized prism πG of G is the graph consisting of two copies of G, with edges between the copies determined by a permutation π acting on the vertices of G. We define a generalized Cartesian product that corresponds to the Cartesian product when π is the identity, and the generalized prism when H is the graph K2. Burger, Mynhardt and Weakley [A.P. Burger, C.M. Mynhardt, W.D. Weakley, On the domination number of prisms of graphs, Discuss. Math. Graph Theory 24 (2) (2004) 303-318.] characterized universal doublers, i.e. graphs for which γ(πG)=2γ(G) for any π. In general for any n≥2 and permutation π, and a graph attaining equality in this upper bound for all π is called a universal multiplier. We characterize such graphs.  相似文献   

7.
Dezheng Xie 《Discrete Mathematics》2009,309(14):4682-4689
In this paper, some earlier results by Fleischner [H. Fleischner, Bipartizing matchings and Sabidussi’s compatibility conjecture, Discrete Math. 244 (2002) 77-82] about edge-disjoint bipartizing matchings of a cubic graph with a dominating circuit are generalized for graphs without the assumption of the existence of a dominating circuit and 3-regularity. A pair of integer flows (D,f1) and (D,f2) is an (h,k)-flow parity-pair-cover of G if the union of their supports covers the entire graph; f1 is an h-flow and f2 is a k-flow, and . Then G admits a nowhere-zero 6-flow if and only if G admits a (4,3)-flow parity-pair-cover; and G admits a nowhere-zero 5-flow if G admits a (3,3)-flow parity-pair-cover. A pair of integer flows (D,f1) and (D,f2) is an (h,k)-flow even-disjoint-pair-cover of G if the union of their supports covers the entire graph, f1 is an h-flow and f2 is a k-flow, and for each {i,j}={1,2}. Then G has a 5-cycle double cover if G admits a (4,4)-flow even-disjoint-pair-cover; and G admits a (3,3)-flow parity-pair-cover if G has an orientable 5-cycle double cover.  相似文献   

8.
We establish a connection between smooth symplectic resolutions and symplectic deformations of a (possibly singular) affine Poisson variety.In particular, let V be a finite-dimensional complex symplectic vector space and GSp(V) a finite subgroup. Our main result says that the so-called Calogero-Moser deformation of the orbifold V/G is, in an appropriate sense, a versal Poisson deformation. That enables us to determine the algebra structure on the cohomology of any smooth symplectic resolution X?V/G (multiplicative McKay correspondence). We prove further that if is an irreducible Weyl group and , then no smooth symplectic resolution of V/G exists unless G is of types .  相似文献   

9.
The Kurosh rank rK(H) of a subgroup H of a free product of groups Gα, αI, is defined accordingly to the classic Kurosh subgroup theorem as the number of free factors of H. We prove that if H1, H2 are subgroups of and H1, H2 have finite Kurosh rank, then , where , q is the minimum of orders >2 of finite subgroups of groups Gα, αI, q:=∞ if there are no such subgroups, and if q=∞. In particular, if the factors Gα, αI, are torsion-free groups, then .  相似文献   

10.
Suppose that G is a locally compact group and π is a (not necessarily irreducible) unitary representation of a closed normal subgroup N of G on a Hilbert space . We extend results of Clifford and Mackey to determine when π extends to a unitary representation of G on the same space in terms of a cohomological obstruction.  相似文献   

11.
Let denote the maximum average degree (over all subgraphs) of G and let χi(G) denote the injective chromatic number of G. We prove that if , then χi(G)≤Δ(G)+1; and if , then χi(G)=Δ(G). Suppose that G is a planar graph with girth g(G) and Δ(G)≥4. We prove that if g(G)≥9, then χi(G)≤Δ(G)+1; similarly, if g(G)≥13, then χi(G)=Δ(G).  相似文献   

12.
Let Ω be a measurable subset of a compact group G of positive Haar measure. Let be a non-negative function defined on the dual space and let L2(μ) be the corresponding Hilbert space which consists of elements (ξπ)π∈suppμ satisfying , where ξπ is a linear operator on the representation space of π, and is equipped with the inner product: . We show that the Fourier transform gives an isometric isomorphism from L2(Ω) onto L2(μ) if and only if the restrictions to Ω of all matrix coordinate functions , π∈suppμ, constitute an orthonormal basis for L2(Ω). Finally compact connected Lie groups case is studied.  相似文献   

13.
For a locally compact group G, let XG be one of the following introverted subspaces of VN(G): , the C-algebra of uniformly continuous functionals on A(G); , the space of weakly almost periodic functionals on A(G); or , the C-algebra generated by the left regular representation on the measure algebra of G. We discuss the extension of homomorphisms of (reduced) Fourier-Stieltjes algebras on G and H to cb-norm preserving, weak-weak-continuous homomorphisms of into , where (XG,XH) is one of the pairs , , or . When G is amenable, these extensions are characterized in terms of piecewise affine maps.  相似文献   

14.
The bandwidth B(G) of a graph G is the minimum of the quantity max{|f(x)-f(y)|:xyE(G)} taken over all proper numberings f of G. The strong product of two graphs G and H, written as G(SP)H, is the graph with vertex set V(GV(H) and with (u1,v1) adjacent to (u2,v2) if one of the following holds: (a) u1 and v1 are adjacent to u2 and v2 in G and H, respectively, (b) u1 is adjacent to u2 in G and v1=v2, or (c) u1=u2 and v1 is adjacent to v2 in H. In this paper, we investigate the bandwidth of the strong product of two connected graphs. Let G be a connected graph. We denote the diameter of G by D(G). Let d be a positive integer and let x,y be two vertices of G. Let denote the set of vertices v so that the distance between x and v in G is at most d. We define δd(G) as the minimum value of over all vertices x of G. Let denote the set of vertices z such that the distance between x and z in G is at most d-1 and z is adjacent to y. We denote the larger of and by . We define η(G)=1 if G is complete and η(G) as the minimum of over all pair of vertices x,y of G otherwise. Let G and H be two connected graphs. Among other results, we prove that if δD(H)(G)?B(G)D(H)+1 and B(H)=⌈(|V(H)|+η(H)-2)/D(H)⌉, then B(G(SP)H)=B(G)|V(H)|+B(H). Moreover, we show that this result determines the bandwidth of the strong product of some classes of graphs. Furthermore, we study the bandwidth of the strong product of power of paths with complete bipartite graphs.  相似文献   

15.
Acyclic edge colouring of planar graphs without short cycles   总被引:1,自引:0,他引:1  
Let G=(V,E) be any finite graph. A mapping C:E→[k] is called an acyclic edgek-colouring of G, if any two adjacent edges have different colours and there are no bichromatic cycles in G. In other words, for every pair of distinct colours i and j, the subgraph induced in G by all the edges which have colour i or j, is acyclic. The smallest number k of colours, such that G has an acyclic edge k-colouring is called the acyclic chromatic index of G, denoted by .In 2001, Alon et al. conjectured that for any graph G it holds that ; here Δ(G) stands for the maximum degree of G.In this paper we prove this conjecture for planar graphs with girth at least 5 and for planar graphs not containing cycles of length 4,6,8 and 9. We also show that if G is planar with girth at least 6. Moreover, we find an upper bound for the acyclic chromatic index of planar graphs without cycles of length 4. Namely, we prove that if G is such a graph, then .  相似文献   

16.
Let m?2 be an integer, and π an irreducible unitary cuspidal representation for GLm(AQ), whose attached automorphic L-function is denoted by L(s,π). Let be the sequence of coefficients in the Dirichlet series expression of L(s,π) in the half-plane Rs>1. It is proved in this paper that, if π is such that the sequence is real, then there are infinitely many sign changes in the sequence , and the first sign change occurs at some , where Qπ is the conductor of π, and the implied constant depends only on m and ε. This generalizes the previous results for GL2. A result of the same quality is also established for , the sequence of coefficients in the Dirichlet series expression of in the half-plane Rs>1.  相似文献   

17.
Let H0 (respectively H) denote the class of commuting pairs of subnormal operators on Hilbert space (respectively subnormal pairs), and for an integer k?1 let Hk denote the class of k-hyponormal pairs in H0. We study the hyponormality and subnormality of powers of pairs in Hk. We first show that if (T1,T2)∈H1, the pair may fail to be in H1. Conversely, we find a pair (T1,T2)∈H0 such that but (T1,T2)∉H1. Next, we show that there exists a pair (T1,T2)∈H1 such that is subnormal (for all m,n?1), but (T1,T2) is not in H; this further stretches the gap between the classes H1 and H. Finally, we prove that there exists a large class of 2-variable weighted shifts (T1,T2) (namely those pairs in H0 whose cores are of tensor form (cf. Definition 3.4)), for which the subnormality of and does imply the subnormality of (T1,T2).  相似文献   

18.
19.
Motivated by wavelength-assignment problems for all-to-all traffic in optical networks, we study graph parameters related to sets of paths connecting all pairs of vertices. We consider sets of both undirected and directed paths, under minimisation criteria known as edge congestion and wavelength count; this gives rise to four parameters of a graph G: its edge forwarding index π(G), arc forwarding index , undirected optical index , and directed optical index .In the paper we address two long-standing open problems: whether the equality holds for all graphs, and whether indices π(G) and are hard to compute. For the first problem, we give an example of a family of planar graphs {Gk} such that . For the second problem, we show that determining either π(G) or is NP-hard.  相似文献   

20.
In the paper we examine Pexiderized ?-homogeneity equation almost everywhere. Assume that G and H are groups with zero, (X,G) and (Y,H) are a G- and an H-space, respectively. We prove, under some assumption on (Y,H), that if functions and satisfy Pexiderized ?-homogeneity equation
F1(αx)=?(α)F2(x)  相似文献   

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

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