Related papers: Plumbed 3-Manifolds and Neumann Moves

This work addresses the problem of computing measures of recognisable sets of infinite trees. An algorithm is provided to compute the probability measure of a tree language recognisable by a weak alternating automaton, or equivalently…

Finite metric trees are known to have strict 1-negative type. In this paper we introduce a new family of inequalities that quantify the extent of the "strictness" of the 1-negative type inequalities for finite metric trees. These…

The inverse problem of recovery of a potential on a quantum tree graph from Weyl's matrix given at a number of points is considered. A method for its numerical solution is proposed. The overall approach is based on the leaf peeling method…

A triple of finite von Neumann algebras $B\subseteq N\subseteq M$ is said to have the relative weak asymptotic homomorphism property if there exists a net of unitary operators $\{u_{\lambda}\}_{\lambda\in \Lambda}$ in $B$ such that…

In this article, we study sharp bounds for the Neumann eigenvalues of the Laplace operator on graphs. We first obtain monotonicity results for the Neumann eigenvalues on trees. In particular, we show that increasing any number of boundary…

The present article proposes a partitioned Dirichlet-Neumann algorithm, that allows to address unique challenges arising from a novel mixed-dimensional coupling of very slender fibers embedded in fluid flow using a regularized mortar-type…

In this talk, I will survey recent progress made on the classification of von Neumann algebras arising from countable groups and their actions on probability spaces. In particular, I will present the first results which provide classes of…

We consider a nonlinear parametric Neumann problem driven by the anisotropic $(p,q)$-Laplacian and a reaction which exhibits the combined effects of a singular term and of a parametric superlinear perturbation. We are looking for positive…

We compute the continuous bounded cohomology of the full automorphism groups of regular trees in all positive degrees, with coefficients arising from any irreducible continuous unitary representations. To the author's knowledge, this seems…

We study Neumann functions for divergence form, second order elliptic systems with bounded measurable coefficients in a bounded Lipschitz domain or a Lipschitz graph domain. We establish existence, uniqueness, and various estimates for the…

Let M be a closed, orientable, irreducible, non-simply connected 3-manifold. We prove that if M admits a sequence of Riemannian metrics whose sectional curvature is locally controlled and whose thick part becomes asymptotically hyperbolic…

Ruberman constructed families $\{g_n\vert n \in \mathbb{N}\} \subset \mathcal{R}^+ (M)$ of metrics of positive scalar curvature on certain $4$-manifolds which are concordant but lie in different path components of $\mathcal{R}^+ (M)$. We…

The Newton method is a powerful optimization algorithm, valued for its rapid local convergence and elegant geometric properties. However, its theoretical guarantees are usually limited to convex problems. In this work, we ask whether…

A positive function (conductivity) on the edges of a graph induces the Dirichlet-to- Neumann map between boundary values of harmonic functions. The inverse conductivity problem is to find the conductivity from the Dirichlet-to-Neumann map.…

Thevon Neumann entropy, named after John von Neumann, is an extension of the classical concept of entropy to the field of quantum mechanics. From a numerical perspective, von Neumann entropy can be computed simply by computing all…

We prove a finiteness theorem for the class of complete finite volume Riemannian manifolds with pinched negative sectional curvature, fixed fundamental group, and of dimension $>2$. One of the key ingredients is that the fundamental group…

Architecture optimization, which is a technique for finding an efficient neural network that meets certain requirements, generally reduces to a set of multiple-choice selection problems among alternative sub-structures or parameters. The…

Determinisation and completion of finite tree automata are important operations with applications in program analysis and verification. However, the complexity of the classical procedures for determinisation and completion is high. They are…

Orthogonally invariant functions of symmetric matrices often inherit properties from their diagonal restrictions: von Neumann's theorem on matrix norms is an early example. We discuss the example of "identifiability", a common property of…

Let M be a rational homology sphere plumbed 3-manifold associated with a connected negative definite plumbing graph. We show that its Seiberg-Witten invariants equal certain coefficients of an equivariant multivariable Ehrhart polynomial.…