相关论文: Graphs of multifunctions
We prove a.s. (almost sure) unisolvency of interpolation by continuous random sampling with respect to any given density, in spaces of multivariate a.e. (almost everywhere) analytic functions. Examples are given concerning polynomial and…
We initiate the study of property testing in arbitrary planar graphs. We prove that bipartiteness can be tested in constant time, improving on the previous bound of $\tilde{O}(\sqrt{n})$ for graphs on $n$ vertices. The constant-time…
In this note, we extend results about unique $n^{\textrm{th}}$ roots and cancellation of finite disconnected graphs with respect to the Cartesian, the strong and the direct product, to the rooted hierarchical products, and to a modified…
The present article is an extended version of [6] containing new results and an updated list of references. We review the notion of polar analyticity introduced in a previous paper and succesfully applied in Mellin analysis and quadrature…
In this paper I present a kind of proof for classical Euclidean geometric problems which relies on both synthetic and analytic geometry. Using the elementary tools of polynomial algebra and multivariate calculus we manage to reduce the…
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…
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…
In this paper we show that for each $n$, there exists a simple graph whose reliability polynomial has at least $n$ inflection points.
Basing on invariant properties of universal multifractals we propose a simple algorithm for interpolation of multifractal densities. The algorithm admits generalization to a multidimensional case. Analitically obtained are multifractal…
We obtain sharp bounds for the number of n-cycles in a finite graph as a function of the number of edges, and prove that the complete graph is optimal in more ways than could be imagined. En route, we prove some sharp estimates on power…
We present analytical potential-density pairs in three dimensions for the gravitational field of galaxies, obtained by thickening the multipolar expansion up to the quadrupole term. These may be interpreted as generalizations of the…
In this note, we give short inductive proofs of two known results on $k$-extendible graphs based on a property proved in [Qinglin Yu, A note on $n$-extendable graphs. Journal of Graph Theory, 16:349-353, 1992].
We propose the Lie-algebraic interpretation of poly-analytic functions in $L_2(\C,d\mu)$, with the Gaussian measure $d\mu$, based on a flag structure formed by the representation spaces of the $\mathfrak{sl}(2)$-algebra realized by…
The periodic discrete Toda equation defined over finite fields has been studied. We obtained the finite graph structures constructed by the network of states where edges denote possible time evolutions. We simplify the graphs by introducing…
We study the asymptotics of large, simple, labeled graphs constrained by the densities of edges and of $k$-star subgraphs, $k\ge 2$ fixed. We prove that under such constraints graphs are "multipodal": asymptotically in the number of…
Using the stratifications of Deligne-Mumford moduli spaces $\overline{\mathcal M}_{g,n}$ indexed by stable graphs, we introduce a partially ordered set of stable graphs by defining a partial ordering on the set of connected stable graphs of…
Multiparticle systems on complicated metric graphs might have many applications in physics, biology and social life. But the corresponding science still does not exist. Here we start it with simplest examples where there is quadratic…
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.
What is a mathematically rigorous way to describe the taxi-pickup distribution in Manhattan, or the profile information in online social networks? A deep understanding of representing those data not only provides insights to the data…
In this paper, we consider the decomposition of multigraphs under minimum degree constraints and give a unified generalization of several results by various researchers. Let $G$ be a multigraph in which no quadrilaterals share edges with…