Related papers: Erratum : Linear projections and successive minima

Fix a point in a finite-dimensional complex vector space and consider the sequence of iterates of this point under the composition of a unitary map with the orthogonal projection on the hyperplane orthogonal to the starting point. We prove…

Reference frame optimization is a generic framework to calculate a spatially-varying observer field that views an unsteady fluid flow in a reference frame that is as-steady-as-possible. In this paper, we show that the optimized vector field…

This article focuses on numerical efficiency of projection algorithms for solving linear optimization problems. The theoretical foundation for this approach is provided by the basic result that bounded finite dimensional linear optimization…

The proximal gradient algorithm for minimizing the sum of a smooth and a nonsmooth convex function often converges linearly even without strong convexity. One common reason is that a multiple of the step length at each iteration may…

In recent years there has been much interest -and progress- in understanding projections of many concrete fractals sets and measures. The general goal is to be able to go beyond general results such as Marstrand's Theorem, and quantify the…

Let $L$ be a slim, planar, semimodular lattice (slim means that it does not contain ${\mathsf M}_3$-sublattices). We call the interval $I = [o, i]$ of $L$ \emph{rectangular}, if there are $u_l, u_r \in [o, i] - \{o,i\}$ such that $o = u_l…

The first part of this note contains a review of basic properties of the variety of lines contained in an embedded projective variety and passing through a general point. In particular we provide a detailed proof that for varieties defined…

We give upper bounds on the minimal degree of a model in $\mathbb{P}^2$ and the minimal bidegree of a model in $\mathbb{P}^1 \times \mathbb{P}^1$ of the curve defined by a given Laurent polynomial, in terms of the combinatorics of the…

We prove a higher-rank analogue of a well-known result of W. M. Schmidt concerning almost everywhere pointwise discrepancy bounds for lattices in Euclidean space (see Theorem 1 [Trans. Amer. Math. Soc. 95 (1960), 516-529]). We also…

After mentioning some of the difficulties arising in lattice gauge theory from chiral symmetry, I discuss one of the recent attempts to resolve these issues using fermionic surface states in an extra space-time dimension. This picture can…

We explain why naive discretization results that have appeared in [hep-lat/0006013] do not appear to yield the desired continuum limit. The fermion propagator on the lattice inevitably yields a diagram with nonvanishing UV degree D=0…

The purpose of this erratum is to correct the proof of Theorem A.0.1 in the appendix to our article ``Hadamard spaces with isolated flats'' math.GR/0411232, which was jointly authored by Mohamad Hindawi, Hruska and Kleiner. In that…

This paper studies the inference about linear functionals of high-dimensional low-rank matrices. While most existing inference methods would require consistent estimation of the true rank, our procedure is robust to rank misspecification,…

Many classical results in algebraic geometry arise from investigating some extremal behaviors that appear among projective varieties not lying on any hypersurface of fixed degree. We study two numerical invariants attached to such…

By using the metric projection onto a closed self-dual cone of the Euclidean space, M. S. Gowda, R. Sznajder and J. Tao have defined generalized lattice operations, which in the particular case of the nonnegative orthant of a Cartesian…

We obtain lower bound for the maximum distance between any three distinct points in an affine lattice which are close to a helix with small curvature and torsion.

We study some methods of subgradient projections for solving a convex feasibility problem with general (not necessarily hyperplanes or half-spaces) convex sets in the inconsistent case and propose a strategy that controls the relaxation…

First we solve the problem of finding minimal degree families on toric surfaces by reducing it to lattice geometry. Then we describe how to find minimal degree families on, more generally, rational complex projective surfaces.

We present a simple and efficient acceleration technique for an arbitrary method for computing the Euclidean projection of a point onto a convex polytope, defined as the convex hull of a finite number of points, in the case when the number…

We study the equational theory of the Weihrauch lattice with multiplication, meaning the collection of equations between terms built from variables, the lattice operations $\sqcup$, $\sqcap$, the product $\times$, and the finite…