Related papers: Determinants of Steiner Distance Hypermatrices

We study bracket words, which are a far-reaching generalisation of Sturmian words, along Hardy field sequences, which are a far-reaching generalisation of Piatetski--Shapiro sequences $\lfloor n^c \rfloor$. We show that thus obtained…

We show that any compact, connected set $K$ in the plane can be approximated by the critical points of a polynomial with two critical values. Equivalently, $K$ can be approximated in the Hausdorff metric by a true tree in the sense of…

The paper concerns the tree invariants of string links, introduced by Kravchenko and Polyak and closely related to the classical Milnor linking numbers also known as $\bar{\mu}$--invariants. We prove that, analogously as for…

We give upper and lower bounds on the determinant of a perturbation of the identity matrix or, more generally, a perturbation of a nonsingular diagonal matrix. The matrices considered are, in general, diagonally dominant. The lower bounds…

Cayley's first hyperdeterminant is a straightforward generalization of determinants for tensors. We prove that nonzero hyperdeterminants imply lower bounds on some types of tensor ranks. This result applies to the slice rank introduced by…

We prove a criterion for the geometric and algebraic finiteness properties of vertex stabilisers of $G$-CW-complexes, given the finiteness properties of the group $G$ and of the stabilisers of positive dimensional cells. This generalises a…

In this paper, we propose a gradient type term for the $k$-Hessian equation that extends for $k>1$ the classical quadratic gradient term associated with the Laplace equation. We prove that such as gradient term is invariant by the…

Let $\Gamma$ be a countable group acting on a geodesic Gromov-hyperbolic metric space $X$ and $\mu$ a probability measure on $\Gamma$ whose support generates a non-elementary subsemigroup. Under the assumption that $\mu$ has a finite…

We provide sharp estimates for the intrinsic distances of Finsler metrics with precise boundary estimates. These metrics include the Kobayashi-Hilbert metric near strongly convex points, the minimal metric near convex and strongly minimally…

Given a Galton-Watson process conditioned to have total progeny equal to $n$, we study the asymptotic probability that this conditioned Galton-Watson process has distance to the border bigger or equal than $k$, as the number of nodes $n…

Computing $\log\det(A)$ for large symmetric positive definite matrices arises in Gaussian process inference and Bayesian model comparison. Standard methods combine matrix-vector products with polynomial approximations. We study a different…

We present a version of the matrix-tree theorem, which relates the determinant of a matrix to sums of weights of arborescences of its directed graph representation. Our treatment allows for non-zero column sums in the parent matrix by…

We establish maximal trees and graphs for the difference of average distance and proximity proving thus the corresponding conjecture posed in [4]. We also establish maximal trees for the difference of average eccentricity and remoteness and…

We show that variants of the classical reflection functors from quiver representation theory exist in any abstract stable homotopy theory, making them available for example over arbitrary ground rings, for quasi-coherent modules on schemes,…

Given a finite typed rooted tree $T$ with $n$ vertices, the {\em empirical subtree measure} is the uniform measure on the $n$ typed subtrees of $T$ formed by taking all descendants of a single vertex. We prove a large deviation principle in…

We build on the formalism developed in [arXiv:1906.08372v1] to propose new representations of solutions to Stein equations. We provide new uniform and non uniform bounds on these solutions (a.k.a.\ Stein factors). We use these…

The $k$-cut number of rooted graphs was introduced by Cai et al. as a generalization of the classical cutting model by Meir and Moon. In this paper, we show that all moments of the k-cut number of conditioned Galton-Watson trees converges…

A binary tensor consists of $2^n$ entries arranged into hypercube format $2 \times 2 \times \cdots \times 2$. There are $n$ ways to flatten such a tensor into a matrix of size $2 \times 2^{n-1}$. For each flattening, $M$, we take the…

Varchenko introduced a distance function on chambers of hyperplane arrangements that he called quantum bilinear form. That gave rise to a determinant indexed by chambers whose entry in position $(C,D)$ is the distance between $C$ and $D$:…

We derive a Jacobi-Trudi type formula for Jack functions of rectangular shapes. In this formula, we make use of a hyperdeterminant, which is Cayley's simple generalization of the determinant. In addition, after developing the general theory…