A prime algebraic lattice can be characterised as isomorphic to the downwards-closed subsets, ordered by inclusion, of its complete primes. It is easily seen that the downwards-closed subsets of a partial order form a completely distributive algebraic lattice when ordered by inclusion. The converse also holds; any completely distributive algebraic lattice is isomorphic to such a set of downward...

If D = (V,A) is a digraph, its competition hypergraph CH(D) has the vertex set V and e ⊆ V is an edge of CH(D) iff |e| ≥ 2 and there is a vertex v ∈ V , such that e = {w ∈ V |(w, v) ∈ A}. We tackle the problem to minimize the number of strong components in D without changing the competition hypergraph CH(D). The results are closely related to the corresponding investigations for competition gra...

We study a certain monotonicity property of ratios of means, which we call a strong inequality. These strong inequalities were recently shown to be related to the so-called relative metric. We also use the strong inequalities to derive new ordinary inequalities. The means studied are the extended mean value of Stolarsky, Gini’s mean and Seiffert’s mean.

Several ideal-lattice-based cryptosystems have been broken by recent attacks that exploit special structures of the rings used in those cryptosystems. The same structures are also used in the leading proposals for post-quantum lattice-based cryptography, including the classic NTRU cryptosystem and typical Ring-LWE-based cryptosystems. This paper proposes NTRU Prime, which tweaks NTRU to use rin...

CONTENTS

in this paper, we introduce a method by which we can find a close connection between the set of prime $z$-ideals of $c(x)$ and the same of $c(y)$, for some special subset $y$ of $x$. for instance, if $y=coz(f)$ for some $fin c(x)$, then there exists a one-to-one correspondence between the set of prime $z$-ideals of $c(y)$ and the set of prime $z$-ideals of $c(x)$ not containing $f$. moreover, c...