Related papers: The cycle polynomial of a permutation group

Firstly, for a general graph, we find a recursion formula on the number of Hamiltonian cycles and one on cycles. By this result, we give some new polynomial invariants. Secondly, we give a condition to tell whether a polynomial defined by…

We consider the action of a permutation group $G$ of order $k$ on the tropical polynomial semiring in $n$ variables. We prove that the sub-semiring of invariant polynomials is finitely generated if and only if $G$ is generated by…

For each nonnegative integer $i$, let $a_i$ be the number of $i$-subsets of $V(G)$ that induce an acyclic subgraph of a given graph $G$. We define $A(G,x) = \sum_{i \geq 0} a_i x^i$ (the generating function for $a_i$) to be the acyclic…

Let $G$ be a finite group. For all $a \in \Z$, such that $(a,|G|)=1$, the function $\rho_a: G \to G$ sending $g$ to $g^a$ defines a permutation of the elements of $G$. Motivated by a recent generalization of Zolotarev's proof of classic…

A polynomial with integer coefficients yields a family of dynamical systems indexed by primes as follows: for any prime $p$, reduce its coefficients mod $p$ and consider its action on the field $\mathbb{F}_p$. The questions of whether and…

In this paper we introduce and study the concept of cyclic factorization number of a finite group G. By using the Mobius inversion formula and other methods involving the cyclic subgroup structure, this is explicitly computed for some…

A \emph{Golomb ruler} is a sequence of distinct integers (the \emph{markings} of the ruler) whose pairwise differences are distinct. Golomb rulers can be traced back to additive number theory in the 1930s and have attracted recent research…

We investigate the combinatorics and geometry of permutation polytopes associated to cyclic permutation groups, i.e., the convex hulls of cyclic groups of permutation matrices. We give formulas for their dimension and vertex degree. In the…

We consider the space of all representations of the commutator subgroup of a knot group into a finite abelian group {\Sigma}, together with a shift map {\sigma}_x. This is a finite dynamical system, introduced by D.Silver and S. Williams.…

A cycle base of a permutation group is defined to be a maximal set of its pairwise non-conjugate regular cyclic subgroups. It is proved that a cycle base of a permutation group of degree $n$ can be constructed in polynomial time in~$n$.

We give a shorter proof of the recurrence relation for the domination polynomial $\gamma (P_{n},t)$ and for the number $\gamma _{k}(P_{n})$ of dominating $k$-sets of the path with $n$ vertices. For every positive integers $n$ and $k,$…

Using the Polya Enumeration Theorem, we count with particular attention to C^3/Gamma up to C^6/Gamma, abelian orbifolds in various dimensions which are invariant under cycles of the permutation group S_D. This produces a collection of…

We give a generating function for the number of unimodal permutations with a given cycle structure.

Given a finite group $G$, we introduce the \textit{permutability degree} of $G$, as $$pd(G)=\frac{1}{|G| \ |\mathcal{L}(G)|} {\underset{X \in \mathcal{L}(G)}\sum}|P_G(X)|,$$ where $\mathcal{L}(G)$ is the subgroup lattice of $G$ and $P_G(X)$…

Let G be a combinatorial graph with vertices V and edges E. A proper coloring of G is an assignment of colors to the vertices such that no edge connects two vertices of the same color. These are the colorings considered in the famous Four…

The absolute value of the coefficient of $q$ in the chromatic polynomial of a graph $G$ is known as the chromatic discriminant of $G$ and is denoted $\alpha(G)$. There is a well known recurrence formula for $\alpha(G)$ that comes from the…

As an instance of the B-polynomial, the circuit, or cycle, polynomial P(G(Gamma); w) of the generalized rooted product G(Gamma) of graphs was studied by Farrell and Rosenfeld ({\em Jour. Math. Sci. (India)}, 2000, \textbf{11}(1), 35--47)…

Let X be a non-empty finite set, E be a finite dimensional euclidean vector space and G a finite subgroup of O(E), the orthognal group of E. Suppose GG={U_i | i in X} is a finite set of linear lines in E and an orbit of G on which its…

Jaeger et al. in 1992 introduced group coloring as the dual concept to group connectivity in graphs. Let $A$ be an additive Abelian group, $ f: E(G)\to A$ and $D$ an orientation of a graph $G$. A vertex coloring $c:V(G)\to A$ is an $(A,…

The ring of dual numbers over a ring $R$ is $R[\alpha] = R[x]/(x^2)$, where $\alpha$ denotes $x+(x^2)$. For any finite commutative ring $R$, we characterize null polynomials and permutation polynomials on $R[\alpha]$ in terms of the…