相关论文: Edit distance in substitution systems
On a compact spin manifold we study the space of Riemannian metrics for which the Dirac operator is invertible. The first main result is a surgery theorem stating that such a metric can be extended over the trace of a surgery of codimension…
We seek an entropy estimator for discrete distributions with fully empirical accuracy bounds. As stated, this goal is infeasible without some prior assumptions on the distribution. We discover that a certain information moment assumption…
This paper reviews some results regarding symbolic dynamics, correspondence between languages of dynamical systems and combinatorics. Sturmian sequences provide a pattern for investigation of one-dimensional systems, in particular interval…
Motivated by applications in the theory of numeration systems and recognizable sets of integers, this paper deals with morphic words when erasing morphisms are taken into account. Cobham showed that if an infinite word $w =g(f^\omega(a))$…
Many variants of Optimal Transport (OT) have been developed to address its heavy computation. Among them, notably, Sliced Wasserstein (SW) is widely used for application domains by projecting the OT problem onto one-dimensional lines, and…
We study variational principles for metric mean dimension. First we prove that in the variational principle of Lindenstrauss and Tsukamoto it suffices to take supremum over ergodic measures. Second we derive a variational principle for…
On the string of finite length, a (genomic) transposition is defined as the operation of exchanging two consecutive substrings. The minimum number of transpositions needed to transform one into the other is the transposition distance, that…
The approximate period recovery problem asks to compute all $\textit{approximate word-periods}$ of a given word $S$ of length $n$: all primitive words $P$ ($|P|=p$) which have a periodic extension at edit distance smaller than $\tau_p$ from…
The orbital diameter of a primitive permutation group is the maximal diameter of its orbital graphs. There has been a lot of interest in bounds for the orbital diameter. In this paper we provide explicit bounds on the diameters of groups of…
The length $a(n)$ of the longest common subsequence of the $n$'th Thue-Morse word and its bitwise complement is studied. An open problem suggested by Jean Berstel in 2006 is to find a formula for $a(n)$. In this paper we prove new lower…
A graph is diameter-$k$-critical if its diameter equals $k$ and the deletion of any edge increases its diameter. The Murty-Simon Conjecture states that for any diameter-2-critical graph $G$ of order $n$, $e(G) \leq \lfloor…
The normalized edit distance is one of the distances derived from the edit distance. It is useful in some applications because it takes into account the lengths of the two strings compared. The normalized edit distance is not defined in…
The metric dimension of a graph is the minimum size of a set of vertices such that each vertex is uniquely determined by the distances to the vertices of that set. Our aim is to upper-bound the order $n$ of a graph in terms of its diameter…
The {\em edit distance} between two ordered trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations consisting of deleting and relabeling existing nodes, as well as…
We explore constraints on (1+1)$d$ unitary conformal field theory with an internal $\mathbb{Z}_N$ global symmetry, by bounding the lightest symmetry-preserving scalar primary operator using the modular bootstrap. Among the other constraints…
Comparative analysis of scalar fields in scientific visualization often involves distance functions on topological abstractions. This paper focuses on the merge tree abstraction (representing the nesting of sub- or superlevel sets) and…
We introduce a pregeometry that provides a metric and dimensionality over a Borel set (Wheeler's "bucket of dust") without assuming probability amplitudes for adjacency. Rather, a non-trivial metric is produced over a Borel set X per a…
Minimum distance estimation (MDE) gained recent attention as a formulation of (implicit) generative modeling. It considers minimizing, over model parameters, a statistical distance between the empirical data distribution and the model. This…
An L-system (for lossless compression) is a CPD0L-system extended with two parameters $d$ and $n$, which determines unambiguously a string $w = \tau(\varphi^d(s))[1:n]$, where $\varphi$ is the morphism of the system, $s$ is its axiom, and…
We survey the emerging area of compression-based, parameter-free, similarity distance measures useful in data-mining, pattern recognition, learning and automatic semantics extraction. Given a family of distances on a set of objects, a…