Related papers: Dirichlet-Poincar\'{e} profiles of graphs and grou…

Let $G$ be a countable discrete group with an orthogonal representation $\alpha$ on a real Hilbert space $H$. We prove $L_p$ Poincar\'e inequalities for the group measure space $L_\infty(\Omega_H,\gamma)\rtimes G$, where both the group…

The Dirichlet problem and Dirichlet to Neumann map are analyzed for elliptic equations on a large collection of infinite quantum graphs. For a dense set of continuous functions on the graph boundary, the Dirichlet to Neumann map has values…

We use the concept of intrinsic metrics to give a new definition for an isoperimetric constant of a graph. We use this novel isoperimetric constant to prove a Cheeger-type estimate for the bottom of the spectrum which is nontrivial even if…

We classify pro-$p$ Poincar\'e duality pairs in dimension two. We then use this classification to build a pro-$p$ analogue of the curve complex and establish its basic properties. We conclude with some statements concerning separability…

To a closed Riemannian manifold, we associate a set of (special values of) a family of Dirichlet series, indexed by functions on the manifold. We study the meaning of equality of two such families of spectral Dirichlet series under pullback…

We give a short axiomatic introduction to Carnot groups and their subRiemannian and subFinsler geometry. We explain how such spaces can be metrically described as exactly those proper geodesic spaces that admit dilations and are…

In this paper we define a degree for ends of infinite digraphs. The well-definedness of our definition in particular resolves a problem by Zuther. Furthermore, we extend our notion of end degree to also respect, among others, the vertices…

We introduce shortcut graphs and groups. Shortcut graphs are graphs in which cycles cannot embed without metric distortion. Shortcut groups are groups which act properly and cocompactly on shortcut graphs. These notions unify a surprisingly…

We study the eigenvalues of the connection Laplacian on a graph with an orthogonal group or unitary group signature. We establish higher order Buser type inequalities, i.e., we provide upper bounds for eigenvalues in terms of Cheeger…

We build a bridge between geometric group theory and topological dynamical systems by establishing a dictionary between coarse equivalence and continuous orbit equivalence. As an application, we give conceptual explanations for previous…

In this thesis, we study connections between metric and combinatorial graphs from a Dirichlet space point of view.

Dirichlet-to-Neumann maps enable the coupling of multiphysics simulations across computational subdomains by ensuring continuity of state variables and fluxes at artificial interfaces. We present a novel method for learning…

Using the idea of the degree of a smooth mapping between two manifolds of the same dimension we present here the topological (homotopical) classification of the mappings between spheres of the same dimension, vector fields, monopole and…

For each graph and each positive integer $n$, we define a chain complex whose graded Euler characteristic is equal to an appropriate $n$-specialization of the dichromatic polynomial. This also gives a categorification of $n$-specializations…

We introduce a topological invariant, it a type of a graph-manifold, which takes natural values. For a 4-dimensional graph-manifold, whose type does not exceed two, it is proved that its universal cover is bi-Lipschitz equivalent to a…

In the framework of a strictly local regular Dirichlet space ${\bf X}$ we introduce the subspaces $PW_{\omega},\>\>\omega>0,$ of Paley-Wiener functions of bandwidth $\omega$. It is shown that every function in $PW_{\omega},\>\>\omega>0,$ is…

Type families on higher inductive types such as pushouts can capture homotopical properties of differential geometric constructions including connections, curvature, and vector fields. We define a class of pushouts based on simplicial…

An almost self-centered graph is a connected graph of order $n$ with exactly $n-2$ central vertices, and an almost peripheral graph is a connected graph of order $n$ with exactly $n-1$ peripheral vertices. We determine (1) the maximum girth…

We provide an introduction to Dirichlet forms on discrete spaces and study their global properties such as recurrence, stochastic completeness and regularity of the Neumann form. In this setting we compare the notion of a recurrent…

Initial steps in the study of inner expansion properties of infinite Cayley graphs and other infinite graphs, such as hyperbolic ones, are taken, in a flavor similar to the well-known Lipton-Tarjan square root separation result for planar…