Study on functional ellipsoids to decompose the identity.
problem Decompose the identity for functional ellipsoids.
method Construct a decomposition similar to Fritz John's theorem.
result Developed a new approach to functional ellipsoids.
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…
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 p and q. The paper proves a Bonnesen-type inequality for the real projective plane.
problem Proving an inequality for the real projective plane.
method Using Pu's systolic inequality, John ellipsoids, and Pogorelov's rigidity theorem.
result Generalized Pu's systolic inequality for positively-curved metrics.
We present an affine-invariant random walk for drawing uniform random samples from a convex body K⊂Rn 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 …
Given a centrally symmetric convex body K⊂Rd and a positive number λ, we consider, among all ellipsoids E⊂Rd of volume λ, those that best approximate K with respect to the symmetric difference metric, or equivalently that maximize the volume of E∩K: these are the maxi…
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…
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…
We generalize the maximal diameter sphere theorem due to Toponogov by means of the radial curvature. As a corollary to our main theorem, we prove that for a complete connected Riemannian n-manifold M having radial sectional curvature at a point bounded from below by the radial curvature function of an ellipsoid of …
The paper finds a geometric way to minimize a convex function to construct isotropic measures.
problem Constructing isotropic measures in convex bodies.
method Minimizing a convex function in a high-dimensional space.
result Geometric interpretation of the minimizer as a derivative.
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 Cr mappings are shown (r≥1). Moreover, some applications of the two the…
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…
In this article we construct L--A representations of geodesic flows on quadrics and of billiard problems within ellipsoids in the pseudo--Euclidean spaces. A geometric interpretation of the integrability analogous to the classical Chasles theorem for symmetric ellipsoids is given. We also consider a generalization of t…
Given a positive function u∈W1,n, we define its John-Nirenberg radius at point x to be the supreme of the radius such that ∫Bt∣∇logu∣n<ε0n when n>2, and ∫Bt∣∇u∣2<ε02 when n=2. We will show that for a collapsing sequence in a fixed conformal class under some curvature c…
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.
The study confirms most Cantor sets are in general position for all projections.
problem Understanding the general position of Cantor sets under various projections.
method Proof of the theorem stated in the title.
result Most Cantor sets are in general position with respect to all projections.
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.
Minimal spheres found in ellipsoids with large axes.
problem Finding non-planar minimal spheres in ellipsoids.
method Quantitative proof of minimal spheres existence with constraints.
result Ellipsoids with large axes contain at least three non-planar minimal spheres.
Paper proves existence and gives construction of Symphonic map between ellipsoids.
problem Existence and construction of Symphonic map between ellipsoids.
method Geometric construction using Hopf map.
result Existence and construction of Symphonic map from ellipsoid to ellipsoid.
The horizon and geodesic structure of static configurations generated by anisotropic conformal transforms of the Schwarzschild metric is analyzed. We construct the maximal analytic extension of such off--diagonal vacuum metrics and conclude that for small deformations there are different classes of vacuum solutions of …
Let (M;g) be a smooth compact Riemiannian manifold without boundary and gk be a metric conformal to g. Suppose vol(M;gk)+∣∣Rk∣∣Lp(M;gk)<C, where Rk is the scalar curvature and p>2n. We will use the 3-circle theorem and the John-Nirenberg inequality to study the bubble tre…
Study on rigidity with non-negative intermediate curvature on low-dimensional manifolds.
problem Extending non-existence theorem of positive scalar curvature to product manifolds.
method Introduced intermediate curvature and studied rigidity conditions.
result Rigidity when intermediate curvature is non-negative in low dimensions.
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.…
CTEF fits ellipsoids to noisy data in any dimension.
problem Fitting ellipsoids to noisy data in arbitrary dimensions.
method Uses the Cayley transform to fit ellipsoids.
result CTEF outperforms other methods, especially when data are not uniformly distributed.
The paper uses Seshadri constants to construct symplectic ellipsoid embeddings.
problem Constructing symplectic embeddings of ellipsoids.
method Exploring weighted blow-ups and Seshadri constants to demonstrate symplectic embeddings.
result Illustrates constructions of ellipsoid fillings and embeddings.
We construct new classes of exact solutions in metric--affine gravity (MAG) with string corrections by the antisymmetric H--field. The solutions are parametrized by generic off--diagonal metrics possessing noncommutative symmetry associated to anholonomy framerelations and related nonlinear connection (N--connection)…
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…
New minimal discs and annuli found in ellipsoids.
problem Constructing minimal surfaces in ellipsoids.
method Equivariant variational methods.
result At least three distinct embedded free boundary minimal annuli in ellipsoids.
John Conway created pairs of domains that sound the same for a special kind of music.
problem Creating domains that sound the same for a special kind of music.
method Using his theory of quilts, Conway developed pairs of glueing diagrams.
result Conway's pairs of domains are isospectral for the Laplace operator.
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.
Comparison theorems in centro-affine differential geometry
problem rigidity phenomena of comparison theorems
method study of centro-affine differential geometry
result examples of rigidity phenomena
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 …
Jacobi solved geodesics on triaxial ellipsoids.
problem Finding the shortest path on a triaxial ellipsoid.
method Numerical evaluation of integrals and solving coupled equations.
result Solution for geodesics on triaxial ellipsoids.
Study finds many nonplanar minimal spheres in elongated ellipsoids.
problem Existence of nonplanar minimal spheres in elongated ellipsoids.
method Global bifurcation techniques to establish existence and quantify number.
result Arbitrarily many nonplanar minimal spheres exist in elongated ellipsoids.
Study smoothings of singular intersections of ellipsoids.
problem Smooth singular intersections of ellipsoids.
method Generic singularities of coaxial intersections of ellipsoids studied.
result Special attention to 3D case.
Optimizes ellipsoids for uncertainty regions in parameter estimation.
problem Learning minimal volume uncertainty ellipsoids for parameter estimation.
method Differentiable optimization approach using neural networks to approximate optimal ellipsoids.
result Approximately computed ellipsoids are smaller and more accurate than existing methods.
Consider a d×d matrix M whose rows are independent centered non-degenerate Gaussian vectors ξ1,...,ξd with covariance matrices Σ1,...,Σd. Denote by Ei the location-dispersion ellipsoid of ξi:Ei=x∈Rd:x⊤Σi−1x⩽1. We sh…
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.
Ellipsoids host infinitely many minimal tori, bifurcating from a 2-torus orbit.
problem Minimal tori in ellipsoids.
method Analyzing 3D ellipsoids invariant under a 2-torus action.
result Infinitely many distinct minimal tori bifurcate from a 2-torus orbit.
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(β)γd volume factor of best β-conditioned ellipsoid. Study smoothings of ellipsoid intersections with singularities.
problem Smooth singular intersections of ellipsoids.
method Study 3D manifolds with singularities as small covers of Coxeter polyhedral orbifolds.
result Introduce n-pyramitoid to generalize n-pyramids. Uniform convexity in divisible domains leads to hyperbolic geometry.
problem Understanding the geometry of divisible convex sets in Finsler manifolds.
method Proving β-uniform convexity of a specific Finsler metric. result A strictly convex divisible domain induces a β-uniformly convex Finsler metric. 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.
Geodesic algorithms extended to arbitrary ellipsoids.
problem Computing geodesics on ellipsoids of varying eccentricity.
method Implementation of geodesic algorithms using elliptic integrals and discrete sine transform.
result Achieved high accuracy (close to machine precision) for geodesic computations.
Ellipsoids approach Gaussian distribution in high dimensions.
problem Understanding convergence of high-dimensional ellipsoids to Gaussian spaces.
method Proof of convergence in Gromov's concentration topology.
result Solid ellipsoids converge to Gaussian space in high dimensions.
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.