In this paper we generalize work of Amice and Lazard from the early sixties. Amice determined the dual of the space of locally Qp-analytic functions on Zp and showed that it is isomorphic to the ring of rigid functions on the open unit disk over Cp. Lazard showed that this ring has a divisor theory and that the classes of closed, finitely generated, and principal ideals in this ring coincide. W...

In this paper, we have focused to study convex L-subgroups of an Lordered group. First, we introduce the concept of a convex L-subgroup and a convex L-lattice subgroup of an L-ordered group and give some examples. Then we find some properties and use them to construct convex L-subgroup generated by a subset S of an L-ordered group G . Also, we generalize a well known result about the set of all...

In this paper we provide a rigorous toolkit for extending convex risk measures from L∞ to L, for p ≥ 1. Our main result is a one-to-one correspondence between law-invariant convex risk measures on L∞ and L. This proves that the canonical model space for the predominant class of law-invariant convex risk measures is L. Some significant counterexamples illustrate the many pitfalls with convex ris...

Let R be a (nonzero commutative unital) ring. If I and J are ideals of R such that R/I ⊕R/J is a cyclic R-module, then I + J = R. The rings R such that R/I ⊕R/J is a cyclic R-module for all distinct nonzero proper ideals I and J of R are the following three types of principal ideal rings: fields, rings isomorphic to K ×L for the fields K and L, and special principal ideal rings (R,M) such thatM...

In this paper we study the finite dimensional Lie p-algebras, L splitting on its abelian p-socle, the sum of its minimal abelian p-ideals. In addition, some properties of the Frattini p-subalgebra of L are pointed

A neural code C is a collection of binary vectors of a given length n that record the co-firing patterns of a set of neurons. Our focus is on neural codes arising from place cells, neurons that respond to geographic stimulus. In this setting, the stimulus space can be visualized as subset of R covered by a collection U of convex sets such that the arrangement U forms an Euler diagram for C. The...

From a well-known decomposition theorem, we propose a tree representation for distributive and simplicial lattices. We show how this representation (called ideal tree) can be efficiently computed (linear time in the size of the lattice given by any graph whose transitive closure is the lattice) and compared with respect to time and space complexity. As far as time complexity is concerned, we si...