Linear symmetries of Boolean functions

نویسنده

  • Wenjun Xiao
چکیده

In this note we study the linear symmetry group LS(f ) of a Boolean function f of n variables, that is, the set of all ∈ GLn(2) which leave f invariant, where GLn(2) is the general linear group on the field of two elements. The main problem is that of concrete representation: which subgroups G of GLn(2) can be represented as G= LS(f ) for some n-ary k-valued Boolean function f. We call such subgroups linearly representable. The main results of the note may be summarized as follows: We give a necessary and sufficient condition that a subgroup ofGLn(2) is linearly representable and obtain some results on linear representability of its subgroups. Our results generalize some theorems from P. Clote and E. Kranakis [SIAM J. Comput. 20 (1991) 553–590];A. Kisielewicz [J.Algebra 199 (1998) 379–403]. © 2005 Elsevier B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES

Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...

متن کامل

Fast computation of symmetries in Boolean functions

Symmetry detection in completely specified Boolean functions is important for several applications in logic synthesis, technology mapping, BDD minimization, and testing. This paper presents a new algorithm to detect four basic types of two-variable symmetries. The algorithm detects all pairs of symmetric variables in one pass over the shared BDD of the multi-output function. The worst-case comp...

متن کامل

Information Measures in Detecting and Recognizing Symmetries

This paper presents a method to detect and recognize symmetries in Boolean functions. The idea is to use information theoretic measures of Boolean functions to detect sub-space of possible symmetric variables. Coupled with the new techniques of efficient estimations of information measures on Binary Decision Diagrams (BDDs) we obtain promised results in symmetries detection for large-scale func...

متن کامل

Antisymmetries in the realization of Boolean functions

New symmetries of degree two are introduced, along with spectral techniques for identifying these symmetries. Some applications of these symmetries are discussed, in particular their application to the construction of binary decision diagrams and the implementation of Boolean functions.

متن کامل

Generalized Symmetries in Boolean Functions: Fast Computation and Application to Boolean Matching

In recent years, the notion of symmetry has been extended from classical symmetries to also include constant cofactor symmetries, single variable symmetries and Kronecker symmetries. All these symmetries form a generalized symmetry scheme. Existing methods to detect generalized symmetries require computing the cofactors for each pair of variables to check certain relationships between the cofac...

متن کامل

The Complexity of Detecting Symmetric Functions

The characterization of the symmetries of boolean functions is important both in automatic layout synthesis, and in automatic verification of manually created layouts. It is possible to characterize the symmetries of an n-input boolean function as an arbitrary subgroup, G, of Sn, the symmetric group of order n. Given an expression e, which represents an n-input boolean function F, and a subgrou...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete Applied Mathematics

دوره 149  شماره 

صفحات  -

تاریخ انتشار 2005