首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 593 毫秒
1.
Let m and k be two fixed positive integers such that m>k?2. Let V be a left vector space over a division ring with dimension at least m+k+1. Let Gm(V) be the Grassmannian consisting of all m-dimensional subspaces of V. We characterize surjective mappings T from Gm(V) onto itself such that for any A,B in Gm(V), the distance between A and B is not greater than k if and only if the distance between T(A) and T(B) is not greater than k.  相似文献   

2.
Let G=(V,E) be a graph with V={1,2,…,n}. Define S(G) as the set of all n×n real-valued symmetric matrices A=[aij] with aij≠0,ij if and only if ijE. By M(G) we denote the largest possible nullity of any matrix AS(G). The path cover number of a graph G, denoted P(G), is the minimum number of vertex disjoint paths occurring as induced subgraphs of G which cover all the vertices of G.There has been some success with relating the path cover number of a graph to its maximum nullity. Johnson and Duarte [5], have shown that for a tree T,M(T)=P(T). Barioli et al. [2], show that for a unicyclic graph G,M(G)=P(G) or M(G)=P(G)-1. Notice that both families of graphs are outerplanar. We show that for any outerplanar graph G,M(G)?P(G). Further we show that for any partial 2-path G,M(G)=P(G).  相似文献   

3.
Let U(G) be a maximal unipotent subgroup of one of the classical groups G=GL(V), O(V), Sp(V). Let W be a direct sum of copies of V and its dual V*. For the natural action U(G) : W, we describe a minimal system of homogeneous generators for the algebra of U(G)-invariant regular functions on W. For G=O(V), Sp(V), this result is connected with a construction for the irreducible representations of G due to H. Weyl.  相似文献   

4.
For a graph G=(V,E) with vertex-set V={1,2,…,n}, which is allowed to have parallel edges, and for a field F, let S(G;F) be the set of all F-valued symmetric n×n matrices A which represent G. The maximum corank of a graph G is the maximum possible corank over all AS(G;F). If (G1,G2) is a (?2)-separation, we give a formula which relates the maximum corank of G to the maximum corank of some small variations of G1 and G2.  相似文献   

5.
Let V be a 6-dimensional vector space over a field F, let f be a nondegenerate alternating bilinear form on V and let Sp(V,f)≅Sp6(F) denote the symplectic group associated with (V,f). The group GL(V) has a natural action on the third exterior power ?3V of V and this action defines five families of nonzero trivectors of V (four of whose are orbits for any choice of F). In this paper, we divide three of these five families into orbits for the action of Sp(V,f)⊆GL(V) on ?3V.  相似文献   

6.
We give canonical matrices of a pair (A,B) consisting of a nondegenerate form B and a linear operator A satisfying B(Ax,Ay)=B(x,y) on a vector space over F in the following cases:
F is an algebraically closed field of characteristic different from 2 or a real closed field, and B is symmetric or skew-symmetric;
F is an algebraically closed field of characteristic 0 or the skew field of quaternions over a real closed field, and B is Hermitian or skew-Hermitian with respect to any nonidentity involution on F.
These classification problems are wild if B may be degenerate. We use a method that admits to reduce the problem of classifying an arbitrary system of forms and linear mappings to the problem of classifying representations of some quiver. This method was described in [V.V. Sergeichuk, Classification problems for systems of forms and linear mappings, Math. USSR-Izv. 31 (3) (1988) 481-501].  相似文献   

7.
Let G=(V,E) be a graph with V={1,2,…,n}. Denote by S(G) the set of all real symmetric n×n matrices A=[ai,j] with ai,j≠0, ij if and only if ij is an edge of G. Denote by I(G) the set of all pairs (p,q) of natural numbers such that there exists a matrix AS(G) with at most p positive and q negative eigenvalues. We show that if G is the join of G1 and G2, then I(G)?{(1,1)}=I(G1K1)∩I(G2K1)?{(1,1)}. Further, we show that if G is a graph with s isolated vertices, then , where denotes the graph obtained from G be removing all isolated vertices, and we give a combinatorial characterization of graphs G with (1,1)∈I(G). We use these results to determine I(G) for every complete multipartite graph G.  相似文献   

8.
Let Mm,n(B) be the semimodule of all m×n Boolean matrices where B is the Boolean algebra with two elements. Let k be a positive integer such that 2?k?min(m,n). Let B(m,n,k) denote the subsemimodule of Mm,n(B) spanned by the set of all rank k matrices. We show that if T is a bijective linear mapping on B(m,n,k), then there exist permutation matrices P and Q such that T(A)=PAQ for all AB(m,n,k) or m=n and T(A)=PAtQ for all AB(m,n,k). This result follows from a more general theorem we prove concerning the structure of linear mappings on B(m,n,k) that preserve both the weight of each matrix and rank one matrices of weight k2. Here the weight of a Boolean matrix is the number of its nonzero entries.  相似文献   

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.
Gleason [A.M. Gleason, The definition of a quadratic form, Amer. Math. Monthly 73 (1966) 1049-1066] determined all functionals Q on K-vector spaces satisfying the parallelogram law Q(x+y)+Q(x-y)=2Q(x)+2Q(y) and the homogeneity Q(λx)=λ2Q(x). Associated with Q is a unique symmetric bi-additive form S such that Q(x)=S(x,x) and 4S(x,y)=Q(x+y)-Q(x-y). Homogeneity of Q corresponds to that of S: S(λx,λy)=λ2S(x,y). The associated S is not necessarily bi-linear.Let V be a vector space over a field K, char(K)≠2,3. A tri-additive form T on V is a map of V3 into K that is additive in each of its three variables. T is homogeneous of degree 3 if T(λx,λy,λz)=λ3T(x,y,z) for all .We determine the structure of tri-additive forms that are homogeneous of degree 3. One of the keys to this investigation is to find the general solution of the functional equation
F(t)+t3G(1/t)=0,  相似文献   

11.
Let F be a field and let m and n be integers with m,n?3. Let Mn denote the algebra of n×n matrices over F. In this note, we characterize mappings ψ:MnMm that satisfy one of the following conditions:
1.
|F|=2 or |F|>n+1, and ψ(adj(A+αB))=adj(ψ(A)+αψ(B)) for all A,BMn and αF with ψ(In)≠0.
2.
ψ is surjective and ψ(adj(A-B))=adj(ψ(A)-ψ(B)) for every A,BMn.
Here, adjA denotes the classical adjoint of the matrix A, and In is the identity matrix of order n. We give examples showing the indispensability of the assumption ψ(In)≠0 in our results.  相似文献   

12.
 Let R be a discrete nonsingular equivalence relation on a standard probability space , and let V be an ergodic strongly asymptotically central automorphism of R. We prove that every V-invariant cocycle with values in a Polish group G takes values in an abelian subgroup of G. The hypotheses of this result are satisfied, for example, if A is a finite set, a closed, shift-invariant subset, V is the shift, μ a shift-invariant and ergodic probability measure on X, the two-sided tail-equivalence relation on X, a shift-invariant subrelation which is μ-nonsingular, and a shift-invariant cocycle. (Received 15 September 2001)  相似文献   

13.
Let Λ be a commutative local uniserial ring with radical factor field k. We consider the category S(Λ) of embeddings of all possible submodules of finitely generated Λ-modules. In case Λ=Z/〈pn〉, where p is a prime, the problem of classifying the objects in S(Λ), up to isomorphism, has been posed by Garrett Birkhoff in 1934. In this paper we assume that Λ has Loewy length at least seven. We show that S(Λ) is controlled k-wild with a single control object IS(Λ). It follows that each finite dimensional k-algebra can be realized as a quotient End(X)/End(X)I of the endomorphism ring of some object XS(Λ) modulo the ideal End(X)I of all maps which factor through a finite direct sum of copies of I.  相似文献   

14.
Let G be a graph. If u,vV(G), a u-vshortest path of G is a path linking u and v with minimum number of edges. The closed interval I[u,v] consists of all vertices lying in some u-v shortest path of G. For SV(G), the set I[S] is the union of all sets I[u,v] for u,vS. We say that S is a convex set if I[S]=S. The convex hull of S, denoted Ih[S], is the smallest convex set containing S. A set S is a hull set of G if Ih[S]=V(G). The cardinality of a minimum hull set of G is the hull number of G, denoted by hn(G). In this work we prove that deciding whether hn(G)≤k is NP-complete.We also present polynomial-time algorithms for computing hn(G) when G is a unit interval graph, a cograph or a split graph.  相似文献   

15.
We determine the universal deformation rings R(G,V) of certain mod 2 representations V of a finite group G which belong to a 2-modular block of G whose defect groups are isomorphic to a generalized quaternion group D. We show that for these V, a question raised by the author and Chinburg concerning the relation of R(G,V) to D has an affirmative answer. We also show that R(G,V) is a complete intersection even though R(G/N,V) need not be for certain normal subgroups N of G which act trivially on V.  相似文献   

16.
17.
Linda Eroh 《Discrete Mathematics》2008,308(18):4212-4220
Let G be a connected graph and SV(G). Then the Steiner distance of S, denoted by dG(S), is the smallest number of edges in a connected subgraph of G containing S. Such a subgraph is necessarily a tree called a Steiner tree for S. The Steiner interval for a set S of vertices in a graph, denoted by I(S) is the union of all vertices that belong to some Steiner tree for S. If S={u,v}, then I(S) is the interval I[u,v] between u and v. A connected graph G is 3-Steiner distance hereditary (3-SDH) if, for every connected induced subgraph H of order at least 3 and every set S of three vertices of H, dH(S)=dG(S). The eccentricity of a vertex v in a connected graph G is defined as e(v)=max{d(v,x)|xV(G)}. A vertex v in a graph G is a contour vertex if for every vertex u adjacent with v, e(u)?e(v). The closure of a set S of vertices, denoted by I[S], is defined to be the union of intervals between pairs of vertices of S taken over all pairs of vertices in S. A set of vertices of a graph G is a geodetic set if its closure is the vertex set of G. The smallest cardinality of a geodetic set of G is called the geodetic number of G and is denoted by g(G). A set S of vertices of a connected graph G is a Steiner geodetic set for G if I(S)=V(G). The smallest cardinality of a Steiner geodetic set of G is called the Steiner geodetic number of G and is denoted by sg(G). We show that the contour vertices of 3-SDH and HHD-free graphs are geodetic sets. For 3-SDH graphs we also show that g(G)?sg(G). An efficient algorithm for finding Steiner intervals in 3-SDH graphs is developed.  相似文献   

18.
We investigate relationships between polyvectors of a vector space V, alternating multilinear forms on V, hyperplanes of projective Grassmannians and regular spreads of projective spaces. Suppose V is an n-dimensional vector space over a field F and that An-1,k(F) is the Grassmannian of the (k − 1)-dimensional subspaces of PG(V) (1  ? k ? n − 1). With each hyperplane H of An-1,k(F), we associate an (n − k)-vector of V (i.e., a vector of ∧nkV) which we will call a representative vector of H. One of the problems which we consider is the isomorphism problem of hyperplanes of An-1,k(F), i.e., how isomorphism of hyperplanes can be recognized in terms of their representative vectors. Special attention is paid here to the case n = 2k and to those isomorphisms which arise from dualities of PG(V). We also prove that with each regular spread of the projective space PG(2k-1,F), there is associated some class of isomorphic hyperplanes of the Grassmannian A2k-1,k(F), and we study some properties of these hyperplanes. The above investigations allow us to obtain a new proof for the classification, up to equivalence, of the trivectors of a 6-dimensional vector space over an arbitrary field F, and to obtain a classification, up to isomorphism, of all hyperplanes of A5,3(F).  相似文献   

19.
Let FG=F(u) be a central quadratic skew field extension (such that the generator u is central in G) and a natural (G,G)-bimodule. We deal with the matrix problem on finding a canonical form for rectangular matrices over W with help of left elementary transformations of their rows and right elementary transformations of columns over G. We solve this problem reducing it in the separable (resp. inseparable) case to the semilinear (resp. pseudolinear) pencil problem.  相似文献   

20.
Let S be a finite solvable group, and suppose S acts on the finite group N, and they have coprime orders. Then, the celebrated Glauberman correspondence provides a natural bijection from the set IrrS(N) of irreducible characters of N which are invariant under the action of S to the set Irr(CN(S)) of all irreducible characters of the centralizer of S in N. Suppose, further, that the semidirect product SN is a normal subgroup of a finite group G. Let θ∈IrrS(N), and let ψ∈Irr(CN(S)) be its Glauberman correspondent. We prove that there is a bijection with good compatibility properties from the set Irr(G,θ) of the irreducible characters of G above θ to Irr(NG(S),ψ) such that, in the case when S is a p-group for some prime p, it preserves fields of values and Schur indices over Qp, the field of p-adic numbers. Using this result, we also prove a strengthening of the McKay Conjecture for all p-solvable groups.  相似文献   

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

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