Article
Licensed
Unlicensed
Requires Authentication
On the number of reversible homogeneous structures
-
I. V. Kucherenko
Published/Copyright:
July 1, 2003
We estimate the number r (n,m) of functions of n-valued logic in m + 1 variables which are local transition functions of reversible homogeneous structures with arbitrary fixed neighbourhood pattern consisting of m vectors. It follows from the results obtained in the paper that if n → ∞, then
ln r (n,m) ∼ nm+1 ln n
uniformly in m.
Published Online: 2003-07-01
Published in Print: 2003-07-01
Copyright 2003, 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
- Independent systems of automata in labyrinths
- Estimation of the time needed to set up a covert channel
- Schemes of public distribution of keys based on a non-commutative group
- Characteristic polynomials of multi-index transportation problems
- Construction of maximally non-Hamiltonian graphs
- Generating triples of involutions of large sporadic groups
- On the number of reversible homogeneous structures
- Random partitions of a set with given number of blocks
- On two statistics of chi-square type based on frequencies of tuples of states of a high-order Markov chain
Articles in the same Issue
- Independent systems of automata in labyrinths
- Estimation of the time needed to set up a covert channel
- Schemes of public distribution of keys based on a non-commutative group
- Characteristic polynomials of multi-index transportation problems
- Construction of maximally non-Hamiltonian graphs
- Generating triples of involutions of large sporadic groups
- On the number of reversible homogeneous structures
- Random partitions of a set with given number of blocks
- On two statistics of chi-square type based on frequencies of tuples of states of a high-order Markov chain
