English
Related papers

Related papers: Separating zeros of polynomials using an added int…

200 papers

The $X_1$-Jacobi and the $X_1$-Laguerre exceptional orthogonal polynomials have been introduced and studied by G\'omez-Ullate, Kamran and Milson in a series of papers. In this note, we establish some properties, such as interlacing,…

Classical Analysis and ODEs · Mathematics 2019-08-06 Yen Chi Lun

An interesting discovery in the last two years in the field of mathematical physics has been the exceptional $X_\ell$ Laguerre and Jacobi polynomials. Unlike the well-known classical orthogonal polynomials which start with constant terms,…

Mathematical Physics · Physics 2014-12-01 C. -L. Ho , R. Sasaki

Polynomials whose zeros are symmetric either to the real line or to the unit circle are very important in mathematics and physics. We can classify them into three main classes: the self-conjugate polynomials, whose zeros are symmetric to…

Complex Variables · Mathematics 2019-04-04 R. S. Vieira

The purpose of this note is to revive in $L^p$ spaces the original A. Markov ideas to study monotonicity of zeros of orthogonal polynomials. This allows us to prove and improve in a simple and unified way our previous result [Electron.…

Classical Analysis and ODEs · Mathematics 2019-04-10 K. Castillo , M. S. Costa , F. R. Rafaeli

We opt to study the convergence of maximal real roots of certain Fibonacci-type polynomials given by $G_n=x^kG_{n-1}+G_{n-2}$. The special cases $k=1$ and $k=2$ are found in [4] and [7], respectively.

Number Theory · Mathematics 2008-12-16 Tewodros Amdeberhan

In this paper we investigate bounds for the zeros of a bicomplex polynomial using matrix method. In particular, we find analogue of Gershgorin disk theorem, Cauchy Theorem, theorem of Fujiwara, Walsh and other theorems concerning to zeros…

Complex Variables · Mathematics 2024-02-23 Ovaisa Jan , Idrees Qasim

Combinatorial properties of zeons have been applied to graph enumeration problems, graph colorings, routing problems in communication networks, partition-dependent stochastic integrals, and Boolean satisfiability. Power series of elementary…

Combinatorics · Mathematics 2021-09-07 G. Stacey Staples

In this work, we prove a refinement of the Gallai-Edmonds structure theorem for weighted matching polynomials by Ku and Wong. Our proof uses a connection between matching polynomials and branched continued fractions. We also show how this…

Combinatorics · Mathematics 2024-01-17 Thomás Jung Spier

In this paper, we investigate the classes of matroid intersection admitting a solution for the problem of partitioning the ground set $E$ into $k$ common independent sets, where $E$ can be partitioned into $k$ independent sets in each of…

Combinatorics · Mathematics 2019-01-29 Kenjiro Takazawa , Yu Yokoi

We generalize Coincidence theorem due to Walsh for symmetric and linear polynomial in n complex variables, that is linear in each of them having total degre n. We discuss case when total degree is smaller then n. This case has been already…

Complex Variables · Mathematics 2023-05-29 Rados Bakic

In this note, we provide a wide range of upper bounds for the moduli of the zeros of a complex polynomial. The obtained bounds complete a series of previous papers on the location of zeros of polynomials.

Complex Variables · Mathematics 2011-02-15 Josep Rubió-Massegú

A fast and weakly stable method for computing the zeros of a particular class of hypergeometric polynomials is presented. The studied hypergeometric polynomials satisfy a higher order differential equation and generalize Laguerre…

Numerical Analysis · Mathematics 2025-03-27 Nicola Mastronardi , Marc Van Barel , Raf Vandebril , Paul Van Dooren

We present an exact and complete algorithm to isolate the real solutions of a zero-dimensional bivariate polynomial system. The proposed algorithm constitutes an elimination method which improves upon existing approaches in a number of…

Mathematical Software · Computer Science 2010-10-08 Eric Berberich , Pavel Emeliyanenko , Michael Sagraloff

A subset $S$ of vertices of a graph $G$ is called a perfectly matchable set of $G$ if the subgraph induced by $S$ contains a perfect matching. The perfectly matchable set polynomial of $G$, first made explicit by Ohsugi and Tsuchiya, is the…

Combinatorics · Mathematics 2022-08-01 Robert Davis , Florian Kohl

We consider multivariable polynomials over a fixed number field, linear in some of the variables. For a system of such polynomials satisfying certain technical conditions we prove the existence of search bounds for simultaneous zeros with…

Number Theory · Mathematics 2022-11-14 Maxwell Forst , Lenny Fukshansky

Under certain natural sufficient conditions on the sequence of uniformly bounded closed sets $E_k\subset\mathbb{R}$ of admissible coefficients, we construct a polynomial $P_n(x)=1+\sum_{k=1}^n\varepsilon_k x^k$, $\varepsilon_k\in E_k$, with…

Classical Analysis and ODEs · Mathematics 2024-04-12 Markus Jacob , Fedor Nazarov

For any finite partially ordered set $P$, the $P$-Eulerian polynomial is the generating function for the descent number over the set of linear extensions of $P$, and is closely related to the order polynomial of $P$ arising in the theory of…

Combinatorics · Mathematics 2024-09-11 T. Kyle Petersen , Yan Zhuang

We explicitly characterize when the Milnor number at the origin of a polynomial or power series (over an algebraically closed field k of arbitrary characteristic) is the minimum of all polynomials with the same Newton diagram, which…

Algebraic Geometry · Mathematics 2016-12-16 Pinaki Mondal

Information about the behavior of zeros of classical families of multiple or Hermite-Pad\'e orthogonal polynomials as functions of the intrinsic parameters of the family is scarce. We establish the interlacing properties of the zeros of…

Classical Analysis and ODEs · Mathematics 2024-02-13 Andrei Martinez-Finkelshtein , Rafael Morales

Consider the random process in which the edges of a graph $G$ are added one by one in a random order. A classical result states that if $G$ is the complete graph $K_{2n}$ or the complete bipartite graph $K_{n,n}$, then typically a perfect…

Combinatorics · Mathematics 2020-11-03 Roman Glebov , Zur Luria , Michael Simkin
‹ Prev 1 4 5 6 7 8 10 Next ›