Dušan Pokorný
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Dušan Pokorný has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Jan Rataj
Charles University, Prague
5 shared publications - Luděk Zajíček
Charles University, Faculty of Mathematics and Physics, Sokolovská 83, 186 75 Praha 8, Czech Republic
3 shared publications - Ondřej Kurka
Institute of Mathematics, Czech Academy of Sciences, Prague, Czech Republic
2 shared publications - Jaroslav Lukeš
Charles University
1 shared publication - Joseph H. G. Fu
Department of Mathematics, University of Georgia, Athens, USA
1 shared publication Joseph H.G. Fu
1 shared publication
Latest Publications
- 15 July 2021
- Published by Institute of Mathematics, Czech Academy of Sciences in Czechoslovak Mathematical Journal
- Vol. 72 (1) , 1-38
A characterization of sets in ${\mathbb R}^2$ with DC distance functionInstitute of Mathematics of the Czech Academy of Sciences
- 15 July 2021
- Published by Institute of Mathematics, Czech Academy of Sciences in Czechoslovak Mathematical Journal
- Vol. 72 (1) , 1-38
A characterization of sets in ${\mathbb R}^2$ with DC distance functionInstitute of Mathematics of the Czech Academy of Sciences
- Open AccessA characterization of sets in $\mathbb{R}^2$ with DC distance functionWe give a complete characterization of closed sets $F \subset \mathbb{R}^2$ whose distance function $d_F:= \mathrm{dist}(\cdot,F)$ is DC (i.e., is the difference of two convex functions on $\mathbb{R}^2$). Using this characterization, a number of properties of such sets is proved.Open AccessA characterization of sets in $\mathbb{R}^2$ with DC distance functionWe give a complete characterization of closed sets $F \subset \mathbb{R}^2$ whose distance function $d_F:= \mathrm{dist}(\cdot,F)$ is DC (i.e., is the difference of two convex functions on $\mathbb{R}^2$). Using this characterization, a number of properties of such sets is proved.
- Open Access
On the asymptotics of counting functions for Ahlfors regular sets
In this paper we deal with the so-called Ahlfors regular sets (also known as $s$-regular sets) in metric spaces. First we show that those sets correspond to a certain class of tree-like structures. Building on this observation we then study the following question: under which conditions does the limit $\lim_{\varepsilon\to 0+} \varepsilon^s N(\varepsilon,K)$ exist, where $K$ is an $s$-regular set and $N(\varepsilon,K)$ is for instance the $\varepsilon$-packing number of $K$?Open AccessOn the asymptotics of counting functions for Ahlfors regular sets
In this paper we deal with the so-called Ahlfors regular sets (also known as $s$-regular sets) in metric spaces. First we show that those sets correspond to a certain class of tree-like structures. Building on this observation we then study the following question: under which conditions does the limit $\lim_{\varepsilon\to 0+} \varepsilon^s N(\varepsilon,K)$ exist, where $K$ is an $s$-regular set and $N(\varepsilon,K)$ is for instance the $\varepsilon$-packing number of $K$? - Open AccessOn sets in ${\mathbb R}^d$ with DC distance functionWe study closed sets $F \subset {\mathbb R}^d$ whose distance function $d_F:= {\rm dist}\,(\cdot,F)$ is DC (i.e., is the difference of two convex functions on ${\mathbb R}^d$). Our main result asserts that if $F \subset {\mathbb R}^2$ is a graph of a DC function $g:{\mathbb R}\to {\mathbb R}$, then $F$ has the above property. If $d>1$, the same holds if $g:{\mathbb R}^{d-1}\to {\mathbb R}$ is semiconcave, however the case of a general DC function $g$ remains open.Open AccessOn sets in ${\mathbb R}^d$ with DC distance functionWe study closed sets $F \subset {\mathbb R}^d$ whose distance function $d_F:= {\rm dist}\,(\cdot,F)$ is DC (i.e., is the difference of two convex functions on ${\mathbb R}^d$). Our main result asserts that if $F \subset {\mathbb R}^2$ is a graph of a DC function $g:{\mathbb R}\to {\mathbb R}$, then $F$ has the above property. If $d>1$, the same holds if $g:{\mathbb R}^{d-1}\to {\mathbb R}$ is semiconcave, however the case of a general DC function $g$ remains open.
- 29 March 2019
- Published by Wiley in Mathematische Nachrichten
- Vol. 292 (7) , 1595-1626
On the structure of WDC sets
- 29 March 2019
- Published by Wiley in Mathematische Nachrichten
- Vol. 292 (7) , 1595-1626
On the structure of WDC sets
- 21 September 2017
- Published by EDP Sciences in ESAIM: Control, Optimisation and Calculus of Variations
- Vol. 23 (4) , 1617-1648
Notes on the trace problem for separately convex functions
We discuss the following question: for a function f of two or more variables which is convex in the directions of coordinate axes, what can its trace g(x) = f(x,x,...,x) look like? In the two-dimensional case, we provide some necessary and sufficient conditions, as well as some examples illustrating that our approach does not seem to be appropriate for finding a characterization in full generality. For a concave function g, however, a characterization in the two-dimensional case is established.
- 21 September 2017
- Published by EDP Sciences in ESAIM: Control, Optimisation and Calculus of Variations
- Vol. 23 (4) , 1617-1648
Notes on the trace problem for separately convex functions
We discuss the following question: for a function f of two or more variables which is convex in the directions of coordinate axes, what can its trace g(x) = f(x,x,...,x) look like? In the two-dimensional case, we provide some necessary and sufficient conditions, as well as some examples illustrating that our approach does not seem to be appropriate for finding a characterization in full generality. For a concave function g, however, a characterization in the two-dimensional case is established.
- 1 April 2017
- Published by Elsevier in Advances in Mathematics
- Vol. 311, 796-832
Kinematic formulas for sets defined by differences of convex functions
- 1 April 2017
- Published by Elsevier in Advances in Mathematics
- Vol. 311, 796-832
Kinematic formulas for sets defined by differences of convex functions
- Open Access
Kinematic formulas for sets defined by differences of convex functions
Two of the authors have defined the class $ WDC(M)$ as the class of all subsets of a smooth manifold $M$ that may be expressed in local coordinates as certain sublevel sets of DC (differences of convex) functions. If $M$ is Riemanian and $G$ is a group of isometries acting transitively on the sphere bundle $SM$, we define the invariant curvature measures of compact \WDC~ subsets of $M$, and show that pairs of such subsets are subject to the array of kinematic formulas known to apply to smoother sets. Restricting to the case $(M, G) = (\mathbb R^d, \overline{SO(d)})$, this extends and subsumes Federer's theory of sets with positive reach in an essential way. The key technical point is equivalent to a sharpening of a classical theorem of Ewald, Larman, and Rogers characterizing the dimension of the set of directions of line segments lying in the boundary of a given convex body.Open AccessKinematic formulas for sets defined by differences of convex functions
Two of the authors have defined the class $ WDC(M)$ as the class of all subsets of a smooth manifold $M$ that may be expressed in local coordinates as certain sublevel sets of DC (differences of convex) functions. If $M$ is Riemanian and $G$ is a group of isometries acting transitively on the sphere bundle $SM$, we define the invariant curvature measures of compact \WDC~ subsets of $M$, and show that pairs of such subsets are subject to the array of kinematic formulas known to apply to smoother sets. Restricting to the case $(M, G) = (\mathbb R^d, \overline{SO(d)})$, this extends and subsumes Federer's theory of sets with positive reach in an essential way. The key technical point is equivalent to a sharpening of a classical theorem of Ewald, Larman, and Rogers characterizing the dimension of the set of directions of line segments lying in the boundary of a given convex body. - Open Access
Notes on the trace problem for separately convex functions
We discuss the following question: For a function f of two or more variables which is convex in the directions of coordinate axes, how can its trace g(x) = f(x, x, ..., x) look like? In the two-dimensional case, we provide some necessary and sufficient conditions, as well as some examples illustrating that our approach does not seem to be appropriate for finding a characterization in full generality. For a concave function g, however, a characterization in the two-dimensional case is established.
Open AccessNotes on the trace problem for separately convex functions
We discuss the following question: For a function f of two or more variables which is convex in the directions of coordinate axes, how can its trace g(x) = f(x, x, ..., x) look like? In the two-dimensional case, we provide some necessary and sufficient conditions, as well as some examples illustrating that our approach does not seem to be appropriate for finding a characterization in full generality. For a concave function g, however, a characterization in the two-dimensional case is established.