On completely multiplicative functions whose values are roots of unity

Summary We prove that if a complex valued completely multiplicative function F and a positive integer ℓ≦5 satisfy the condition F(N) = U_ℓ, where U_ℓ is the set of all ℓ-th roots of unity, then {F(n+1) F(n) ∣ nε N} = U_ℓ.     

Cyclic conjugacy separability and conjugacy separability of certain HNN extensions

Abstract

In this note, we give a criterion for certain HNN extensions of cyclic conjugacy separable (respectively conjugacy separable) groups with infinite cyclic associated subgroups to be again cyclic conjugacy separable (respectively conjugacy separable).

Communicated by Alexander Olshanskii     

A Comparative Result for Multiplicative Functions

In this paper, we compare the asymptotic behavior of _nx f(n) and _nx g(n) for multiplicative functions f and g, respectively, where |f| g. Our results extend relevant theorems by E. Wirsing and G. Hal@aacute;sz. The methods we use are elementary.     

Integral representation of random set-valued measures

Abstract

We consider random set-valued measures with values in a separable Banach space. We prove two integral representation theorems using measurable multifunctions and set-valued integrals. The first theorem is valid for all separable Banach spaces, while the second holds for reflexive separable Banach spaces.     

Are Biseparable Extensions Frobenius?

In Secion 1 we describe what is known of the extent to which a separable extension of unital associative rings is a Frobenius extension. A problem of this kind is suggested by asking if three algebraic axioms for finite Jones index subfactors are dependent. In Section 2 the problem in the title is formulated in terms of separable bimodules. In Section 3 we specialize the problem to ring extensions, noting that a biseparable extension is a two-sided finitely generated projective, split, separable extension. Some reductions of the problem are discussed and solutions in special cases are provided. In Section 4 various examples are provided of projective separable extensions that are neither finitely generated nor Frobenius and which give obstructions to weakening the hypotheses of the question in the title. In Section 5 we show that characterizations of the separable extensions among Frobenius extensions are special cases of a result for adjoint functors. Mathematics Subject Classifications (2000): 16L60, 16H05.     

The ultrametric corona problem

Let K be a complete ultrametric algebraically closed field and let A be the K-Banach algebra of bounded analytic functions in the disk D: |x| < 1. Let Mult(A, ∥ · ∥) be the set of continuous multiplicative semi-norms of A, let Mult _m (A, ∥ · ∥) be the subset of the ϕ ∈ Mult(A, ∥ · ∥) whose kernel is a maximal ideal and let Mult _a (A, ∥ · ∥) be the subset of the ϕ ∈ Mult _m (A, ∥ · ∥) whose kernel is of the form (x − a)A, a ∈ D ( if ϕ ∈ Mult _m (A, ∥ · ∥) \ Mult _a (A, ∥ · ∥), the kernel of ϕ is then of infinite codimension). We examine whether Mult _a (A, ∥ · ∥) is dense inside Mult _m (A, ∥ · ∥) with respect to the topology of simple convergence. This a first step to the conjecture of density of Mult _a (A, ∥ · ∥) in the whole set Mult(A, ∥ · ∥): this is the corresponding problem to the well-known complex corona problem. We notice that if ϕ ∈ Mult _m (A, ∥ · ∥) is defined by an ultrafilter on D, then ϕ lies in the closure of Mult _a (A, ∥ · ∥). Particularly, we show that this is case when a maximal ideal is the kernel of a unique ϕ ∈ Multm(A, ∥ · ∥). Particularly, when K is strongly valued all maximal ideals enjoy this property. And we can prove this is also true when K is spherically complete, thanks to the ultrametric holomorphic functional calculus. More generally, we show that if ψ ∈ Mult(A, ∥ · ∥) does not define the Gauss norm on polynomials (∥ · ∥), then it is defined by a circular filter, like on rational functions and analytic elements. As a consequence, if ψ ∈ Multm(A, ∥ · ∥) \ Multa(A, ∥ · ∥) or if φ does not lie in the closure of Mult _a (A, ∥ · ∥), then its restriction to polynomials is the Gauss norm. The first situation does happen. The second is unlikely. The text was submitted by the authors in English.     

Why Restricted Additive Schwarz Converges Faster than Additive Schwarz

Recently a variant of the additive Schwarz (AS) preconditioner, the restricted additive Schwarz (RAS) preconditioner has been introduced, and numerical experiments showed that RAS converges faster and requires less communication than AS. We show in this paper how RAS, which is defined at the matrix level, can be interpreted as an iteration at the continuous level of the underlying problem. This interpretation reveals why RAS converges faster than classical AS.This revised version was published online in October 2005 with corrections to the Cover Date.     

Functional Equation Related to Quadratic and Norm Forms

Let T(a ₁, a ₂,..., a _n ) be a norm form of some finite proper extension of ℚ in a certain fixed integral basis, or even some integer form satisfying certain conditions. We are interested in two problems. One is finding all functions f : ℤ → ℂ satisfying the integer functional equation f(T(a ₁, a ₂,..., a _n )) = T(f(a ₁), f(a ₂),..., f(a _n )). Another closely related problem is finding all functions f : ℤ → ℂ such that T(f(a ₁, f(a ₂,..., f(a _n )) depends only on the value of T(a ₁, a ₂,..., a _n ).The second question was studied before for special quadratic forms. We extend these investigations to other types of quadratic forms and, thus, partially solve the second problem for them. The solution of the first problem for one cubic field is also presented. Finally, we give the corresponding conjecture for the first problem and, additionally, several remarks concerning the choice of norm forms.__________Published in Lietuvos Matematikos Rinkinys, Vol. 45, No. 2, pp. 153–172, April–June, 2005.     

Probabilistic Number Theory in Additive Arithmetic Semigroups, III

We extend the investigation of quantitative mean-value theorems of completely multiplicative functions on additive arithmetic semigroups given in our previous paper. Then the new and old quantitative mean-value theorems are applied to the investigation of local distribution of values of a special additive function *(a). The result is unexpected from the point of view of classical number theory. This reveals the fact that the essential divergence of the theory of additive arithmetic semigroups from classical number theory is not related to the existence of a zero of the zeta function Z(y) at y = –q ^–1.     

Densely Continuous Forms in Vietoris Hyperspaces

For countably paracompact normal spaces X and locally compact separable metric spaces Y, a characterization is given for the closure of the set of densely continuous forms from X to Y in the hyperspace of nonempty closed subsets of X × Y under the Vietoris topology. This shows that for such X having no isolated points, every closed subset of X × R that is dense over X can be Vietoris approximated by a semicontinuous function on X.     

On the absolute convergence of multiple fourier series

Let f: R ^N → C be a periodic function with period 2π in each variable. We prove suffcient conditions for the absolute convergence of the multiple Fourier series of f in terms of moduli of continuity, of bounded variation in the sense of Vitali or Hardy and Krause, and of the mixed partial derivative in case f is an absolutely continuous function. Our results extend the classical theorems of Bernstein and Zygmund from single to multiple Fourier series. This research was started while the first author was a visiting professor at the Department of Mathematics, Texas A&M University, College Station during the fall semester in 2005; and it was also supported by the Hungarian National Foundation for Scientific Research under Grant T 046 192.     

On the solution of concave knapsack problems

We consider a version of the knapsack problem which gives rise to a separable concave minimization problem subject to bounds on the variables and one equality constraint. We characterize strict local miniimizers of concave minimization problems subject to linear constraints, and use this characterization to show that although the problem of determining a global minimizer of the concave knapsack problem is NP-hard, it is possible to determine a local minimizer of this problem with at most O(n logn) operations and 1+[logn] evaluations of the function. If the function is quadratic this algorithm requires at most O(n logn) operations.Work supported in part by the Applied Mathematical Sciences subprogram of the Office of Energy Research of the U.S. Department of Energy under Contract W-31-109-Eng-38.Work supported in part by a Fannie and John Hertz Foundation graduate fellowship.     

A description of Kac-systems of multiplicative unitary operators

Let V be a multiplicative unitary operator on a separable Hilbert spaceH, then there are two subalgebras ofB( H) denoted byA( V) and ?( V), respectively, which correspond to V. If V satisfiesV ² =I, then we will obtain the necessary and sufficient condition of Baaj and Skandalis’ main theorem, i.e.V has a Kac-system if and only if the linear closed space of the product of the above two algebras is the compact operator space; with this condition the above algebras are also quantum groups.     

A note on a theorem of Daboussi

The following assertion is proved. Let be the set of integers the number of the prime power of which is . Let be the size of . Then for each irrational , uniformly in , \begin{equation*} \frac{1}{\pi_k(x)} \bigg|\sum _{\alul{n\le x}{n\in\cN_k}} f(n) e^{2\pi in\alpha}\bigg|\to 0, \end{equation*} where is an arbitrary multiplicative function with , is a positive constant. This revised version was published online in June 2006 with corrections to the Cover Date.     

Computing the Volume of n-Dimensional Copulas

Abstract

A problem that is very relevant in applications of copula functions to finance is the computation of the survival copula, which is applied to enforce multivariate put–call parity. This may be very complex for large dimensions. The problem is a special case of the more general problem of volume computation in high-dimensional copulas. We provide an algorithm for the exact computation of the volume of copula functions in cases where the copula function is computable in closed form. We apply the algorithm to the problem of computing the survival of a copula function in the pricing problem of a multivariate digital option, and we provide evidence that this is feasible for baskets of up to 20 underlying assets, with acceptable CPU time performance.     

On local frequencies related to farey fractions

LetP ₁ andP ₂ be two sets of prime numbers and let ω(m,P_i)=#{p: p/m, pεP_i} (i=1,2) be two related additive functions ofm. For an irreducible positive fractionm/n, defineh(m/n)=ω(m, P ₁)+ω(n, P₂). In this paper the local frequenciesv _x{h(m/n)=s}=#{m/n ∈ F_x:h(m/n)=s}/#F_x are considered, whereF _x denotes the classical Farey series. Using the mean-value theorem for multiplicative functions of rational argument, a local limit theorem forv _x{h(m/n)=s} is proved. Research supported by the Lithuanian State Science and Studies Foundation. Translated from Lietuvos Matematikos Rinkinys, Vol. 40, No. 1, pp. 113–131, January–March, 2000. Translated by V. Stakènas     

Conley barriers and their applications: Chain-recurrence and Lyapunov functions

Given a compact metric space X and a continuous map f from X to itself, we construct a barrier function for chain-recurrence. We use it to endow the space of chain-transitive components with a non-trivial ultrametric distance and to construct Lyapunov functions for f. Most of these constructions are then generalized on an arbitrary separable metric space to a continuous compactum-valued map.     

On the convexity of the multiplicative potential and penalty functions and related topics

It is well known that a function f of the real variable x is convex if and only if (x,y)→yf(y ^-1 x),y>0 is convex. This is used to derive a recursive proof of the convexity of the multiplicative potential function. In this paper, we obtain a conjugacy formula which gives rise, as a corollary, to a new rule for generating new convex functions from old ones. In particular, it allows to extend the aforementioned property to functions of the form (x,y)→g(y)f(g(y)^-1 x) and provides a new tool for the study of the multiplicative potential and penalty functions. Received: June 3, 1999 / Accepted: September 29, 2000?Published online January 17, 2001     

An Euler product transform applied to q-series

This paper introduces the concept of a D-analogue. This is a Dirichlet series analogue for the already known and well researched hypergeometric q-series, often called the basic hypergeometric series. The main result in this paper is a transform, based on an Euler product over the primes. Examples given are D-analogues of the q-binomial theorem and the q-Gauss summation. 2000 Mathematics Subject Classification Primary—11M41; Secondary—33D15, 30B50