English
Related papers

Related papers: Constructing Displacement Vectors

200 papers

We use probabilistic, topological and combinatorial methods to establish the following deviation inequality: For any normed space $X=(\mathbb R^n ,\|\cdot\| )$ there exists an invertible linear map $T:\mathbb R^n \to \mathbb R^n$ with \[…

Functional Analysis · Mathematics 2018-05-21 Grigoris Paouris , Petros Valettas

The static stress needed to depin a 2D edge dislocation, the lower dynamic stress needed to keep it moving, its velocity and displacement vector profile are calculated from first principles. We use a simplified discrete model whose far…

Materials Science · Physics 2009-11-10 A. Carpio , L. L. Bonilla

The main content of this treatise is a new concept in nonperturbative non-Lagrangian QFT which explains and extends the ad hoc constructions in low-dimensional models and incorporates them together with the higher dimensional theories into…

High Energy Physics - Theory · Physics 2009-09-25 B. Schroer

It is an open question whether fluctuations at the Planck scale in a non-perturbative theory of quantum gravity behave in such a way that the resulting semi-classical geometry can be modelled by a space that admits (approximate) Killing…

General Relativity and Quantum Cosmology · Physics 2021-07-07 Joren Brunekreef , Marcus Reitz

We give an alternative definition of relative hyperbolicity based on properties of closest-point projections on peripheral subgroups. We also derive a distance formula for relatively hyperbolic groups, similar to the one for mapping class…

Metric Geometry · Mathematics 2012-04-04 Alessandro Sisto

We construct a set of bounded vector fields dense in $L^p((0,2);W^{s,p}_{loc}(\mathbb{R}^2;\mathbb{R}^2))$ for $1\leq p <+\infty$ and $0\leq s<1$ with $p<1/s$ for which smooth regularisation of the vector field does not give a selection…

Analysis of PDEs · Mathematics 2025-07-08 Jules Pitcho

Under which conditions and with which distortions can we preserve the pairwise-distances of low-complexity vectors, e.g., for structured sets such as the set of sparse vectors or the one of low-rank matrices, when these are mapped in a…

Information Theory · Computer Science 2016-11-15 Laurent Jacques

We study long-time dynamics of a class of abstract second order in time evolution equations in a Hilbert space with the damping term depending both on displacement and velocity. This damping represents the nonlinear strong dissipation…

Dynamical Systems · Mathematics 2010-10-26 Igor Chueshov , Stanislav Kolbasin

Considered is the problem of local equivalence of generic four-dimensional metrics possessing two commuting and orthogonally transitive Killing vector fields. A sufficient set of eight differential invariants is explicitly constructed,…

Mathematical Physics · Physics 2024-03-21 M. Marvan , O. Stolin

The ability to measure similarity between documents enables intelligent summarization and analysis of large corpora. Past distances between documents suffer from either an inability to incorporate semantic similarities between words or from…

Machine Learning · Computer Science 2019-11-05 Mikhail Yurochkin , Sebastian Claici , Edward Chien , Farzaneh Mirzazadeh , Justin Solomon

An important result in discrepancy due to Banaszczyk states that for any set of $n$ vectors in $\mathbb{R}^m$ of $\ell_2$ norm at most $1$ and any convex body $K$ in $\mathbb{R}^m$ of Gaussian measure at least half, there exists a $\pm 1$…

Data Structures and Algorithms · Computer Science 2017-08-04 Nikhil Bansal , Daniel Dadush , Shashwat Garg , Shachar Lovett

We study discrepancy minimization for vectors in $\mathbb{R}^n$ under various settings. The main result is the analysis of a new simple random process in multiple dimensions through a comparison argument. As corollaries, we obtain bounds…

Data Structures and Algorithms · Computer Science 2020-08-07 Ryan Alweiss , Yang P. Liu , Mehtaab Sawhney

Let $X$ be a $d$-dimensional random vector and $X_\theta$ its projection onto the span of a set of orthonormal vectors $\{\theta_1,...,\theta_k\}$. Conditions on the distribution of $X$ are given such that if $\theta$ is chosen according to…

Probability · Mathematics 2011-02-16 Elizabeth Meckes

We show that starting with the fact that special relativity theory is concerned with a distortion of the observed length of a moving rod, without mentioning if it is a "contraction" or "dilation", we can derive the Lorentz transformations…

General Physics · Physics 2007-09-24 Bernhard Rothenstein , Stefan Popescu

We show that the displacement and translation distance of non-elementary random walks on isometry groups of hyperbolic spaces satisfy large deviation principles with the same rate function $I$. Roughly, this means that there exists function…

Probability · Mathematics 2020-08-20 Cagri Sert , Alessandro Sisto

We present a substantially more efficient variant, both in terms of running time and size of preprocessing advice, of the algorithm by Liu, Lyubashevsky, and Micciancio for solving CVPP (the preprocessing version of the Closest Vector…

Data Structures and Algorithms · Computer Science 2019-01-28 Daniel Dadush , Oded Regev , Noah Stephens-Davidowitz

Courses in introductory special and general relativity have increasingly become part of the curriculum for upper-level undergraduate physics majors and master's degree candidates. One of the topics rarely discussed is symmetry, particularly…

General Relativity and Quantum Cosmology · Physics 2009-11-11 Alex Harvey , Engelbert L. Schucking , Eugene J. Surowitz

We develop an asymptotic theory for $L^2$ norms of sample mean vectors of high-dimensional data. An invariance principle for the $L^2$ norms is derived under conditions that involve a delicate interplay between the dimension $p$, the sample…

Statistics Theory · Mathematics 2015-03-13 Mengyu Xu , Danna Zhang , Wei Biao Wu

By means of associated structural invariants, we efficiently construct four biplanes of order 9 - except the one with the smallest automorphism group, that is found by Janko and Trung. The notion of non-transversal vector is introduced…

Combinatorics · Mathematics 2016-06-28 Ivica Martinjak

For variable-length coding with an almost-sure distortion constraint, Zhang et al. show that for discrete sources the redundancy is upper bounded by $\log n/n$ and lower bounded (in most cases) by $\log n/(2n)$, ignoring lower order terms.…

Information Theory · Computer Science 2026-01-21 Sharang M. Sriramu , Aaron B. Wagner