首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 218 毫秒
1.
Let (G,G+) be a quasi-lattice-ordered group with positive cone G+. Laca and Raeburn have shown that the universal C-algebra C(G,G+) introduced by Nica is a crossed product BG+α×G+ by a semigroup of endomorphisms. The goal of this paper is to extend some results for totally ordered abelian groups to the case of discrete lattice-ordered abelian groups. In particular given a hereditary subsemigroup H+ of G+ we introduce a closed ideal IH+ of the C-algebra BG+. We construct an approximate identity for this ideal and show that IH+ is extendibly α-invariant. It follows that there is an isomorphism between C-crossed products and B+(G/H)β×G+. This leads to our main result that B+(G/H)β×G+ is realized as an induced C-algebra .  相似文献   

2.
Thorsten Holm 《代数通讯》2013,41(6):1957-1969
Let k be a field of characteristic P >0 and let G be a finite abelian group. We determine the structure of the Hochschild cohomology ring of the group algebra k G. Moreover, we prove that for any finite group G the Krull dimension of H H *(k G) equals the p-rank of G.  相似文献   

3.
The edge degree d(e) of the edge e=uv is defined as the number of neighbours of e, i.e., |N(u)∪N(v)|-2. Two edges are called remote if they are disjoint and there is no edge joining them. In this article, we prove that in a 2-connected graph G, if d(e1)+d(e2)>|V(G)|-4 for any remote edges e1,e2, then all longest cycles C in G are dominating, i.e., G-V(C) is edgeless. This lower bound is best possible.As a corollary, it holds that if G is a 2-connected triangle-free graph with σ2(G)>|V(G)|/2, then all longest cycles are dominating.  相似文献   

4.
Let G be a compact nonmetrizable topological group whose local weight b(G) has uncountable cofinality. Let H be an amenable locally compact group, A(G×H) the Fourier algebra of G×H, and UC2(G×H) the space of uniformly continuous functionals in VN(G×H)=A(G×H). We use weak factorization of operators in the group von Neumann algebra VN(G×H) to prove that there exist at least 2b(G)2 left ideals of dimensions at least 2b(G)2 in A(G×H)∗∗ and in UC2(G×H). We show that every nontrivial right ideal in A(G×H)∗∗ and in UC2(G×H) has dimension at least 2b(G)2.  相似文献   

5.
LetG be a profinite group which has an open subgroupH such that the cohomologicalp-dimensiond≔cdp(H) is finite (p is a fixed prime). The main result of this paper expresses thep-primary part of high degree cohomology ofG in terms of the elementary abelianp-subgroups ofG: From the latter one constructs a natural profinite simplicial setA G, on whichG acts by conjugation. ThenH n(G,M)≅H G n (AG,M) holds fornd+r and everyp-primary discreteG-moduleM (rp-rank ofG). If one uses profinite Farrell cohomology, which is introduced in this paper, the analogous fact holds in all degrees. These results are the profinite analogues of theorems by K.S. Brown for discrete groups.  相似文献   

6.
Let A be an R G-module over a commutative ring R, where G is a group of infinite section p-rank (0-rank), C G (A) = 1, A is not a Noetherian R-module, and the quotient A/C A (H) is a Noetherian R-module for every proper subgroup H of infinite section p-rank (0-rank). We describe the structure of solvable groups G of this type.  相似文献   

7.
Suppose G is a locally compact noncompact group. For abelian such G's, it is shown in this paper that L1(G), C(G), and L(G) always have discontinuous translation-invariant linear forms(TILF's) while C0(G) and Lp(G) for 1 < p < ∞ have such forms if and only if GH is a torsion group for some open σ-compact subgroup H of G. For σ-compact amenable G's, all the above spaces have discontinuous left TILF's.  相似文献   

8.
A list-assignment L to the vertices of G is an assignment of a set L(v) of colors to vertex v for every vV(G). An (L,d)-coloring is a mapping ? that assigns a color ?(v)∈L(v) to each vertex vV(G) such that at most d neighbors of v receive color ?(v). A graph is called (k,d)-choosable, if G admits an (L,d)-coloring for every list assignment L with |L(v)|≥k for all vV(G). In this note, it is proved that every plane graph, which contains no 4-cycles and l-cycles for some l∈{8,9}, is (3,1)-choosable.  相似文献   

9.
Let G be a molecular graph. The eccentric connectivity index ξc(G) is defined as ξc(G)=∑uV(G)degG(u)εG(u), where degG(u) denotes the degree of vertex u and εG(u) is the largest distance between u and any other vertex v of G. In this paper exact formulas for the eccentric connectivity index of TUC4C8(S) nanotube and TC4C8(S) nanotorus are given.  相似文献   

10.
An edge-labeling λ for a directed graph G has a weak sense of direction (WSD) if there is a function f that satisfies the condition that for any node u and for any two label sequences α and α generated by non-trivial walks on G starting at u, f(α)=f(α) if and only if the two walks end at the same node. The function f is referred to as a coding function of λ. The weak sense of direction number of G, WSD(G), is the smallest integer k so that G has a WSD-labeling that uses k labels. It is known that WSD(G)≥Δ+(G), where Δ+(G) is the maximum outdegree of G.Let us say that a function τ:V(G)→V(H) is an embedding from G onto H if τ demonstrates that G is isomorphic to a subgraph of H. We show that there are deep connections between WSD-labelings and graph embeddings. First, we prove that when fH is the coding function that naturally accompanies a Cayley graph H and G has a node that can reach every other node in the graph, then G has a WSD-labeling that has fH as a coding function if and only if G can be embedded onto H. Additionally, we show that the problem “Given G, does G have a WSD-labeling that uses a particular coding function f?” is NP-complete even when G and f are fairly simple.Second, when D is a distributive lattice, H(D) is its Hasse diagram and G(D) is its cover graph, then WSD(H(D))=Δ+(H(D))=d, where d is the smallest integer d so that H(D) can be embedded onto the d-dimensional mesh. Along the way, we also prove that the isometric dimension of G(D) is its diameter, and the lattice dimension of G(D) is Δ+(H(D)). Our WSD-labelings are poset-based, making use of Birkhoff’s characterization of distributive lattices and Dilworth’s theorem for posets.  相似文献   

11.
Letp be a prime,G a periodic solvablep′-group acted on by an elementary groupV of orderp 2. We show that ifC G(v) is abelian for eachvV # thenG has nilpotent derived group, and ifp=2 andC G(v) is nilpotent for eachvV # thenG is metanilpotent. Earlier results of this kind were known only for finite groups.  相似文献   

12.
The shift action on the 2-cocycle group Z2(G,C) of a finite group G with coefficients in a finitely generated abelian group C has several useful applications in combinatorics and digital communications, arising from the invariance of a uniform distribution property of cocycles under the action. In this article, we study the shift orbit structure of the coboundary subgroup B2(G,C) of Z2(G,C). The study is placed within a well-known setting involving the Loewy and socle series of a group algebra over G. We prove new bounds on the dimensions of terms in such series. Asymptotic results on the size of shift orbits are also derived; for example, if C is an elementary abelian p-group, then almost all shift orbits in B2(G,C) are maximal-sized for large enough finite p-groups G of certain classes.  相似文献   

13.
A simple graph G=(V,E) admits a cycle-covering if every edge in E belongs at least to one subgraph of G isomorphic to a given cycle C. Then the graph G is C-magic if there exists a total labelling f:VE→{1,2,…,|V|+|E|} such that, for every subgraph H=(V,E) of G isomorphic to C, ∑vVf(v)+∑eEf(e) is constant. When f(V)={1,…,|V|}, then G is said to be C-supermagic.We study the cyclic-magic and cyclic-supermagic behavior of several classes of connected graphs. We give several families of Cr-magic graphs for each r?3. The results rely on a technique of partitioning sets of integers with special properties.  相似文献   

14.
Let G be a graph with vertex set V and edge set E, and let A be an abelian group. A labeling f:VA induces an edge labeling f:EA defined by f(xy)=f(x)+f(y). For iA, let vf(i)=card{vV:f(v)=i} and ef(i)=card{eE:f(e)=i}. A labeling f is said to be A-friendly if |vf(i)−vf(j)|≤1 for all (i,j)∈A×A, and A-cordial if we also have |ef(i)−ef(j)|≤1 for all (i,j)∈A×A. When A=Z2, the friendly index set of the graph G is defined as {|ef(1)−ef(0)|:the vertex labelingf is Z2-friendly}. In this paper we completely determine the friendly index sets of 2-regular graphs. In particular, we show that a 2-regular graph of order n is cordial if and only if n?2 (mod 4).  相似文献   

15.
Let G denote a locally compact abelian group and H a separable Hilbert space. Let L p (G, H), 1 ≤ p < ∞, be the space of H-valued measurable functions which are in the usual L p space. Motivated by the work of Helgason [1], Figa-Talamanca [11] and Bachelis [2, 3], we have defined the derived space of the Banach space L p (G, H) and have studied its properties. Similar to the scalar case, we prove that if G is a noncompact, locally compact abelian group, then L p 0 (G, H) = {0} holds for 1 ≤ p < 2. Let G be a compact abelian group and Γ be its dual group. Let S p (G, H) be the L 1(G) Banach module of functions in L p (G, H) having unconditionally convergent Fourier series in L p -norm. We show that S p (G, H) coincides with the derived space L p 0 (G, H), as in the scalar valued case. We also show that if G is compact and abelian, then L p 0 (G, H) = L 2(G, H) holds for 1 ≤ p ≤ 2. Thus, if FL p (G, H), 1 ≤ p < 2 and F has an unconditionally convergent Fourier series in L p -norm, then FL 2(G, H). Let Ω be the set of all functions on Γ taking only the values 1, ?1 and Ω* be the set of all complex-valued functions on Γ having absolute value 1. As an application of the derived space L p 0 (G, H), we prove the following main result of this paper. Let G be a compact abelian group and F be an H-valued function on the dual group Γ such that $$ \sum \omega (\gamma )F(\gamma )\gamma $$ is a Fourier-Stieltjes series of some measure µ ∈ M(G, H) for every scalar function ω such that |ω(γ)| = 1. Then Fl 2(Γ, H).  相似文献   

16.
We consider an R G-module A over a commutative Noetherian ring R. Let G be a group having infinite section p-rank (or infinite 0-rank) such that C G (A) = 1, A/C A (G) is not a Noetherian R-module, but the quotient A/C A (H) is a Noetherian R-module for every proper subgroup H of infinite section p-rank (or infinite 0-rank, respectively). In this paper, it is proved that if G is a locally soluble group, then G is soluble. Some properties of soluble groups of this type are also obtained.  相似文献   

17.
18.
We prove the existence of solutions of the Cauchy problem for the doubly nonlinear evolution equation: dv(t)/dt+Vφt(u(t))∋f(t), v(t)∈Hψ(u(t)), 0<t<T, where Hψ (respectively, Vφt) denotes the subdifferential operator of a proper lower semicontinuous functional ψ (respectively, φt explicitly depending on t) from a Hilbert space H (respectively, reflexive Banach space V) into (−∞,+∞] and f is given. To do so, we suppose that V?HH?V compactly and densely, and we also assume smoothness in t, boundedness and coercivity of φt in an appropriate sense, but use neither strong monotonicity nor boundedness of Hψ. The method of our proof relies on approximation problems in H and a couple of energy inequalities. We also treat the initial-boundary value problem of a non-autonomous degenerate elliptic-parabolic problem.  相似文献   

19.
For a graph G with the vertex set V(G), we denote by d(u,v) the distance between vertices u and v in G, by d(u) the degree of vertex u. The Hosoya polynomial of G is H(G)=∑{u,v}⊆V(G)xd(u,v). The partial Hosoya polynomials of G are for positive integer numbers m and n. It is shown that H(G1)−H(G2)=x2(x+1)2(H33(G1)−H33(G2)),H22(G1)−H22(G2)=(x2+x−1)2(H33(G1)−H33(G2)) and H23(G1)−H23(G2)=2(x2+x−1)(H33(G1)−H33(G2)) for arbitrary catacondensed benzenoid graphs G1 and G2 with equal number of hexagons. As an application, we give an affine relationship between H(G) with two other distance-based polynomials constructed by Gutman [I. Gutman, Some relations between distance-based polynomials of trees, Bulletin de l’Académie Serbe des Sciences et des Arts (Cl. Math. Natur.) 131 (2005) 1-7].  相似文献   

20.
Let k,n be integers with 2≤kn, and let G be a graph of order n. We prove that if max{dG(x),dG(y)}≥(nk+1)/2 for any x,yV(G) with xy and xyE(G), then G has k vertex-disjoint subgraphs H1,…,Hk such that V(H1)∪?∪V(Hk)=V(G) and Hi is a cycle or K1 or K2 for each 1≤ik, unless k=2 and G=C5, or k=3 and G=K1C5.  相似文献   

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

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