Related papers: The cycle structure of unicritical polynomials

Latin squares have been historically used in order to create statistical designs in which, starting from a small number of experiments, it can be obtained a large experimental space. In this sense, the optimization of the selection of Latin…

A unitary cyclotomic polynomial of order three is a polynomial of the form \[ \Phi^*_{PQR}(x)=\frac{(x^{PQR}-1)(x^P-1)(x^Q-1)(x^R-1)}{(x^{PQ}-1)(x^{QR}-1)(x^{RP}-1)(x-1)}, \] where $P$, $Q$ and $R$ are powers of three distinct primes $p$,…

Probabilistic circuits compute multilinear polynomials that represent multivariate probability distributions. They are tractable models that support efficient marginal inference. However, various polynomial semantics have been considered in…

Zeros of many ensembles of polynomials with random coefficients are asymptotically equidistributed near the unit circumference. We give quantitative estimates for such equidistribution in terms of the expected discrepancy and expected…

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…

In this paper it is proved, that for every prime number p, the set of cyclic p-roots in C^p is finite. Moreover the number of cyclic p-roots counted with multiplicity is equal to (2p-2)!/(p-1)!^2. In particular, the number of complex…

In this article we consider several probabilistic processes defining random grapha. One of these processes appeared recently in connection with a factorization problem in the symmetric group. For each of the probabilistic processes, we…

Cyclic codes are an important class of linear codes, whose weight distribution have been extensively studied. Most previous results obtained so far were for cyclic codes with no more than three zeroes. Inspired by the works…

In this article, we study a model of random permutations, which we call random standardized permutations, based on a sequence of i.i.d. random variables. This model generalizes others, such as the riffle-shuffle and the major-index-biased…

Any permutation polynomial is an $ n $-cycle permutation. When $n$ is a specific small positive integer, one can obtain efficient permutations, such as involutions, triple-cycle permutations and quadruple-cycle permutations. These…

Simple cycles, also known as self-avoiding polygons, are cycles on graphs which are not allowed to visit any vertex more than once. We present an exact formula for enumerating the simple cycles of any length on any directed graph involving…

Terao's factorization theorem shows that if an arrangement is free, then its characteristic polynomial factors into the product of linear polynomials over the integer ring. This is not a necessary condition, but there are not so many…

Despite their apparent simplicity, random Boolean networks display a rich variety of dynamical behaviors. Much work has been focused on the properties and abundance of attractors. We here derive an expression for the number of attractors in…

We consider systems of recursively defined combinatorial structures. We give algorithms checking that these systems are well founded, computing generating series and providing numerical values. Our framework is an articulation of the…

P-time event graphs are discrete event systems able to model cyclic production systems where tasks need to be performed within given time windows. Consistency is the property of admitting an infinite execution of such tasks that does not…

Several conditions are known for a self-inversive polynomial that ascertain the location of its roots, and we present a framework for comparison of those conditions. We associate a parametric family of polynomials $p_\alpha$ to each such…

We give an infinite family of polynomials that have roots modulo every positive integer but fail to have rational roots. Each polynomial in this family is made up of monic quadratic factors that do not have linear term.

We study proportions of consecutive occurrences of permutations of a given size. Specifically, the limit of such proportions on large permutations forms a region, called \emph{feasible region}. We show that this feasible region is a…

Denote by $x$ a random infinite path in the graph of Pascal's triangle (left and right turns are selected independently with fixed probabilities) and by $d_n(x)$ the binomial coefficient at the $n$'th level along the path $x$. Then for a…

Polymatroids can be considered as "fractional matroid" where the rank function is not required to be integer valued. Many, but not every notion in matroid terminology translates naturally to polymatroids. Defining cyclic flats of a…