Structure of intersection graphs

<p style="text-align: left;" dir="ltr"> Let <em>G</em> be a finite group and let <em>N</em> be a fixed normal subgroup of <em>G</em>. In this paper, a new kind of graph on <em>G</em>, namely the intersection graph is defined and studied. We use <img src="/public/site/images/ikhsan/equation.png" alt="" width="6" height="4" /> to denote this graph, with its vertices are all normal subgroups of <em>G</em> and two distinct vertices are adjacent if their intersection in <em>N</em>. We show some properties of this graph. For instance, the intersection graph is a simple connected with diameter at most two. Furthermore we give the graph structure of <img src="/public/site/images/ikhsan/equation_(1).png" alt="" width="6" height="4" /> for some finite groups such as the symmetric, dihedral, special linear group, quaternion and cyclic groups. </p>

Abelian p-groups with minimal full inertia

The class of abelian p-groups with minimal full inertia, that is, satisfying the property that fully inert subgroups are commensurable with fully invariant subgroups is investigated, as well as the class of groups not satisfying this property; it is known that both the class of direct sums of cyclic groups and that of torsion-complete groups are of the first type. It is proved that groups with “small" endomorphism ring do not satisfy the property and concrete examples of them are provided via Corner’s realization theorems. Closure properties with respect to direct sums of the two classes of groups are also studied. A topological condition of the socle and a structural condition of the Jacobson radical of the endomorphism ring of a p-group G, both of which are satisfied by direct sums of cyclic groups and by torsion-complete groups, are shown to be independent of the property of having minimal full inertia. The new examples of fully inert subgroups, which are proved not to be commensurable with fully invariant subgroups, are shown not to be uniformly fully inert.

The utility of clusters and a Hungarian clustering algorithm

Implicit in the k–means algorithm is a way to assign a value, or utility, to a cluster of points. It works by taking the centroid of the points and the value of the cluster is the sum of distances from the centroid to each point in the cluster. The aim in this paper is to introduce an alternative way to assign a value to a cluster. Motivation is provided. Moreover, whereas the k–means algorithm does not have a natural way to determine k if it is unknown, we can use our method of evaluating a cluster to find good clusters in a sequential manner. The idea uses optimizations over permutations and clusters are set by the cyclic groups; generated by the Hungarian algorithm.

A free-group valued invariant of free knots

The aim of the present paper is to construct series of invariants of free knots (flat virtual knots, virtual knots) valued in free groups (and also free products of cyclic groups).