English
Related papers

Related papers: On the existence of Hurwitz polynomials with no Ha…

200 papers

For two polynomials of degrees $n$ and $m$ ($n\geq m$) $$ f\left( s\right) =a_{0}+a_{1}s+\ldots+a_{n-1}s^{n-1}+a_{n}s^{n}$$ and $$g\left( s\right) =b_{0}+b_{1}s+\ldots+b_{m-1}s^{m-1}+b_{m}s^{m}$$ we define a set of polynomials $f\bullet g…

Classical Analysis and ODEs · Mathematics 2019-05-21 Stanisław Białas , Michał Góra

Every matrix polynomial $\mathbf{f}_n$ can be written in the form \[ \mathbf{f}_n(z)=\mathbf{h}(z^2)+z\,\mathbf{g}_n(z^2). \] The matrix polynomial $\mathbf{f}_{2m}$ is said to be of Hurwitz type if the expression…

Classical Analysis and ODEs · Mathematics 2026-03-06 Abdon E. Choque-Rivero

We describe a wide class of polynomials, which is a natural generalization of Hurwitz stable polynomials. We also give a detailed account of so-called self-interlacing polynomials, which are dual to Hurwitz stable polynomials but have only…

Classical Analysis and ODEs · Mathematics 2010-05-19 Mikhail Tyaglov

A generalization of Hurwitz stable polynomials to real rational functions is considered. We establishe an analogue of the Hurwitz stability criterion for rational functions and introduce a new type of determinants that can be treated as a…

Classical Analysis and ODEs · Mathematics 2025-07-01 Yury S. Barkovsky , Mikhail Tyaglov

A polynomial P in n complex variables is said to have the "half-plane property" (or Hurwitz property) if it is nonvanishing whenever all the variables lie in the open right half-plane. Such polynomials arise in combinatorics, reliability…

Combinatorics · Mathematics 2007-05-23 Young-Bin Choe , James G. Oxley , Alan D. Sokal , David G. Wagner

For a complex polynomial \[ f\left( s\right) =s^{n}+a_{n-1}s^{n-1}+\ldots+a_{1}s+a_{0}% \] and for a rational number $p$, we consider the Schur stability problem of the $p$-th Hadamard power of $f$ \[ f^{\left[ p\right] }\left( s\right)…

Classical Analysis and ODEs · Mathematics 2019-05-21 Michał Góra

One of the interesting problems in arithmetic dynamics is to study the stability of polynomials over a field. In this paper, we study the stability of $f(z)=z^d+\frac{1}{c}$ for $d\geq 2$, $c\in{\mathbb{Z}\setminus\{0\}}$. We show that for…

Number Theory · Mathematics 2022-06-10 Shanta Laishram , Ritumoni Sarma , Himanshu Sharma

Every $n th$ order monic polynomial corresponds $n$-dimensional vector. If the given polynomial is stable that is all its roots lie in the open left half plane it is said to be Hurwitz polynomial and the corresponding vector is called…

Optimization and Control · Mathematics 2018-10-24 Vakif Dzhafarov , Özlem Esen , Taner Büyükköroğlu

This note is an introduction to the properties of stable polynomials in several variables with real or complex coefficients. These polynomials are defined in terms of where the polynomial is non-vanishing. We do not cover well-known topics…

Classical Analysis and ODEs · Mathematics 2008-03-04 Steve Fisk

Turyn prove that if a circulant Hadamard matrix of order $n$ exists then $n$ must be of the form $n=4m^{2}$ for some odd integer $m$. In this paper we use the structure constant of Schur ring of $\Z_{2}^{4m^{2}}$ to prove that there is no…

Combinatorics · Mathematics 2018-05-15 Ronald Orozco López

This paper aims at extending the criterion that the quasi-stability of a polynomial is equivalent to the total nonnegativity of its Hurwitz matrix. We give a complete description of functions generating doubly infinite series with totally…

Complex Variables · Mathematics 2017-05-25 Alexander Dyachenko

A polynomial with rational coefficients is said to be pure with respect to a rational prime $p$ if its Newton polygon has one slope. In this article, we prove that the number of irreducible factors of the $n$-th iterate of a pure polynomial…

Number Theory · Mathematics 2023-01-31 Mohamed O Darwish , Mohammad Sadek

Let $q$ be a prime power. We construct stable polynomials of the form $b^{m-1}(x+a)^m+c(x+a)+d$ over a finite field $\mathbb{F}_{q}$ for $m=2,3,4$ by Capelli's lemma. When $m=3$ and $q$ is even, we confirm the conjecture of Ahmadi and…

Number Theory · Mathematics 2023-10-05 Tong Lin , Qiang Wang

We prove that there is no circulant Hadamard matrix $H$ with first row $[h_{1},\ldots,h_{n}]$ of order $n>4$, under a condition about a sum of scalar products of rows of two other circulant matrices of size $n/2$ associated to $H.$

Number Theory · Mathematics 2019-03-25 Luis H. Gallardo

This article is a continuation of the article with the same title (see arXiv:1003.2953v1). Let {\rm $\text{HUR}_{d,t}^{G}(\mathbb P^1)$} be the Hurwitz space of degree $d$ coverings of the projective line $\mathbb P^1$ with Galois group…

Algebraic Geometry · Mathematics 2011-12-07 Vik. S. Kulikov

In this paper, we investigate the solubility of homogeneous polynomial equations. The work of Browning, Le boudec, Sawin [3] shows that almost all homogeneous equations of degree $d\geq 4$ in $d+1$ or more variables satisfy the Hasse…

Number Theory · Mathematics 2025-09-10 Kiseok Yeon

Let H(N) denote the set of all polynomials with positive integer coefficients which have their zeros in the open left half-plane. We are looking for polynomials in H(N) whose largest coefficients are as small as possible and also for…

Complex Variables · Mathematics 2013-08-02 Albrecht Boettcher

We describe a new subclass of the class of real polynomials with real simple roots called self-interlacing polynomials. This subclass is isomorphic to the class of real Hurwitz stable polynomials (all roots in the open left half-plane). In…

Classical Analysis and ODEs · Mathematics 2025-07-01 Mikhail Tyaglov

A Hadamard matrix is a scaled orthogonal matrix with $\pm 1$ entries. Such matrices exist in certain dimensions: the Hadamard conjecture is that such a matrix always exists when $n$ is a multiple of 4. A conjecture attributed to Ryser is…

Combinatorics · Mathematics 2024-02-21 Stefan Steinerberger

Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also give applications and connections to polynomial identity…

Computational Complexity · Computer Science 2009-07-24 V. Arvind , Pushkar S. Joglekar , Srikanth Srinivasan
‹ Prev 1 2 3 10 Next ›