let $g$ be a finite group and let $text{cd}(g)$ be the set of all‎ ‎complex irreducible character degrees of $g$‎. ‎b‎. ‎huppert conjectured‎ ‎that if $h$ is a finite nonabelian simple group such that‎ ‎$text{cd}(g) =text{cd}(h)$‎, ‎then $gcong h times a$‎, ‎where $a$ is‎ ‎an abelian group‎. ‎in this paper‎, ‎we verify the conjecture for‎ ${f_4(2)}.$‎

Examples of such algebras are subspaces of associative algebras of characteristic p^O which are closed under the Lie multiplication [ab] =ab — ba and under pih powers. Then one may take a[pl =ap. It is known that every restricted Lie algebra is isomorphic to one of this type. For this reason we may simplify our notation in the sequel and write a" for alp]. We call the mapping a—>ap the p-operat...

‎‎we investigate graham higman's paper emph{enumerating }$p$emph{-groups}‎, ‎ii‎, ‎in which he formulated his famous porc conjecture‎. ‎we are able to simplify some of the theory‎. ‎in particular‎, ‎higman's paper contains five pages of homological algebra which he uses in‎ ‎his proof that the number of solutions in a finite field to a finite set of‎ ‎emph{monomial} equations is porc‎. ‎it turn...

let $gamma(s_n)$ be the minimum number of proper subgroups‎ ‎$h_i, i=1‎, ‎dots‎, ‎l $ of the symmetric group $s_n$ such that each element in $s_n$‎ ‎lies in some conjugate of one of the $h_i.$ in this paper we‎ ‎conjecture that $$gamma(s_n)=frac{n}{2}left(1-frac{1}{p_1}right)‎ ‎left(1-frac{1}{p_2}right)+2,$$ where $p_1,p_2$ are the two smallest primes‎ ‎in the factorization of $ninmathbb{n}$ an...

 In this paper, we prove Frankl's Conjecture for an upper semimodular lattice $L$ such that $|J(L)setminus A(L)| leq 3$, where $J(L)$ and $A(L)$ are the set of join-irreducible elements and the set of atoms respectively. It is known that the class of planar lattices is contained in the class of dismantlable lattices and the class of dismantlable lattices is contained in the class of lattices ha...

in this paper, we mainly investigate the uniqueness of the entire function sharing a small entire function with its high difference operators. we obtain one results, which can give a negative answer to an uniqueness question relate to the bruck conjecture dealt by liu and yang. meanwhile, we also establish a difference analogue of the bruck conjecture for entire functions of order less than 2, ...

In this survey we report about a new algorithm for factoring polynomials due to Mark van Hoeij. The main idea is that the combinatorial problem which occurs in the Zassenhaus algorithm is reduced to a very special knapsack problem. In case of rational polynomials this knapsack problem can be very efficiently solved by the LLL algorithm. This gives a polynomial time algorithm which also works ve...

In this paper, we contribute higher order operator-splitting method improved by Zassenhaus product. We apply the contribution to classical and iterative splitting methods. The underlying analysis to obtain higher order operator-splitting methods is presented. While applying the methods to partial differential equations, the benefits of balancing time and spatial scales are discussed to accelera...

We describe an iterative method of constructing some favorable auxiliary polynomials used to obtain lower bounds in some problems of algebraic number theory. With this method we improve a lower bound on Mahler’s measure of a polynomial with no cyclotomic factors whose coefficients are all congruent to 1 modulo m for some integer m ≥ 2, raise a lower bound in the problem of Schinzel and Zassenha...