相关论文: Plumbed 3-Manifolds and Neumann Moves

The lattice cohomology of a plumbed 3--manifold $M$ associated with a connected negative definite plumbing graph is an important tool in the study of topological properties of $M$, and in the comparison of the topological properties with…

We investigate criteria for von-Neumann finiteness and reversibility in some classes of non-associative algebras. We show that all finite-dimensional alternative algebras, as well as all algebras obtained from the real numbers via the…

Recombining trinomial trees are a workhorse for modeling discrete-event systems in option pricing, logistics, and feedback control. Because each node stores a state-dependent quantity, a depth-$D$ tree naively yields $\mathcal{O}(3^{D})$…

Riemannian submanifold optimization with momentum is computationally challenging because, to ensure that the iterates remain on the submanifold, we often need to solve difficult differential equations. Here, we simplify such difficulties…

We consider a connected negative definite plumbing graph, and we assume that the associated plumbed 3-manifold is a rational homology sphere. We provide two new combinatorial formulae for the Seiberg-Witten invariant of this manifold. The…

We derive a cut-and-paste surgery formula of Seiberg--Witten invariants for negative definite plumbed rational homology 3-spheres. It is similar to (and motivated by) Okuma's recursion formula [arXiv:math.AG/0610464, 4.5] targeting analytic…

One of the main questions in the theory of normal surface singularities is to understand the relations between their geometry and topology. The lattice cohomology is an important tool in the study of topological properties of a plumbed…

We introduce a two-variable refinement $\hat{Z}_a(q,t)$ of plumbed 3-manifold invariants $\hat{Z}_a(q)$, which were previously defined for weakly negative definite plumbed 3-manifolds. We also provide a number of explicit examples in which…

We show that an algorithmic construction of sequences of recursive trees leads to a direct proof of the convergence of random recursive trees in an associated Doob-Martin compactification; it also gives a representation of the limit in…

We study formal series which are invariants of plumbed 3-manifolds twisted by root lattices. These series extend the BPS $q$-series $\widehat{Z}(q)$ recently defined in Gukov-Pei-Putrov-Vafa, Gukov-Manolescu, Park, and further refined in…

Non-negative matrix factorization (NMF) is a fundamental matrix decomposition technique that is used primarily for dimensionality reduction and is increasing in popularity in the biological domain. Although finding a unique NMF is generally…

We develop a linearized boundary control method for the inverse boundary value problem of determining the damping coefficient in the damped wave equation. The objective is to reconstruct an unknown perturbation in a known background damping…

A hermitian matrix can be parametrized by a set consisting of its determinant and the eigenvalues of its submatrices. We established a group of equations which connect these variables with the mixing parameters of diagonalization. These…

In this paper we explore avenues for improving the reliability of dimensionality reduction methods such as Non-Negative Matrix Factorization (NMF) as interpretive exploratory data analysis tools. We first explore the difficulties of the…

We characterize real and complex functions which, when applied entrywise to square matrices, yield a positive definite matrix if and only if the original matrix is positive definite. We refer to these transformations as sign preservers.…

Assume $\Gamma$ is a negative-definite forest with exactly one unframed vertex, and $M(\Gamma)$ is the resulting plumbed 3-manifold with a knot embedded. We show that the filtered lattice chain homotopy type of $\Gamma$ is an invariant of…

We introduce the von Neumann entropy regularization of Unbalanced Non-commutative Optimal Transport, specifically Non-commutative Optimal Transport between semi-definite positive matrices (not necessarily with trace one). We prove the…

We propose a new arithmetic for non-empty rooted unordered trees simply called trees. After discussing tree representation and enumeration, we define the operations of tree addition, multiplication and stretch, prove their properties, and…

We divide the class of infinite computable trees into three types. For the first and second types, $0'$ computes a nontrivial self-embedding while for the third type $0''$ computes a nontrivial self-embedding. These results are optimal and…

We study the inverse problem of recovering a tree graph together with the weights on its edges (equivalently a metric tree) from the knowledge of the Dirichlet-to-Neumann matrix associated with the Laplacian. We prove an explicit formula…