Related papers: Cyclotomic generating functions

Using the formalism of polynomials with positive coefficients, the fact that exactly half of all subsets of a finite set have even cardinality can be generalized asymptotically.

We study enumeration functions for unimodal sequences of positive integers, where the size of a sequence is the sum of its terms. We survey known results for a number of natural variants of unimodal sequences, including Auluck's generalized…

The general normal ordering problem for boson strings is a combinatorial problem. In this note we restrict ourselves to single-mode boson monomials. This problem leads to elegant generalisations of well-known combinatorial numbers, such as…

We consider random subgroups of Thompson's group $F$ with respect to two natural stratifications of the set of all $k$ generator subgroups. We find that the isomorphism classes of subgroups which occur with positive density are not the same…

We use directed graphs called "syzygy quivers" to study the asymptotic growth rates of the dimensions of the syzygies of representations of finite dimensional algebras. For any finitely generated representation of a monomial algebra, we…

This paper investigates coefficients of cyclotomic polynomials theoretically and experimentally. We prove the following result. {{\em If $n=p_1\ldots p_k$ where $p_i$ are odd primes and $p_1<p_2<\ldots<p_r<p_1+p_2<p_{r+1}<\ldots<p_t$ with…

We address two interrelated problems concerning the permutation of roots of univariate polynomials whose coefficients depend on parameters. First, we compute the Galois group of polynomials $\varphi(x)\in\mathbb{C}[y_1,\cdots,y_k][x]$ over…

Let $P(G,q)$ be the chromatic polynomial for coloring the $n$-vertex graph $G$ with $q$ colors, and define $W=\lim_{n \to \infty}P(G,q)^{1/n}$. Besides their mathematical interest, these functions are important in statistical physics. We…

We give a general asymptotic formula for the growth rate of the number of indecomposable summands in the tensor powers of representations of finite groups, over a field of arbitrary characteristic. In characteristic zero we obtain…

Following Lucas and then other Fibonacci people Kwasniewski had introduced and had started ten years ago the open investigation of the overall F-nomial coefficients which encompass among others Binomial, Gaussian and Fibonomial coefficients…

Let $f(x)=(x^{k}+c)^{m}-ax^{n}\in\mathbb{Z}[x]$ be an irreducible polynomial over $\mathbb{Q}$, where $k,m,n\in\mathbb{N}$ with $km>n$, and let $K=\mathbb{Q}(\theta)$, where $\theta$ is a root of $f(x)$. We investigate the arithmetic…

Given a number field $K$ and a polynomial $f(z) \in K[z]$ of degree at least 2, one can construct a finite directed graph $G(f,K)$ whose vertices are the $K$-rational preperiodic points for $f$, with an edge $\alpha \to \beta$ if and only…

We examine the behavior of the coefficients of powers of polynomials over a finite field of prime order. Extending the work of Allouche-Berthe, 1997, we study a(n), the number of occurring strings of length n among coefficients of any power…

Gromov asked whether an asymptotic cone of a finitely generated group was always simply connected or had uncountable fundamental group. We prove that Gromov's dichotomy holds for asympotic cones with cut points, as well as, HNN extensions…

For any $n\geq 1$, let $T_n$ be the complete binary rooted tree of height $n$, and $f(x)=(x+a)^2-a-1$ such that $a\neq \pm b^2$ for any $b\in \mathbb{Z}$. In \cite{Settled}, Jones and Boston empirically observed that iteratively applying a…

We study a generating function for the sum over fatgraphs with specified valences of vertices and faces, inversely weighted by the order of their symmetry group. A compact expression is found for general (i.e. non necessarily connected)…

A conjugation-free geometric presentation of a fundamental group is a presentation with the natural topological generators $x_1, ..., x_n$ and the cyclic relations: $x_{i_k}x_{i_{k-1}} ... x_{i_1} = x_{i_{k-1}} ... x_{i_1} x_{i_k} = ... =…

Results are obtained concerning the roots of asymmetric geometric representations of Coxeter groups. These representations were independently introduced by Vinberg and Eriksson, and generalize the standard geometric representation of a…

In this work we present a general and versatile algorithmic framework for exhaustively generating a large variety of different combinatorial objects, based on encoding them as permutations. This approach provides a unified view on many…

We study the class of functions on the set of (generalized) Young diagrams arising as the number of embeddings of bipartite graphs. We give a criterion for checking when such a function is a polynomial function on Young diagrams (in the…