Related papers: Iterated Monodromy Groups of Quadratic Polynomials…
We prove that the arboreal Galois representations attached to certain unicritical polynomials have finite index in an infinite wreath product of cyclic groups, and we prove surjectivity for some small degree examples, including a new family…
We examine the behavior of the sequences of $p$-adic valuations of quadratic polynomials with integer coefficients for an odd prime $p$ through tree representations. Under this representation, a finite tree corresponds to a periodic…
We describe isomorphisms of groups of several periodic infinite matrices and isomorphisms of groups of invertible elements of unital locally matrix algebras.
We describe a multivariable polynomial invariant for certain class of non isolated hypersurface singularities generalizing the characteristic polynomial on monodromy. The starting point is an extension of a theorem due to Le Dung Trang and…
In this paper, we study a class of orthogonal polynomials defined by a three-term recurrence relation with periodic coefficients. We derive explicit formulas for the generating function, the associated continued fraction, the orthogonality…
We consider several algorithmic problems concerning geodesics in finitely generated groups. We show that the three geodesic problems considered by Miasnikov et al [arXiv:0807.1032] are polynomial-time reducible to each other. We study two…
We complete the description of group gradings on finite-dimensional incidence algebras. Moreover, we classify the finite-dimensional graded algebras that can be realized as incidence algebras endowed with a group grading.
In this paper we will study properties of twisted Alexander polynomials of knots corresponding to metabelian representations. In particular we answer a question of Wada about the twisted Alexander polynomial associated to the tensor product…
We estimate the frequency of polynomial iterations which falls in a given multiplicative subgroup of a finite field of $p$ elements. We also give a lower bound on the size of the subgroup which is multiplicatively generated by the first $N$…
We compute the graded polynomial identities of the infinite dimensional upper triangular matrix algebra over an arbitrary field. If the grading group is finite, we prove that the set of graded polynomial identities admits a finite basis. We…
Each graph and choice of a commutative ring gives rise to an associated graphical group. In this article, we introduce and investigate graph polynomials that enumerate conjugacy classes of graphical groups over finite fields according to…
We associate each endomorphism of a finite cyclic group with a digraph and study many properties of this digraph, including its adjacent matrix and automorphism group.
Cubic complexes appear in the theory of finite type invariants so often that one can ascribe them to basic notions of the theory. In this paper we begin the exposition of finite type invariants from the `cubic' point of view. Finite type…
We investigate a family of permutation polynomials of finite fields of characteristic 2. Through a connection between permutation polynomials and quadratic forms, a general treatment is presented to characterize these permutation…
Explicit generators are given for the ring of invariant polynomials under the coadjoint representation of certain inhomogeneous groups.
Infinite order linear recurrences are studied via kneading matrices and kneading determinants. The concepts of kneading matrix and kneading determinant of an infinite order linear recurrence, introduced in this work, are defined in a purely…
We study the arithmetic and geometric iterated monodromy groups associated to the postcritically finite (PCF) quadratic rational function $f(x)=\frac{2}{(x-1)^2}$ defined over a number field $k$, whose critical points are both strictly…
We give an arithmetic proof of rigidity for postcritically finite polynomials.
We give an efficient algorithm to enumerate all sets of $r\ge 1$ quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.
In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials of a given degree and exhibit explicit decompositions into…