首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
2.
3.
4.
5.
Let λ1Ka denote the graph on a vertices with λ1 edges between every pair of vertices. Take p copies of this graph λ1Ka, and join each pair of vertices in different copies with λ2 edges. The resulting graph is denoted by K(a,p;λ1,λ2), a graph that was of particular interest to Bose and Shimamoto in their study of group divisible designs with two associate classes. The existence of z-cycle decompositions of this graph have been found when z{3,4}. In this paper we consider resolvable decompositions, finding necessary and sufficient conditions for a 4-cycle factorization of K(a,p;λ1,λ2) (when λ1 is even) or of K(a,p;λ1,λ2) minus a 1-factor (when λ1 is odd) whenever a is even.  相似文献   

6.
7.
8.
Let Ω?Rn be a bounded domain satisfying a Hayman-type asymmetry condition, and let D be an arbitrary bounded domain referred to as an “obstacle”. We are interested in the behavior of the first Dirichlet eigenvalue λ1(Ω?(x+D)).First, we prove an upper bound on λ1(Ω?(x+D)) in terms of the distance of the set x+D to the set of maximum points x0 of the first Dirichlet ground state ?λ1>0 of Ω. In short, a direct corollary is that if
(1)μΩ:=maxx?λ1(Ω?(x+D))
is large enough in terms of λ1(Ω), then all maximizer sets x+D of μΩ are close to each maximum point x0 of ?λ1.Second, we discuss the distribution of ?λ1(Ω) and the possibility to inscribe wavelength balls at a given point in Ω.Finally, we specify our observations to convex obstacles D and show that if μΩ is sufficiently large with respect to λ1(Ω), then all maximizers x+D of μΩ contain all maximum points x0 of ?λ1(Ω).  相似文献   

9.
Denote the sum of element orders in a finite group G by ψ(G) and let Cn denote the cyclic group of order n. Suppose that G is a non-cyclic finite group of order n and q is the least prime divisor of n. We proved that ψ(G)711ψ(Cn) and ψ(G)<1q?1ψ(Cn). The first result is best possible, since for each n=4k, k odd, there exists a group G of order n satisfying ψ(G)=711ψ(Cn) and the second result implies that if G is of odd order, then ψ(G)<12ψ(Cn). Our results improve the inequality ψ(G)<ψ(Cn) obtained by H. Amiri, S.M. Jafarian Amiri and I.M. Isaacs in 2009, as well as other results obtained by S.M. Jafarian Amiri and M. Amiri in 2014 and by R. Shen, G. Chen and C. Wu in 2015. Furthermore, we obtained some ψ(G)-based sufficient conditions for the solvability of G.  相似文献   

10.
11.
12.
A finite Borel measure μ in Rd is called a frame-spectral measure if it admits an exponential frame (or Fourier frame) for L2(μ). It has been conjectured that a frame-spectral measure must be translationally absolutely continuous, which is a criterion describing the local uniformity of a measure on its support. In this paper, we show that if any measures ν and λ without atoms whose supports form a packing pair, then ν?λ+δt?ν is translationally singular and it does not admit any Fourier frame. In particular, we show that the sum of one-fourth and one-sixteenth Cantor measure μ4+μ16 does not admit any Fourier frame. We also interpolate the mixed-type frame-spectral measures studied by Lev and the measure we studied. In doing so, we demonstrate a discontinuity behavior: For any anticlockwise rotation mapping Rθ with θ±π/2, the two-dimensional measure ρθ(?):=(μ4×δ0)(?)+(δ0×μ16)(Rθ?1?), supported on the union of x-axis and y=(cot?θ)x, always admit a Fourier frame. Furthermore, we can find {e2πiλ,x}λΛθ such that it forms a Fourier frame for ρθ with frame bounds independent of θ. Nonetheless, ρ±π/2 does not admit any Fourier frame.  相似文献   

13.
Let G be a graph with n vertices and e(G) edges, and let μ1(G)?μ2(G)???μn(G)=0 be the Laplacian eigenvalues of G. Let Sk(G)=i=1kμi(G), where 1?k?n. Brouwer conjectured that Sk(G)?e(G)+k+12 for 1?k?n. It has been shown in Haemers et al. [7] that the conjecture is true for trees. We give upper bounds for Sk(G), and in particular, we show that the conjecture is true for unicyclic and bicyclic graphs.  相似文献   

14.
15.
16.
17.
18.
We consider the finite exceptional group of Lie type G=E6ε(q) (universal version) with 3|q?ε, where E6+1(q)=E6(q) and E6?1(q)=2E6(q). We classify, up to conjugacy, all maximal-proper 3-local subgroups of G, that is, all 3-local M<G which are maximal with respect to inclusion among all proper subgroups of G which are 3-local. To this end, we also determine, up to conjugacy, all elementary-abelian 3-subgroups containing Z(G), all extraspecial subgroups containing Z(G), and all cyclic groups of order 9 containing Z(G). These classifications are an important first step towards a classification of the 3-radical subgroups of G, which play a crucial role in many open conjectures in modular representation theory.  相似文献   

19.
20.
Let e be a positive integer, p be an odd prime, q=pe, and Fq be the finite field of q elements. Let f,gFq[X,Y]. The graph Gq(f,g) is a bipartite graph with vertex partitions P=Fq3 and L=Fq3, and edges defined as follows: a vertex (p)=(p1,p2,p3)P is adjacent to a vertex [l]=[l1,l2,l3]L if and only if p2+l2=f(p1,l1) and p3+l3=g(p1,l1). If f=XY and g=XY2, the graph Gq(XY,XY2) contains no cycles of length less than eight and is edge-transitive. Motivated by certain questions in extremal graph theory and finite geometry, people search for examples of graphs Gq(f,g) containing no cycles of length less than eight and not isomorphic to the graph Gq(XY,XY2), even without requiring them to be edge-transitive. So far, no such graphs Gq(f,g) have been found. It was conjectured that if both f and g are monomials, then no such graphs exist. In this paper we prove the conjecture.  相似文献   

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

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