Related papers: Graphs with multiple sheeted pluripolar hulls
We characterize the region of meromorphic continuation of an analytic function $f$ in terms of the geometric rate of convergence on a compact set of sequences of multi-point rational interpolants of $f$. The rational approximants have a…
We say that a subset of C^n is hypoconvex if its complement is the union of complex hyperplanes. Let D be the closed unit disk in C, T the unit circle. We prove two conjectures of Helton and Marshall. (See ``Frequency domain design and…
Let $G$ be a finite group. The bipartite divisor graph for the set of irreducible complex character degrees is the undirected graph with vertex set consisting of the prime numbers dividing some character degree and of the non-identity…
We study the behavior of the analytic capacity of a compact set under deformations obtained by families of conformal maps depending holomorphically on the complex parameter. We show that, under those deformations, the logarithm of the…
We characterize analytic curves that contain non-trivial self-affine sets. We also prove that compact algebraic surfaces cannot contain non-trivial self-affine sets.
Multifractals are inhomogeneous measures (or functions) which are typically described by a full spectrum of real dimensions, as opposed to a single real dimension. Results from the study of fractal strings in the analysis of their geometry,…
The partition function of a factor graph can sometimes be accurately estimated by Monte Carlo methods. In this paper, such methods are extended to factor graphs with negative and complex factors.
Let X be a complex analytic space. A short analytic arc is a holomorphic map of the closed unit disc to X such that only the origin is mapped to a singular point. In contrast with the space of formal arcs studied by Nash, the moduli space…
For more than a decade, graphs have been used to model the voting behavior taking place in parliaments. However, the methods described in the literature suffer from several limitations. The two main ones are that 1) they rely on some…
In this paper we study underlying graphs corresponding to a set of halving lines. We establish many properties of such graphs. In addition, we tighten the upper bound for the number of halving lines.
We examine the Maximum Independent Set Problem in an undirected graph. The main result is that this problem can be considered as the solving the same problem in a subclass of the weighted normal twin-orthogonal graphs. The problem is…
We study the zero sets of the independence polynomial on recursive sequences of graphs. We prove that for a maximally independent starting graph and a stable and expanding recursion algorithm, the zeros of the independence polynomial are…
Argument graphs provide an abstract representation of an argumentative situation. A bipolar argument graph is a directed graph where each node denotes an argument, and each arc denotes the influence of one argument on another. Here we…
A plane graph is called a rectangular graph if each of its edges can be oriented either horizontally or vertically, each of its interior regions is a four-sided region and all interior regions can be fitted in a rectangular enclosure. If…
Generalizing pseudospherical drawings, we introduce a new class of simple drawings, which we call separable drawings. In a separable drawing, every edge can be closed to a simple curve that intersects each other edge at most once. Curves of…
This article investigates multiset dimensions in zero divisor graphs (ZD-graphs) associated with rings. Through rigorous analysis, we establish general bounds for the multiset dimension (Mdim) in ZD-graphs, exploring various commutative…
By designating vertices with variables, a simple undirected graph can be augmented to have an associated representing rational function in two variables taking the complex bi-upper halfplane to itself. We give relations between representing…
We prove that a connected bipartite graph G is a partial cube if and only if the set of attaching points of any copoint of G is convex. A consequence of this result is that any connected bipartite graph with pre-hull number at most 1 is a…
Trivalent $2$-stratifolds are a generalization of $2$-manifolds in that there are disjoint simple closed curves where three sheets meet. We obtain a classification of $1$-connected $2$-stratifolds in terms of their associated labeled graphs…
A graph $G$ is said to be an $(s, k)$-polar graph if its vertex set admits a partition $(A, B)$ such that $A$ and $B$ induce, respectively, a complete $s$-partite graph and the disjoint union of at most $k$ complete graphs. Polar graphs and…