相关论文: On the braid monodromy group of a polynomial in on…

The matching polynomial of a graph encodes rich combinatorial information through its roots. We determine the maximum multiplicity of a non-zero matching polynomial root and characterize all graphs attaining the bound. We also generalize…

Let $G$ be a finite group, $n$ a positive integer. $\pi(n)$ denotes the set of all prime divisors of $n$ and $\pi(G)=\pi(|G|)$. The prime graph $\Gamma(G)$ of $G$, defined by Grenberg and Kegel, is a graph whose vertex set is $\pi(G)$, two…

The goal of this article is to prove a rigidity result for unicritical polynomials with parabolic cycles. More precisely, we show that if two unicritical polynomials have conformally conjugate parabolic germs, then the polynomials are…

Let $p_n$ be the characteristic polynomial of an $n \times n$ random matrix drawn from one of the compact classical matrix groups. We show that the critical points of $p_n$ converge to the uniform distribution on the unit circle as $n$…

In this paper we define a new family of groups which generalize the {\it classical braid groups on} $\C $. We denote this family by $\{B_n^m\}_{n \ge m+1}$ where $n,m \in \N$. The family $\{ B_n^1 \}_{n \in \N}$ is the set of classical…

Starting from the classical division polynomials we construct homogeneous polynomials $\alpha_n$, $\beta_n$, $\gamma_n$ such that for $P = (x:y:z)$ on an elliptic curve in Weierstrass form over an arbitrary ring we have $nP =…

The conjugator length function of a finitely generated group $\Gamma$ gives the optimal upper bound on the length of a shortest conjugator for any pair of conjugate elements in the ball of radius $n$ in the Cayley graph of $\Gamma$. We…

We show that there are only finitely many homogeneous links whose Conway polynomial has any given degree. Using this we give an example of an inhomogeneous, fibred knot. Secondly, we show how to compute the monodromy of a homogeneous link…

Consider a sequence of random polynomials $P_n(z) = \prod_{k=1}^{n}(z - X_k)$, where $\{X_k\}_k$ are i.i.d. random variables distributed uniformly on the unit disc $\mathbb{D}$. Let $\Lambda_n = \{z \in \mathbb{C}: |P_n(z)| < 1\}$ be the…

Let $P_1,...,P_n$ be generic homogeneous polynomials in $n$ variables of degrees $d_1,...,d_n$ respectively. We prove that if $\nu$ is an integer satisfying ${\sum_{i=1}^n d_i}-n+1-\min\{d_i\}<\nu,$ then all multivariate subresultants…

We prove that if $\mathcal{C}$ is a hereditary class of graphs that is polynomially $\chi$-bounded, then the class of graphs that admit decompositions into pieces belonging to $\mathcal{C}$ along cuts of bounded rank is also polynomially…

Let $n$ be a positive integer and let $C_n$ be the cycle indicator of the symmetric group $S_n$. Carlitz proved that if $p$ is a prime, and if $r$ is a non negative integer, then we have the congruence $C_{r+np}\equiv (X_1^p-X_p)^nC_r…

Let $f(x)\in {\mathbb Z}[x]$ be monic of degree $N\ge 2$. Suppose that $f(x)$ is monogenic, and that $f(x)$ is the characteristic polynomial of the $N$th order linear recurrence sequence $\Upsilon_f:=(U_n)_{n\ge 0}$ with initial conditions…

The Sendovs conjecture asserts that if all the zeros of a polynomial p(z) lie in the closed unit disk, then there must be a critical point of p(z) within unit distance of each zero. The conjecture has been proved to be true for many special…

We prove that, for $n\geq 3$, the minimal dimension of a model of the classifying space of the full braid group $B_n$, and of the pure braid group $P_n$, with respect to the family of virtually cyclic groups is $n$.

The mixed braid groups are the subgroups of Artin braid groups whose elements preserve a given partition of the base points. We prove that the centralizer of any braid can be expressed in terms of semidirect and direct products of mixed…

We prove Odoni's conjecture in all prime degrees; namely, we prove that for every positive prime $p$, there exists a degree $p$ polynomial $\varphi\in\mathbb{Z}[x]$ with surjective arboreal Galois representation. We also show that Vojta's…

A Newman polynomial has all the coefficients in $\{ 0,1\}$ and constant term 1, whereas a Littlewood polynomial has all coefficients in $\{-1,1\}$. We call $P(X)\in\mathbb{Z}[X]$ a Borwein polynomial if all its coefficients belong to $\{…

The {\it prime graph} $\Gamma(G)$ of a finite group $G$ is the graph whose vertex set is the set of prime divisors of $|G|$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if there exists an element of $G$ of order…

We treat the following "polynomial moment problem": for a complex polynomial P(z) and distinct complex numbers a,b such that P(a)=P(b) to describe polynomials q(z)=Q'(z) orthogonal to all degrees of P(z) on the segment [a,b]. We show that…