Related papers: Pluripolar graphs are holomorphic

This paper presents and explores a theory of \emph{multiholomorphic maps}. This group of ideas generalizes the theory of pseudoholomorphic curves in a direction suggested by consideration of the kinds of compatible geometric structures that…

In this paper, we investigate the geometric properties of complex-valued pluriharmonic mappings defined over convex Reinhardt domains in $\mathbb{C}^n$. We first establish a multidimensional analogue of the Noshiro-Warschawski Theorem,…

A polynomial is said to be unimodal if its coefficients are non-decreasing and then non-increasing. The domination polynomial of a graph $G$ is the generating function of the number of domination sets of each cardinality in $G$, and its…

In classical function theory, a function is holomorphic if and only if it is complex analytic. For higher dimensional spaces it is natural to work in the context of Clifford algebras. The structures of these algebras depend on the parity of…

We prove that the set of points where a subharmonic function fails to be continuous is polar.

We prove that if f and g are holomorphic functions on an open connected domain, with the same moduli on two intersecting segments, then f = g up to the multiplication of a unimodular constant, provided the segments make an angle that is an…

It is well known that a plane graph is Eulerian if and only if its geometric dual is bipartite. We extend this result to partial duals of plane graphs. We then characterize all bipartite partial duals of a plane graph in terms of oriented…

Let $f$ be a harmonic map from a Riemann surface to a Riemannian $n$-manifold. We prove that if there is a holomorphic diffeomorphism $h$ between open subsets of the surface such that $f\circ h = f$, then $f$ factors through a holomorphic…

If G is a graph and H is a set of subgraphs of G, then an edge-coloring of G is called H-polychromatic if every graph from H gets all colors present in G on its edges. The H-polychromatic number of G, denoted poly_H(G), is the largest…

For a K\"{a}hler manifold endowed with a weighted measure $e^{-f}\,dv,$ the associated weighted Hodge Laplacian $\Delta _{f}$ maps the space of $(p,q)$-forms to itself if and only if the $(1,0)$-part of the gradient vector field $\nabla f$…

Planar holomorphic systems $\dot{x}=u(x,y)$, $\dot{y}=v(x,y)$ are those that $u=\operatorname{Re}(f)$ and $v=\operatorname{Im}(f)$ for some holomorphic function $f(z)$. They have important dynamical properties, highlighting, for example,…

Let $\mathcal A$ and $\mathcal B$ be two (complex) algebras. A linear map $\phi:{\mathcal A}\to{\mathcal B}$ is called $n$-homomorphism if $\phi(a_{1}... a_{n})=\phi(a_{1})...\phi(a_{n})$ for each $a_{1},...,a_{n}\in{\mathcal A}.$ In this…

Let D be a bounded domain in the complex plane whose boundary consists of m pairwise disjoint simple closed curves where m is greater than one. Let A(bD) be the algebra of all continuous functions on bD which extend holomorphically through…

A digraph is connected-homogeneous if every isomorphism between two finite connected induced subdigraphs extends to an automorphism of the whole digraph. In this paper, we completely classify the countable connected-homogeneous digraphs.

We prove an analogue of Sadullaev's theorem concerning the size of the set where a maximal totally real manifold can meet a pluripolar set. The manifold has to be of class C-1 only. This readily leads to a version of Shcherbina's theorem…

We prove that if f is a holomorphic function on the open unit disc in C whose cluster set C(f) has finite linear measure and is such that the complement of C(f) has finitely many components, then the derivative of f belongs to the Hardy…

One-parameter smooth families of circles in the complex plane with the following property are described: a function is polyanalytic if and only if it has meromorphic extension inside any circle from the family, with the only singularity-a…

We call a multigraph {\em non-homotopic} if it can be drawn in the plane in such a way that no two edges connecting the same pair of vertices can be continuously transformed into each other without passing through a vertex, and no loop can…

An explicit algorithm is presented for testing whether two non-directed graphs are isomorphic or not. It is shown that for a graph of n vertices, the number of n independent operations needed for the test is polynomial in n. A proof that…

We classify the connected-homogeneous digraphs with more than one end. We further show that if their underlying undirected graph is not connected-homogeneous, they are highly-arc-transitive.