English

Continuous Sensitivity and Reversibility

Combinatorics 2018-06-19 v2 Discrete Mathematics

Abstract

Let nn be a positive integer and ff a differentiable function from a convex subset CC of the Euclidean space Rn\mathbb{R}^n to a smooth manifold. We define an invariant of ff via counting certain threshold functions associated to ff. We call this invariant the continuous sensitivity of ff and denote it by csC(f)\mathrm{cs}_{C}(f). This invariant is a real number between 00 and nn and measures how sensitive ff is to change in its input variables. For example, if ff is a constant function then csC(f)=0\mathrm{cs}_{C}(f)=0. On the other extreme, if csC(f)=n\mathrm{cs}_{C}(f)=n then ff is one-to-one on CC. This last statement is important for reversibility problems. To say that a function is reversible one can write an explicit inverse of the function. However, this is not always easy. Even a multilinear function can have a complicated inverse function. Here we give tools to compute continuous sensitivity which makes it possible to answer reversibility problems without finding explicit inverse functions.

Keywords

Cite

@article{arxiv.1601.05988,
  title  = {Continuous Sensitivity and Reversibility},
  author = {Aslı Güçlükan İlhan and Özgün Ünlü},
  journal= {arXiv preprint arXiv:1601.05988},
  year   = {2018}
}
R2 v1 2026-06-22T12:34:51.361Z