in this article‎, ‎we have characterized ideals in $c(x)$ in which‎ ‎every ideal is also an ideal (a $z$-ideal) of $c(x)$‎. ‎motivated by‎ ‎this characterization‎, ‎we observe that $c_infty(x)$ is a regular‎ ‎ring if and only if every open locally compact $sigma$-compact‎ ‎subset of $x$ is finite‎. ‎concerning prime ideals‎, ‎it is shown that‎ ‎the sum of every two prime (semiprime) ideals of e...

We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...

The article continues the formalization of the lattice theory (as structures with two binary operations, not in terms of ordering relations). In the Mizar Mathematical Library, there are some attempts to formalize prime ideals and filters; one series of articles written as decoding [9] proven some results; we tried however to follow [21], [12], and [13]. All three were devoted to the Stone repr...

If R is a valuation domain of maximal ideal P with a maximal immediate extension of finite rank it is proven that there exists a finite sequence of prime ideals P = L0 ⊃ L1 ⊃ · · · ⊃ Lm ⊇ 0 such that RLj /Lj+1 is almost maximal for each j, 0 ≤ j ≤ m − 1 and RLm is maximal if Lm 6= 0. Then we suppose that there is an integer n ≥ 1 such that each torsion-free R-module of finite rank is a direct s...

It is known that a k-term DNF can have at most 2k − 1 prime implicants and that this bound is sharp. We determine all k-term DNF having the maximal number of prime implicants. It is shown that a DNF is maximal if and only if it corresponds to a non-repeating decision tree with literals assigned to the leaves in a certain way. We also mention some related results and open problems.

This paper develops a prime radix transform algorithm that can be used to calculate the discrete Fourier transform (DFT) of a data block of length P, a prime, using fixed coefficient second order recursive filter sections: this simple hardware structure allows compact, high performance DFT processors to be developed. Further “massaging” of the prime radix algorithm produces the zero factor tran...