The component-by-component construction algorithm constructs the generating vector for a rank-1 lattice one component at a time by minimizing the worst-case error in each step. This algorithm can be formulated elegantly as a repeated matrixvector product, where the matrix-vector product expresses the calculation of the worst-case error in that step. As was shown in an earlier paper, this matrix...

Let $N$ be a submodule of a module $M$ and a minimal primary decomposition of $N$ is known‎. ‎A formula to compute Baer's lower nilradical of $N$ is given‎. ‎The relations between classical prime submodules and their nilradicals are investigated‎. ‎Some situations in which semiprime submodules can be written as finite intersection of classical prime submodule are stated‎.

in this paper a particular case of z-ideals, called strongly z-ideal, is defined by introducing zero sets in pointfree topology. we study strongly z-ideals, their relation with z-ideals and the role of spatiality in this relation. for strongly z-ideals, we analyze prime ideals using the concept of zero sets. moreover, it is proven that the intersection of all zero sets of a prime ideal of c(l),...

Let ? ( n ) denote the number of prime factors n. We show that for any bounded f : N ? C one has 1 ? = + o ? . This yields a new elementary proof Prime Number Theorem.

We provide an upper bound of the dimension of the maximal projective submodule of the Lie module of the symmetric group of n letters in prime characteristic p, where n = pk with p k.

The rings considered in this article are commutative with identity which are not fields. Let R be a ring. A. Alilou, J. Amjadi and Sheikholeslami introduced and investigated a graph whose vertex set is the set of all nontrivial ideals of R and distinct vertices I, J are joined by an edge in this graph if and only if either ann(I)J = (0) or ann(J)I = (0). They called this graph as a new graph as...

In the present paper, by considering the notion of MV-modules which is the structure that naturally correspond to lu-modules over lu-rings, we prove some results on prime A-ideals and state some conditions to obtain a prime A-ideal in MV-modules. Also, we state some conditions that an A-ideal is not prime and investigate conditions that $Ksubseteq bigcup _{i=1}^{n}K_{i}$ implies $Ksubseteq K_{j...

A prime sieve is an algorithm that finds the primes up to a bound n. We say that a prime sieve is incremental, if it can quickly determine if n+1 is prime after having found all primes up to n. We say a sieve is compact if it uses roughly √ n space or less. In this paper we present two new results: • We describe the rolling sieve, a practical, incremental prime sieve that takes O(n log logn) ti...

Finding the sub-vector with the largest sum in a sequence of n numbers is known as the maximum sum problem. Finding the k sub-vectors with the largest sums is a natural extension of this, and is known as the k maximal sums problem. In this paper we design an optimal O(n+k) time algorithm for the k maximal sums problem. We use this algorithm to obtain algorithms solving the two-dimensional k max...