Metric properties of the tropical Abel–Jacobi map (original) (raw)
Related papers
Metric transforms of finite spaces and connected graphs
Discrete Mathematics, 1986
A metric transform of a semimetric space X is obtained from X by measuring the distances by a different (not always proportional) scale. Two semimetric spaces are said to be isomorphic if one is isometric to a metric transform of the other. If X is a finite semimetric space, then it will be shown that X is isomorphic to a subset of a euclidean space. The dimension of X is defined to be the minimum dimension of a euclidean space containing an isomorph of X. In this paper we examine scales and dimensions for finite semiraetric spaces, especially, for connected graphs and trees as metric spaces. We also count the number of non-isomorphic semimetric spaces.
Graphs and the Jacobian conjecture
Journal of Pure and Applied Algebra, 2008
It is proved in [M. de Bondt, A. van den Essen, A reduction of the Jacobian conjecture to the symmetric case, Proceedings of the AMS 133 -2205] that it suffices to study the Jacobian Conjecture for maps of the form x + ∇ f , where f is a homogeneous polynomial of degree d (=4). The Jacobian Condition implies that f is a finite sum of d-th powers of linear forms, α, x d , where x, y = x t y and each α is an isotropic vector i.e. α, α = 0. To a set {α 1 , . . . , α s } of isotropic vectors, we assign a graph and study its structure in case the corresponding polynomial f = α j , x d has a nilpotent Hessian. The main result of this article asserts that in the case dim([α 1 , . . . , α s ]) ≤ 2 or ≥ s − 2, the Jacobian Conjecture holds for the maps x + ∇ f . In fact, we give a complete description of the graphs of such f 's, whose Hessian is nilpotent. As an application of the result, we show that lines and cycles cannot appear as graphs of HN polynomials.
Metric graph theory and geometry: a survey
Surveys on Discrete and Computational Geometry, 2008
The article surveys structural characterizations of several graph classes defined by distance properties, which have in part a general algebraic flavor and can be interpreted as subdirect decomposition. The graphs we feature in the first place are the median graphs and their various kinds of generalizations, e.g., weakly modular graphs, or fiber-complemented graphs, or l 1-graphs. Several kinds of l 1-graphs admit natural geometric realizations as polyhedral complexes. Particular instances of these graphs also occur in other geometric contexts, for example, as dual polar graphs, basis graphs of (even ∆-)matroids, tope graphs, lopsided sets, or plane graphs with vertex degrees and face sizes bounded from below. Several other classes of graphs, e.g., Helly graphs (as injective objects), or bridged graphs (generalizing chordal graphs), or tree-like graphs such as distance-hereditary graphs occur in the investigation of graphs satisfying some basic properties of the distance function, such as the Helly property for balls, or the convexity of balls or of the neighborhoods of convex sets, etc. Operators between graphs or complexes relate some of the graph classes reported in this survey.
Intrinsic Metric on Graded Graphs, Standardness, and Invariant Measures
Journal of Mathematical Sciences, 2014
We define a general notion of a smooth invariant (central) ergodic measure on the space of paths of an N-graded graph (Bratteli diagram). It is based on the notion of standardness of the tail filtration in the space of paths, and the smoothness criterion uses the so-called intrinsic metric which can be canonically defined on the set of vertices of these graphs. In many cases known to the author, like the Pascal graph, the Young graph, the space of configurations, all ergodic central measures are smooth (in this case, we say that the graph is smooth). But even in these cases, the intrinsic metric is far from being obvious and does not coincide with the "natural" metric. We apply and generalize the theory of filtrations developed by the author during the last forty years to the case of tail filtrations and, in particular, introduce the notion of a standard filtration as a generalization to the case of semi-homogeneous filtrations of the notion of a standard homogeneous (dyadic) filtration in the sense of that theory. The crucial role is played by the new notion of intrinsic semi-metric on the set of vertices of a graph and the notion of regular paths, which allows us to refine the ergodic method for the case of smooth measures. In future, we will apply this new approach to the theory of invariant measures in combinatorics, ergodic theory, and the theory of C *-algebras.
2010
Using isometric embedding of metric trees into Banach spaces, this paper will investigate barycenters, type and cotype, and various measures of compactness of metric trees. A metric tree (T , d) is a metric space such that between any two of its points there is an unique arc that is isometric to an interval in R. We begin our investigation by examining isometric embeddings of metric trees into Banach spaces. We then investigate the possible images x0 = π((x1 + . . . + xn)/n), where π is a contractive retraction from the ambient Banach space X onto T (such a π always exists), in order to understand the "metric" barycenter of a family of points x1, . . . , xn in a tree T . Further, we consider the metric properties of trees (such as their type and cotype). We identify various measures of compactness of metric trees (their covering numbers, ǫ-entropy and Kolmogorov widths) and the connections between them. Additionally, we prove that the limit of the sequence of the Kolmogorov widths of a metric tree is equal to its ball measure of non-compactness.
A metric between quasi-isometric trees
2010
It is known that PQ-symmetric maps on the boundary characterize the quasi-isometry type of visual hyperbolic spaces, in particular, of geodesically complete \br-trees. We define a map on pairs of PQ-symmetric ultrametric spaces which characterizes the branching of the space. We also show that, when the ultrametric spaces are the corresponding end spaces, this map defines a metric between rooted
Forum Mathematicum, 2002
We define a number of natural (from geometric and combinatorial points of view) deformation spaces of valuations on finite graphs, and study functions over these deformation spaces. These functions include both direct metric invariants (girth, diameter), and spectral invariants (the determinant of the Laplace operator, or complexity; bottom non-zero eigenvalue of the Laplace operator). We show that almost all of these functions are, surprisingly, convex, and we characterize the valuations extremizing these invariant
Quasi-isometries between graphs and trees
Journal of Combinatorial Theory, Series B, 2008
Criteria for quasi-isometry between trees and general graphs as well as for quasi-isometries between metrically almost transitive graphs and trees are found. Thereby we use different concepts of thickness for graphs, ends and end spaces. A metrically almost transitive graph is quasi-isometric to a tree if and only if it has only thin metric ends (in the sense of Definition 3.6). If a graph is quasi-isometric to a tree then there is a one-to-one correspondence between the metric ends and those d-fibers which contain a quasi-geodesic. The graphs considered in this paper are not necessarily locally finite.
Potential Theory on Trees, Graphs and Ahlfors-regular Metric Spaces
Potential Analysis, 2013
We investigate connections between potential theories on a Ahlfors-regular metric space X, on a graph G associated with X, and on the tree T obtained by removing the "horizontal edges" in G. Applications to the calculation of set capacity are given.