相关论文: Pluripolar graphs are holomorphic

For a graph $G$, a $k$-coloring $c:V(G)\to \{1,2,\ldots, k\}$ is called distinguishing, if the only automorphism $f$ of $G$ with the property $c(v)=c(f(v))$ for every vertex $v\in G$ (color-preserving automorphism), is the identity. In this…

The number of homomorphisms from a finite graph $F$ to the complete graph $K_n$ is the evaluation of the chromatic polynomial of $F$ at $n$. Suitably scaled, this is the Tutte polynomial evaluation $T(F;1-n,0)$ and an invariant of the cycle…

Necessary and sufficient conditions are obtained under which the numerator of the partial derivative of a rational function holomorphic in open upper poly-halfplane is the sum of squares of polynomials.

We establish a general uniqueness theorem for subharmonic functions of several variables on a domain. A corollary from this uniqueness theorem for holomorphic functions is formulated in terms of the zero subset of holomorphic functions and…

We prove that, if f:R^n\to R satisfies Fr\'echet's functional equation and f(x_1,...,x_n) is not an ordinary algebraic polynomial in the variables x_1,...,x_n, then f is unbounded on all non-empty open set U of R^n. Furthermore, the closure…

The following result is proved: Let $D$ and $D'$ be bounded domains in $\mathbb C^n$, $\partial D$ is smooth, real-analytic, simply connected, and $\partial D'$ is connected, smooth, real-algebraic. Then there exists a proper holomorphic…

Let D be a bounded domain in the complex plane whose boundary bD consists of finitely many pairwise disjoint real analytic simple closed curves. Let f be an integrable function on bD. In the paper we show how to compute the candidates for…

Under very general conditions it is shown that if $A$ is a uniform algebra generated by real-analytic functions, then either $A$ consists of all continuous functions or else there exists a disc on which every function in $A$ is holomorphic.…

Let $f: X\to X$ be a surjective endomorphism of a projective variety of dimension $d$. The aim of this paper is to study the action of $f$ on the numerical group of divisors. For exmaple, I proved that $f$ is cohomologically hyperbolic if…

A function on a (generally infinite) graph $\G$ with values in a field $K$ of characteristic 2 will be called {\it harmonic} if its value at every vertex of $\G$ is the sum of its values over all adjacent vertices. We consider binary…

Let $\D$ be the unit disk. Kutzschebauch and Studer \cite{KS} recently proved that, for each continuous map $A:\overline D\to \mathrm{SL}(2,\C)$, which is holomorphic in $\D$, there exist continuous maps $E,F:\overline \D\to…

A hypermap is (hypervertex-) bipartite if its hypervertices can be 2-coloured in such a way that ``neighbouring'' hypervertices have different colours. It is bipartite-uniform if within each of the sets of hypervertices of the same colour,…

We prove that a real-valued function (that is not assumed to be continuous) on a real analytic manifold is analytic whenever all its restrictions to analytic submanifolds homeomorphic to the 2-sphere are analytic. This is a real analog for…

We consider holomorphic functions on the unit disc whose images are contained in a strip of the complex plane. Under an additional condition, such functions are constants. We also consider appropriate operator valued versions. Applications…

It is well known that the real and imaginary parts of any holomorphic function are harmonic functions of two variables. In this paper we generalize this property to finite-dimensional commutative algebras. We prove that if some basis of a…

A graph is said to be circular-arc if the vertices can be associated with arcs of a circle so that two vertices are adjacent if and only if the corresponding arcs overlap. It is proved that the isomorphism of circular-arc graphs can be…

We establish rigidity results for holomorphic mappings and plurisubharmonic functions in complex geometry. First, under mild conditions, we show that the gradient of a $\operatorname{U}(1)$-invariant strictly plurisubharmonic function in…

We extend the concept of the law of a finite graph to graphings, which are, in general, infinite graphs whose vertices are equipped with the structure of a probability space. By doing this, we obtain a vast array of new unimodular measures.…

A relational structure is (connected-)homogeneous if every isomorphism between finite (connected) substructures extends to an automorphism of the structure. We investigate notions which generalise (connected-)homogeneity, where…

If $G$ is a more than one tough graph on $n$ vertices with $\delta\ge \frac{n}{2}-a$ for a given $a>0$ and $n$ is large enough then $G$ is hamiltonian.