Related papers: The cycle polynomial of a permutation group

Let $G^\sigma$ be an orientation of a simple graph $G$. In this paper, the permanental polynomial of an oriented graph $G^\sigma$ is introduced. The coefficients of the permanental polynomial of $G^\sigma$ are interpreted in terms of the…

The notion of the Gamma integral structure for the quantum cohomology of an algebraic variety was introduced by Iritani, Katzarkov-Kontsevich-Pantev. In this paper, we define the Gamma integral structure for an invertible polynomial of…

Each group G of nxn permutation matrices has a corresponding permutation polytope, P(G):=conv(G) in R^{nxn}. We relate the structure of P(G) to the transitivity of G. In particular, we show that if G has t nontrivial orbits, then…

We associate a graph $\Gamma_G$ to a non locally cyclic group $G$ (called the non-cyclic graph of $G$) as follows: take $G\backslash Cyc(G)$ as vertex set, where $Cyc(G)=\{x\in G | \left<x,y\right> \text{is cyclic for all} y\in G\}$, and…

A hole in a graph $G$ is an induced cycle of length at least four, and a $k$-multihole in $G$ is a set of pairwise disjoint and nonadjacent holes. It is well known that if $G$ does not contain any holes then its chromatic number is equal to…

We develop a diagrammatic categorification of the polynomial ring $Z[x]$. Our categorification satisfies a version of Bernstein-Gelfand-Gelfand reciprocity property with the indecomposable projective modules corresponding to $x^n$ and…

Let $G$ be 2-generated group. The generating graph $\Gamma(G)$ of $G$ is the graph whose vertices are the elements of $G$ and where two vertices $g$ and $h$ are adjacent if $G = \langle g, h \rangle.$ This definition can be extended to a…

Joyal's theory of combiantorial species provides a rich and elegant framework for enumerating combinatorial structures by translating structural information into algebraic functional equations. We present some classical and folklore results…

Let $G$ be a finite, non-abelian group of the form $G = A N$, where $A \leq G$ is abelian, and $N \trianglelefteq G$ is cyclic. We prove that the commuting graph $\Gamma(G)$ of $G$ is either a connected graph of diameter at most four, or…

Let $KG$ be the group ring of a group $G$ over a commutative ring $K$ with unity. The rings $KG$ are described for which $xx^\sigma=x^\sigma x$ for all $x=\sum_{g\in G}\alpha_gg\in KG$, where \quad $x\mapsto x^\sigma=~\sum_{g\in…

Let $n$ be a positive integer, $\sigma$ be an element of the symmetric group $\mathcal{S}_n$ and let $\sigma$ be a cycle of length $n$. The elements $\alpha ,\beta \in \mathcal{S}_n$ are $\sigma$-equivalent, if there are natural numbers $k$…

We give a new interpretation of the chromatic polynomial of a simple graph G in terms of the Kac-Moody Lie algebra with Dynkin diagram G. We show that the chromatic polynomial is essentially the q-Kostant partition function of this Lie…

The second author had previously obtained explicit generating functions for moments of characteristic polynomials of permutation matrices (n points). In this paper, we generalize many aspects of this situation. We introduce random shifts of…

The spectrum $\omega(G)$ of a finite group $G$ is the set of orders of elements of $G$. We present a polynomial-time algorithm that, given a finite set $\mathcal M$ of positive integers, outputs either an empty set or a finite simple group…

We undertake a detailed investigation into the structure of permutations in monotone grid classes whose row-column graphs do not contain components with more than one cycle. Central to this investigation is a new decomposition, called the…

One way to study certain classes of polynomials is by considering examples that are attached to combinatorial objects. Any graph $G$ has an associated reciprocal polynomial $R_G$, and with two particular classes of reciprocal polynomials in…

Let $ G $ be a cyclic group, in this paper, we study the Herbrand quotient and $ 1-$th cohomology group on finitely generated $ G-$modules in some cases. When $ G $ is of order $ 2, $ the order of the cohomology group is explicitly related…

The family $\mathcal{OG}(4)$ consisting of graph-group pairs $(\Gamma, G)$, where $\Gamma$ is a finite, connected, 4-valent graph admitting a $G$-vertex-, and $G$-edge-transitive, but not $G$-arc-transitive action, has recently been…

Given an oriented graph G, the modular flow polynomial counts the number of nowhere-zero Z_k-flows of G. We give a description of the modular flow polynomial in terms of (open) Ehrhart polynomials of lattice polytopes. Using…

The Hultman numbers enumerate permutations whose cycle graph has a given number of alternating cycles (they are relevant to the Bafna-Pevzner approach to genome comparison and genome rearrangements). We give two new interpretations of the…