相关论文: The Smith normal form of distance matrices of high…

Given two $\left( n+1\right) \times\left( n+1\right)$-matrices $A$ and $B$ over a commutative ring, and some $k\in\left\{ 0,1,\ldots,n\right\}$, we consider the $\dbinom{n}{k}\times\dbinom{n}{k}$-matrix $W$ whose entries are $\left(…

Two cycles are referred as disjoint if they have no common edges. In this paper, we will investigate the determinant of the distance matrix of a graph, giving a formula for the determinant of the distance matrix of a bicyclic graph whose…

It is an open question whether there exists a polynomial-time algorithm for computing the rotation distances between pairs of extended ordered binary trees. The problem of computing the rotation distance between an arbitrary pair of trees,…

Consider two simple graphs, G1 and G2, with their respective vertex sets V(G1) and V(G2). The Kronecker product forms a new graph with a vertex set V(G1) X V(G2). In this new graph, two vertices, (x, y) and (u, v), are adjacent if and only…

To overcome computational challenges of Optimal Transport (OT), several variants of Sliced Wasserstein (SW) has been developed in the literature. These approaches exploit the closed-form expression of the univariate OT by projecting…

New bounds for the $k$-th order derivatives of the solutions of the normal and multivariate normal Stein equations are obtained. Our general order bounds involve fewer derivatives of the test function than those in the existing literature.…

Define $$D_n(x)=\sum_{k=0}^n\binom nk^2x^k(x+1)^{n-k}\ \ \ \mbox{for}\ n=0,1,2,\ldots$$ and $$s_n(x)=\sum_{k=1}^n\frac1n\binom nk\binom n{k-1}x^{k-1}(x+1)^{n-k}\ \ \ \mbox{for}\ n=1,2,3,\ldots.$$ Then $D_n(1)$ is the $n$-th central Delannoy…

We show that a one-dimensional differential equation depending on a parameter $\mu$ with a saddle-node bifurcation at $\mu =0$ can be modelled by an extended normal form $\dot y = \nu (\mu )-y^2+a(\mu )y^3$, where the functions $\nu$ and…

Liu, Hong, Gu, and Lai proved if the second largest eigenvalue of the adjacency matrix of graph $G$ with minimum degree $\delta \ge 2m+2 \ge 4$ satisfies $\lambda_2(G) < \delta - \frac{2m+1}{\delta+1}$, then $G$ contains at least $m+1$…

A new class of distances for graph vertices is proposed. This class contains parametric families of distances which reduce to the shortest-path, weighted shortest-path, and the resistance distances at the limiting values of the family…

We introduce a family of probabilistic {\it scale-invariant} Leibniz-like pyramids and $(d+1)$-dimensional hyperpyramids ($d=1,2,3,...$), characterized by a parameter $\nu>0$, whose value determines the degree of correlation between $N$…

We present the Hamiltonian formalism for $f(T)$ gravity, and prove that the theory has $\frac{n(n-3)}{2}+1$ degrees of freedom (d.o.f.) in $n$ dimensions. We start from a scalar-tensor action for the theory, which represents a scalar field…

Let $D(G)$ be the distance matrix of a simple connected graph $G$. The Hadamard product $D(G)~\circ~ D(G)$ is called the squared distance matrix of $G$, and is denoted by $\Delta(G)$. A simple connected graph is called a starlike block…

Optimal transport (\OT) theory defines a powerful set of tools to compare probability distributions. \OT~suffers however from a few drawbacks, computational and statistical, which have encouraged the proposal of several regularized variants…

By establishing a local version of Bismut formula for Dirichlet semigroups on a regular domain, gradient estimates are derived for killed SDEs with singular drifts. As an application, the total variation distance between two solutions of…

This paper surveys some combinatorial aspects of Smith normal form, and more generally, diagonal form. The discussion includes general algebraic properties and interpretations of Smith normal form, critical groups of graphs, and Smith…

We show variants of spectral sparsification routines can preserve the total spanning tree counts of graphs, which by Kirchhoff's matrix-tree theorem, is equivalent to determinant of a graph Laplacian minor, or equivalently, of any SDDM…

The disjoint paths problem asks, given an graph G and k + 1 pairs of terminals (s_0,t_0), ...,(s_k,t_k), whether there are k+1 pairwise disjoint paths P_0, ...,P_k, such that P_i connects s_i to t_i. Robertson and Seymour have proven that…

The celebrated Steiner tree problem is the problem of finding a set $St$ of minimum one-dimensional Hausdorff measure $H$ (length) such that $St \cup \mathcal{A}$ is connected, where $\mathcal{A} \subset \mathbb{R}^d$ is a given compact…

We study the problem of distinguishing between two symmetric probability distributions over $n$ bits by observing $k$ bits of a sample, subject to the constraint that all $k-1$-wise marginal distributions of the two distributions are…