# Sandeep Murthy

 Nov 27 accepted How large can abelian subgroups of class 2 nilpotent groups or simple groups be? Nov 27 asked How large can abelian subgroups of class 2 nilpotent groups or simple groups be? Nov 3 awarded Tumbleweed Aug 24 comment Number of partitions of a set with size constraintsWhat I have given is an estimate, because you asked for an upper bound. Obviously it is not an exact formula. Sandeep Aug 24 awarded Teacher Aug 24 awarded Editor Aug 24 revised Number of partitions of a set with size constraintsadded 1 characters in body Aug 24 answered Number of partitions of a set with size constraints Nov 7 awarded Supporter Nov 6 asked Constraining the length of a list type in an XML schema Nov 6 revised XML schemas for modelling finite algebraic structures and substructuresdeleted 1 characters in body Nov 6 asked XML schemas for modelling finite algebraic structures and substructures Nov 3 accepted Difference in Java, if any, between the % operator and the IEEEremainder() method? Nov 3 asked Difference in Java, if any, between the % operator and the IEEEremainder() method? Oct 20 awarded Student Oct 19 comment Finding a vertex of least distance to all other vertices in a graphIt seems to me that we do not need to compute the distance sum of vertices. Surely if backwards iterate over the length of the the tree, such that inside each iteration, we iterate over the vertices of the current tree, testing whether the current vertex is a leaf, and stripping it from the tree if so, then when the current tree is down to 2 vertices, we can return any of those two vertices as the answer. Would this work? Oct 18 accepted Printing elements of an array of arrays of primitives in Java using Arrays.deepToString( Object[] arr ) Oct 17 awarded Supporter Oct 17 awarded Scholar Oct 17 comment Finding a vertex of least distance to all other vertices in a graphThanks. I thought a tree is undirected graph. The graph I describe was described to me as a directed acyclic graph, which I guess is a kind of tree, with partial ordering. Well, anyway, I can see the solution. P. S. Part of the problem with graph theory, being someone who is "just visiting" as it were, is that there are so many terms with overlapping or even inconsistent meanings.