Related papers: Boundary Measurement Matrices for Directed Network…
We study a generalized boundary rigidity problem, which investigates whether the areas of embedded minimal surfaces can uniquely determine a Riemannian manifold with boundary. We prove that for a conformal perturbation of an analytic metric…
Boundary conforming coordinates are commonly used in plasma physics to describe the geometry of toroidal domains, for example, in three-dimensional magnetohydrodynamic equilibrium solvers. The magnetohydrodynamic equilibrium configuration…
We give new characterizations for the class of uniformly dense matroids and study applications of these characterizations to graphic and real representable matroids. We show that a matroid is uniformly dense if and only if its base polytope…
We obtain a conceptually new differential geometric proof of P.F. Klembeck's result that the holomorphic sectional curvature of a strictly pseudoconvex domain approaches (in the boundary limit) the constant sectional curvature of the…
We introduce a new measure of complexity (called spectral complexity) for directed graphs. We start with splitting of the directed graph into its recurrent and non-recurrent parts. We define the spectral complexity metric in terms of the…
We study several intrinsic properties of the Carath\'eodory and Szeg\"o metrics on finitely connected planar domains. Among them are the existence of closed geodesics and geodesic spirals, boundary behaviour of Gaussian curvatures, and…
Root separation bounds play an important role as a complexity measure in understanding the behaviour of various algorithms in computational algebra, e.g., root isolation algorithms. A classic result in the univariate setting is the…
In this paper we give tight upper bounds on the total domination number, the weakly connected domination number and the connected domination number of a graph in terms of order and Euler characteristic. We also present upper bounds for the…
We show that an electric potential and magnetic field can be uniquely determined by partial boundary measurements of the Neumann-to-Dirichlet map of the associated magnetic Schr\"{o}dinger operator. This improves upon previous results of…
A graph is called a $k$-planar unit distance graph if it can be drawn in the plane such that every edge is a unit line segment and is involved in at most $k$ crossings. We investigate $u_k(n)$, the maximum number of edges of such graphs on…
A graph $G = (V, E)$ of bounded degree has an adjacency operator~$A$ which acts on the Hilbert space $\ell^2(V)$. There are different kinds of measures of interest on the spectrum $\Sigma (A)$ of $A$. In particular, each vector $\xi \in…
We propose the graph description of Teichm\"uller theory of surfaces with marked points on boundary components (bordered surfaces). Introducing new parameters, we formulate this theory in terms of hyperbolic geometry. We can then describe…
In this paper, we establish an iterative data-driven approach to derive guaranteed bounds on nonlinearity measures of unknown nonlinear systems. In this context, nonlinearity measures quantify the strength of the nonlinearity of a dynamical…
Postnikov's plabic graphs in a disk are used to parametrize totally positive Grassmannians. In recent years plabic graphs have found numerous applications in math and physics. One of the key features of the theory is the fact that if a…
In this paper, we examine roots of graph polynomials where those roots can be considered as structural graph measures. More precisely, we prove analytical results for the roots of certain modified graph polynomials and also discuss…
Magnetic graphs, originally developed to model quantum systems under magnetic fields, have recently emerged as a powerful framework for analyzing complex directed networks. Existing research has primarily used the spectral properties of the…
The quantum Cram\'er-Rao bound is a cornerstone of modern quantum metrology, as it provides the ultimate precision in parameter estimation. In the multiparameter scenario, this bound becomes a matrix inequality, which can be cast to a…
Consider the point line-geometry ${\mathcal P}_t(n,k)$ having as points all the $[n,k]$-linear codes having minimum dual distance at least $t+1$ and where two points $X$ and $Y$ are collinear whenever $X\cap Y$ is a $[n,k-1]$-linear code…
We present a new approach for matching regular surfaces in a Riemannian setting. We use a Sobolev type metric on deformation vector fields which form the tangent bundle to the space of surfaces. In this article we compare our approach with…
In this short note we outline a simple probabilistic proof of the Gauss-Bonnet formula for compact Riemannian manifolds with boundary, which adapts to this setting an argument due to Hsu \cite{Hs1,Hs2} in the closed case. The new technical…