presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. the method is easy to u...

This paper concerns the form-finding problem for general and symmetric tensegrity structures with shape constraints. A number of different geometries are treated and several fundamental properties of tensegrity structures are identified that simplify the form-finding problem. The concept of a tensegrity invariance (similarity) transformation is defined and it is shown that tensegrity equilibriu...

In this paper we investigate the Boolean functions with essential arity gap 2. We use Full Conjunctive Normal Forms instead of Zhegalkin’s polynomials, which allow us to simplify the proofs and to obtain several combinatorial results, concerning the Boolean functions with a given arity gap.

The class of finitely presented algebras over a field K with a set of generators a1, . . . , an and defined by homogeneous relations of the form a1a2 · · · an = aσ(a)aσ(2) · · · aσ(n), where σ runs through a subset H of the symmetric group Sym n of degree n, is introduced. The emphasis is on the case of a cyclic subgroup H of Sym n of order n. A normal form of elements of the algebra is obtaine...

In this paper we present a constructive detection of minimal monomials in the algebraic normal form of rotation symmetric Boolean functions (immune to circular translation of indices). This helps in constructing rotation symmetric Boolean functions by respecting the rules we present here.  2003 Elsevier B.V. All rights reserved.