This paper introduces new type of m-ary systolic arrays called m-ary reversible systolic arrays which extends the new concept of two-valued reversible systolic arrays that was introduced in the first part of my article. The m-ary quantum systolic architectures’ computations of the new type of systolic arrays are also introduced. The new m-ary systolic arrays maintain the high level of regularit...

Explicit product formulas are obtained for families of multivariate polynomials which are orthogonal on simplices and on a parabolic biangle in R. These product formulas are shown to give rise to measure algebras which are hypergroups. The article also includes an elementary proof that the Michael topology for the space of compact subsets of a topological space (which is used in the definition ...

Let H be an ultraspherical hypergroup associated to a locally compact group G and let A(H) the Fourier algebra of H. For left Banach A(H)-submodule X VN(H), define QX norm closure linear span set {u f : u ?A(H), ? X} in BA(H)(A(H),X

Let K be a locally compact hypergroup. In this paper, among other results we give sufficient condition for the inclusion LΦ1w (K) * LΦ2w ⊆ to hold. Also, as an application, provide new weighted Orlicz space LΦw convolution Banach algebra.

A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...

This paper focuses on multi-ary α-semantic resolution automated reasoning method based on multi-ary α-resolution principle for lattice-valued propositional logic LP(X) with truth-value in lattice implication algebras. The definitions of the multi-ary α-semantic resolution and multi-ary α-semantic resolution deduction in lattice-valued propositional logic LP(X) are given, respectively, and the s...

n-ary transit functions are introduced as a generalization of binary (2-ary) transit functions. We show that they can be associated with convexities in natural way and discuss the Steiner convexity as a natural n-ary generalization of geodesicaly convexity. Furthermore, we generalize the betweenness axioms to n-ary transit functions and discuss the connectivity conditions for underlying hypergr...

Let {Rn} and {Pn} be two polynomial systems which induce signed polynomial hypergroup structures on N0. We investigate when the Banach algebra l(N0, h) can be continuously embedded into or is isomorphic to l(N0, h ). We find sufficient conditions on the connection coefficients cnk given by Rn = ∑n k=0 cnkPk, for the existence of such an embedding or isomorphism. Finally we apply these results t...

a parallel algorithm for generating t-ary tree sequences in reverse b-order is presented. the algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time o(1). the algorithm is executed on a crew sm simd model, and is adaptive and cost-optimal. prior to the discussion of the parallel algorithm a new sequential generation with o(1) average time ...