相关论文: Cycle indices for the finite classical groups
As is well known, any complex cyclic matrix $A$ is similar to the unique companion matrix associated with the minimal polynomial of $A$. On the other hand, a cyclic matrix over a division ring $\mathbb F$ is similar to a companion matrix of…
In this paper we consider endomorphisms of an undirected cycle graph from Semigroup Theory perspective. Our main aim is to present a process to determine sets of generators with minimal cardinality for the monoids $wEnd(C_n)$ and $End(C_n)$…
Since its first appearance in 1971, Gutzwiller's trace formula has been extended to systems with continuous symmetries, in which not all periodic orbits are isolated. In order to avoid the divergences occurring in connection with symmetry…
We prove that there exists a functorial correspondence between MV-algebras and partially cyclically ordered groups which are wound round of lattice-ordered groups. It follows that some results about cyclically ordered groups can be stated…
Graph dynamical systems (GDSs) can be used to describe a wide range of distributed, nonlinear phenomena. In this paper we characterize cycle equivalence of a class of finite GDSs called sequential dynamical systems SDSs. In general, two…
This paper mainly focuses on commutative local domains of dimension one. We then obtain a criterion for a ring to have a finite number of trace ideals in terms of integrally closed ideals. We also explore properties of such rings related to…
This contains a new version of the so-called non-commutative Gauss algorithm for polycyclic groups. Its results allow to read off the order and the index of a subgroup in an (possibly infinite) polycyclic group.
This paper is concerned with the taxonomy of finitely complete categories, based on 'matrix properties' - these are a particular type of exactness properties that can be represented by integer matrices. In particular, the main result of the…
We present a new proof of a theorem of Schur's determining the least common multiple of the orders of all finite groups of complex $n \times n$-matrices whose elements have traces in the field of rational numbers. The basic method of proof…
In recent work, Pomerance and Shparlinski have obtained results on the number of cycles in the functional graph of the map $x \mapsto x^a$ in $\mathbb{F}_p^*$. We prove similar results for other families of finite groups. In particular, we…
We characterize when a generalized Baumslag-Solitar group is linear, and extend the result to the fundamental groups of a graph of groups with infinite virtually cyclic vertex and edge groups.
The volume of a cyclic polytope can be obtained by forming an iterated integral along a suitable piecewise linear path running through its edges. Different choices of such a path are related by the action of a subgroup of the combinatorial…
The definition of order indices for density matrices is extended to finite systems. This makes it possible to characterize the level of ordering in such finite systems as macromolecules, nanoclusters, quantum dots, or trapped atoms. The…
We consider ideals in a polynomial ring that are generated by regular sequences of homogeneous polynomials and are stable under the action of the symmetric group permuting the variables. In previous work, we determined the possible…
We introduce and study the notion of universally defined cycles of smooth varieties of dimension $d$, and prove that they are given by polynomials in the Chern classes. A similar result is proved for universally defined cycles on products…
The cyclic sieving phenomenon (CSP) provides valuable data about symmetry classes of cyclic actions, and has applications to representation theory. In this paper, we enumerate domino tableaux of shape 2-by-n, and use this result to prove a…
Markov chains are used to give a purely probabilistic way of understanding the conjugacy classes of the finite symplectic and orthogonal groups in odd characteristic. As a corollary of these methods one obtains a probabilistic proof of…
The family of cycle completable graphs has several cryptomorphic descriptions, the equivalence of which has heretofore been proven by a laborious implication-cycle that detours through a motivating matrix completion problem. We give a…
The enumeration of Hamiltonian cycles on 2n*2n grids of nodes is a longstanding problem in combinatorics. Previous work has concentrated on counting all cycles. The current work enumerates nonisomorphic cycles -- that is, the number of…
The cyclic sieving phenomenon is a well-studied occurrence in combinatorics appearing when a cyclic group acts on a finite set. In this paper, we demonstrate a natural extension of this theory to finite abelian groups. We also present a…