Related papers: Counting genus one partitions and permutations

We investigate the computational complexity of various decision problems related to conjugacy in finite inverse semigroups. We describe polynomial-time algorithms for checking if two elements in such a semigroup are ~p conjugate and whether…

We give a reformulation of the Lehmer conjecture about algebraic integers in terms of a simple counting problem modulo p.

We calculate the number of unary clones (submonoids of the full transformation monoid) containing the permutations, on an infinite base set. It turns out that this number is quite large, on some cardinals as large as the whole clone…

In this note we provide some counterexamples for the conjectures of finite simple groups, one of the conjectures said "all finite simple groups $G$ can be determined using their orders $|G|$ and the number of elements of order $p$, where…

Extensions of a set partition obtained by imposing bounds on the size of the parts and the coloring of some of the elements are examined. Combinatorial properties and the generating functions of some counting sequences associated with these…

In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…

We use a sign-reversing involution to show that trees on the vertex set [n], considered to be rooted at 1, in which no vertex has exactly one child are counted by 1/n sum_{k=1}^{n} (-1)^(n-k) {n}-choose-{k} (n-1)!/(k-1)! k^(k-1). This…

We consider bivariate polynomials over the skew field of quaternions, where the indeterminates commute with all coefficients and with each other. We analyze existence of univariate factorizations, that is, factorizations with univariate…

We develop a nonstandard approach to exploring polynomials associated with peaks and runs of permutations. With the aid of a context-free grammar, or a set of substitution rules, one can perform a symbolic calculus, and the computation…

It is well known that the Bell numbers represent the total number of partitions of an n-set. Similarly, the Stirling numbers of the second kind, represent the number of k-partitions of an n-set. In this paper we introduce a certain…

We calculate genus one corrections to Hermitian one-matrix model solution with arbitrary number of cuts directly from the loop equation confirming the answer previously obtained from algebro-geometrical considerations and generalizing it to…

We develop the theory of weighted P-partitions, which generalises the theory of P-partitions from labelled posets to weighted labelled posets. We define the related generating functions in the natural way and compute their product,…

Let Mod_{g,b} denote the mapping class group of a surface of genus g with b punctures. Feng Luo asked in a recent preprint if there is a universal upper bound, independent of genus, for the number of torsion elements needed to generate…

Let $M$ be a positive integer and $p(n)$ be the number of partitions of a positive integer $n$. Newman's Conjecture asserts that for each integer $r$, there are infinitely many positive integers $n$ such that \[ p(n)\equiv r \pmod{M}. \]…

We consider the problem of factoring permutations as a product of special types of transpositions, namely, those transpositions involving two positions with bounded distances. In particular, we investigate the minimum number, $\delta$, such…

Although there is no natural internal product for hermitian forms over an algebra with involution of the first kind, we describe how to multiply two $\varepsilon$-hermitian forms to obtain a quadratic form over the base field. This allows…

Let $F$ be a totally real field in which $p$ is unramified. Let $\overline{r}: G_F \rightarrow \mathrm{GL}_2(\overline{\mathbb{F}}_p)$ be a modular Galois representation which satisfies the Taylor-Wiles hypotheses and is generic at a place…

We present a new algorithm for iterating over all permutations of a sequence. The algorithm leverages elementary~$O(1)$ operations on recursive lists. As a result, no new nodes are allocated during the computation. Instead, all elements are…

We consider partitions $p_{w}(n)$ of a positive integer $n$ arising from the generating functions \[ \sum_{n=1}^\infty p_{w}(n) z^n = \prod_{m \in \mathbb{N}} (1-z^m)^{-w(m)}, \] where the weights $w(m)$ are M\"{o}bius convolutions. We…

A word-representable graph is a simple graph $G$ which can be represented by a word $w$ over the vertices of $G$ such that any two vertices are adjacent in $G$ if and only if they alternate in $w$. It is known that the class of…