Article
Licensed
Unlicensed Requires Authentication

Finding and estimating the number of repetition-free Boolean functions over the elementary basis in the form of a convergent series

Published/Copyright: January 11, 2010
Become an author with De Gruyter Brill
Author Information Explore this Subject
Discrete Mathematics and Applications
From the journal Volume 19 Issue 5

Abstract

We obtain a representation of the number Kn of repetition-free Boolean functions of n variables over the elementary basis {&, ∨,¯} in the form of a convergent exponential power series. This representation is the simplest representation among a number of similar formulas containing different combinatorial numbers. The obtained result gives a possibility to find the asymptotics of Kn.

Received: 2008-03-11
Published Online: 2010-01-11
Published in Print: 2009-December

© de Gruyter 2009

Articles in the same Issue

  1. The key space of the McEliece–Sidelnikov cryptosystem
  2. On the game-theoretical approach to the analysis of authentication codes
  3. Finding and estimating the number of repetition-free Boolean functions over the elementary basis in the form of a convergent series
  4. Problems on independence systems solvable by the greedy algorithm
  5. Defragmentation of permutation tables with four columns
  6. Nondegenerate colourings in the Brooks theorem
https://doi.org/10.1515/DMA.2009.033

Articles in the same Issue

  1. The key space of the McEliece–Sidelnikov cryptosystem
  2. On the game-theoretical approach to the analysis of authentication codes
  3. Finding and estimating the number of repetition-free Boolean functions over the elementary basis in the form of a convergent series
  4. Problems on independence systems solvable by the greedy algorithm
  5. Defragmentation of permutation tables with four columns
  6. Nondegenerate colourings in the Brooks theorem
Downloaded on 13.4.2026 from https://www.degruyterbrill.com/document/doi/10.1515/DMA.2009.033/html
Scroll to top button