scholarly journals The Complexity of Approximating the Matching Polynomial in the Complex Plane

2021 ◽  
Vol 13 (2) ◽  
pp. 1-37
Author(s):  
Ivona Bezáková ◽  
Andreas Galanis ◽  
Leslie Ann Goldberg ◽  
Daniel Štefankovič

We study the problem of approximating the value of the matching polynomial on graphs with edge parameter γ, where γ takes arbitrary values in the complex plane. When γ is a positive real, Jerrum and Sinclair showed that the problem admits an FPRAS on general graphs. For general complex values of γ, Patel and Regts, building on methods developed by Barvinok, showed that the problem admits an FPTAS on graphs of maximum degree Δ as long as γ is not a negative real number less than or equal to −1/(4(Δ −1)). Our first main result completes the picture for the approximability of the matching polynomial on bounded degree graphs. We show that for all Δ ≥ 3 and all real γ less than −1/(4(Δ −1)), the problem of approximating the value of the matching polynomial on graphs of maximum degree Δ with edge parameter γ is #P-hard. We then explore whether the maximum degree parameter can be replaced by the connective constant. Sinclair et al. showed that for positive real γ, it is possible to approximate the value of the matching polynomial using a correlation decay algorithm on graphs with bounded connective constant (and potentially unbounded maximum degree). We first show that this result does not extend in general in the complex plane; in particular, the problem is #P-hard on graphs with bounded connective constant for a dense set of γ values on the negative real axis. Nevertheless, we show that the result does extend for any complex value γ that does not lie on the negative real axis. Our analysis accounts for complex values of γ using geodesic distances in the complex plane in the metric defined by an appropriate density function.

Fractals ◽  
1996 ◽  
Vol 04 (04) ◽  
pp. 533-541 ◽  
Author(s):  
KIM-KHOON ONG ◽  
AICHYUN SHIAH ◽  
ZDZISLAW E. MUSIELAK

The iteration function [Formula: see text], where both α and β are positive real numbers, is used to generate families of the generalized Julia sets, [Formula: see text]. The calculations are restricted to the principal value of zα + iβ and the obtained results demonstrate that classical Julia sets, [Formula: see text] are significantly deformed when non-zero values of β are considered. As a result of this deformation, the area of stable regions in the complex plane changes and a process of splitting and shifting takes place along the real axis. It is shown that this process is responsible for the formation of new fractal images of generalized Julia sets.


2011 ◽  
Vol 07 (04) ◽  
pp. 1033-1043 ◽  
Author(s):  
ABDUL HASSEN ◽  
HIEU D. NGUYEN

This paper investigates the location of "trivial" zeros of some hypergeometric zeta functions. Analogous to Riemann's zeta function, we demonstrate that they possess a zero-free region on a left-half complex plane, except for infinitely many zeros regularly spaced on the negative real axis.


2018 ◽  
Vol 2019 (23) ◽  
pp. 7356-7378
Author(s):  
Walter Bergweiler ◽  
Alexandre Eremenko

Abstract Let L0 and L1 be two distinct rays emanating from the origin and let ${\mathcal{F}}$ be the family of all functions holomorphic in the unit disk ${\mathbb{D}}$ for which all zeros lie on L0 while all 1-points lie on L1. It is shown that ${\mathcal{F}}$ is normal in ${\mathbb{D}}\backslash \{0\}$. The case where L0 is the positive real axis and L1 is the negative real axis is studied in more detail.


Author(s):  
Vida Dujmović ◽  
Louis Esperet ◽  
Pat Morin ◽  
Bartosz Walczak ◽  
David R. Wood

Abstract A (not necessarily proper) vertex colouring of a graph has clustering c if every monochromatic component has at most c vertices. We prove that planar graphs with maximum degree $\Delta$ are 3-colourable with clustering $O(\Delta^2)$ . The previous best bound was $O(\Delta^{37})$ . This result for planar graphs generalises to graphs that can be drawn on a surface of bounded Euler genus with a bounded number of crossings per edge. We then prove that graphs with maximum degree $\Delta$ that exclude a fixed minor are 3-colourable with clustering $O(\Delta^5)$ . The best previous bound for this result was exponential in $\Delta$ .


2021 ◽  
Vol 2038 (1) ◽  
pp. 012009
Author(s):  
Joshua Feinberg ◽  
Roman Riser

Abstract We review our recent results on pseudo-hermitian random matrix theory which were hitherto presented in various conferences and talks. (Detailed accounts of our work will appear soon in separate publications.) Following an introduction of this new type of random matrices, we focus on two specific models of matrices which are pseudo-hermitian with respect to a given indefinite metric B. Eigenvalues of pseudo-hermitian matrices are either real, or come in complex-conjugate pairs. The diagrammatic method is applied to deriving explicit analytical expressions for the density of eigenvalues in the complex plane and on the real axis, in the large-N, planar limit. In one of the models we discuss, the metric B depends on a certain real parameter t. As t varies, the model exhibits various ‘phase transitions’ associated with eigenvalues flowing from the complex plane onto the real axis, causing disjoint eigenvalue support intervals to merge. Our analytical results agree well with presented numerical simulations.


2021 ◽  
Vol 185 (2) ◽  
Author(s):  
Shuai Shao ◽  
Yuxin Sun

AbstractWe study the connection between the correlation decay property (more precisely, strong spatial mixing) and the zero-freeness of the partition function of 2-spin systems on graphs of bounded degree. We show that for 2-spin systems on an entire family of graphs of a given bounded degree, the contraction property that ensures correlation decay exists for certain real parameters implies the zero-freeness of the partition function and the existence of correlation decay for some corresponding complex neighborhoods. Based on this connection, we are able to extend any real parameter of which the 2-spin system on graphs of bounded degree exhibits correlation decay to its complex neighborhood where the partition function is zero-free and correlation decay still exists. We give new zero-free regions in which the edge interaction parameters and the uniform external field are all complex-valued, and we show the existence of correlation decay for such complex regions. As a consequence, we obtain approximation algorithms for computing the partition function of 2-spin systems on graphs of bounded degree for these complex parameter settings.


1964 ◽  
Vol 14 (2) ◽  
pp. 137-141
Author(s):  
R. Wilson

Let f(z) be represented on its circle of convergence |z| = 1 by the Taylor seriesand suppose that its sole singularity on |z| = 1 is an almost isolated singularity at z = 1. In the neighbourhood of such a singularity f(z) is regular on a sufficiently small disk, centre z = 1, with the outward drawn radius along the positive real axis excised. If also in this neighbourhood |f(z)| e−(1/δ)ρ remains bounded for some finite ρ, where δ is the distance from the excised radius, then the singularity is said to be of finite exponential order.


2019 ◽  
Vol 79 (12) ◽  
Author(s):  
J. R. Pelaez ◽  
A. Rodas ◽  
J. Ruiz de Elvira

AbstractWe provide global parameterizations of $$\pi \pi \rightarrow \pi \pi $$ππ→ππ scattering S0 and P partial waves up to roughly 2 GeV for phenomenological use. These parameterizations describe the output and uncertainties of previous partial-wave dispersive analyses of $$\pi \pi \rightarrow \pi \pi $$ππ→ππ, both in the real axis up to 1.12 $${\mathrm {\,GeV}}$$GeV and in the complex plane within their applicability region, while also fulfilling forward dispersion relations up to 1.43 $${\mathrm {\,GeV}}$$GeV. Above that energy we just describe the available experimental data. Moreover, the analytic continuations of these global parameterizations also describe accurately the dispersive determinations of the $$\sigma /f_0(500)$$σ/f0(500), $$f_0(980)$$f0(980) and $$\rho (770)$$ρ(770) pole parameters.


Sign in / Sign up

Export Citation Format

Share Document