28 research outputs found

    A uniform estimate of the relative projection constant

    Full text link
    The main goal of the paper is to provide a quantitative lower bound greater than 11 for the relative projection constant λ(Y,X)\lambda(Y, X), where XX is a subspace of 2pm\ell_{2p}^m space and YXY \subset X is an arbitrary hyperplane. As a consequence, we establish that for every integer n4n \geq 4 there exists an nn-dimensional normed space XX such that for an every hyperplane YY and every projection P:XYP:X \to Y the inequality P>1+(8(n+3)5)30(n+3)2||P|| > 1 + \left (8 \left ( n + 3 \right )^{5} \right )^{-30(n+3)^2} holds. This gives a non-trivial lower bound in a variation of problem proposed by Bosznay and Garay in 19861986.Comment: 16 page

    Equilateral dimension of some classes of normed spaces

    Full text link
    An equilateral dimension of a normed space is a maximal number of pairwise equidistant points of this space. The aim of this paper is to study the equilateral dimension of certain classes of finite dimensional normed spaces. The well-known conjecture states that the equilateral dimension of any nn-dimensional normed space is not less than n+1n+1. By using an elementary continuity argument, we establish it in the following classes of spaces: permutation-invariant spaces, Orlicz-Musielak spaces and in one codimensional subspaces of n\ell^n_{\infty}. For smooth and symmetric spaces, Orlicz-Musielak spaces satisfying an additional condition and every (n1)(n-1)-dimensional subspace of n\ell^{n}_{\infty} we also provide some weaker bounds on the equilateral dimension for every space which is sufficiently close to one of these. This generalizes the result of Swanepoel and Villa concerning the pn\ell_p^n spaces.Comment: 14 pages, Numerical Functional Analysis and Optimization 35 (2014

    Around the Petty theorem on equilateral sets

    Full text link
    The main goal of this paper is to provide an alternative proof of the following theorem of Petty: in the normed space of dimension at least three, every 3-element equilateral set can be extended to a 4-element equilateral set. Our approach is based on the result of Kramer and N\'emeth about inscribing a simplex into a convex body. To prove the theorem of Petty, we shall also establish that for every 3 points in the normed plane, forming an equilateral set of the common distance pp, there exists a fourth point, which is equidistant to the given points with the distance not larger than pp. We will also improve the example given by Petty and obtain the existence of a smooth and strictly convex norm in Rn\mathbb{R}^n, which contain a maximal 4-element equilateral set. This shows that the theorem of Petty cannot be generalized to higher dimensions, even for smooth and strictly convex norms.Comment: 12 pages, 1 figur

    Extremal Banach-Mazur distance between a symmetric convex body and an arbitrary convex body on the plane

    Full text link
    We prove that if K,LR2K, L \subset \mathbb{R}^2 are convex bodies such that LL is symmetric and the Banach-Mazur distance between KK and LL is equal to 22, then KK is a triangle.Comment: 17 pages, 13 figure

    A uniform lower bound on the norms of hyperplane projections of spherical polytopes

    Full text link
    Let KK be a centrally symmetric spherical polytope, whose vertices form a 14n\frac{1}{4n}-net in the unit sphere in Rn\mathbb{R}^n. We prove a uniform lower bound on the norms of hyperplane projections P:XXP: X \to X, where XX is the nn-dimensional normed space with the unit ball KK. The estimate is given in terms of the determinant function of vertices and faces of KK. In particular, if Nn4nN \geq n^{4n} and KK is the convex hull of {±x1,±x2,,±xN}\{ \pm x_1, \pm x_2, \ldots, \pm x_N \}, where x1,x2,,xNx_1, x_2, \ldots, x_N are independent random points distributed uniformly in the unit sphere, then every hyperplane projection P:XXP: X \to X satisfies the inequality P1+cnN8n6||P|| \geq 1 + c_nN^{-8n-6} (for some explicit constant cnc_n), with the probability at least 14N.1 - \frac{4}{N}.Comment: 14 page

    On the dimension of the set of minimal projections

    Full text link
    Let XX be a finite-dimensional normed space and let YXY \subseteq X be its proper linear subspace. The set of all minimal projections from XX to YY is a convex subset of the space all linear operators from XX to XX and we can consider its affine dimension. We establish several results on the possible values of this dimension. We prove optimal upper bounds in terms of the dimensions of XX and YY. Moreover, we improve these estimates in the polyhedral normed spaces for an open and dense subset of subspaces of the given dimension. As a consequence, in the polyhedral normed spaces a minimal projection is unique for an open and dense subset of hyperplanes. To prove this, we establish certain new properties of the Chalmers-Metcalf operator. Another consequence is the fact, that for every subspace of a polyhedral normed space, there exists a minimal projection with many norming pairs. Finally, we provide some more refined results in the hyperplane case.Comment: 31 page

    Tomasz Dohnalik

    Get PDF

    Tomasz Gąsowski

    Get PDF
    corecore