Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

3773110146 · May 202619922001200920172026
48 results for John ellipsoid theorem

Using an idea of Voronoi in the geometric theory of positive definite quadratic forms, we give a transparent proof of John's characterization of the unique ellipsoid of maximum volume contained in a convex body. The same idea applies to the 'hard part' of a generalization of John's theorem and shows the difficulties of…

2012-07-31abs ↗pdf ↗

The paper applies a capillary John ellipsoid theorem to solve capillary curvature problems.

problem Solving capillary curvature problems in Euclidean half-spaces.
method Applying a capillary John ellipsoid theorem to derive non-collapsing estimates and gradient estimates.
result Established existence of solutions to capillary curvature problems in certain ranges of pp and qq.

We present an affine-invariant random walk for drawing uniform random samples from a convex body KRn\mathcal{K} \subset \mathbb{R}^n that uses maximum volume inscribed ellipsoids, known as John's ellipsoids, for the proposal distribution. Our algorithm makes steps using uniform sampling from the John's ellipsoid of the …

2018-03-06abs ↗pdf ↗

We extend the model of stochastic bandits with adversarial corruption (Lykouriset al., 2018) to the stochastic linear optimization problem (Dani et al., 2008). Our algorithm is agnostic to the amount of corruption chosen by the adaptive adversary. The regret of the algorithm only increases linearly in the amount of cor…

2019-09-04abs ↗pdf ↗

We propose and analyze two new MCMC sampling algorithms, the Vaidya walk and the John walk, for generating samples from the uniform distribution over a polytope. Both random walks are sampling algorithms derived from interior point methods. The former is based on volumetric-logarithmic barrier introduced by Vaidya wher…

2017-10-23abs ↗pdf ↗

Study eigenvalues of ellipsoids near a sphere, comparing to sphere's.

problem Analyzing changes in Laplacian eigenvalues for ellipsoids near a sphere.
method Comparison with standard Euclidean unit sphere, under Gaussian curvature condition.
result Eigenvalues of ellipsoids near a sphere, with comparison to sphere's.

In his celebrated paper "Generic projections", John Mather has given a striking transversality theorem and its applications on generic projections. On the other hand, in this paper, two transversality theorems on generic linearly perturbed CrC^r mappings are shown (r1)(r\geq 1). Moreover, some applications of the two the…

2018-06-13abs ↗pdf ↗

We describe the geometry of geodesics on a Lorentz ellipsoid: give explicit formulas for the first integrals (pseudo-confocal coordinates), curvature, geodesically equivalent Riemannian metric, the invariant area-forms on the time- and space-like geodesics and invariant 1-form on the space of null geodesics. We prove a…

2007-05-01abs ↗pdf ↗

Given a positive function uW1,nu\in W^{1,n}, we define its John-Nirenberg radius at point xx to be the supreme of the radius such that Btlogun<ε0n\int_{B_t}|\nabla\log u|^n<ε_0^n when n>2n>2, and Btu2<ε02\int_{B_t}|\nabla u|^2<ε_0^2 when n=2n=2. We will show that for a collapsing sequence in a fixed conformal class under some curvature c…

2017-08-07abs ↗pdf ↗

The paper proves ellipsoids are the only centroaffine Tchebychev hyperovaloids.

problem Generalizing Blaschke and Deicke's theorem to centroaffine differential geometry.
method Characterized hypersurfaces by a closed conformal vector field and used properties of Riemannian manifolds.
result Ellipsoids are the only centroaffine Tchebychev hyperovaloids.

The study characterizes quadrics among affine hyperspheres based on centroid collinearity of sections.

problem Characterizing quadrics among affine hyperspheres based on section centroid collinearity.
method Extending Meyer and Reisner's theorem to unbounded convex sets and identifying additional assumptions.
result Ellipsoids, paraboloids, and one sheet of a two-sheeted hyperboloid are the only quadrics satisfying the centroid collinearity condition.

Study improves understanding of Ricci curvature in manifolds.

problem Understanding Ricci curvature in manifolds with specific assumptions.
method Exploring m-intermediate Ricci curvature and proving comparison theorems.
result Stable weighted slicing in manifolds with non-negative m-intermediate Ricci curvature has almost non-negative Ricci curvature.

Let (M;g)(M; g) be a smooth compact Riemiannian manifold without boundary and gkg_{k} be a metric conformal to gg. Suppose vol(M;gk)+RkLp(M;gk)<Cvol(M; g_{k})+||R_{k}||_{L^{p}(M;g_{k})} < C, where RkR_{k} is the scalar curvature and p>n2p > \frac{n}{2}. We will use the 3-circle theorem and the John-Nirenberg inequality to study the bubble tre…

2017-06-13abs ↗pdf ↗

Many classical facts in Riemannian geometry have their pseudo-Riemannian analogs. For instance, the spaces of space-like and time-like geodesics on a pseudo-Riemannian manifold have natural symplectic structures (just like in the Riemannian case), while the space of light-like geodesics has a natural contact structure.…

2006-08-24abs ↗pdf ↗

Let Πbe a link projection in S^2. John Conway and later Francis Bonahon and Larry Siebenmann undertook to split ΠΠ into canonical pieces. These pieces received different names: basic or polyhedral diagrams on one hand, rational, algebraic, bretzel, arborescent diagrams on the other hand. This paper proposes a thorough…

2009-06-11abs ↗pdf ↗

The paper develops a method to create non-asymptotic confidence ellipsoids for linear regression without strong noise distribution assumptions.

problem Constructing reliable confidence regions for linear regression with finite sample sizes and general noise distributions.
method The paper introduces the SPS EOA algorithm to create non-asymptotically guaranteed confidence ellipsoids for linear regression problems.
result The sizes of SPS outer ellipsoids are shown to decrease at the optimal rate for linear regression problems.

We discuss Darboux-Staude type of thread configurations for the ellipsoid similar to Chasles-Graves type of thread configurations for the ellipse. These threads are formed by rectilinear segments, geodesic and line of curvature segments on the considered ellipsoid and with tangents tangent to the given ellipsoid and a …

2009-02-09abs ↗pdf ↗

Consider a d×dd\times d matrix MM whose rows are independent centered non-degenerate Gaussian vectors ξ1,...,ξdξ_1,...,ξ_d with covariance matrices Σ1,...,ΣdΣ_1,...,Σ_d. Denote by Ei\mathcal{E}_i the location-dispersion ellipsoid of ξi:Ei=xRd:xΣi1x1ξ_i:\mathcal{E}_i={\mathbf{x}\in\mathbb{R}^d : \mathbf{x}^\topΣ_i^{-1} \mathbf{x}\leqslant1}. We sh…

2012-06-02abs ↗pdf ↗

Discrete analogues of ellipsoids with preserved circular cross sections.

problem Constructing discrete analogues of ellipsoids with preserved geometric properties.
method A novel discretization procedure to create discrete analogues of ellipsoids composed of planar quadrilaterals.
result Discrete analogues of ellipsoids have preserved circular cross sections and can be deformed.

We develop an efficient algorithm to find confidence ellipsoids with volume guarantees in high dimensions.

problem Finding robust confidence ellipsoids in high-dimensional data.
method Polynomial time algorithm using primal-dual structure and geometric Brascamp-Lieb inequality.
result Algorithm finds ellipsoids within a O(β)γdO(β)^{γd} volume factor of best ββ-conditioned ellipsoid.

Self-focal points on ellipsoids of dimension 3 or higher are rare.

problem Existence of self-focal points on Riemannian manifolds of dimension 3 or higher.
method Analyzing geodesics and umbilic points on ellipsoids of various dimensions.
result Ellipsoids of dimension 3 or higher with at least 4 distinct axes have no self-focal points.

The paper studies the number of normals to ellipsoids and their intersections with caustics.

problem The number of normals to an ellipsoid passing through a given point.
method Intersection points of the ellipsoid and its caustics are used to study the problem in 3D space.
result The number of normals is dependent on the position of the given point with respect to the caustics of the ellipsoid.