相关论文: Pluripolar graphs are holomorphic

We ask under what conditions on the function $f$, and a set of maps $\mathcal T$, it is the case that $f$ is a coboundary for some map in $\mathcal T$. We also consider for a function $f$, and a set of maps $\mathcal T$, when we have $f$…

We give sharp conditions on a local biholomorphism $F:X \to \mathbb C^{n}$ which ensure global injectivity. For $n \geq 2$, such a map is injective if for each complex line $l \subset \mathbb C^{n}$, the pre-image $F^{-1}(l)$ embeds…

We study the question of polytopality of graphs: when is a given graph the graph of a polytope? We first review the known necessary conditions for a graph to be polytopal, and we provide several families of graphs which satisfy all these…

Pluriharmonic maps form an important class of harmonic maps which includes holomorphic maps. We study their morphisms, in particular the inter-relationships between $(1,1)$-geodesic, pluriharmonic and $\pm$holomorphic maps. Then we…

A vertex colouring of a graph is called asymmetric if the only automorphism which preserves it is the identity. Tucker conjectured that if every automorphism of a connected, locally finite graph moves infinitely many vertices, then there is…

In this paper we show that a holomorphic function, defined on an open subset $D$ of $\mathbb{C}^n$, is a complex Nash function if and only if its real part (or equivalently its imaginary part) is a real Nash function.

This paper presents sufficient graph-theoretic conditions for injectivity of collections of differentiable functions on rectangular subsets of R^n. The results have implications for the possibility of multiple fixed points of maps and…

A graph is called 1-planar if there exists its drawing in the plane such that each edge is crossed at most once. In this paper, we study 1-planar graph joins. We prove that the join $G+H$ is 1-planar if and only if the pair $[G,H]$ is…

Let $D_j\subset\mathbb C^{n_j}$ be a pseudoconvex domain and let $A_j\subset D_j$ be a locally pluriregular 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. $$ Let $M\subset…

Assume that there is a free group action of automorphisms on a bipartite graph. If there is a perfect matching on the factor graph, then obviously there is a perfect matching on the graph. Surprisingly, the reversed is also true for…

We show that a continuous map $f$ from a quasi-graph $G$ to itself is pointwise recurrent if and only if one of the following two statements holds: (1) $X$ is a simple closed curve and $f$ is topologically conjugate to an irrational…

We extend a well-known result, about the unit ball, by H. Alexander to a class of balanced domains in $\mathbb{C}^n, \ n > 1$. Specifically: we prove that any proper holomorphic self-map of a certain type of balanced, finite-type domain in…

Let T be the unit circle, f be an \alpha-Holder continuous function on T, \alpha>1/2, and A be the algebra of continuous function in the closed unit disk \bar D that are holomorphic in D. Then f extends to a meromorphic function in D with…

A basic result in the theory of holomorphic functions of several complex variables is the following special case of the work of H. Cartan on the sheaf cohomology on Stein domains ([10], or see [14] or [16] for more modern treatments).

In this paper we show that a (non necessarily integrable) holomorphic plane field on a compact complex manfold $M$ having an infinite number of invariant hypersurfaces must admit a meromorphic first integral $F:M\longrightarrow…

We prove that every connected strongly regular graph on sufficiently many vertices is Hamiltonian. We prove this by showing that, apart from three families, connected strongly regular graphs are (highly) pseudo-random. Our results suggest a…

Assuming complex functions defined on complex curves satisfy recursion relations with respect to number of parameters, we express the corresponding cohomology theory via generalizations of holomorphic connections. In examples provided, the…

Let $H$ be a graph possibly with loops and $G$ be a multigraph without loops. An $H$-coloring of $G$ is a function $c: E(G) \rightarrow V(H)$. We will say that $G$ is an $H$-colored multigraph, whenever we are taking a fixed $H$-coloring of…

Necessary and sufficient conditions for a finite connected graph with a strict partial order on vertices to be a combinatorial invariant of pseudoharmonic function are obtained.

We compare two classes of functions arising from genus-one superstring amplitudes: modular and holomorphic graph functions. We focus on their analytic properties, we recall the known asymptotic behaviour of modular graph functions and we…