Article
Licensed
Unlicensed
Requires Authentication
On the number of closure-type mappings
-
V. B. Alekseev
Published/Copyright:
July 1, 2004
In this paper, we consider mappings of Cartesian powers Sn of an arbitrary partially ordered set S into itself which possess the main properties of closures. For each partially ordered set, we describe the asymptotic behaviour of the logarithm of the number of such mappings as n → ∞.
Published Online: 2004-07-01
Published in Print: 2004-07-01
Copyright 2004, Walter de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- On the number of closure-type mappings
- Spectral properties of a linear congruent generator in special cases
- On the key space of the McEliece cryptosystem based on binary Reed–Muller codes
- On the complexity of polarised polynomials of multi-valued logic functions in one variable
- Simulation of circuits of functional elements by the universal Turing machine
- Implementation of Markov chains over Galois fields
- On solving automaton equations
- Boundaries of random triangulation of a disk
- On the accuracy of approximation in the Poisson limit theorem
Articles in the same Issue
- On the number of closure-type mappings
- Spectral properties of a linear congruent generator in special cases
- On the key space of the McEliece cryptosystem based on binary Reed–Muller codes
- On the complexity of polarised polynomials of multi-valued logic functions in one variable
- Simulation of circuits of functional elements by the universal Turing machine
- Implementation of Markov chains over Galois fields
- On solving automaton equations
- Boundaries of random triangulation of a disk
- On the accuracy of approximation in the Poisson limit theorem
