Related papers: Linear projections and successive minima
Linear sets on the projective line have attracted a lot of attention because of their link with blocking sets, KM-arcs and rank-metric codes. In this paper, we study linear sets having two points of complementary weight, that is with two…
We study linear systems of surfaces in $\mathbb{P}^3$ singular along general lines. Our purpose is to identify and classify special systems of such surfaces, i.e., those nonempty systems where the conditions imposed by the multiple lines…
This work is devoted to establish the strong convergence results of an iterative algorithm generated by the shrinking projection method in Hilbert spaces. The proposed approximation sequence is used to find a common element in the set of…
A stochastic gradient method for finite-sum minimization subject to deterministic linear constraints is proposed and analyzed. The procedure presented adapts the projected gradient method on convex set to the use of both a stochastic…
The coordinate projective line over a field is seen as a groupoid with a further `projection' structure. We investigate conversely to what extent such an, abstractly given, groupoid may be coordinatized by a suitable field constructed out…
This paper is concerned with the concept of linear repetitivity in the theory of tilings. We prove a general uniform subadditive ergodic theorem for linearly repetitive tilings. This theorem unifies and extends various known (sub)additive…
We present a proof of the Harbourne-Hirschowitz conjecture for linear systems with base points of multiplicity seven or less. This proof uses a well-known degeneration of the projective plane, as well as a combinatorial technique that…
Parallel and cyclic projection algorithms are proposed for minimizing the sum of a finite family of convex functions over the intersection of a finite family of closed convex subsets of a Hilbert space. These algorithms are of…
A new heuristic for rectilinear crossing minimization is proposed. It is based on the idea of iteratively repositioning nodes after a first initial graph drawing. The new position of a node is computed by casting rays from the node towards…
In this article we study the problem of recovering the unknown solution of a linear ill-posed problem, via iterative regularization methods. We review the problem of projection-regularization from a statistical point of view. A basic…
These are lecture notes on the rigidity of submanifolds of projective space "resembling" compact Hermitian symmetric spaces in their homogeneous embeddings. Recent results are surveyed, along with their classical predecessors. The notes…
Finite linear least squares is one of the core problems of numerical linear algebra, with countless applications across science and engineering. Consequently, there is a rich and ongoing literature on algorithms for solving linear least…
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…
In this short survey we want to present some of the impact of Minkowski's successive minima within Convex and Discrete Geometry. Originally related to the volume of an $o$-symmetric convex body, we point out relations of the successive…
We consider first-order linear systems of ordinary differential equations with periodic coefficients. Supposing that right-hand sides of equations are not known and subjected to some quadratic restrictions, we obtain optimal, in certain…
A general definition of a linear connection in noncommutative geometry has been recently proposed. Two examples are given of linear connections in noncommutative geometries which are based on matrix algebras. They both possess a unique…
We determine those maps between affine or projective spaces that are linear in the abstract sense of transforming collinear points into collinear points and whose restriction to any line is constant or injective. Our results are extensions…
In this note we study the Petty projection of a log-concave function, which has been recently introduced in [9]. Moreover, we present some new inequalities involving this new notion, partly complementing and correcting some results from…
This survey highlights the recent advances in algorithms for numerical linear algebra that have come from the technique of linear sketching, whereby given a matrix, one first compresses it to a much smaller matrix by multiplying it by a…
The simplex method in Linear Programming motivates several problems of asymptotic convex geometry. We discuss some conjectures and known results in two related directions -- computing the size of projections of high dimensional polytopes…