中文
相关论文

相关论文: Circulants and critical points of polynomials

200 篇论文

In this paper, we obtain new results on the critical points of a polynomial, these results are useful to the Sendov conjecture.

复变函数 · 数学 2013-01-03 Zaizhao Meng

Given a prime $p$ and a positive integer $k$, let $\mathrm{M}_{n}(\mathbb{Z}/p^{k}\mathbb{Z})$ be the ring of $n \times n$ matrices over $\mathbb{Z}/p^{k}\mathbb{Z}$. We consider the number of solutions $X \in…

组合数学 · 数学 2023-01-10 Gilyoung Cheong , Yunqi Liang , Michael Strand

A recent paper computed the induced $p$-norm of a special class of circulant matrices $A(n,a,b) \in \mathbb{R}^{n \times n}$, with the diagonal entries equal to $a \in \mathbb{R}$ and the off-diagonal entries equal to $b \ge 0$. We provide…

泛函分析 · 数学 2021-11-23 K. R. Sahasranand

We study the forward orbit of the critical point for polynomials of the form $f_c=z^2+c$ defined over $\mathbb{Z}_p$. Hubbard trees capture the dynamical behavior for such maps with finite critical orbit in $\mathbb{C}$. We suggest a notion…

数论 · 数学 2016-03-15 Cara Mullen

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…

交换代数 · 数学 2008-03-19 Uffe Haagerup

In 2006 J.G. Thompson conjectured: "If F is a field and A is in GL(n,F), then there is a permutation matrix P such that AP is cyclic, that is, the minimal polynomial of AP is also its characteristic polynomial" (open problem 16.95 in the…

群论 · 数学 2017-11-16 John D. Dixon

If all the zeros of $n$th degree polynomials $f(z)$ and $g(z) = \sum_{k=0}^{n}\lambda_k\binom{n}{k}z^k$ respectively lie in the cricular regions $|z|\leq r$ and $|z| \leq s|z-\sigma|$, $s>0$, then it was proved by Marden \cite[p. 86]{mm}…

复变函数 · 数学 2024-12-03 N. A. Rather , Ishfaq Dar , Suhail Gulzar

D. Khavinson and G. Swiatek proved that harmonic polynomials p(z)+q(z), where p is holomorphic, q is antiholomorphic, and deg p = n > 1 = deg q, can have at most 3n-2 complex zeros. We show that this bound is sharp for all n by proving a…

复变函数 · 数学 2014-04-04 Lukas Geyer

Using the celebrated Morris Constant Term Identity, we deduce a recent conjecture of Chan, Robbins, and Yuen (math.CO/9810154), that asserts that the volume of a certain $n(n-1)/2$-dimensional polytope is given by the product of the first…

组合数学 · 数学 2007-05-23 Doron Zeilberger

Let $f$ be a polynomial of degree $d>1$ in $n$ variables over $\mathbb{Z}$. Let $f_d$ be the homogeneous part of degree $d$ of $f$ and $s$ be the dimension of the critical locus of $f_d$. In this paper, we prove Igusa's conjecture for…

数论 · 数学 2021-11-24 Kien Huu Nguyen

We determine the critical groups of the generalized de Bruijn graphs DB$(n,d)$ and generalized Kautz graphs Kautz$(n,d)$, thus extending and completing earlier results for the classical de Bruijn and Kautz graphs. Moreover, for a prime $p$…

组合数学 · 数学 2013-12-10 Swee Hong Chan , Henk D. L. Hollmann , Dmitrii V. Pasechnik

We prove a quantitative Roth-type theorem for polynomial corners in $\mathbb{R}^2$. Let $P_1$ and $P_2$ be two linearly independent polynomials with zero constant term. We show that any measurable subset of $[0,1]^2$ with positive measure…

经典分析与常微分方程 · 数学 2023-07-04 Xuezhi Chen , Jingwei Guo

We present and study two families of polynomials with coefficients in the center of the universal enveloping algebra. These polynomials are analogues of a determinant and a characteristic polynomial of a certain non-commutative matrix,…

表示论 · 数学 2007-05-23 Natasha Rozhkovskaya

Calculating the permanent of a (0,1) matrix is a #P-complete problem but there are some classes of structured matrices for which the permanent is calculable in polynomial time. The most well-known example is the fixed-jump (0,1) circulant…

组合数学 · 数学 2009-09-29 Mordecai J. Golin , Yiu Cho Leung , Yajun Wang

Let $g(x)$ be a fixed non-constant complex polynomial. It was conjectured by Schinzel that if $g(h(x))$ has boundedly many terms, then $h(x)\in \C[x]$ must also have boundedly many terms. Solving an older conjecture raised by R\'enyi and by…

数论 · 数学 2015-05-13 Umberto Zannier

A continuous selection of polynomial functions is a continuous function whose domain can be partitioned into finitely many pieces on which the function coincides with a polynomial. Given a set of finitely many polynomials, we show that…

最优化与控制 · 数学 2020-07-09 Feng Guo , Liguo Jiao , Do Sang Kim

The behavior under iteration of the critical points of polynomial maps plays an essential role in understanding its dynamics. We study the special case where the forward orbits of the critical points are finite. Thurston's theorem tells us…

动力系统 · 数学 2014-08-12 Benjamin Hutz , Adam Towsley

We study the regularity of the roots of multiparameter families of complex univariate monic polynomials $P(x)(z) = z^n + \sum_{j=1}^n (-1)^j a_j(x) z^{n-j}$ with fixed degree $n$ whose coefficients belong to a certain subring $\mathcal C$…

经典分析与常微分方程 · 数学 2011-08-04 Armin Rainer

A conjecture of Khang Tran [6] claims that for an arbitrary pair of polynomials $A(z)$ and $B(z)$, every zero of every polynomial in the sequence $\{P_n(z)\}_{n=1}^\infty$ satisfying the three-term recurrence relation of length $k$…

经典分析与常微分方程 · 数学 2020-03-18 Rikard Bögvad , Innocent Ndikubwayo , Boris Shapiro

Schramm's Locality Conjecture asserts that the value of the critical percolation parameter $p_c$ of a graph satisfying $p_c<1$ depends only on its local structure. In this note, we prove this conjecture in the particular case of transitive…

概率论 · 数学 2022-05-23 Daniel Contreras , Sébastien Martineau , Vincent Tassion