Related papers: Singularity for graph-directed conjugate equations…
In this paper, we discuss the existence of fixed points for integral type contractions in uniform spaces endowed with both a graph and an $E$-distance. We also give two sufficient conditions under which the fixed point is unique. Our main…
This paper deals with spectral graph theory issues related to questions of monotonicity and comparison of eigenvalues. We consider finite directed graphs with non symmetric edge weights and we introduce a special self-adjoint operator as…
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…
This paper studies singularity structures of the linear inviscid damping of two-dimensional Euler equations in a finite periodic channel. We introduce a recursive definition of singularity structures which characterize the singularities of…
We present a theorem of resolution of singularities for real analytic constrained differential systems $A(x)\dot{x} = F(x)$ defined on a 2-manifold with corners having impasse set $\{x; \det A(x) = 0\}$. This result can be seen as a…
We study the behavior of solutions of mutually coupled equations in heterogeneous random graphs. Heterogeneity means that some equations receive many inputs whereas most of the equations are given only with a few connections. Starting from…
Bidirected graphs are multigraphs where every edge has an independent direction at each end. In the paper, with an arbitrary bidirected graph we associate a non-negative integral quadratic form (called the incidence form of the graph), and…
In Chapter 1 we fully characterise pairs of finite graphs which form a gap in the full homomorphism order. This leads to a simple proof of the existence of generalised duality pairs. We also discuss how such results can be carried to…
We give characterizations for the failure of form uniqueness on weakly spherically symmetric graphs. The first characterization is in terms of the graph structure, the second involves the capacity of a Cauchy boundary. We also discuss the…
This paper presents two new constructions related to singular solutions of polynomial systems. The first is a new deflation method for an isolated singular root. This construction uses a single linear differential form defined from the…
Differential calculus on discrete sets is developed in the spirit of noncommutative geometry. Any differential algebra on a discrete set can be regarded as a `reduction' of the `universal differential algebra' and this allows a systematic…
Let M be a smooth connected compact surface, P be either the real line R^1 or the circle S^1, and f:M-->P be a smooth mapping. In a previous series of papers for the case when f is a Morse map the author calculated the homotopy types of…
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse…
Comparing and recognizing metrics can be extraordinarily difficult because of the group of diffeomorphisms. Two metrics, that could even be the same, could look completely different in different coordinates. This is the gauge problem. The…
We review the method of uniqueness which is a powerful technique for multi-loop calculations in higher dimensional theories with conformal symmetry. We use the method in momentum space and show that it allows a very transparent evaluation…
Consider a fixed connected, finite graph $\Gamma$ and equip its vertices with weights $p_i$ which are non-negative integers. We show that there is a finite number of possibilities for the coefficients of the canonical cycle of a numerically…
We investigate linear parabolic equations in divergence form with singular coefficients and non-smooth boundary data. When the diffusion, drift, or potential terms, as well as the initial or boundary conditions, are distributions rather…
We consider weighted graphs with an infinite set of vertices. We show that boundedness of all functions of finite energy can be seen as a notion of `relative compactness' for such graphs and study sufficient and necessary conditions for…
Functional digraphs are unlabelled finite digraphs where each vertex has exactly one out-neighbor. They are isomorphic classes of finite discrete-time dynamical systems. Endowed with the direct sum and product, functional digraphs form a…
We show that the groupoids of two directed graphs are isomorphic if and only if the two graphs are orbit equivalent by an orbit equivalence that preserves isolated eventually periodic points. We also give a complete description of the…