Related papers: The cycle structure of unicritical polynomials

We investigate the notion of cyclicity for convolutional codes as it has been introduced by Piret and Roos in the seventies. Codes of this type are described as submodules of the module of all vector polynomials in one variable with some…

Many applications use sequences of n consecutive symbols (n-grams). Hashing these n-grams can be a performance bottleneck. For more speed, recursive hash families compute hash values by updating previous values. We prove that recursive hash…

Some polynomials $P$ with rational coefficients give rise to well defined maps between cyclic groups, $\Z_q\longrightarrow\Z_r$, $x+q\Z\longmapsto P(x)+r\Z$. More generally, there are polynomials in several variables with tuples of rational…

We initiate the study of the cycle structure of uniformly random parking functions. Using the combinatorics of parking completions, we compute the asymptotic expected value of the number of cycles of any fixed length. We obtain an upper…

We show that all permutations in $S_n$ can be generated by affine unicritical polynomials. We use the $\operatorname{PGL}$ group structure to compute the cycle structure of permutations with low Carlitz rank. The tree structure of the group…

Taking the absolute value of consecutive differences of a cyclicly ordered list of integers constitutes a simple dynamical system. For lists of lenght a power of two the process will terminate in all zeros, but examples with arbitarily long…

In this paper, we consider a one-parameter family of degree $d\ge 2$ rational maps with an automorphism group containing the cyclic group of order $d$. We construct a polynomial whose roots correspond to parameter values for which the…

We identify a structural pattern in the construction of known infinite families of trees whose independence polynomials are not log-concave. Using this pattern and properties of polynomial ring ideals, we derive linear recurrences for these…

In this note we introduce a family of polynomials on a matroid derived from chain Tutte polynomials which generalize the classic and ubiquitous characteristic polynomial. We show that the coefficients of these polynomials alternate and…

In this paper, we extend the slow divergence-integral from slow-fast systems, due to De Maesschalck, Dumortier and Roussarie, to smooth systems that limit onto piecewise smooth ones as $\epsilon\rightarrow 0$. In slow-fast systems, the slow…

We propose a general methodology for testing whether a given polynomial with integer coefficients is identically zero. The methodology evaluates the polynomial at efficiently computable approximations of suitable irrational points. In…

We consider the challenging problem of statistical inference for exponential-family random graph models based on a single observation of a random graph with complex dependence. To facilitate statistical inference, we consider random graphs…

Let p be an odd prime number. We show that there exists a finite group of order p^{p+3} whose the mod p cycle map from the mod p Chow ring of its classifying space to its ordinary mod p cohomology is not injective.

The first author introduced a sequence of polynomials (\cite{8}, sequence A174531) defined recursively. One of the main results of this study is proof of the integrality of its coefficients.

A meander system is a union of two arc systems that represent non-crossing pairings of the set $[2n] = \{1, \ldots, 2n\}$ in the upper and lower half-plane. In this paper, we consider random meander systems. We show that for a class of…

Let $f(x)$ be a nonconstant polynomial with integer coefficients and nonzero discriminant. We study the distribution modulo primes of the set of squarefree integers $d$ such that the curve $dy^2=f(x)$ has a nontrivial rational or integral…

For X a finite subset of the circle and for 0 < r <= 1 fixed, consider the function f_r : X -> X which maps each point to the clockwise furthest element of X within angular distance less than 2 pi r. We study the discrete dynamical system…

We study the number of real zeros of trigonometric polynomials in a period and the number of zeros of self-reciprocal algebraic polynomials on the unit circle under the assumption that their coefficients are in a fixed finite set of real…

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…

We are interested in ordering the elements of a subset A of the non-zero integers modulo n in such a way that all the partial sums are distinct. We conjecture that this can always be done and we prove various partial results about this…