We have developed a new technique, which is complementary to other procedures, that will have wide applicability for generating new feasible framework structures with defined microporous architectures from the knowledge of only the unit cell dimensions, constituent elements and by defining forbidden regions within the unit cell.

In this paper using strongly duplexes we introduce a new class of (semi)hypergroups. The associated (semi)hypergroup from a strongly duplex is called duplex (semi)hypergroup. Two computer programs written in MATLAB show that the two groups Z2n and Zn × Z2 produce a strongly duplex and its associated hypergroup is a complementary feasible hypergroup.

We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational information about the theorem being proved. This includes extracting feasible algorithms, deterministic or interactive, for witnessing an existential quantifier, a uniform family of short propositional proofs of instance...

We present a new corrector-predictor method for solving sufficient linear complementarity problems for which a sufficiently centered feasible starting point is available. In contrast with its predictor-corrector counterpart proposed by Miao, the method does not depend on the handicap κ of the problem. The method has O((1+ κ)√nL)-iteration complexity, the same as Miao’s method, but our error est...

In this thesis, we survey the current research into self-complementary hypergraphs, and present several new results. We characterize the cycle type of the permutations on n elements with order equal to a power of 2 which are k-complementing. The k-complementing permutations map the edges of a k-uniform hypergraph to the edges of its complement. This yields a test to determine whether a finite p...