Related papers: Enumeration Techniques on Cyclic Schur Rings
Hierarchical clustering is a common algorithm in data analysis. It is unique among many clustering algorithms in that it draws dendrograms based on the distance of data under a certain metric, and group them. It is widely used in all areas…
We give an explicit combinatorial presentation of the Chow groups of a toric scheme over a DVR. As an application, we compute the Chow groups of several toric schemes over a DVR and of their special fibers.
In this paper homotopical methods for the description of subgroups determined by ideals in group rings are introduced. It is shown that in certain cases the subgroups determined by symmetric product of ideals in group rings can be described…
We define a global rank for partial types based in a generalization of Shelah trees. We prove an equivalence with the depth of a localized version of the constructions known as dividing sequence and dividing chain. This rank characterizes…
We present a method of computing elements of spin groups in the case of arbitrary dimension. This method generalizes Hestenes method for the case of dimension 4. We use the method of averaging in Clifford's geometric algebra previously…
A number system coding for the permutations generated by cyclic shift is described. The system allows to find the rank of a permutation given how it has been generated, and to determine a permutation given its rank. It defines a code…
We determine the maximal number of steps required to sort $n$ labeled points on a circle by adjacent swaps. Lower bounds for sorting by all swaps, not necessarily adjacent, are given as well.
In this report we summarize this work, all finite simple groups $G$ can determined uniformly using their orders $|G|$ and the set $\pi_e(G)$ of their element orders.
Let $G$ be a finite group. If $\Gamma$ is a permutation group with $G_{right}\leq\Gamma\leq Sym(G)$ and $\mathcal{S}$ is the set of orbits of the stabilizer of the identity $e=e_{G}$ in $\Gamma$, then the $\mathbb{Z}$-submodule…
We consider the question of computing the distribution of a permutation statistics over restricted permutations via enumeration schemes. The restricted permutations are those avoiding sets of vincular patterns (which include both classical…
We give a general definition of classical and quantum groups whose representation theory is "determined by partitions" and study their structure. This encompasses many examples of classical groups for which Schur-Weyl duality is described…
In this paper, in the first we give definitions of some classes of division rings which strictly contain the class of centrally finite division rings. One of our main purpose is to construct non-trivial examples of rings of new defined…
We introduce the notion of pattern for numerical semigroups, which allows us to generalize the definition of Arf numerical semigroups. In this way infinitely many other classes of numerical semigroups are defined giving a classification of…
We investigate sums of exceptional units in a quaternion ring $H(R)$ over a finite commutative ring $R$. We prove that in order to find the number of representations of an element in $H(R)$ as a sum of $k$ exceptional units for some integer…
The definition of Suzuki groups over rings is given by means of an explicit description as a difference-algebraic group. For a (not necessarily perfect) field with more than two elements this construction produces a simple group.
Following the general idea of Schur--Weyl scheme and using two suitable symmetric groups (instead of one), we try to make more explicit the classical problem of decomposing tensor representations of finite and infinite symmetric groups into…
We describe an algorithm to compute the Schur multipliers of all nilpotent Lie $p$-rings in the family defined by a symbolic nilpotent Lie $p$-ring. Symbolic nilpotent Lie $p$-rings can be used to describe the isomorphism types of…
This is a note for constructing fundamental invariants and computing the Hilbert series of the invariant subalgebras of tensor products of polynomial rings under the action by a direct product of symmetric groups. Our computation relies on…
We study the enumeration of bargraphs with respect to some corner statistics. We find generating functions for the number of bargraphs that tracks the corner statistics of interest, the number of cells, and the number of columns. The…
Data clustering is the process of identifying natural groupings or clusters within multidimensional data based on some similarity measure. Clustering is a fundamental process in many different disciplines. Hence, researchers from different…