相关论文: A note on linear approximately orthogonality prese…
This paper presents a novel approach to address the constrained coding challenge of generating almost-balanced sequences. While strictly balanced sequences have been well studied in the past, the problem of designing efficient algorithms…
For any constant $d$ and parameter $\varepsilon > 0$, we show the existence of (roughly) $1/\varepsilon^d$ orderings on the unit cube $[0,1)^d$, such that any two points $p,q\in [0,1)^d$ that are close together under the Euclidean metric…
We establish a version of von Staudt's theorem on mappings which preserve harmonic quadruples for projective lines over (not necessarily commutative) rings with "sufficiently many" units, in particular 2 has to be a unit.
The metric sketching problem is defined as follows. Given a metric on $n$ points, and $\epsilon>0$, we wish to produce a small size data structure (sketch) that, given any pair of point indices, recovers the distance between the points up…
The problem of homological stability helps us to catch the structure of group homology. We calculate homological stability of special orthogonal groups, and we also calculate the stability of orthogonal groups with determinant-twisted…
Known algorithms for manipulating octagons do not preserve their sparsity, leading typically to quadratic or cubic time and space complexities even if no relation among variables is known when they are all bounded. In this paper, we present…
An $\varepsilon$-coreset for Least-Mean-Squares (LMS) of a matrix $A\in{\mathbb{R}}^{n\times d}$ is a small weighted subset of its rows that approximates the sum of squared distances from its rows to every affine $k$-dimensional subspace of…
We show that any $N$-dimensional linear subspace of $L^2(\mathbb{T})$ admits an orthonormal system such that the $L^2$ norm of the square variation operator $V^2$ is as small as possible. When applied to the span of the trigonometric…
Let $T_n$ be the linear Hadamard convolution operator acting over Hardy space $H^q$, $1\le q\le\infty$. We call $T_n$ a best approximation-preserving operator (BAP operator) if $T_n(e_n)=e_n$, where $e_n(z):=z^n,$ and if $\|T_n(f)\|_q\le…
In this article, we extend an argument of Vogtmann in order to show homology stability of the Euclidean orthogonal group $O_n(A)$ when $A$ is a valuation ring subject to arithmetic conditions on either its residue or its quotient field. In…
Persistent homology is a tool that can be employed to summarize the shape of data by quantifying homological features. When the data is an object in $\mathbb{R}^d$, the (augmented) persistent homology transform ((A)PHT) is a family of…
In this note we investigate the existence of flat orthogonal matrices, i.e. real orthogonal matrices with all entries having absolute value close to $\frac{1}{\sqrt{n}}$. Entries of $\pm \frac{1}{\sqrt{n}}$ correspond to Hadamard matrices,…
In this paper, we take a step towards developing efficient hard thresholding methods for low-rank tensor recovery from memory-efficient linear measurements with tensorial structure. Theoretical guarantees for many standard iterative…
Consider a sliding camera that travels back and forth along an orthogonal line segment $s$ inside an orthogonal polygon $P$ with $n$ vertices. The camera can see a point $p$ inside $P$ if and only if there exists a line segment containing…
We introduce a minimization formulation for the determination of a finite-dimensional, time-dependent, orthonormal basis that captures directions of the phase space associated with transient instabilities. While these instabilities have…
A method for moving least squares interpolation and differentiation is presented in the framework of orthogonal polynomials on discrete points. This yields a robust and efficient method which can avoid singularities and breakdowns in the…
A hidden guard set $ G $ is a set of point guards in polygon $ P $ that all points of the polygon are visible from some guards in $ G $ under the constraint that no two guards may see each other. In this paper, we consider the problem for…
Mathematical morphology is a theory concerned with non-linear operators for image processing and analysis. The underlying framework for mathematical morphology is a partially ordered set with well-defined supremum and infimum operations.…
We show that a partition of the unity (or POVM) on a Hilbert space that is almost orthogonal is close to an orthogonal POVM in the same von Neumann algebra. This generalizes to infinite dimension previous results in matrix algebras by…
A structure preserving proper orthogonal decomposition reduce-order modeling approach has been developed in [Gong et al. 2017] for the Hamiltonian system, which uses the traditional framework of Galerkin projection-based model reduction but…