• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to project page

2003 Fiscal Year Final Research Report Summary

Application of Probabilistic Programming to the Multidimensional Data Compression Problem

Research Project

Project/Area Number 14540108
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeSingle-year Grants
Section一般
Research Field General mathematics (including Probability theory/Statistical mathematics)
Research InstitutionTokyo University of Science (2003)
Niigata University (2002)

Principal Investigator

AKASHI Shigeo  Tokyo University of Science, Faculty of Science and Engineering, Professor, 理工学部, 教授 (30202518)

Co-Investigator(Kenkyū-buntansha) OHYA Masanori  Tokyo University of Science, Faculty of Science and Engineering, Professor, 理工学部, 教授 (90112896)
TAKAHASHI Wataru  Tokyo Institute of Technology, Faculty of Science, Professor, 理学部, 教授 (40016142)
ISOGAI Eiichi  Niigata University, Faculty of Science, Professor, 理学部, 教授 (40108014)
MIYADERA Takayuki  Tokyo University of Science, Faculty of Science and Engineering, Assistant, 理工学部, 助手 (50339123)
Project Period (FY) 2002 – 2003
Keywordsepsilon entropy / data compression / Hilbert's 13th problem / uperposit ion representation / low band pass filter / Poisoon kernels / Approximate identity / Gibbs penomena
Research Abstract

The contents of the researchers published during two years from 2002 till 2003 can be classified into two parts, which are satated as follows :
(1).The solution to an open problem related to Hubert's 13th problem.
The 13th problem formulated by Hubert, which asks if any continuous functions of several variables can be represented as superpositions constructed from several continuous functions of fewer variables, was solved by Kolmogorov and Arnold after about fifty years.Actually, theentire function theoretic problem asking if any entire functions of several variables can be represented as superpositions constructed from several entire functions of fewer variables has remained to be solved.The representative of this research project has succeeded in giving the solution to this open problem which is based on entropy theoretic methods.
(2).A relation between the superposition representation proble'm and the theory of nomographs.
Primarily, it has been shown that the concept of superposition irrepresentability can be classified. into two concepts which is called strong superposition irrepresentability and weak superposition irepresentability, respectively.Moreover, there does not exist any nomographs enabling to estimate the values of the functions of several variables if they are strongly irrepresentable, and, for a certain positive integer k, there does not exist any nomographs enabling to estimate the values of the functions of several variables by at least k-time operations if they are weakly irrepresentable.

  • Research Products

    (6 results)

All Other

All Publications (6 results)

  • [Publications] K.Sakai, S.Akashi: "Set-valued theoretic characterization of Stackelberg equilibrium points"Proceedings of the 2nd International Conference on Nonlinear and Convex Analysis. 443-449 (2002)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] S.Akashi: "A version of Hilbert's 13th problem for analytic functions"The Bulletin of the London Mathematical Society. 35. 8-14 (2003)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] S.Akashi, S.Iriyama: "Estimation of complexity for the Ohya-Masuda-Volovich SAT algorithm"Open Systems and Information Dynamics. (to be published).

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] K.Sakai, S.Akashi: "Set-valued theoretic characterization of Stackelberg equilibrium points"Proceedings of the 2nd International Conference on Nonlinear and Convex Analysis. 443-449 (2002)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] S.Akashi: "A version of Hilbert's 13th problem for analytic functions"The London Mathematical Society. 35. 8-14 (2003)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] S.Akashi, S.Iriyama: "Estimation of complexity for the Ohya-Masuda-Volovich SAT algorithm"to be published in Open Systems Open Systems and Inforamation Dynamics.

    • Description
      「研究成果報告書概要(欧文)」より

URL: 

Published: 2005-04-19  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi