English
Related papers

Related papers: Computation of maximal projection constants

200 papers

Let $H$ be a hypersurface in $\mathbb R^n$ and let $\pi$ be an orthogonal projection in $\mathbb R^n$ restricted to $H$. We say that $H$ satisfies the $Archimedean$ $projection$ $property$ corresponding to $\pi$ if there exists a constant…

Differential Geometry · Mathematics 2015-04-14 Vincent Coll , Jeff Dodd , Michael Harrison

Given a convex $n$-gon $P$ and a positive integer $m$ such that $3\le m\le n-1$, let $Q$ denote the largest area convex $m$-gon contained in $P$. We are interested in the minimum value of $\Delta(Q)/\Delta(P)$, the ratio of the areas of…

Combinatorics · Mathematics 2021-04-27 Dan Ismailescu , Min Jung Kim , Eric Wang

All spaces below are Tychonov. We define the projective pi-character p(X) of a space X as the supremum of the values $\pi\chi(Y)$ where Y ranges over all continuous images of X. Our main result says that every space X has a pi-base whose…

General Topology · Mathematics 2007-05-23 Istvan Juhasz , Zoltan Szentmiklossy

For two probability measures $\rho$ and $\pi$ on $[-1,1]^{\mathbb{N}}$ we investigate the approximation of the triangular Knothe-Rosenblatt transport $T:[-1,1]^{\mathbb{N}}\to [-1,1]^{\mathbb{N}}$ that pushes forward $\rho$ to $\pi$. Under…

Statistics Theory · Mathematics 2021-07-29 Jakob Zech , Youssef Marzouk

We consider a random geometric graph model, where pairs of vertices are points in a metric space and edges are formed independently with fixed probability $p$ between pairs within threshold distance $\delta $. A countable dense set in a…

Combinatorics · Mathematics 2018-02-22 Anthony Bonato , Jeannette Janssen , Anthony Quas

We show that for an Erd\H{o}s-R\'{e}nyi graph on $N$ vertices with expected degree $d$ satisfying $\log^{-1/9}N\leq d\leq \log^{1/40}N$, the largest eigenvalues can be precisely determined by small neighborhoods around vertices of close to…

Probability · Mathematics 2023-09-21 Ella Hiesmayr , Theo McKenzie

Let $E$ be one of the spaces $C(K)$ and $L_1$, $F$ be an arbitrary Banach space, $p>1,$ and $(X,\sigma)$ be a space with a finite measure. We prove that $E$ is isometric to a subspace of the Lebesgue-Bochner space $L_p(X;F)$ only if $E$ is…

Functional Analysis · Mathematics 2016-09-06 Alexander Koldobsky

The object of the paper is to find complete systems of inequalities relating the perimeter $P$, the area $|\cdot|$ and the Cheeger constant $h$ of planar sets. To do so, we study the so called Blaschke--Santal\'o diagram of the triplet…

Optimization and Control · Mathematics 2025-01-07 Ilias Ftouhi

Let $G=(V,E)$ be a finite, connected graph. We consider a greedy selection of vertices: given a list of vertices $x_1, \dots, x_k$, take $x_{k+1}$ to be any vertex maximizing the sum of distances to the existing vertices and iterate: we…

Combinatorics · Mathematics 2022-05-06 Stefan Steinerberger

A closed subset $M$ of a Banach space $E$ is \ep, i.e., can be represented locally as the epigraph of a Lipschitz function, if and only if it is the level set of some locally Lipschitz function $f: E\to \R$, wich Clarke's generalized…

Optimization and Control · Mathematics 2009-03-05 Marc-Olivier Czarnecki , Anastasia Nikolaevna Gudovich

We characrterize extreme contractions defined between \ finite-dimensional polyhedral Banach spaces using $k$- smoothness of operators. We also explore weak L-P property, a recently introduced concept in the study of extreme contractions.…

Functional Analysis · Mathematics 2024-08-14 Arpita Mal , Kallol Paul , Subhrajit Dey

Let $X$ be a real Banach space with a normalized duality mapping uniformly norm-to-weak$^\star$ continuous on bounded sets or a reflexive Banach space which admits a weakly continuous duality mapping $J_{\Phi}$ with gauge $\phi$. Let $f$ be…

Optimization and Control · Mathematics 2007-12-10 Jean-Philippe Chancelier

We study expansion/contraction properties of some common classes of mappings of the Euclidean space ${\mathbb R}^n, n\ge 2\,,$ with respect to the distance ratio metric. The first main case is the behavior of M\"obius transformations of the…

Complex Variables · Mathematics 2013-07-11 Slavko Simić , Matti Vuorinen , Gendi Wang

We study the approximability of the Maximum Independent Set (MIS) problem in $H$-free graphs (that is, graphs which do not admit $H$ as an induced subgraph). As one motivation we investigate the following conjecture: for every fixed graph…

Data Structures and Algorithms · Computer Science 2020-04-28 Édouard Bonnet , Stéphan Thomassé , Xuan Thang Tran , Rémi Watrigant

We study a convergence criterion which generalises the notion of being monotonically decreasing, and introduce a quantitative version of this criterion, a so called metastable rate of asymptotic decreasingness. We then present a concrete…

Functional Analysis · Mathematics 2020-04-27 Thomas Powell

We study sparse principal components analysis in the high-dimensional setting, where $p$ (the number of variables) can be much larger than $n$ (the number of observations). We prove optimal, non-asymptotic lower and upper bounds on the…

Machine Learning · Statistics 2012-02-07 Vincent Q. Vu , Jing Lei

In this paper we study the diameter of the random graph $G(n,p)$, i.e., the the largest finite distance between two vertices, for a wide range of functions $p=p(n)$. For $p=\la/n$ with $\la>1$ constant, we give a simple proof of an…

Probability · Mathematics 2010-10-07 Oliver Riordan , Nicholas Wormald

It is well known that if $A \subseteq \mathbb{R}^n$ is an analytic set of Hausdorff dimension $a$, then $\dim_H(\pi_VA)=\min\{a,k\}$ for a.e.\ $V\in G(n,k)$, where $G(n,k)$ denotes the set of all $k$-dimensional subspaces of $\mathbb{R}^n$…

Classical Analysis and ODEs · Mathematics 2025-09-03 Peter Cholak , Marianna Csornyei , Neil Lutz , Patrick Lutz , Elvira Mayordomo , D. M. Stull

The existence of a Banach limit as a translation invariant positive continuous linear functional on the space of bounded scalar sequences which is equal to 1 at the constant sequence (1,1,...,1,...) is proved in a first course on functional…

Functional Analysis · Mathematics 2019-06-12 M. A. Sofi

Given a directed simple graph G=(V,E) and a nonnegative-valued cost function the power of a vertex u in a directed spanning subgraph H is given by the maximum cost of an arcs of H exiting u. The power of H is the sum of the power of its…

Data Structures and Algorithms · Computer Science 2012-05-16 Gruia Calinescu
‹ Prev 1 8 9 10 Next ›