Related papers: Computing the Distance between Piecewise-Linear Bi…
We give in this short paper a sharp estimate for the norm of a multivariate dilation operator generated by multi-matrix (tensor) linear argument transformation (dilation operator) between two different weight Lebesgue-Riesz and Grand…
Let $P$ be a convex polygon in the plane, and let $T$ be a triangulation of $P$. An edge $e$ in $T$ is called a diagonal if it is shared by two triangles in $T$. A flip of a diagonal $e$ is the operation of removing $e$ and adding the…
Tree comparison metrics have proven to be an invaluable aide in the reconstruction and analysis of phylogenetic (evolutionary) trees. The path-length distance between trees is a particularly attractive measure as it reflects differences in…
We study the problem of computing the diameter and the mean distance of a continuous graph, i.e., a connected graph where all points along the edges, instead of only the vertices, must be taken into account. It is known that for continuous…
We derive the exact generating function for planar maps (genus zero fatgraphs) with vertices of arbitrary even valence and with two marked points at a fixed geodesic distance. This is done in a purely combinatorial way based on a bijection…
In this paper we consider the problem of measuring stationarity in locally stationary long-memory processes. We introduce an $L_2$-distance between the spectral density of the locally stationary process and its best approximation under the…
Let $\G$ denote a bipartite distance-regular graph with vertex set $X$ and diameter $D \ge 3$. Fix $x \in X$ and let $L$ (resp. $R$) denote the corresponding lowering (resp. raising) matrix. We show that each $Q$-polynomial structure for…
By the continuous mapping theorem, if a sequence of $d$-dimensional random vectors $(\mathbf{W}_n)_{n\geq1}$ converges in distribution to a multivariate normal random variable $\Sigma^{1/2}\mathbf{Z}$, then the sequence of random variables…
We deal with a problem of the reconstruction of any holomorphic function $f$ on the unit ball of $\mathbb{C}^2$ from its restricions on a union of complex lines. We give an explicit formula of Lagrange interpolation's type that is…
Labelled Markov chains (LMCs) are widely used in probabilistic verification, speech recognition, computational biology, and many other fields. Checking two LMCs for equivalence is a classical problem subject to extensive studies, while the…
We associate to each Boolean function a polynomial whose evaluations represents the distances from all possible Boolean affine functions. Both determining the coefficients of this polynomial from the truth table of the Boolean function and…
This paper presents a general study of one-dimensional differentiability for functionals defined on convex domains that are not necessarily open. The local approximation is carried out using affine functionals, as opposed to linear…
In 2006 Carbery raised a question about an improvement on the na\"ive norm inequality $\|f+g\|_p^p \leq 2^{p-1}(\|f\|_p^p + \|g\|_p^p)$ for two functions in $L^p$ of any measure space. When $f=g$ this is an equality, but when the supports…
Given two triangulations of a convex polygon, computing the minimum number of flips required to transform one to the other is a long-standing open problem. It is not known whether the problem is in P or NP-complete. We prove that two…
We analyze the space of bivariate functions that are piecewise polynomial of bi-degree \textless{}= (m, m') and of smoothness r along the interior edges of a planar T-mesh. We give new combinatorial lower and upper bounds for the dimension…
We study logarithmically averaged binary correlations of bounded multiplicative functions $g_1$ and $g_2$. A breakthrough on these correlations was made by Tao, who showed that the correlation average is negligibly small whenever $g_1$ or…
Finding an exact maximum distance of two points in the given set is a fundamental computational problem which is solved in many applications. This paper presents a fast, simple to implement and robust algorithm for finding this maximum…
A polynomial f (multivariate over a field) is decomposable if f = g(h) with g univariate of degree at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and an approximation to their number…
An important problem in geometric computing is defining and computing similarity between two geometric shapes, e.g. point sets, curves and surfaces, etc. Important geometric and topological information of many shapes can be captured by…
Computing the distance function to some surface or line is a problem that occurs very frequently. There are several ways of computing a relevant approximation of this function, using for example technique originating from the approximation…