Krzysztof Chris Ciesielski
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Krzysztof Chris Ciesielski has a total of 45 co-authors. Here are the top co-authors by number of shared publications:
- Juan Benigno Seoane-Sepúlveda
Instituto de Matemática Interdisciplinar (IMI), Departamento de Análisis Matemático y Matemática Aplicada, Facultad de Ciencias Matemáticas, Universidad Complutense de Madrid, Madrid, Spain
6 shared publications Jayaram K. Udupa
Department of Radiology, MIPG, University of Pennsylvania, Blockley Hall, 4th Floor, 423 Guardian Drive, Philadelphia, PA 19104-6021, United States
4 shared publications- Paulo André Vechiatto Miranda
Institute of Mathematics and Statistics, University of São Paulo, São Paulo, Brazil
4 shared publications - Tomasz Natkaniec
Institute of Mathematics, Faculty of Mathematics, Physics and Informatics, University of Gdańsk, Gdańsk, Poland
4 shared publications - Daniel L. Rodriguez-Vidanes
Grupo de Investigación: Análisis Matemático y Aplicaciones, Departamento de Matemática Aplicada a la Ingeniería Industrial, Escuela Técnica Superior de Ingeniería y Diseño Industrial, Universidad Politécnica de Madrid, Madrid, Spain
3 shared publications - Gbrel M. Albkwre
Department of Mathematics, West Virginia University, Morgantown, USA
3 shared publications
Latest Publications
- Open Access
- 14 November 2022
- Published by Springer Nature in Revista de la Real Academia de Ciencias Exactas, Fisicas y Naturales. Serie A. Matematicas
- Vol. 117 (1) , 1-15
Almost continuous Sierpiński–Zygmund functions under different set-theoretical assumptions
A function $$f:\mathbb {R}\rightarrow \mathbb {R}$$ is: almost continuous in the sense of Stallings, $$f\in \textrm{AC}$$ , if each open set $$G\subset \mathbb {R}^2$$ containing the graph of f contains also the graph of a continuous function $$g:\mathbb {R}\rightarrow \mathbb {R}$$ ; Sierpiński–Zygmund, $$f\in \textrm{SZ}$$ (or, more generally, $$f\in \textrm{SZ}(\textrm{Bor})$$ ), provided its restriction $$f\restriction M$$ is discontinuous (not Borel, respectively) for any $$M\subset \mathbb {R}$$ of cardinality continuum. It is known that an example of a Sierpiński–Zygmund almost continuous function $$f:\mathbb {R}\rightarrow \mathbb {R}$$ (i.e., an $$f\in \textrm{SZ}\cap \textrm{AC}$$ ) cannot be constructed in ZFC; however, an $$f\in \textrm{SZ}\cap \textrm{AC}$$ exists under the additional set-theoretical assumption $${{\,\textrm{cov}\,}}(\mathcal {M})=\mathfrak {c}$$ , that is, that $$\mathbb {R}$$ cannot be covered by less than $$\mathfrak {c}$$ -many meager sets. The primary purpose of this paper is to show that the existence of an $$f\in \textrm{SZ}\cap \textrm{AC}$$ is also consistent with ZFC plus the negation of $${{\,\textrm{cov}\,}}(\mathcal {M})=\mathfrak {c}$$ . More precisely, we show that it is consistent with ZFC+ $${{\,\textrm{cov}\,}}(\mathcal {M})<\mathfrak {c}$$ (follows from the assumption that $${{\,\textrm{non}\,}}(\mathcal {N})<{{\,\textrm{cov}\,}}(\mathcal {N})=\mathfrak {c}$$ ) that there is an $$f\in \textrm{SZ}(\textrm{Bor})\cap \textrm{AC}$$ and that such a map may have even stronger properties expressed in the language of Darboux-like functions. We also examine, assuming either $${{\,\textrm{cov}\,}}(\mathcal {M})=\mathfrak {c}$$ or $${{\,\textrm{non}\,}}(\mathcal {N})<{{\,\textrm{cov}\,}}(\mathcal {N})=\mathfrak {c}$$ , the lineability and the additivity coefficient of the class of all almost continuous Sierpiński–Zygmund functions. Several open problems are also stated.- 14 November 2022
- Published by Springer Nature in Revista de la Real Academia de Ciencias Exactas, Fisicas y Naturales. Serie A. Matematicas
- Vol. 117 (1) , 1-15
Open AccessAlmost continuous Sierpiński–Zygmund functions under different set-theoretical assumptions
A function $$f:\mathbb {R}\rightarrow \mathbb {R}$$ is: almost continuous in the sense of Stallings, $$f\in \textrm{AC}$$ , if each open set $$G\subset \mathbb {R}^2$$ containing the graph of f contains also the graph of a continuous function $$g:\mathbb {R}\rightarrow \mathbb {R}$$ ; Sierpiński–Zygmund, $$f\in \textrm{SZ}$$ (or, more generally, $$f\in \textrm{SZ}(\textrm{Bor})$$ ), provided its restriction $$f\restriction M$$ is discontinuous (not Borel, respectively) for any $$M\subset \mathbb {R}$$ of cardinality continuum. It is known that an example of a Sierpiński–Zygmund almost continuous function $$f:\mathbb {R}\rightarrow \mathbb {R}$$ (i.e., an $$f\in \textrm{SZ}\cap \textrm{AC}$$ ) cannot be constructed in ZFC; however, an $$f\in \textrm{SZ}\cap \textrm{AC}$$ exists under the additional set-theoretical assumption $${{\,\textrm{cov}\,}}(\mathcal {M})=\mathfrak {c}$$ , that is, that $$\mathbb {R}$$ cannot be covered by less than $$\mathfrak {c}$$ -many meager sets. The primary purpose of this paper is to show that the existence of an $$f\in \textrm{SZ}\cap \textrm{AC}$$ is also consistent with ZFC plus the negation of $${{\,\textrm{cov}\,}}(\mathcal {M})=\mathfrak {c}$$ . More precisely, we show that it is consistent with ZFC+ $${{\,\textrm{cov}\,}}(\mathcal {M})<\mathfrak {c}$$ (follows from the assumption that $${{\,\textrm{non}\,}}(\mathcal {N})<{{\,\textrm{cov}\,}}(\mathcal {N})=\mathfrak {c}$$ ) that there is an $$f\in \textrm{SZ}(\textrm{Bor})\cap \textrm{AC}$$ and that such a map may have even stronger properties expressed in the language of Darboux-like functions. We also examine, assuming either $${{\,\textrm{cov}\,}}(\mathcal {M})=\mathfrak {c}$$ or $${{\,\textrm{non}\,}}(\mathcal {N})<{{\,\textrm{cov}\,}}(\mathcal {N})=\mathfrak {c}$$ , the lineability and the additivity coefficient of the class of all almost continuous Sierpiński–Zygmund functions. Several open problems are also stated. - 27 May 2022
- Published by Taylor & Francis in The American Mathematical Monthly
- Vol. 129 (7) , 647-659
Continuous Maps Admitting No Tangent Lines: A Centennial of Besicovitch Functions
One of the most influential examples in analysis is a Weierstrass function from to that is continuous but differentiable at no point. However this map, as well most of the others among the myriad similar examples, still admits vertical tangent lines. The examples of continuous maps that admit no tangent line in any direction are also known; however, all currently existing presentations of such maps are not easily accessible due to their very complicated descriptions and hard-to-follow proofs of their desired properties. The goal of this article is to present in an accessible way two such examples. The first—a coordinate of the classical Peano space-filling curve—is simpler, but admits one-sided vertical tangent lines at some points. The second is a variation of a function from a 1924 paper of Besicovitch, which is continuous but admits no one-sided tangent line in any direction. The proofs of nondifferentiability of these two examples will be facilitated by a simple yet general lemma that also implies nondifferentiability of other similar maps, including those of Takagi and van der Waerden.- 27 May 2022
- Published by Taylor & Francis in The American Mathematical Monthly
- Vol. 129 (7) , 647-659
Continuous Maps Admitting No Tangent Lines: A Centennial of Besicovitch Functions
One of the most influential examples in analysis is a Weierstrass function from to that is continuous but differentiable at no point. However this map, as well most of the others among the myriad similar examples, still admits vertical tangent lines. The examples of continuous maps that admit no tangent line in any direction are also known; however, all currently existing presentations of such maps are not easily accessible due to their very complicated descriptions and hard-to-follow proofs of their desired properties. The goal of this article is to present in an accessible way two such examples. The first—a coordinate of the classical Peano space-filling curve—is simpler, but admits one-sided vertical tangent lines at some points. The second is a variation of a function from a 1924 paper of Besicovitch, which is continuous but admits no one-sided tangent line in any direction. The proofs of nondifferentiability of these two examples will be facilitated by a simple yet general lemma that also implies nondifferentiability of other similar maps, including those of Takagi and van der Waerden.- 1 January 2022
- Published by Elsevier in Journal of Mathematical Analysis and Applications
- Vol. 505 (2)
c -lineability: A general method and its application to Darboux-like maps
- 1 January 2022
- Published by Elsevier in Journal of Mathematical Analysis and Applications
- Vol. 505 (2)
c -lineability: A general method and its application to Darboux-like maps
- 21 October 2021
- Published by Springer Nature in Revista de la Real Academia de Ciencias Exactas, Fisicas y Naturales. Serie A. Matematicas
- Vol. 116 (1) , 1-13
Maximal lineability of several subclasses of Darboux-like maps on ${\mathbb {R}}$- 21 October 2021
- Published by Springer Nature in Revista de la Real Academia de Ciencias Exactas, Fisicas y Naturales. Serie A. Matematicas
- Vol. 116 (1) , 1-13
Maximal lineability of several subclasses of Darboux-like maps on ${\mathbb {R}}$- 24 July 2021
- Published by Springer Nature in Revista de la Real Academia de Ciencias Exactas, Fisicas y Naturales. Serie A. Matematicas
- Vol. 115 (4) , 1-4
Maximal lineability of the class of Darboux not connectivity maps on ${\mathbb {R}}$- 24 July 2021
- Published by Springer Nature in Revista de la Real Academia de Ciencias Exactas, Fisicas y Naturales. Serie A. Matematicas
- Vol. 115 (4) , 1-4
Maximal lineability of the class of Darboux not connectivity maps on ${\mathbb {R}}$- Open Access
- 23 December 2020
- Published by Springer Nature in Results in Mathematics
- Vol. 76 (1) , 1-38
Additivity Coefficients for all Classes in the Algebra of Darboux-Like Maps on $\mathbb {R}$The class $$\mathbb D$$ of generalized continuous functions on $$\mathbb {R}$$ known under the common name of Darboux-like functions is usually described as consisting of eight families of maps: Darboux, connectivity, almost continuous, extendable, peripherally continuous, those having perfect road, and having either the Cantor Intermediate Value Property or the Strong Cantor Intermediate Value Property. The algebra $$\mathcal {A}(\mathbb D)$$ of classes of functions generated by these families contains 17 atoms. In this work we will calculate the values of the additivity coefficient $${{\,\mathrm{A}\,}}(\mathcal {F})$$ for all atoms $$\mathcal {F}$$ in the algebra $$\mathcal {A}(\mathbb D)$$ . We also determine the values $${{\,\mathrm{A}\,}}(\mathcal {F})$$ for a lot of other families $$\mathcal {F}\in \mathcal {A}(\mathbb D)$$ . Open questions and new directions of research shall also be provided.- 23 December 2020
- Published by Springer Nature in Results in Mathematics
- Vol. 76 (1) , 1-38
Open AccessAdditivity Coefficients for all Classes in the Algebra of Darboux-Like Maps on $\mathbb {R}$The class $$\mathbb D$$ of generalized continuous functions on $$\mathbb {R}$$ known under the common name of Darboux-like functions is usually described as consisting of eight families of maps: Darboux, connectivity, almost continuous, extendable, peripherally continuous, those having perfect road, and having either the Cantor Intermediate Value Property or the Strong Cantor Intermediate Value Property. The algebra $$\mathcal {A}(\mathbb D)$$ of classes of functions generated by these families contains 17 atoms. In this work we will calculate the values of the additivity coefficient $${{\,\mathrm{A}\,}}(\mathcal {F})$$ for all atoms $$\mathcal {F}$$ in the algebra $$\mathcal {A}(\mathbb D)$$ . We also determine the values $${{\,\mathrm{A}\,}}(\mathcal {F})$$ for a lot of other families $$\mathcal {F}\in \mathcal {A}(\mathbb D)$$ . Open questions and new directions of research shall also be provided. - 20 October 2020
- Published by Taylor & Francis in The American Mathematical Monthly
- Vol. 127 (9) , 807-819
Distinct Continuous Maps with All Riemann Sums Equal
Do examples as in the title exist? It depends on how the term Riemann sum is understood. For the standard, left, or right Riemann sums such examples do not exist. However, as we will see, they do exist for the lower and upper Riemann sums. Nevertheless, there are only a few examples of such pairs and they have a very simple structure. In this article, we describe all such pairs among Riemann integrable functions from an interval into . We also show that such pairs have an especially nice format when we restrict our attention to continuous maps. All the arguments presented are elementary. In particular, the part concerning continuous functions is self-contained and presented in a format accessible to good undergraduate students.- 20 October 2020
- Published by Taylor & Francis in The American Mathematical Monthly
- Vol. 127 (9) , 807-819
Distinct Continuous Maps with All Riemann Sums Equal
Do examples as in the title exist? It depends on how the term Riemann sum is understood. For the standard, left, or right Riemann sums such examples do not exist. However, as we will see, they do exist for the lower and upper Riemann sums. Nevertheless, there are only a few examples of such pairs and they have a very simple structure. In this article, we describe all such pairs among Riemann integrable functions from an interval into . We also show that such pairs have an especially nice format when we restrict our attention to continuous maps. All the arguments presented are elementary. In particular, the part concerning continuous functions is self-contained and presented in a format accessible to good undergraduate students.- Open Access
- 16 June 2020
- Published by Springer Nature in Journal of Mathematical Imaging and Vision
- Vol. 62 (5) , 737-750
Two Polynomial Time Graph Labeling Algorithms Optimizing Max-Norm-Based Objective Functions
Many problems in applied computer science can be expressed in a graph setting and solved by finding an appropriate vertex labeling of the associated graph. It is also common to identify the term “appropriate labeling” with a labeling that optimizes some application-motivated objective function. The goal of this work is to present two algorithms that, for the objective functions in a general format motivated by image processing tasks, find such optimal labelings. Specifically, we consider a problem of finding an optimal binary labeling for the objective function defined as the max-norm over a set of local costs of a form that naturally appears in image processing. It is well known that for a limited subclass of such problems, globally optimal solutions can be found via watershed cuts, that is, by the cuts associated with the optimal spanning forests of a graph. Here, we propose two new algorithms for optimizing a broader class of such problems. The first algorithm, that works for all considered objective functions, returns a globally optimal labeling in quadratic time with respect to the size of the graph (i.e., the number of its vertices and edges) or, for an image associated graph, the size of the image. The second algorithm is more efficient, with quasi-linear time complexity, and returns a globally optimal labeling provided that the objective function satisfies certain given conditions. These conditions are analogous to the submodularity conditions encountered in max-flow/min-cut optimization, where the objective function is defined as sum of all local costs. We will also consider a refinement of the max-norm measure, defined in terms of the lexicographical order, and examine the algorithms that could find minimal labelings with respect to this refined measure.
- 16 June 2020
- Published by Springer Nature in Journal of Mathematical Imaging and Vision
- Vol. 62 (5) , 737-750
Open AccessTwo Polynomial Time Graph Labeling Algorithms Optimizing Max-Norm-Based Objective Functions
Many problems in applied computer science can be expressed in a graph setting and solved by finding an appropriate vertex labeling of the associated graph. It is also common to identify the term “appropriate labeling” with a labeling that optimizes some application-motivated objective function. The goal of this work is to present two algorithms that, for the objective functions in a general format motivated by image processing tasks, find such optimal labelings. Specifically, we consider a problem of finding an optimal binary labeling for the objective function defined as the max-norm over a set of local costs of a form that naturally appears in image processing. It is well known that for a limited subclass of such problems, globally optimal solutions can be found via watershed cuts, that is, by the cuts associated with the optimal spanning forests of a graph. Here, we propose two new algorithms for optimizing a broader class of such problems. The first algorithm, that works for all considered objective functions, returns a globally optimal labeling in quadratic time with respect to the size of the graph (i.e., the number of its vertices and edges) or, for an image associated graph, the size of the image. The second algorithm is more efficient, with quasi-linear time complexity, and returns a globally optimal labeling provided that the objective function satisfies certain given conditions. These conditions are analogous to the submodularity conditions encountered in max-flow/min-cut optimization, where the objective function is defined as sum of all local costs. We will also consider a refinement of the max-norm measure, defined in terms of the lexicographical order, and examine the algorithms that could find minimal labelings with respect to this refined measure.
- 4 June 2020
- Published by Springer Nature in Revista de la Real Academia de Ciencias Exactas, Fisicas y Naturales. Serie A. Matematicas
- Vol. 114 (3) , 1-10
Lineability of the functions that are Sierpiński–Zygmund, Darboux, but not connectivity
- 4 June 2020
- Published by Springer Nature in Revista de la Real Academia de Ciencias Exactas, Fisicas y Naturales. Serie A. Matematicas
- Vol. 114 (3) , 1-10
Lineability of the functions that are Sierpiński–Zygmund, Darboux, but not connectivity