A Communication Approach to the Superposition Problem

  • Authors:

  • Farid Ablayev;Svetlana Ablayeva

  • Affiliations:

  • (Correspd.) Departmnt of Theoretical Cybernetics, Kazan State University, Kazan, Russia. fablayev@gmail.com;Department of Differential Equations, Kazan State University, Kazan, Russia

  • Venue:
  • Fundamenta Informaticae - Hardest Boolean Functions and O.B. Lupanov
  • Year:
  • 2010

Quantified Score

Hi-index 0.02

Visualization

Abstract

In function theory the superposition problem is known as the problem of representing a continuous function f(x1, … ,xk) in k variables as the composition of “simpler” functions. This problem stems from the Hilbert's thirteenth problem. In computer science good formalization for the notion of composition of functions is formula. In the paper we consider real-valued continuous functions in k variables in the cube [0,1]k from the class ℋk&ohgr;p with &ohgr;p a special modulus of continuity (measure the smoothness of a function) defined in the paper. ℋk&ohgr;p is a superset of Hölder class of functions. We present an explicit function f ∈ ℋk&ohgr;p which is hard in the sense that it cannot be represented in the following way as a formula: zero level (input) gates associated with variables {x1, … ,xk} (different input gates can be associated with the same variable xi ∈ {x1, … ,xk}), on the first level of the formula, arbitrary number s ≥ 1 of t variable functions from ℋt&ohgr;p for t