相关论文: Cycle indices for the finite classical groups
A matrix is said to be {\it cyclic} if its characteristic polynomial is equal to its minimal polynomial. Cyclic matrices play an important role in some algorithms for matrix group computation, such as the Cyclic Meataxe developed by P. M.…
We investigate invertible matrices over finite additively idempotent semirings. The main result provides a criterion for the invertibility of such matrices. We also give a construction of the inverse matrix and a formula for the number of…
Cyclicity of a convolutional code (CC) is relying on a nontrivial automorphism of the algebra F[x]/(x^n-1), where F is a finite field. If this automorphism itself has certain specific cyclicity properties one is lead to the class of…
In this paper we give an algorithm to determine all finite matrix groups over a number field. Our algorithm is based on the representation theory of finite groups.
We study characteristic polynomials of symmetric matrices with entries ${i+j\choose i}$ the binomial coefficients, over finite fields.
We characterize polynomials having the same set of nonzero cyclic resultants. Generically, for a polynomial $f$ of degree $d$, there are exactly $2^{d-1}$ distinct degree $d$ polynomials with the same set of cyclic resultants as $f$.…
We examine the number of cycles of length k in a permutation, as a function on the symmetric group. We write it explicitly as a combination of characters of irreducible representations. This allows to study formation of long cycles in the…
By imposing conditions upon the index of a self-centralizing subgroup of a group, and upon the index of the center of the group, we are able to classify the Chermak-Delgado lattice of the group. This is our main result. We use this result…
For each finite classical group $G$, we classify the subgroups of $G$ which act transitively on a $G$-invariant set of subspaces of the natural module, where the subspaces are either totally isotropic or nondegenerate. Our proof uses the…
We use techniques from finite free probability to analyze matrix processes related to eigenvalues, singular values, and generalized singular values of random matrices. The models we use are quite basic and the analysis consists entirely of…
For any prime p we consider the density of elements in the multiplicative group of the finite field F_p having order, respectively index, congruent to a(mod d). We compute these densities on average, where the average is taken over all…
The problem of linking the structure of a finite linear dynamical system with its dynamics is well understood when the phase space is a vector space over a finite field. The cycle structure of such a system can be described by the…
We give a generalization of the random matrix ensembles, including all lassical ensembles. Then we derive the joint density function of the generalized ensemble by one simple formula, which give a direct and unified way to compute the…
We consider the problem of assessing a group of nodes in a network. Our focus is on vitality indices -- a natural class of centrality measures that evaluate the importance of a node by examining the impact of its removal on the network. We…
Given a family of systems, identifying stabilizing switching signals in terms of infinite walks constructed by concatenating cycles on the underlying directed graph of a switched system that satisfy certain conditions, is a well-known…
In this survey article, we review some conceptual approaches to the cyclic category $\Lambda$, as well as its description as a crossed simplicial group. We then give a new proof of the model structure on cyclic sets, work through the…
We first obtain explicit upper bounds for the proportion of elements in a finite classical group G with a given characteristic polynomial. We use this to complete the proof that the proportion of elements of a finite classical group G which…
Using a variant of Schreier's Theorem, and the theory of Green's relations, we show how to reduce the computation of an arbitrary subsemigroup of a finite regular semigroup to that of certain associated subgroups. Examples of semigroups to…
We prove by using simple number-theoretic arguments formulae concerning the number of elements of a fixed order and the number of cyclic subgroups of a direct product of several finite cyclic groups. We point out that certain multiplicative…
We study the statistics of Hamiltonian cycles on various families of bicolored random planar maps (with the spherical topology). These families fall into two groups corresponding to two distinct universality classes with respective central…