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

Concept

Unit sphere

Publications associées (19)

Spectral Hypergraph Sparsifiers of Nearly Linear Size

Mikhail Kapralov, Jakab Tardos

Graph sparsification has been studied extensively over the past two decades, culminating in spectral sparsifiers of optimal size (up to constant factors). Spectral hypergraph sparsification is a natural analogue of this problem, for which optimal bounds on ...

IEEE COMPUTER SOC2022

Realizing doubles: a conjugation zoo

Jérôme Scherer

Conjugation spaces are topological spaces equipped with an involution such that their fixed points have the same mod 2 cohomology (as a graded vector space, a ring and even an unstable algebra) but with all degrees divided by two, generalizing the classica ...

CAMBRIDGE UNIV PRESS2021

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

Geometric ergodicity for some space-time max-stable Markov chains

Erwan Fabrice Koch

Max-stable processes are central models for spatial extremes. In this paper, we focus on some space-time max-stable models introduced in Embrechts et al. (2016). The processes considered induce discrete-time Markov chains taking values in the space of cont ...

ELSEVIER SCIENCE BV2019

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

Approximating Steiner trees and forests with minimum number of Steiner points

Nachshon Cohen

Let R be a finite set of terminals in a convex metric space (M, d). We give approximation algorithms for problems of finding a minimum size set S subset of M of additional points such that the unit-disc graph G[R boolean OR S] of R boolean OR S satisfies s ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2018

Scenario Reduction Revisited: Fundamental Limits and Guarantees

Daniel Kuhn, Wolfram Wiesemann, Napat Rujeerapaiboon, Kilian Schindler

The goal of scenario reduction is to approximate a given discrete distribution with another discrete distribution that has fewer atoms. We distinguish continuous scenario reduction, where the new atoms may be chosen freely, and discrete scenario reduction, ...

2022

New Moduli For Banach Spaces

Grigory Ivanov

Modifying the moduli of supporting convexity and supporting smoothness, we introduce new moduli for Banach spaces which occur, for example, as lengths of catheti of right-angled triangles (defined via so-called quasiorthogonality). These triangles have two ...

Tusi Mathematical Research Group2017

Localization Genus

Jérôme Scherer

Which spaces look like an n-sphere through the eyes of the n-th Postnikov section functor and the n-connected cover functor? The answer is what we call the Postnikov genus of the n-sphere. We define in fact the notion of localization genus for any homotopi ...

Univ Autonoma Barcelona2017

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

Computing Extremal Points Of Symplectic Pseudospectra And Solving Symplectic Matrix Nearness Problems

Daniel Kressner

We study differential equations that lead to extremal points in symplectic pseudospectra. In a two-level approach, where on the inner level we compute extremizers of the symplectic epsilon-pseudospectrum for a given epsilon and on the outer level we optimi ...

Siam Publications2014

Asymptotic linearity and Hadamard differentiability

Charles Stuart

For a mapping between Banach spaces, two weaker variants of the usual notion of asymptotic linearity are defined and explored. It is shown that, under inversion through the unit sphere, they correspond to Hadamard and weak Hadamard differentiability at the ...

2012

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

On Sphere-Filling Ropes

What is the longest rope on the unit sphere? Intuition tells us that the answer to this packing problem depends on the rope's thickness. For a countably infinite number of prescribed thickness values we construct and classify all solution curves. The simpl ...

2011

What are the Longest Ropes on the Unit Sphere?

We consider the variational problem of finding the longest closed curves of given minimal thickness on the unit sphere. After establishing the existence of solutions for any given thickness between 0 and 1, we explicitly construct for each given thickness ...

Springer-Verlag2011

Ideal knots and other packing problems of tubes

This thesis concerns optimal packing problems of tubes, or thick curves, where thickness is defined as follows. Three points on a closed space curve define a circle. Taking the infimum over all radii of pairwise-distinct point triples defines the thickness ...

EPFL2010

Solidification behavior of PLLA/nHA nanocomposites

Jan-Anders Edvin Maansson, Pierre-Etienne Bourban, John Christopher Plummer, Claire Diane Delabarde

As part of a broader effort to establish processing-structure-property relationships in PLLA/nHA, which is currently under consideration for bioresorbable scaffolds for bone repair, hot stage optical microscopy and differential scanning calorimetry have be ...

2010

Publications associées (19)