Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Volume of an n-ball

Related publications (12)

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

Friedrich Eisenbrand

We consider integer programming problems in standard form max{c(T)x : Ax = b, x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m), and c is an element of Z(n). We show that such an integer program can be solved in time ...

ASSOC COMPUTING MACHINERY2020

On the Volume of the John-Lowner Ellipsoid

Grigory Ivanov

We find an optimal upper bound on the volume of the John ellipsoid of a k-dimensional section of the n-dimensional cube, and an optimal lower bound on the volume of the Lowner ellipsoid of a projection of the n-dimensional cross-polytope onto a k-dimension ...

SPRINGER2020

On the reverse isodiametric problem and Dvoretzky-Rogers-type volume bounds

Matthias Schymura

The isodiametric inequality states that the Euclidean ball maximizes the volume among all convex bodies of a given diameter. We are motivated by a conjecture of Makai Jr. on the reverse question: Every convex body has a linear image whose isodiametric quot ...

2018

Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma

Friedrich Eisenbrand

We consider integer programming problems in standard form max{c(T)x : Ax = b; x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m) and c is an element of Z(n). We show that such an integer program can be solved in time ...

ASSOC COMPUTING MACHINERY2018

Stable high-order randomized cubature formulae in arbitrary dimension

Fabio Nobile, Giovanni Migliorati

We propose and analyse randomized cubature formulae for the numerical integration of functions with respect to a given probability measure μ defined on a domain Γ⊆ℝ^d, in any dimension d. Each cubature formula is conceived to be exact on a given finite dim ...

2022

How close are the eigenvectors and eigenvalues of the sample and actual covariance matrices?

Andreas Loukas

How many samples are sufficient to guarantee that the eigenvectors and eigenvalues of the sample covariance matrix are close to those of the actual covariance matrix? For a wide family of distributions, including distributions with finite second moment and ...

2017

Small subset sums

Gergely Ambrus

Let parallel to.parallel to be a norm in R-d whose unit ball is B. Assume that V subset of B is a finite set of cardinality n, with Sigma(v is an element of V) v = 0. We show that for every integer k with 0

Elsevier Science Inc2016

Polynomial diffusions and applications in finance

Damir Filipovic, Martin Larsson

This paper provides the mathematical foundation for polynomial diffusions. They play an important role in a growing range of applications in finance, including financial market models for interest rates, credit risk, stochastic volatility, commodities and ...

Springer Verlag2016

Quantum anomalies and logarithmic derivatives of feynman pseudomeasures

Tudor Ratiu

Connections between quantum anomalies and transformations of pseudomeasures of the type of Feynman pseudomeasures are studied. Mathematical objects related to the notion of the volume element in an infinite-dimensional space considered in the physics liter ...

Springer Verlag2015

The corona theorem for the Drury–Arveson Hardy space and other holomorphic Besov–Sobolev spaces on the unit ball in C-n

We prove that the multiplier algebra of the Drury-Arveson Hardy space H-n(2) on the unit ball in C-n has no corona in its maximal ideal space, thus generalizing the corona theorem of L. Carleson to higher dimensions. This result is obtained as a corollary ...

2011

G-Chaplygin Systems With Internal Symmetries, Truncation, And An (Almost) Symplectic View Of Chaplygin'S Ball

Simon Hochgerner

Via compression ([18,8]) we write the n-dimensional Chaplygin sphere system as an almost Hamiltonian system on T*SO (n) with internal symmetry group SO (n-1). We show how this symmetry group can be factored out, and pass to the fully reduced system on (a f ...

2009

Efficient algorithms for the k-distance transformation

Olivier Cuisenaire

The k-distance transformation (k-DT) computes the k nearest patterns from each location on a discrete regular grid within a D dimensional volume, which Warfield [Patt. Rec. Letters, 17(1996) 713-721] proposed to implement using 2^D raster scans. We investi ...

2006

Related publications (12)