Abstract Let $$A/{\mathbb {Q}}$$ A / Q be an abelian variety such that $$A({\mathbb {Q}}) =\{0_A\}$$ ( ) = { 0 } . $$\ell $$ <mm...

We characterize well-founded algebraic lattices by means of forbidden subsemilattices of the join-semilattice made of their compact elements. More specifically, we show that an algebraic lattice L is well-founded if and only if K(L), the join-semilattice of compact elements of L, is well-founded and contains neither [ω], nor Ω(ω∗) as a join-subsemilattice. As an immediate corollary, we get that...

Applying (enriched) categorical structures we define the notion of ordered sheaf on a quantaloid Q, which we call ‘Q-order’. This requires a theory of semicategories enriched in the quantaloid Q, that admit a suitable Cauchy completion. There is a quantaloid Idl(Q) of Q-orders and ideal relations, and a locally ordered category Ord(Q) of Q-orders and monotone maps; actually, Ord(Q) = Map(Idl(Q)...

is the Hecke L-series attached to the eigenform f . Hecke’s theory shows that L(f, s) has an Euler product expansion identical to (2), and also that it admits an integral representation as a Mellin transform of f . This extends L(f, s) analytically to the whole complex plane and shows that it satisfies a functional equation relating its values at s and 2− s. The modularity of E thus implies tha...

Using the concept of codes on ordered sets introduced by Brualdi, Graves and Lawrence, we consider perfect codes on the ordinal sum of two ordered sets, the standard ordered sets and the disjoint sum of two chains. In the classical coding theory all perfect codes are completely described in terms of parameters (cf. [2, 3]). They are mathematically interesting structures. Brualdi et al. [1] rece...

Let F be a subfield of the field of real numbers and let Fn (n ≥ 2) be the n× n matrix algebra over F. It is shown that if Fn is a lattice-ordered algebra over F in which the identity matrix 1 is positive, then Fn is isomorphic to the lattice-ordered algebra Fn with the usual lattice order. In particular, Weinberg’s conjecture is true. Let L be a totally ordered field, and let Ln (n ≥ 2) be the...

We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: L(x, y) = f(x)+Q(x, y)+g(y), where f : R → R∪{+∞} and g : R → R∪{+∞} are proper lower semicontinuous functions, and Q : R × R → R is a smooth C function which couples the variables x and y. The algorithm can be viewed as a proximal regularization of the usual Gau...

The origin of this paper is in a question that was asked of the author by Michael Wellman, a computer scientist who works in artificial intelligence at Wright Patterson Air Force Base in Dayton, Ohio. He wanted to know if, starting with R and its usual topology and product partial order, he could linearly reorder every finite subset and still obtain a continuous function from R into R that was ...

For a finite lattice L, the congruence lattice ConL of L can be easily computed from the partially ordered set J(L) of join-irreducible elements of L and the join-dependency relation DL on J(L). We establish a similar version of this result for the dimension monoid DimL of L, a natural precursor of ConL. For L join-semidistributive, this result takes the following form: Theorem 1. Let L be a fi...