Related papers: Enumeration Techniques on Cyclic Schur Rings

In this research, a general theoretical framework for clustering is proposed over specific partial algebraic systems by the present author. Her theory helps in isolating minimal assumptions necessary for different concepts of clustering…

Clustering methods group a set of data points into a few coherent groups or clusters of similar data points. As an example, consider clustering pixels in an image (or video) if they belong to the same object. Different clustering methods…

We give the classification of elements - respectively cyclic subgroups - of finite order of the Cremona group, up to conjugation. Natural parametrisations of conjugacy classes, related to fixed curves of positive genus, are provided.

We prove a division algorithm for group rings of high genus surface groups and use it to show that some $2$-complexes with surface fundamental groups are standard. We also give an application of division to cohomological dimension of…

This note describes an algorithm for enumerating all the elements in a finite set based on uniformly random sampling from the set. This algorithm can be used for enumeration by fair sampling with quantum annealing. Our algorithm is based on…

We present a new algorithm to compute all the chiral polytopes that have a given group $G$ as full automorphism group. This algorithm uses a new set of generators that characterize the group, all of them except one being involutions. It…

In this paper we investigate some properties of ideals in group algebras of finite groups over fields. First, we highlight an important link between their dimension, their minimal Hamming distance and the group order. This is a generalized…

We propose a new anytime hierarchical clustering method that iteratively transforms an arbitrary initial hierarchy on the configuration of measurements along a sequence of trees we prove for a fixed data set must terminate in a chain of…

Set partitions are arrangements of distinct objects into groups. The problem of listing all set partitions arises in a variety of settings, in particular in combinatorial optimization tasks. After a brief review, we give practical…

The general theory of Grothendieck categories is presented. We systemize the principle methods and results of the theory, showing how these results can be used for studying rings and modules.

Co-clustering is a specific type of clustering that addresses the problem of finding groups of objects without necessarily considering all attributes. This technique has shown to have more consistent results in high-dimensional sparse data…

We compute the integral cohomology rings of a family of 3-groups. As a corollary, we exhibit, for each n greater than or equal to 5, a pair of groups of order 3^n whose integral cohomology rings are isomorphic.

We apply recent results on the rank of elements of rings to study the structure of generalized corner rings $aRa$, where $R$ is a unital ring and $a$ an element of $R$. We give a complete description of the structure of $aRa$ when $a^2$ has…

It is shown that Section 8 of Plesken's 1983 lecture notes describes blocks of cyclic defect group up to Morita equivalence. In particular such a block is determined by its planar embedded Brauer tree. Applying the radical idealizer…

Clustering is an unsupervised technique of Data Mining. It means grouping similar objects together and separating the dissimilar ones. Each object in the data set is assigned a class label in the clustering process using a distance measure.…

The subgroup pattern of a finite groups $G$ is the table of marks of $G$ together with a list of representatives of the conjugacy classes of subgroups of $G$. In this article we present an algorithm for the computation of the subgroup…

The famous Burnside-Schur theorem states that every primitive finite permutation group containing a regular cyclic subgroup is either 2-transitive or isomorphic to a subgroup of a 1-dimensional affine group of prime degree. It is known that…

Mathematics has been used in the exploration and enumeration of juggling patterns. In the case when we catch and throw one ball at a time the number of possible juggling patterns is well-known. When we are allowed to catch and throw any…

Motivated by spin modular representations of the symmetric groups, we propose two generalizations of the Schur regular partitions for an odd integer $p\geq 3$. One forms a subset of the set of $p$-strict partitions, and the other forms that…

Text Clustering is a text mining technique which divides the given set of text documents into significant clusters. It is used for organizing a huge number of text documents into a well-organized form. In the majority of the clustering…