Related papers: The convergence Newton polygon of a $p$-adic diffe…
We deal with locally free $\mathcal{O}_X$-modules with connection over a Berkovich curve $X$. As a main result we prove local and global decomposition theorems of such objects by the radii of convergence of their solutions. We also derive a…
We prove that the radii of convergence of the solutions of a $p$-adic differential equation $\mathcal{F}$ over an affinoid domain $X$ of the Berkovich affine line are continuous functions on $X$ that factorize through the retraction of…
In this paper and its sequel we consider locally-free $\mathscr{O}_X$-modules together with a connection over a quasi-smooth Berkovich curve $X$. We obtain necessary and sufficient conditions for the finite dimensionality of their de Rham…
We study the convergence of graphs consisting of finitely many internal rays for degenerating Newton maps. We state a sufficient condition to guarantee the convergence. As an application, we investigate the boundedness of hyperbolic…
The moduli space of rank $n$ graphs, the outer automorphism group of the free group of rank $n$ and Kontsevich's Lie graph complex have the same rational cohomology. We show that the associated Euler characteristic grows like…
We highlight a topological aspect of the graph limit theory. Graphons are limit objects for convergent sequences of dense graphs. We introduce the representation of a graphon on a unique metric space and we relate the dimension of this…
We study the variation of the convergence Newton polygon of a differential equation along a smooth Berkovich curve over a non-archimedean complete valued field of characteristic 0. Relying on work of the second author who investigated its…
As a natural sequel to the study of A-motivic cohomology initiated in "On the integral part of A-motivic cohomology", we develop a notion of regulator for rigid analytically trivial Anderson A-motives. In accordance with the conjectural…
We investigate the controllability of an infinite-dimensional quantum system: a quantum particle confined on a Thick Quantum Graph, a generalisation of Quantum Graphs whose edges are allowed to be manifolds of arbitrary dimension with…
A main theme of the paper is a conjecture of Bloch-Kato on the image of $p$-adic regulator maps for a proper smooth variety $X$ over an algebraic number field $k$. The conjecture for a regulator map of particular degree and weight is…
We discuss a link between graph theory and geometry that arises when considering graph dynamical systems with odd interactions. The equilibrium set in such systems is not a collection of isolated points, but rather a union of manifolds,…
We present a method to control gonality of nonarchimedean curves based on graph theory. Let k denote a complete nonarchimedean valued field. We first prove a lower bound for the gonality of a curve over the algebraic closure of k in terms…
In network analysis, a measure of node centrality provides a scale indicating how central a node is within a network. The coreness is a popular notion of centrality that accounts for the maximal smallest degree of a subgraph containing a…
In this technical note, we study the controllability of diffusively coupled networks from a graph theoretic perspective. We consider leader-follower networks, where the external control inputs are injected to only some of the agents, namely…
We find an upper bound for the asymptotic dimension of a hyperbolic metric space with a set of geodesics satisfying a certain boundedness condition studied by Bowditch. The primary example is a collection of tight geodesics on the curve…
The purpose of this article is to study Newton polygons of certain abelian $L$-functions on curves. Let $X$ be a smooth affine curve over a finite field $\mathbb{F}_q$ and let $\rho:\pi_1(X) \to \mathbb{C}_p^\times$ be a finite character of…
We present a new notion of limits of weighted directed graphs of growing size based on convergence of their random quotients. These limits are specified in terms of random exchangeable measures on the unit square. We call our limits…
We find new upper bounds on the size of a minimum totally dominating set for random regular graphs and for regular graphs with large girth. These bounds are obtained through the analysis of a local algorithm using a method due to Hoppen and…
Controlling real-world networked systems, including ecological, biomedical, and engineered networks that exhibit higher-order interactions, remains challenging due to inherent nonlinearities and large system scales. Despite extensive…
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…