Related papers: Enumeration Techniques on Cyclic Schur Rings
We introduce the chain geometry $\Sigma(K,R)$ over a ring $R$ with a distinguished subfield $K$, thus extending the usual concept where $R$ has to be an algebra over $K$. A chain is uniquely determined by three of its points, if, and only…
In this report, we summarize the set partition enumeration problems and thoroughly explain the algorithms used to solve them. These algorithms iterate through the partitions in lexicographic order and are easy to understand and implement in…
Cyclic codes have attracted a lot of research interest for decades. In this paper, for an odd prime $p$, we propose a general strategy to compute the complete weight enumerator of cyclic codes via the value distribution of the corresponding…
Structural properties of unitary groups over local, not necessarily commutative, rings are developed, with applications to the computation of the orders of these groups (when finite) and to the degrees of the irreducible constituents of the…
We enumerate the singular algebraic curves in a complete linear system on a smooth projective surface. The system must be suitably ample in a rather precise sense. The curves may have up to eight nodes, or a triple point of a given type and…
In this paper a variety of issues are discussed, Schur ring, $S$-sets, circulant orbits, decimation operator and Hadamard matrices and their relation between them is shown. Firstly we define the complete $S$-sets. Next, we study the…
We compute the Chow ring of a quasi-split geometrically almost simple algebraic group assuming the coefficients to be a field. This extends the classical computation for split groups done by Kac to the non-split quasi-split case. For the…
We completely characterize possible indices of quasi-cyclic subcodes in a cyclic code for a very broad class of cyclic codes. We present enumeration results for quasi-cyclic subcodes of a fixed index and show that the problem of enumeration…
We present a deterministic polynomial-time algorithm that determines whether a finite module over a finite commutative ring is cyclic, and if it is, outputs a generator.
This work is meant to demonstrate new class of prime numbers -- cyclic prime numbers, that can be derived from any prime number at certain numeric systems. Cyclic prime numbers are also related to the cyclic numbers and full reptend prime…
Semiring complexity is the version of arithmetic circuit complexity that allows only two operations: addition and multiplication. We show that when the number of variables is fixed, the semiring complexity of a Schur polynomial $s_\lambda$…
Given a group G acting on a ring R, one can construct the skew group ring R*G. Skew group rings have been studied in depth, but necessary and sufficient conditions for the simplicity of a general skew group ring are not known. In this…
This article generalizes the result of Burns et al (2022), to find an algorithm to find some elements generating a full-rank subgroup of the torsion-free part of Bloch group of a certain CM number field, and compute the rank of it.
We describe the K-ring of the classifying space of the generalized quaternion group in terms of generators and the minimal set of relations. We also compute the order of the main generator in the truncated rings.
We prove that the generalised non-crossing partitions associated to well-generated complex reflection groups of exceptional type obey two different cyclic sieving phenomena, as conjectured by Armstrong, respectively by Bessis and Reiner.…
In this paper we compute in some new cases the cardinalities of the fibers of certain natural fibrations that appear in the analysis of the configuration space of the Heisenberg ring. This is done by means of certain cyclic group actions on…
Automatic marbles classification based on their visual appearance is an important industrial issue. However, there is no definitive solution to the problem mainly due to the presence of randomly distributed high number of different colours…
This paper classifies the blocks of the cyclotomic Hecke algebras of type G(r,1,n) over an arbitrary field. Rather than working with the Hecke algebras directly we work instead with the cyclotomic Schur algebras. The advantage of these…
We use a cluster ensemble to determine the number of clusters, k, in a group of data. A consensus similarity matrix is formed from the ensemble using multiple algorithms and several values for k. A random walk is induced on the graph…
We consider indecomposable representations of the Klein four group over a field of characteristic $2$ and of a cyclic group of order $pm$ with $p,m$ coprime over a field of characteristic $p$. For each representation we explicitly describe…