Let G be a finite group , in this paper using the order and largest element order of G we show that every finite group with the same order and largest element order as G 2 (q), where q 11 is necessarily isomorphic to the group G 2 (q)

Given a rectangle A and a set S of n points in A, the maximum empty rectangle problem is that of finding a largest-area rectangle which is contained in A. has its sides parallel to Ihose ofA. and does Dot contain any of the points in S. This Dote describes an efficient algorithm for solving this problem.

One of the important problems in group theory is characterization of a group by a given property, that is, to prove there exist only one group with a given property. Let  be a finite group. We denote by  the largest order of elements of . In this paper, we prove that some Suzuki groups are characterizable by order and the largest order of elements. In fact, we prove that if  is a group with  an...

We describe an algorithm for selecting the n-th largest element (where 0 < < 1), from a totally ordered set of n elements, using at most (1 + (1 + o(1))H())n comparisons, where H() is the binary entropy function and the o(1) stands for a function that tends to 0 as tends to 0. For small values of this is almost the best possible as there is a lower bound of about (1 + H())n comparisons. The alg...

in recent year, the evolutionary structural optimization (eso) method, has been applied as an effective tool for structures design. the concept of eso method is to use the finite element  results in each iteration of process and removal of inefficient material based on these results. in this method there are several experimental parameters such as rejection rate and evolutionary rate that are e...