Related papers: Pluripolar graphs are holomorphic

Let $D\subset \C^n,$ $G\subset \C^m$ be pseudoconvex domains, let $A$ (resp. $B$) be an open subset of the boundary $\partial D$ (resp. $\partial G$) and let $X$ be the 2-fold cross $((D\cup A)\times B)\cup (A\times(B\cup G)).$ Suppose in…

In this paper we show that if an entire function $f(z_1,z_2)$ of two (or more) complex variables verifies $\norm{f(z_1,z_2)}\leq K(\norm{P(z_1,z_2)})$, where $P(z_1,z_2)$ is a polynomial that is not a power in $\CC[[z_1,z_2]]$, and $K$ is…

Let D be a bounded convex domain in C^N, N\geq 2. We prove that a continous map F from bD to C^N extends holomorphically through D if and only if for every polynomial map P from C^N to C^N such that F+P has no zero on bD, the degree of…

Two graphs are co-spectral if their respective adjacency matrices have the same multi-set of eigenvalues. A graph is said to be determined by its spectrum if all graphs that are co-spectral with it are isomorphic to it. We consider these…

A function $f$ of a graph is called a complete graph invariant if the isomorphism of graphs $G$ and $H$ is equivalent to the equality $f(G)=f(H)$. If, in addition, $f(G)$ is a graph isomorphic to $G$, then $f$ is called a canonical form for…

Consider a continuous one parameter family of circles in complex plane that contains two circles lying in the exterior of one another. Under mild assumptions on the family, we prove that if a continuous function on the union of the above…

We prove that any graph of multicurves satisfying certain natural properties is either hyperbolic, relatively hyperbolic, or thick. Further, this geometric characterization is determined by the set of subsurfaces that intersect every vertex…

Let $f$ be a postcritically finite rational map. We prove that, as $n$ large enough, there exists an $f^n$-invariant (finite connected) graph on $\widehat{\mathbb{C}}$ such that it contains the postcritical set of $f$.

A multipath in a directed graph is a disjoint union of paths. The multipath complex of a directed graph ${\tt G}$ is the simplicial complex whose faces are the multipaths of ${\tt G}$. We compute the Euler characteristic, and associated…

A coloured graph is k-ultrahomogeneous if every isomorphism between two induced subgraphs of order at most k extends to an automorphism. A coloured graph is t-tuple regular if the number of vertices adjacent to every vertex in a set S of…

Let $D_j\subset\Bbb C^{k_j}$ be a pseudoconvex domain and let $A_j\subset D_j$ be a locally pluripolar set, $j=1,...,N$. Put$$X:=\bigcup_{j=1}^N A_1\times...\times A_{j-1}\times D_j\times A_{j+1}\times...\times A_N\subset\Bbb…

Answering an old question, we find a domain X in the complex projective plane CP^2 which admits a strongly plurisubharmonic function, but such that every holomorphic function on X is constant. The domain X can be chosen diffeomorphic to an…

We show that the graph of a holomorphic motion of the unit disc cannot be biholomorphic to a strongly pseudoconvex domain in C n .

Let $f$ be a holomorphic function on the strip $\{z\in C: -\alpha<Im z<\alpha\}, \alpha > 0$, belonging to the class $H(\alpha,-\alpha;\epsilon)$ defined below. It is shown that there exist holomorphic functions $w_1$ on $\{z\in C: 0<Im z…

Given a pseudoconvex domain D in C^N, N>1, we prove that there is a holomorphic function f on D such that the lengths of paths p: [0,1]--> D along which Re f is bounded above, with p(0) fixed, grow arbitrarily fast as p(1)--> bD. A…

We prove that every locally pluripolar set on a compact complex manifold is pluripolar. This extends similar results in K\"ahler case.

A directed graph is set-homogeneous if, whenever U and V are isomorphic finite subdigraphs, there is an automorphism g of the digraph with U^g=V. Here, extending work of Lachlan on finite homogeneous digraphs, we classify finite…

A 2p-times continuously differentiable complex valued function $f = u + iv$ in a simply connected domain is polyharmonic (or p-harmonic) if it satisfies the polyharmonic equation $\Delta^pF = 0$ . Every polyharmonic mapping f can be written…

It is well known that a graph is bipartite if and only if the spectrum of its adjacency matrix is symmetric. In the present paper, this assertion is dissected into three separate matrix results of wider scope, which are extended also to…

We prove that a linear growth graph has finitely many horofunctions. This provides a short and simple proof that any finitely generated infinite group of linear growth is virtually cyclic.