Related papers: Graph-theoretic conditions for injectivity of func…
The problem of map enumeration concerns counting connected spatial graphs, with a specified number $j$ of vertices, that can be embedded in a compact surface of genus $g$ in such a way that its complement yields a cellular decomposition of…
In the local gluing one glues local neighborhoods around the critical point of the stable and unstable manifolds to gradient flow lines defined on a finite time interval $[-T,T]$ for large $T$. If the Riemannian metric around the critical…
Properties of steady compressible flow for which geometric constraints have been placed on the potential function are derived, under hypotheses on the flow density and the singular set. Some related unconstrained problems are also…
We introduce and study embeddings of graphs in finite projective planes, and present related results for some families of graphs including complete graphs and complete bipartite graphs. We also make connections between embeddings of graphs…
In this paper, we demonstrate that several classes of functions, specifically n-multiplicative isomorphisms, derivations, elementary maps, and Jordan elementary maps on a class of algebras that includes Jordan algebras with idempotents,…
This paper investigates the well posedness of ordinary differential equations and more precisely the existence (or uniqueness) of a flow through explicit compactness estimates. Instead of assuming a bounded divergence condition on the…
The aim of the current paper is to introduce a new class of contractive mappings, which are contracting (a feature of) triangles. We prove that maps contracting triangles are continuous and give the fixed point result for such mappings. We…
We study functions defined on a closed segment of the real line that belong to the class of Gonchar. We show that the graphs of such functions are pluripolar. We also discuss the generalizations of our result to functions defined on a…
We present the main concepts and results for Graph Directed Markov Systems that have a finitely irreducible incidence matrix. We then see how these results change when the incidence matrix is not assumed to be finitely irreducible.
We construct and fully characterize a scalar boundary conformal field theory on a triangulated Riemann surface. The results are analyzed from a string theory perspective as tools to deal with open/closed string dualities.
In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…
We present sweeping line graphs, a generalization of $\Theta$-graphs. We show that these graphs are spanners of the complete graph, as well as of the visibility graph when line segment constraints or polygonal obstacles are considered. Our…
Computational topology is an area that revisits topological problems from an algorithmic point of view, and develops topological tools for improved algorithms. We survey results in computational topology that are concerned with graphs drawn…
Hamiltonian flows on compact surfaces are characterized, and the topological invariants of such flows with finitely many singular points are constructed from the viewpoints of integrable systems, fluid mechanics, and dynamical systems.…
We present a fixed point theorem on topological cylinders in normed linear spaces for maps satisfying a property of stretching a space along paths. This result is a generalization of a similar theorem obtained by D. Papini and F. Zanolin.…
We consider the Radon transform along lines in an $n$ dimensional vector space over the two element field. It is well known that this transform is injective and highly overdetermined. We classify the minimal collections of lines for which…
An approach to the enumeration of feasible parameters for strongly regular graphs is described, based on the pair of structural parameters (a,c) and the positive eigenvalue e. The Krein bound ensures that there are only finitely many…
Graph rigidity theory studies the capability of a graph embedded in the Euclidean space to constrain its global geometric shape via local constraints among nodes and edges, and has been widely exploited in network localization and formation…
The main result of this paper is a Pfaffian formula for the partition function of the dimer model on a graph G embedded in a closed, possibly non-orientable surface S. This formula is suitable for computational purposes, and it is obtained…
We describe dynamical properties of a map $\mathfrak{F}$ defined on the space of rational functions. The fixed points of $\mathfrak{F}$ are classified and the long time behavior of a subclass is described in terms of Eulerian polynomials.