首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 484 毫秒
1.
2.
3.
4.
5.
6.
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.  相似文献   

7.
Making use of a combinatorial approach, we prove two refined major-balance identities on the 321-avoiding involutions in Sn, respecting the number of fixed points and the number of descents, respectively. The former one is proved in terms of ordered trees whose non-root nodes have exactly two children, and the latter one is proved in terms of lattice paths within a n2×n2 rectangle.  相似文献   

8.
9.
10.
Wright's conjecture states that the origin is the global attractor for the delay differential equation y(t)=?αy(t?1)[1+y(t)] for all α(0,π2] when y(t)>?1. This has been proven to be true for a subset of parameter values α. We extend the result to the full parameter range α(0,π2], and thus prove Wright's conjecture to be true. Our approach relies on a careful investigation of the neighborhood of the Hopf bifurcation occurring at α=π2. This analysis fills the gap left by complementary work on Wright's conjecture, which covers parameter values further away from the bifurcation point. Furthermore, we show that the branch of (slowly oscillating) periodic orbits originating from this Hopf bifurcation does not have any subsequent bifurcations (and in particular no folds) for α(π2,π2+6.830×10?3]. When combined with other results, this proves that the branch of slowly oscillating solutions that originates from the Hopf bifurcation at α=π2 is globally parametrized by α>π2.  相似文献   

11.
12.
Füredi conjectured that the Boolean lattice 2[n] can be partitioned into (nn/2) chains such that the size of any two differs in at most one. In this paper, we prove that there is an absolute constant α0.8482 with the following property: for every ϵ>0, if n is sufficiently large, the Boolean lattice 2[n] has a chain partition into (nn/2) chains, each of them of size between (αϵ)n and O(n/ϵ).We deduce this result by looking at the more general setup of unimodal normalized matching posets. We prove that a unimodal normalized matching poset P of width w has a chain partition into w chains, each of size at most 2|P|w+5, and it has a chain partition into w chains, where each chain has size at least |P|2w12.  相似文献   

13.
14.
15.
16.
17.
18.
19.
20.
The purpose of this corrigendum is to point out some errors that appear in [1]. Our main result remains valid, i.e scattering of H?k:=H˙k(Rn)H˙1(Rn) solutions of the loglog energy-supercritical Schrödinger equation i?tu+u=|u|4n?2ulogc?(log?(10+|u|2), 0<c<cn, n{3,4}, with k>n2, radial data u(0):=u0H?k but with slightly different values of cn, i.e cn=15772 if n=3 and cn=38024 if n=4. We propose some corrections.  相似文献   

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

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