Skip to main content
SpringerLink
Log in

An Enhanced Arimoto Theorem on Threshold Transformations

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

It is proved that there exists a threshold transformation of {0,1}n such that for any 1≤k≤2n, its graph has a k-cycle that is the only cycle or loop. Implications on dynamical systems of neural networks are also discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. 37-30, 63rd St., 2F, Woodside, NY 11377, USA, , , , , , US

    Takao Ueda

Authors
  1. Takao Ueda
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: September 24, 1997 Final version received: September 21, 1998

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ueda, T. An Enhanced Arimoto Theorem on Threshold Transformations. Graphs Comb 17, 343–351 (2001). https://doi.org/10.1007/s003730170047

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s003730170047

Keywords

Search

Navigation