A semiring is an algebraic structure similar to a ring, but without the requirement that each element must have an additive inverse. A bounded semiring is a semiring equipped with a compatible bounded partial order. I...A semiring is an algebraic structure similar to a ring, but without the requirement that each element must have an additive inverse. A bounded semiring is a semiring equipped with a compatible bounded partial order. In this paper, properties of zero divisors and prime elements of a bounded semiring are studied. In particular, it is proved that under some mild assumption, the set Z（A） of nonzero zero divisors of A is A ／ {0, 1}, and each prime element of A is a maximal element. For a bounded semiring A with Z（A） = A ／ {0, 1}, it is proved that A has finitely many maximal elements if ACC holds either for elements of A or for principal annihilating ideals of A. As an application of prime elements, we show that the structure of a bounded semiring A is completely determined by the structure of integral bounded semirings if either ｜Z（A）｜ = 1 or ｜Z（A）｜ -- 2 and Z（A）2 ≠ 0. Applications to the ideal structure of commutative rings are also considered. In particular, when R has a finite number of ideals, it is shown that the chain complex of the poset I（R） is pure and shellable, where I（R） consists of all ideals of R.展开更多
For any group G, denote byπe(G) the set of orders of elements in G. Given a finite group G, let h(πe (G)) be the number of isomorphism classes of finite groups with the same set πe(G) of element orders. A group G i...For any group G, denote byπe(G) the set of orders of elements in G. Given a finite group G, let h(πe (G)) be the number of isomorphism classes of finite groups with the same set πe(G) of element orders. A group G is called k-recognizable if h(πe(G)) = k <∞, otherwise G is called non-recognizable. Also a 1-recognizable group is called a recognizable (or characterizable) group. In this paper the authors show that the simple groups PSL(3,q), where 3 < q≡±2 (mod 5) and (6, (q-1)/2) = 1, are recognizable.展开更多
Polysurfacic tori or kideas are three-dimensional objects formed by rotating a regular polygon around a central axis. These toric shapes are referred to as “polysurfacic” because their characteristics, such as the n...Polysurfacic tori or kideas are three-dimensional objects formed by rotating a regular polygon around a central axis. These toric shapes are referred to as “polysurfacic” because their characteristics, such as the number of sides or surfaces separated by edges, can vary in a non-trivial manner depending on the degree of twisting during the revolution. We use the term “Kideas” to specifically denote these polysurfacic tori, and we represent the number of sides (referred to as “facets”) of the original polygon followed by a point, while the number of facets from which the torus is twisted during its revolution is indicated. We then explore the use of concave regular polygons to generate Kideas. We finally give acceleration for the algorithm for calculating the set of prime numbers.展开更多
基金Acknowledgements This work was supported by the National Natural Science Foundation of China （Grant No. 11271250）.
文摘A semiring is an algebraic structure similar to a ring, but without the requirement that each element must have an additive inverse. A bounded semiring is a semiring equipped with a compatible bounded partial order. In this paper, properties of zero divisors and prime elements of a bounded semiring are studied. In particular, it is proved that under some mild assumption, the set Z（A） of nonzero zero divisors of A is A ／ {0, 1}, and each prime element of A is a maximal element. For a bounded semiring A with Z（A） = A ／ {0, 1}, it is proved that A has finitely many maximal elements if ACC holds either for elements of A or for principal annihilating ideals of A. As an application of prime elements, we show that the structure of a bounded semiring A is completely determined by the structure of integral bounded semirings if either ｜Z（A）｜ = 1 or ｜Z（A）｜ -- 2 and Z（A）2 ≠ 0. Applications to the ideal structure of commutative rings are also considered. In particular, when R has a finite number of ideals, it is shown that the chain complex of the poset I（R） is pure and shellable, where I（R） consists of all ideals of R.
基金This work has been supported by the Research Institute for Fundamental Sciences Tabriz,Iran.
文摘For any group G, denote byπe(G) the set of orders of elements in G. Given a finite group G, let h(πe (G)) be the number of isomorphism classes of finite groups with the same set πe(G) of element orders. A group G is called k-recognizable if h(πe(G)) = k <∞, otherwise G is called non-recognizable. Also a 1-recognizable group is called a recognizable (or characterizable) group. In this paper the authors show that the simple groups PSL(3,q), where 3 < q≡±2 (mod 5) and (6, (q-1)/2) = 1, are recognizable.
文摘Polysurfacic tori or kideas are three-dimensional objects formed by rotating a regular polygon around a central axis. These toric shapes are referred to as “polysurfacic” because their characteristics, such as the number of sides or surfaces separated by edges, can vary in a non-trivial manner depending on the degree of twisting during the revolution. We use the term “Kideas” to specifically denote these polysurfacic tori, and we represent the number of sides (referred to as “facets”) of the original polygon followed by a point, while the number of facets from which the torus is twisted during its revolution is indicated. We then explore the use of concave regular polygons to generate Kideas. We finally give acceleration for the algorithm for calculating the set of prime numbers.
