we give a new proof of the well known wedderburn's little theorem (1905) that a finite‎ ‎division ring is commutative‎. ‎we apply the concept of frobenius kernel in frobenius representation theorem in finite group‎ ‎theory to build a proof‎.

some servers are to be located at nodes of a network. demand for services of these servers is located at each node and a subset of the nodes is to be chosen to locate one server in each. each customer selects a server with a probability dependent on distance and a certain amount of benefit is achieved after giving service to the customer. customers may waive receiving service with a known proba...

epilepsy is the most frequnt nearological affiction and afflicts 1% about of the worlds population. currently there is an urgent need for the development of novel anticonvulsants with higher levels of potency and lower levels of toxicity. in this paper, a series of new 6-(substituted-phenyl)thiazolo[3,2-b][1,2,4]triazole derivatives were synthesized and tested for their anticonvulsant activity ...

We prove that the number of minimal transversals (and also the number of maximal independent sets) in a 3-uniform hypergraph with n vertices is at most c, where c ≈ 1.6702. The best known lower bound for this number, due to Tomescu, is ad, where d = 10 1 5 ≈ 1.5849 and a is a constant.

Dynkin’s classification of maximal subalgebras of simple finite dimensional complex Lie algebras is generalized to matrix Lie superalgebras, i.e., the Lie subsuperalgebras of gl(p|q).

The trace of a family of sets A on a set X is A|X = {A ∩ X : A ∈ A}. If A is a family of k-sets from an n-set such that for any r-subset X the trace A|X does not contain a maximal chain, then how large can A be? Patkós conjectured that, for n sufficiently large, the size of A is at most ( n−k+r−1 r−1 ) . Our aim in this paper is to prove this conjecture.

in this note we review a simple criterion, due to ekedahl, for superspecial curves defined over finite fields.using this we generalize and give some simple proofs for some well-known superspecial curves.

The trace of a set F on a another set X is F |X = F ∩ X and the trace of a family F of sets on X is FX = {F |X : F ∈ F}. In this note we prove that if a k-uniform family F ⊂ ([n] k ) has the property that for any k-subset X the trace F|X does not contain a maximal chain (a family C0 ⊂ C1 ⊂ ... ⊂ Ck with |Ci| = i), then |F| ≤ ( n−1 k−1 ) . This bound is sharp as shown by {F ∈ ([n] k ) , 1 ∈ F}. ...

‎in this paper‎, ‎the notion of the radical of a filter in‎ ‎residuated lattices is defined and several characterizations of‎ ‎the radical of a filter are given‎. ‎we show that if f is a‎ ‎positive implicative filter (or obstinate filter)‎, ‎then‎ ‎rad(f)=f‎. ‎we proved the extension theorem for radical of filters in residuated lattices‎. ‎also‎, ‎we study the radical‎ ‎of filters in linearly o...