a module m is called epi-retractable if every submodule of m is a homomorphic image of m. dually, a module m is called co-epi-retractable if it contains a copy of each of its factor modules. in special case, a ring r is called co-pli (resp. co-pri) if rr (resp. rr) is co-epi-retractable. it is proved that if r is a left principal right duo ring, then every left ideal of r is an epi-retractable ...

Let Z = X1×· · ·×Xn be a product of Drinfeld modular curves. We characterize those algebraic subvarieties X ⊂ Z containing a Zariski-dense set of CM points, i.e. points corresponding to n-tuples of Drinfeld modules with complex multiplication (and suitable level structure). This is a characteristic p analogue of a special case of the André-Oort conjecture.

Abstract— In this paper high-speed hardware architectures of point multiplication based on Montgomery ladder algorithm for binary Edwards and generalized Hessian curves in Gaussian normal basis are presented. Computations of the point addition and point doubling in the proposed architecture are concurrently performed by pipelined digitserial finite field multipliers. The multipliers in parallel...

We show that the specialization of nonsymmetric Macdonald polynomials at t = 0 are, up to multiplication by a simple factor, characters of Demazure modules for ŝl(n). This connection furnishes Lie-theoretic proofs of the nonnegativity and monotonicity of Kostka polynomials.

Frobenius manifold structures on the spaces of abelian integrals were constructed by I. Krichever. We use D-modules, deformation theory, and homological algebra to give a coordinate-free description of these structures. It turns out that the tangent sheaf multiplication has a cohomological origin, while the Levi–Civita connection is related to 1-dimensional isomonodromic deformations.

Non-Boolean computations implementing operations on multi-valued variables beyond base 2 allow enhanced computational complexity. We introduce DNA as a functional material for ternary computing, and in particular demonstrate the use of three-valued oligonucleotide inputs to construct a 3 × 3 multiplication table. The system consists of two three-valued inputs of -1; 0; +1 and a fluorophore/quen...