English
Related papers

Related papers: On the best constants associated with $n$-distance…

200 papers

In this paper we propose and study a new structural invariant for graphs, called distance-unbalanced\-ness, as a measure of how much a graph is (un)balanced in terms of distances. Explicit formulas are presented for several classes of…

Combinatorics · Mathematics 2020-11-04 Štefko Miklavič , Primož Šparl

An inequality, recently proposed by Franson [Phys. Rev. A 54, 3808 (1996)] is analyzed and improved. The inequality connects the change of the expectation value of an observable with the uncertainty of this observable. A strict bound on the…

Quantum Physics · Physics 2009-10-30 Lev Vaidman , Ori Belkind

We study some Hardy-type inequalities involving a general norm in $R^n$ and an anisotropic distance function to the boundary. The case of the optimality of the constants is also addressed.

Analysis of PDEs · Mathematics 2015-12-18 Francesco Della Pietra , Giuseppina di Blasio , Nunzia Gavitone

Wasserstein distances are metrics on probability distributions inspired by the problem of optimal mass transportation. Roughly speaking, they measure the minimal effort required to reconfigure the probability mass of one distribution in…

Methodology · Statistics 2019-04-10 Victor M. Panaretos , Yoav Zemel

A dynamical theory is studied in which a scalar field $\phi$ in Einstein- Minkowski space is coupled to the four-velocity $N_{\mu}$ of a preferred inertial observer in that space. As a consistent requirement on this coupling we study a…

High Energy Physics - Theory · Physics 2009-10-30 Hadi Salehi

We study the regularity of the distance function to the boundary of a domain in $\mathbb{R}^n$, with respect to the Minkowski functional of a convex polytope. We obtain the regularity of the distance function in certain cases. We also…

Metric Geometry · Mathematics 2025-12-15 Mohammad Safdari

In previous work the authors defined the k-th order simplicial distance between probability distributions which arises naturally from a measure of dispersion based on the squared volume of random simplices of dimension k. This theory is…

Statistics Theory · Mathematics 2018-09-06 Luc Pronzato , Henry Wynn , Anatoly Zhigljavsky

Optimal transportation distances are valuable for comparing and analyzing probability distributions, but larger-scale computational techniques for the theoretically favorable quadratic case are limited to smooth domains or regularized…

Other Computer Science · Computer Science 2016-03-23 Justin Solomon , Raif Rustamov , Leonidas Guibas , Adrian Butscher

A time series is a sequence of data items; typical examples are videos, stock ticker data, or streams of temperature measurements. Quite some research has been devoted to comparing and indexing simple time series, i.e., time series where…

Computational Complexity · Computer Science 2018-06-04 Jörg P. Bachmann , Johann-Christoph Freytag , Benjamin Hauskeller , Nicole Schweikardt

We consider fundamental physical constants which are among a few of the most important pieces of information we have learned about Nature after its intensive centuries-long studies. We discuss their multifunctional role in modern physics…

Atomic Physics · Physics 2014-11-18 Savely G. Karshenboim

In this paper we provide explicit upper and lower bounds on certain $L^2$ $n$-widths, i.e., best constants in $L^2$ approximation. We further describe a numerical method to compute these $n$-widths approximately, and prove that this method…

Numerical Analysis · Mathematics 2020-09-28 Andrea Bressan , Michael S. Floater , Espen Sande

We present here a note which synthesizes our previous ideas concerning some problems in cosmology, and the numerical correspondences between the physical constants that we could deduce.

General Physics · Physics 2008-02-06 Christophe Real

We develop a new approach to address some classical questions concerning the size and structure of integer distance sets. Our main result is that any integer distance set in the Euclidean plane is either very sparse or has all but an…

Number Theory · Mathematics 2025-08-26 Rachel Greenfeld , Marina Iliopoulou , Sarah Peluse

The quantum relative entropy is frequently used as a distance, or distinguishability measure between two quantum states. In this paper we study the relation between this measure and a number of other measures used for that purpose,…

Quantum Physics · Physics 2009-11-11 K. M. R. Audenaert , J. Eisert

We use Vaschy-Buckhingham Theorem as a systematic tool to build univocal n-dimensional extensions of the electric and gravitational fine structure constants and show that their ratio is dimensionally invariant. The results allow us to…

General Physics · Physics 2009-09-29 Fabricio Casarejos , Jaime F. Villas da Rocha , Roberto Moreira Xavier

The primary distance indicators are established in our Galaxy and the Local Group. There are at least four different methods which give good distances: methods using proper motions, RR Lyraes, Cepheid variables, and Type II supernovae.…

Astrophysics · Physics 2009-10-28 Dragan Huterer , Dimitar D. Sasselov , Paul L. Schechter

The distance covariance of Sz\'ekely, et al. [23] and Sz\'ekely and Rizzo [21], a powerful measure of dependence between sets of multivariate random variables, has the crucial feature that it equals zero if and only if the sets are mutually…

Statistics Theory · Mathematics 2022-06-22 Dominic Edelmann , Tobias Terzer , Donald Richards

We investigate some possible relations between physical observables and estimate the "cosmic variance" which affects these measurements. We focus on redshift and angular-distance and we discuss the difference in considering the redshift as…

Cosmology and Nongalactic Astrophysics · Physics 2018-06-26 Giuseppe Fanizza

The paper introduces a class of distances for linear behaviors over finite time horizons. These distances allow for comparisons between finite-horizon linear behaviors represented by matrices of possibly different dimensions. They remain…

Optimization and Control · Mathematics 2025-06-03 Alberto Padoan , Jeremy Coulson

Let $S$ be a set of $n$ points in $d$-dimensional Euclidean space. Assign to each $x\in S$ an arbitrary distance $r(x)>0$. Let $e_r(x,S)$ denote the number of points in $S$ at distance $r(x)$ from $x$. Avis, Erd\"os and Pach (1988)…

Combinatorics · Mathematics 2015-02-02 Konrad J. Swanepoel