Related papers: Stable Polynomials via Undirected Colored Graphs
We investigate the problem of determining the zeros of quaternionic polynomials using matrix method. In a recent paper, Dar et al. \cite{RD} proved that the zeros of a quaternionic polynomial and the left eigenvalues of the corresponding…
The relationship between a stable multivariable polynomial $p(z)$ and the Fourier coefficients of its spectral density function $1/|p(z)|^2$, is further investigated. In this paper we focus on the radial asymptotics of the Fourier…
Many interesting questions in arithmetic dynamics revolve, in one way or another, around the (local and/or global) reducibility behavior of iterates of a polynomial. We show that for very general families of integer polynomials $f$ (and,…
In this paper, we introduce the notion of 2-boundary planar graphs. A graph is 2-boundary planar if it has an embedding in the plane so that all vertices lie on the boundary of at most two faces and no edges are crossed. A proper coloring…
We investigate the asymptotic structure of a random perfect graph $P_n$ sampled uniformly from the perfect graphs on vertex set $\{1,\ldots,n\}$. Our approach is based on the result of Pr\"omel and Steger that almost all perfect graphs are…
Twisted graph diagrams are virtual graph diagrams with bars on edges. A bijection between abstract graph diagrams and twisted graph diagrams is constructed. Then a polynomial invariant of Yamada-type is developed which provides a lower…
Chaotic attractors commonly contain periodic solutions with unstable manifolds of different dimensions. This allows for a zoo of dynamical phenomena not possible for hyperbolic attractors. The purpose of this Letter is to demonstrate these…
A graph is unichord free if it does not contain a cycle with exactly one chord as its subgraph. In [3], it is shown that a graph is unichord free if and only if every minimal vertex separator is a stable set. In this paper, we first show…
Proper vertex colorings of a graph are related to its boundary map, also called its signed vertex-edge incidence matrix. The vertex Laplacian of a graph, a natural extension of the boundary map, leads us to introduce nowhere-harmonic…
In this paper we demonstrate a connection between the roots of a certain sequence of orthogonal polynomials on the real line and the linear instability of a $x$-directionally homogeneous background velocity profile $u^b(x,y) = \cos(y)$ in…
An edge-weighted graph $G=(V,E)$ is called stable if the value of a maximum-weight matching equals the value of a maximum-weight fractional matching. Stable graphs play an important role in some interesting game theory problems, such as…
For any cubic graph in a closed orientable surface and a perfect matching, the Penrose-Kauffman polynomial is a sum of chromatic polynomials of a collection of associated graphs. A knot-theoretic perspective affords elementary proofs of old…
Roots of graph polynomials such as the characteristic polynomial, the chromatic polynomial, the matching polynomial, and many others are widely studied. In this paper we examine to what extent the location of these roots reflects the graph…
We investigate the dynamical formation of nonlinear patterns in one-dimensional ring condensates under bichromatic periodic modulation of the interaction strength. The stability phase diagram of the condensate's homogeneous density state is…
The study of circular orbits in spacetime is of astrophysical importance. The identification and classification of circular orbits in both static and stationary spacetimes remains an active area of interest. Even in the simplest static…
The domination polynomial of a graph $G$ is given by $D(G,x)=\sum_{k=0}^{n} d_k(G)x^k$ where $d_k(G)$ records the number of $k$-element dominating sets in $G$. A conjecture of Alikhani and Peng asserts that these polynomials have unimodal…
It is known that each symmetric stable distribution in $R^d$ is related to a norm on $R^d$ that makes $R^d$ embeddable in $L_p([0,1])$. In case of a multivariate Cauchy distribution the unit ball in this norm corresponds is the polar set to…
We prove that the coefficients of the colored Jones polynomial of alternating links stabilize under increasing the number of twists in the twist regions of the link diagram. This gives us an infinite family of $q$-power series derived from…
The Four color problem is closely related to other branches of mathematics and practical applications. More than 20 of its reformulations are known, which connect this problem with problems of algebra, statistical mechanics and planning.…
A matching $M$ in a graph $G$ is connected if all the edges of $M$ are in the same component of $G$. Following \L uczak,there have been many results using the existence of large connected matchings in cluster graphs with respect to regular…