We investigate minimal sum-of-products expressions for multiple-valued logic functions for realization by programmable logic arrays. Our focus is on expressions where product terms consist of the MIN of interval literals on input variables and are combined using one of two operations SUM or MAX. In binary logic, the question of whether or not prime implicants are sufficient to optimally realize...

One of the main applications of computational techniques to pure mathematics has been the use of computer algebra systems to perform calculations which mathematicians cannot perform by hand. Because the data is produced within the computer algebra system, this becomes an environment for the exploration of new functions and the data produced is often analysed in order to make conjectures empiric...

Let H H be a connected Hopf algebra acting on an A"> A encoding="application/x-tex">A </inline-formul...

Let p be a prime, K a finite extension overQp and G := Gal(K/K). We extend Kisin’s theory on φ-modules of finite E(u)-height to give a new classification of G-stable Zp-lattices in semi-stable representations.

We determine the semi-regular subgroups of the 2-transitive permutation groups PGL(2, n),PSL(2, n),PGU(3, n),PSU(3, n),Sz(n) and Ree(n) with n a suitable power of a prime number p. 2000 Math. Subj. Class.: 14H37

In this paper we use the connected sum operation on knots to show that there is a one-to-one relation between knots and numbers. In this relation prime knots are bijectively assigned with prime numbers such that the prime number 2 corresponds to the trefoil knot. From this relation we have a classification table of knots where knots are one-to-one assigned with numbers. Further this assignment ...

Feynman’s prescription for a quantum computer was to find a Hamitonian for a system that could serve as a computer. Here we concentrate in a system to solve the problem of decomposing a large number N into its prime factors. The spectrum of this computer is exactly calculated obtaining the factors of N from the arithmetic function that represents the energy of the computer. As a corollary, in t...

We propose a functorial concurrent semantics for Petri nets extended with read and inhibitor arcs, that we call inhibitor nets. Along the lines of the seminal work by Winskel on safe (ordinary) nets, the truly concurrent semantics is given at a categorical level via a chain of coreflections leading from the category SW-IN of semi-weighted inhibitor nets to the category Dom of finitary prime alg...

Let us suppose G is right-multiply prime. Is it possible to extend hulls? We show that every semi-Gaussian subalgebra is measurable. It is not yet known whether Y 6= ∞, although [31] does address the issue of invertibility. Here, admissibility is clearly a concern.

Let p be a prime, K a finite extension of Qp and T a finite free Zp-representation of Gal(K̄/K). We prove that T ⊗Zp Qp is semi-stable (resp., crystalline) with Hodge-Tate weights in {0, . . . , r} if and only if for all n, T/pnT is torsion semi-stable (resp., crystalline) with Hodge-Tate weights in {0, . . . , r}. Résumé. (Représentations galoisiennnes p-adiques de torsion) Soient p un nombre p...