# Über den variabilitätsbereich der fourier’schen konstanten von positiven harmonischen funktionen

@article{CarathodoryberDV,
title={{\"U}ber den variabilit{\"a}tsbereich der fourier’schen konstanten von positiven harmonischen funktionen},
author={Constantin Carath{\'e}odory},
journal={Rendiconti del Circolo Matematico di Palermo (1884-1940)},
volume={32},
pages={193-217}
}
• C. Carathéodory
• Published 1 December 1911
• Mathematics
• Rendiconti del Circolo Matematico di Palermo (1884-1940)
462 Citations
Geodetic convexity parameters for (q, q-4)-graphs
• Mathematics, Computer Science
• Discret. Appl. Math.
• 2017
It is shown that the Radon number can be computed in polynomial time for ( q, q − 4 ) -graphs within the geodetic convexity, the interval number, the conveXity number, and the Caratheodory number. Expand
Toll convexity
The main result of the paper is that a graph is a convex geometry with respect to toll convexity if and only if it is an interval graph. Expand
An extension of Herglotz's theorem to the quaternions
• Mathematics
• 2014
A classical theorem of Herglotz states that a function $n\mapsto r(n)$ from $\mathbb Z$ into $\mathbb C^{s\times s}$ is positive definite if and only there exists a $\mathbb C^{s\times s}$-valuedExpand
Precise semidefinite programming formulation of atomic norm minimization for recovering d-dimensional (D ≥ 2) off-the-grid frequencies
• Computer Science, Mathematics
• 2014 Information Theory and Applications Workshop (ITA)
• 2014
This paper proposes equivalent semidefinite programming formulations of atomic norm minimization to recover signals with d-dimensional (d ≥ 2) off-the-grid frequencies. Expand
Support and separation properties of convex sets in finite dimension
This is a survey on support and separation properties of convex sets in the n-dimensional Euclidean space. It contains a detailed account of existing results, given either chronologically or inExpand
Convex and non-convex optimizations for recovering structured data: algorithms and analysis
This thesis offers convex and non-convex optimization solutions to various large scale optimization problems such as super-resolution, sparse signal processing, hypothesis testing, machine learning, and treatment planning for brachytherapy. Expand
Super-résolution d'impulsions positives par approximation Toeplitz de rang faible
• Physics
• 2015
Super-resolution consists in recovering the fine details of a signal from low-resolution measurements. Here we consider the estimation of Dirac pulses with positive amplitudes at arbitrary locations,Expand
Off-the-grid spectral compressed sensing with prior information
• Computer Science, Mathematics
• 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
• 2014
This paper extends off-the-grid CS to applications where some prior information about spectrally sparse signal is known, specifically cases where a few contributing frequencies or poles, but not their amplitudes or phases, are known a priori. Expand
Popular mixed matchings
• Computer Science, Mathematics
• Theor. Comput. Sci.
• 2011
It is shown that popular mixed matchings always exist and polynomial time algorithms for finding them are designed and they are studied to give tight bounds on the price of anarchy and price of stability of the popular matching problem. Expand
Convex Hulls of Orbits and Orientations of a Moving Protein Domain
• Mathematics, Computer Science
• Discret. Comput. Geom.
• 2010
We study the facial structure and Carathéodory number of the convex hull of an orbit of the group of rotations in ℝ3 acting on the space of pairs of anisotropic symmetric 3×3 tensors. This isExpand