首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
Let G be a finite group and let cd(G) be the set of all complex irreducible character degrees of G. Bertram Huppert conjectured that if H is a finite nonAbelian simple group such that cd(G)=cd(H), then G?H×A, where A is an Abelian group. In this paper, we verify the conjecture for the family of simple exceptional groups of Lie type G2(q) for q7.  相似文献   

2.
Let G be a finite group. Let cd(G) be the set of all complex irreducible character degrees of G. In this paper, we will show that if cd(G)?=?cd(H), where H is the Monster or the Baby Monster simple sporadic groups, then ${G\cong H\times A,}$ where A is an abelian group.  相似文献   

3.
In this paper, we answer Larman’s question on Borsuk’s conjecture for two-distance sets. We find a two-distance set consisting of 416 points on the unit sphere $S^{64}\subset\mathbb{R}^{65}$ which cannot be partitioned into 83 parts of smaller diameter. This also reduces the smallest dimension in which Borsuk’s conjecture is known to be false. Other examples of two-distance sets with large Borsuk numbers are given.  相似文献   

4.
Let be a union-closed family of subsets of an m-element set A. Let . For b ∈ A let w(b) denote the number of sets in containing b minus the number of sets in not containing b. Frankl’s conjecture from 1979, also known as the union-closed sets conjecture, states that there exists an element b ∈ A with w(b) ≥ 0. The present paper deals with the average of the w(b), computed over all b ∈ A. is said to satisfy the averaged Frankl’s property if this average is non-negative. Although this much stronger property does not hold for all union-closed families, the first author (Czédli, J Comb Theory, Ser A, 2008) verified the averaged Frankl’s property whenever n ≥ 2 m  − 2 m/2 and m ≥ 3. The main result of this paper shows that (1) we cannot replace 2 m/2 with the upper integer part of 2 m /3, and (2) if Frankl’s conjecture is true (at least for m-element base sets) and then the averaged Frankl’s property holds (i.e., 2 m/2 can be replaced with the lower integer part of 2 m /3). The proof combines elementary facts from combinatorics and lattice theory. The paper is self-contained, and the reader is assumed to be familiar neither with lattices nor with combinatorics. This research was partially supported by the NFSR of Hungary (OTKA), grant no. T 049433, T 48809 and K 60148.  相似文献   

5.
In this article we study minimal1-blocking sets in finite projective spaces PG(n,q),n 3. We prove that in PG(n,q 2),q = p h , p prime, p > 3,h 1, the second smallest minimal 1-blockingsets are the second smallest minimal blocking sets, w.r.t.lines, in a plane of PG(n,q 2). We also study minimal1-blocking sets in PG(n,q 3), n 3, q = p h, p prime, p > 3,q 5, and prove that the minimal 1-blockingsets of cardinality at most q 3 + q 2 + q + 1 are eithera minimal blocking set in a plane or a subgeometry PG(3,q).  相似文献   

6.
The Cannon Conjecture from the geometric group theory asserts that a word hyperbolic group that acts effectively on its boundary, and whose boundary is homeomorphic to the 2-sphere, is isomorphic to a Kleinian group. We prove the following Criterion for Cannon’s Conjecture: a hyperbolic group G (that acts effectively on its boundary) whose boundary is homeomorphic to the 2-sphere is isomorphic to a Kleinian group if and only if every two points in the boundary of G are separated by a quasi-convex surface subgroup. Thus, the Cannon’s conjecture is reduced to showing that such a group contains “enough” quasi-convex surface subgroups.  相似文献   

7.
Journal of Nonlinear Science - The aim of this work is to extend and prove the Onsager conjecture for a class of conservation laws that possess generalized entropy. One of the main findings of this...  相似文献   

8.
9.
We prove a new formula about local control of the number of p-regular conjugacyclasses of a finite group. We then relate the results to Alperins weight conjecture to obtain newresults describing the number of simple modules for a finite group in terms of weights of solvablesubgroups. Finally, we use the results to obtain new formulations of Alperins weight conjecture,and to obtain restrictions on the structure of a minimal counterexample.  相似文献   

10.
In this paper, we prove that a projective generalization of theKnörr–Robinson formulation of Alperins conjecture holds ifthe ordinary form holds for a certain quotient group.  相似文献   

11.
12.
In both his second and lost notebooks, Ramanujan introduced a function, related to the Rogers–Ramanujan continued fraction and its quadratic transformation, and listed several of its properties. We extend these results and develop a systematic theory.  相似文献   

13.
In this paper we prove a quantitative form of Landis’ conjecture in the plane. Precisely, let W(z) be a measurable real vector-valued function and V(z) ≥0 be a real measurable scalar function, satisfying ‖W L (R 2) ≤ 1 and ‖V L (R 2) ≤ 1. Let u be a real solution of Δu ? ?(Wu) ? Vu = 0 in R 2. Assume that u(0) = 1 and |u(z)| ≤exp (C 0|z|). Then u satisfies inf |z 0| =R  sup |z?z 0| <1|u(z)| ≥exp (?CRlog R), where C depends on C 0. In addition to the case of the whole plane, we also establish a quantitative form of Landis’ conjecture defined in an exterior domain.  相似文献   

14.
The present work is devoted to the studying of a boundary-value problem with Neumann’s condition for three-dimensional elliptic equation with singular coefficients. The main result is a proof of the unique solvability of the problem considered. An energy integral method and a Green’s function method were used as the main tools in the proof of the main result. The unique solution is found in an explicit form, which contains Appel’s hypergeometric functions.  相似文献   

15.
Let \(\tau({\mathcal{H}})\) be the cover number and \(\nu({\mathcal{H}})\) be the matching number of a hypergraph \({\mathcal{H}}\). Ryser conjectured that every r-partite hypergraph \({\mathcal{H}}\) satisfies the inequality \(\tau({\mathcal{H}}) \leq (r-1) \nu ({\mathcal{H}})\). This conjecture is open for all r ≥ 4. For intersecting hypergraphs, namely those with \(\nu({\mathcal{H}}) = 1\), Ryser’s conjecture reduces to \(\tau({\mathcal{H}}) \leq r-1\). Even this conjecture is extremely difficult and is open for all r ≥ 6. For infinitely many r there are examples of intersecting r-partite hypergraphs with \(\tau({\mathcal{H}}) = r-1\), demonstrating the tightness of the conjecture for such r. However, all previously known constructions are not optimal as they use far too many edges. How sparse can an intersecting r-partite hypergraph be, given that its cover number is as large as possible, namely \(\tau({\mathcal{H}}) \ge r-1\)? In this paper we solve this question for r ≤ 5, give an almost optimal construction for r = 6, prove that any r-partite intersecting hypergraph with τ(H) ≥ r ? 1 must have at least \((3-\frac{1}{\sqrt{18}})r(1-o(1)) \approx 2.764r(1-o(1))\) edges, and conjecture that there exist constructions with Θ(r) edges.  相似文献   

16.
Sarnak's Disjointness Conjecture states that the Möbius function is disjoint with any zeroentropy flow. This note establishes this conjecture, with a rate, for Furstenberg's irregular flows on the infinite-dimensional torus.  相似文献   

17.
Nakayamas Conjecture is one of the most famous theorems for representation theory of symmetric groups. Two general irreducible characters of a symmetric group belong to the same p-block if and only if the p-cores of the young diagrams corresponding to them are the same. The conjecture was first proven in 1947 by Brauer and Robinson. We consider an analogue of Nakayamas Conjecture for Johnson schemes.Received January 28, 2004  相似文献   

18.
19.
Proceedings - Mathematical Sciences -  相似文献   

20.
Recently, the authors constructed generalized Borcherds products where modular forms are given as infinite products arising from weight 1/2 harmonic Maass forms. Here we illustrate the utility of these results in the special case of Ramanujan’s mock theta function ω(q). We obtain identities and congruences modulo 512 involving the coefficients of ω(q).  相似文献   

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

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