相关论文: Monodromy groups of polynomials of composition len…

In the last years a lot of work has been concentrated on the study of the behaviour at infinity of polynomial maps. This behaviour can be very complicated, therefore the main idea was to find special classes of polynomial maps which have,…

Let $\mathcal S$ be a set of monic degree $2$ polynomials over a finite field and let $C$ be the compositional semigroup generated by $\mathcal S$. In this paper we establish a necessary and sufficient condition for $C$ to be consisting…

We obtain explicit upper bounds for the number of irreducible factors for a class of compositions of polynomials in several variables over a given field. In particular, some irreducibility criteria are given for this class of compositions…

This work is a study of polynomial compositions having a fixed number of terms. We outline a recursive method to describe these characterizations, give some particular results and discuss the general case. In the final sections, some…

We investigate the structure of finite groups whose non-central real class sizes have the same $2$-part. In particular, we prove that such groups are solvable and have $2$-length one. As a consequence, we show that a finite group is…

The paper studies constructions of irreducible polynomials over finite fields using polynomial composition method.

A paper of the first author and Zilke proposed seven combinatorial problems around formulas for the characteristic polynomial and the exponents of an isolated quasihomogeneous singularity. The most important of them was a conjecture on the…

The monodromy group is an invariant for parameterized systems of polynomial equations that encodes structure of the solutions over the parameter space. Since the structure of real solutions over real parameter spaces are of interest in many…

The combination of this paper and its companion complete the classification of monodromy groups of indecomposable coverings of complex curves $f:X\rightarrow \mathbb P^1$ of sufficiently large degree in comparison to the genus of $X$. In…

We consider a combinatorial problem occurring naturally in a group theoretical setting and provide a constructive solution in a special case. More precisely, in 1999 the author established a logarithmic bound for the derived length of the…

In this paper we prove a characterization of continuity for polynomials on a normed space. Namely, we prove that a polynomial is continuous if and only if it maps compact sets into compact sets. We also provide a partial answer to the…

A class of bilinear permutation polynomials over a finite field of characteristic 2 was constructed in a recursive manner recently which involved some other constructions as special cases. We determine the compositional inverses of them…

For each nonnegative integer $g$, we classify the ramification types and monodromy groups of indecomposable coverings of complex curves $f: X\to Y$ where $X$ has genus $g$, under the hypothesis that $n:=\deg(f)$ is sufficiently large and…

We show that the monodromy operator at infinity plus the decomposition of the homology given by the vanishing cycles completely determine the homology monodromy representation of any complex polynomial.

This paper explores a natural action of the group $\mathrm{PGL}_2(\mathbb F_q)$ on the set of monic irreducible polynomials of degree at least two over a finite field $\mathbb F_q$. Our main results deal with the existence and number of…

We construct a finitely presented (two-sided) totally orderable group with insoluble word problem.

We study the problem of generating monomials of a polynomial in the context of enumeration complexity. In this setting, the complexity measure is the delay between two solutions and the total time. We present two new algorithms for…

We study the unitarity of monodromies of rank two Fuchsian systems of SL type with $(n+1)$ regular singularities on the Riemann sphere, namely, we give a sufficient and necessary condition for the monodromy group to be conjugate to a…

We show the existence of and explicitly construct generic polynomials for various groups, over fields of positive characteristic. The methods we develop apply to a broad class of connected linear algebraic groups defined over finite fields…

We study the maximum modulus set, $\mathcal{M}(p)$, of a polynomial $p$. We are interested in constructing $p$ so that $\mathcal{M}(p)$ has certain exceptional features. Jassim and London gave a cubic polynomial $p$ such that…