English
Related papers

Related papers: An invitation to the study of a uniqueness problem

200 papers

A map $f:X\to Y$ between topological spaces is defined to be {\em scatteredly continuous} if for each subspace $A\subset X$ the restriction $f|A$ has a point of continuity. We show that for a function $f:X\to Y$ from a perfectly paracompact…

Geometric Topology · Mathematics 2011-10-11 T. Banakh , B. Bokalo

We show that an arbitrary factor map $\pi:X \to Y$ on an irreducible subshift of finite type is a composition of a finite-to-one factor code and a class degree one factor code. Using this structure theorem on infinite-to-one factor codes,…

Dynamical Systems · Mathematics 2018-02-02 Jisang Yoo

Lower bounds involving $f$-divergences between the underlying probability measures are proved for the minimax risk in estimation problems. Our proofs just use simple convexity facts. Special cases and straightforward corollaries of our…

Statistics Theory · Mathematics 2011-02-22 Adityanand Guntuboyina

This work considers two popular minimization problems: (i) the minimization of a general convex function $f(\mathbf{X})$ with the domain being positive semi-definite matrices; (ii) the minimization of a general convex function…

Information Theory · Computer Science 2019-02-22 Qiuwei Li , Zhihui Zhu , Gongguo Tang

A real valued function $f$ defined on a convex $K$ is anemconvex function iff it satisfies $$ f((x+y)/2) \le (f(x)+f(y))/2 + 1. $$ A thorough study of approximately convex functions is made. The principal results are a sharp universal upper…

Metric Geometry · Mathematics 2007-05-23 S. J. Dilworth , Ralph Howard , James W. Roberts

For an old problem of Euler's elastica we prove the novel global property that every planar elastica with non-constant monotone curvature is uniquely minimal subject to the clamped boundary condition. We also partly extend this unique…

Analysis of PDEs · Mathematics 2026-01-27 Tatsuya Miura , Glen Wheeler

Let $F$ be a set-valued mapping which to each point $x$ of a metric space $({\mathcal M},\rho)$ assigns a convex closed set $F(x)\subset{\bf R}^2$. We present several constructive criteria for the existence of a Lipschitz selection of $F$,…

Functional Analysis · Mathematics 2023-06-27 Pavel Shvartsman

We study the maximum Hamming distance (or rather, the complementary notion of "minimum approximability") of a general function on a finite group $G$ to either of the sets $\operatorname{End}(G)$ and $\operatorname{Aff}(G)$, of group…

Group Theory · Mathematics 2019-10-31 Alexander Bors

Let us consider the autonomous obstacle problem \begin{equation*} \min_v \int_\Omega F(Dv(x)) \, dx \end{equation*} on a specific class of admissible functions, where we suppose the Lagrangian satisfies proper hypotheses of convexity and…

Analysis of PDEs · Mathematics 2023-07-25 Samuele Riccò , Andrea Torricelli

In this paper we extend certain central results of zero dimensional systems to higher dimensions. The first main result shows that if (Y,f) is a finitely presented system, then there exists a Smale space (X,F) and a u-resolving factor map…

Dynamical Systems · Mathematics 2009-10-02 Todd Fisher

Consider the class of zero-mean functions with fixed $L^{\infty}$ and $L^1$ norms and exactly $N\in \mathbb{N}$ nodal points. Which functions $f$ minimize $W_p(f_+,f_-)$, the Wasserstein distance between the measures whose densities are the…

Classical Analysis and ODEs · Mathematics 2023-06-26 Qiang Du , Amir Sagiv

In this paper we study the right differentiability of a parametric infimum function over a parametric set defined by equality constraints. We present a new theorem with sufficient conditions for the right differentiability with respect to…

Optimization and Control · Mathematics 2023-06-22 Kevin Sturm

In this paper, we prove that if $E$ is a uniquely remotal subset of a real normed linear space $X$ such that $E$ has a Chebyshev center $c \in X$ and the farthest point map $F:X\rightarrow E$ restricted to $[c,F(c)]$ is partially…

Functional Analysis · Mathematics 2020-05-28 Sumit Som , Lakshmi Kanta Dey , Sudeshna Basu

We show that in finite-dimensional nonlinear approximations, the best $r$-term approximant of a function $f$ almost always exists over $\mathbb{C}$ but that the same is not true over $\mathbb{R}$, i.e., the infimum $\inf_{f_1,\dots,f_r \in…

Numerical Analysis · Mathematics 2018-09-07 Yang Qi , Mateusz Michałek , Lek-Heng Lim

Optimization problems under affine constraints appear in various areas of machine learning. We consider the task of minimizing a smooth strongly convex function F(x) under the affine constraint Kx=b, with an oracle providing evaluations of…

Optimization and Control · Mathematics 2022-04-12 Adil Salim , Laurent Condat , Dmitry Kovalev , Peter Richtárik

It is solved the problem on construction of separately continuous functions on product of $n$ topological spaces with given restriction. In particular, it is shown that for every topological space $X$ and $n-1$ Baire class function $g:X\to…

General Topology · Mathematics 2016-02-02 V. V. Mykhaylyuk

We study certain topological problems that are inspired by applications to autonomous robot manipulation. Consider a continuous map $f\colon X\to Y$, where $f$ can be a kinematic map from the configuration space $X$ to the working space $Y$…

Algebraic Topology · Mathematics 2019-12-04 Petar Pavešić

It is well known that the entropy $H(X)$ of a discrete random variable $X$ is always greater than or equal to the entropy $H(f(X))$ of a function $f$ of $X$, with equality if and only if $f$ is one-to-one. In this paper, we give tight…

Information Theory · Computer Science 2017-12-22 Ferdinando Cicalese , Luisa Gargano , Ugo Vaccaro

We analyze the convergence behavior of \emph{globally weakly} and \emph{locally strongly contracting} dynamics. Such dynamics naturally arise in the context of convex optimization problems with a unique minimizer. We show that convergence…

Optimization and Control · Mathematics 2024-05-17 Veronica Centorrino , Alexander Davydov , Anand Gokhale , Giovanni Russo , Francesco Bullo

We consider a class of l0-minimization problems, which is to search for the partial sparsest solution to an underdetermined linear system with additional constraints. We introduce several concepts, including lp-induced norm (0 < p < 1),…

Information Theory · Computer Science 2013-12-17 Chunlei Xu , Yun-Bin Zhao