Related papers: Square Packing with Asymptotically Smallest Waste …
This paper investigates some theoretical properties of the Partial Least Square (PLS) method. We focus our attention on the single component case, that provides a useful framework to understand the underlying mechanism. We provide a…
An abstract indefinite least squares problem with a quadratic constraint is considered. This is a quadratic programming problem with one quadratic equality constraint, where neither the objective nor the constraint are convex functions.…
In this paper, we consider the following geometric puzzle whose origin was traced to Allan Freedman \cite{croft91,tutte69} in the 1960s by Dumitrescu and T{\'o}th \cite{adriancasaba2011}. The puzzle has been popularized of late by Peter…
We consider the estimation of a bounded regression function with nonparametric heteroscedastic noise and random design. We study the true and empirical excess risks of the least-squares estimator on finite-dimensional vector spaces. We give…
The method of quasi-optimal weights provides a comprehensive, asymptotically optimal, transparent and flexible alternative to the least squares method. The optimality holds for a general non-linear, non-gaussian case.
A small polygon is a convex polygon of unit diameter. We are interested in small polygons which have the largest area for a given number of vertices $n$. Many instances are already solved in the literature, namely for all odd $n$, and for…
In our paper, we apply additive-combinatorial methods to study the distribution of the set of squares $\mathcal{R}$ in the prime field. We obtain the best upper bound on the number of gaps in $\mathcal{R}$ at the moment and generalize this…
Consider an orientable compact surface in three dimensional Euclidean space with minimum total absolute curvature. If the Gaussian curvature changes sign to finite order and satisfies a nondegeneracy condition along closed asymptotic…
It is a widely observed phenomenon in computer graphics that the size of the silhouette of a polyhedron is much smaller than the size of the whole polyhedron. This paper provides, for the first time, theoretical evidence supporting this for…
Finite dimensional linear spaces (both complex and real) with indefinite scalar product [.,.] are considered. Upper and lower bounds are given for the size of an indecomposable matrix that is normal with respect to this scalar product in…
Nearest neighbor random walks in the quarter plane that are absorbed when reaching the boundary are studied. The cases of positive and zero drift are considered. Absorption probabilities at a given time and at a given site are made…
The set of 2-dimensional packing problems builds an important class of optimization problems and Strip Packing together with 2-dimensional Bin Packing and 2-dimensional Knapsack is one of the most famous of these problems. Given a set of…
The nonnegative rank of a nonnegative matrix is the minimum number of nonnegative rank-one factors needed to reconstruct it exactly. The problem of determining this rank and computing the corresponding nonnegative factors is difficult;…
We prove that a Schauder frame for any separable Banach space is shrinking if and only if it has an associated space with a shrinking basis, and that a Schauder frame for any separable Banach space is shrinking and boundedly complete if and…
We establish an optimal \emph{Widder theory} for a weighted porous medium equation with rough and inhomogeneous density that may be singular at a point and tends to zero at spatial infinity. Specifically, for this equation, we identify a…
Tile the unit square with $n$ small squares. We determine the minimum of the sum of the side lengths of the $n$ small squares, where the minimum is taken over all tilings of the unit square with $n$ squares.
We address the inference problem concerning regression coefficients in a classical linear regression model using least squares estimates. The analysis is conducted under circumstances where network dependency exists across units in the…
In this paper we give a geometric argument for bounding the diameter of a connected compact surface (with boundary) of arbitrary codimension in Euclidean space in terms of Topping's diameter bound for closed surfaces (without boundary). The…
Hyperplanes, hyperspheres and hypercylinders in $\Bbb R^n$ with suitable densities are proved to be weighted minimizing by a calibration argument. Also calibration method is used to prove a weighted minimal hypersurface is weighted…
We characterize the finite dimensional asymmetric normed spaces which are right bounded and the relation of this property with the natural compactness properties of the unit ball, as compactness and strong compactness. In contrast with some…