Related papers: Chain Rules for Linear Openness in Metric Spaces. …
We obtain a new version of the Uncertainty Principle for functions with Fourier transforms supported on a lacunary set of intervals. This is a generalization of Zygmund's theorem on lacunary trigonometric series to the real line in the…
A rigidity theory is developed for frameworks in a metric space with two types of distance constraints. Mixed sparsity graph characterisations are obtained for the infinitesimal and continuous rigidity of completely regular bar-joint…
The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.
We generalize, improve and unify theorems of Rumin, and Maassen--Uffink about classical entropies associated to quantum density matrices. These theorems refer to the classical entropies of the diagonals of a density matrix in two different…
Lie's linearizability criteria for scalar second-order ordinary differential equations had been extended to systems of second-order ordinary differential equations by using geometric methods. These methods not only yield the linearizing…
We study strong universal Bayes-consistency in the realizable setting for learning with general metric losses, extending classical characterizations beyond $0$-$1$ classification (Bousquet et al., 2020; Hanneke et al., 2021) and real-valued…
The purpose of this paper is finding the essential attributes underlying the convexity theorems for momentum maps. It is shown that they are of topological nature; more specifically, we show that convexity follows if the map is open onto…
We give new lower bounds for the (higher) topological complexity of a space, in terms of the Lusternik-Schnirelmann category of a certain auxiliary space. We also give new lower bounds for the rational topological complexity of a space, and…
This paper is devoted to investigating the sequence of some linear functionals in the space $BV$ of finite variation functions. We prove that under certain conditions this sequence is bounded. We also prove that this result is sharp. In…
Matrix norms can be used to measure the "distance" between two matrices which translates naturally to the problem of calculating the unitary deviation of the neutrino mixing matrices. Variety of matrix norms opens a possibility to measure…
Any symmetric affinity function $w: V\times V \to \mathbb{R}_+$ defined on a discrete set $V$ induces Euclidean space structure on $V$. In particular, an undirected graph specified by an affinity (or adjacency) matrix can be considered as a…
We provide new upper bounds for mixing times of general finite Markov chains. We use these bounds to show that the total variation mixing time is robust under rough isometry for bounded degree graphs that are roughly isometric to trees.
The asymptotic variance is an important criterion to evaluate the performance of Markov chains, especially for the central limit theorems. We give the variational formulas for the asymptotic variance of discrete-time (non-reversible) Markov…
We analyze uncertainty relations on finite dimensional Hilbert spaces expressed in terms of classical fidelity, which are stronger then metric uncertainty relations introduced by Fawzi, Hayden and Sen. We establish validity of fidelity…
An important application of distance geometry to biochemistry studies the embeddings of the vertices of a weighted graph in the three-dimensional Euclidean space such that the edge weights are equal to the Euclidean distances between…
The paper deals with moduli of continuity for paths of random processes indexed by a general metric space $\Theta$ with values in a general metric space $\mathcal{X}$. Adapting the moment condition on the increments from the classical…
We study a general class of recurrence relations that appear in the application of a matrix diagonalization procedure. We find general closed formula and determine analytical properties of the solutions. We finally apply these findings in…
Bidimensionality is the most common technique to design subexponential-time parameterized algorithms on special classes of graphs, particularly planar graphs. The core engine behind it is a combinatorial lemma of Robertson, Seymour and…
In this paper we develop the metric theory for the outer space of a free product of groups. This generalizes the theory of the outer space of a free group, and includes its relative versions. The outer space of a free product is made of…
We formulate the Exact Renormalization Group on the string world sheet for closed string backgrounds. The same techniques that were used for open strings is used here. There are some subtleties. One is that holomorphic factorization of the…