On certain functional equation related to two-sided centralizers

Let m ≥ 0, n ≥ 0 be fixed integers with m + n ≠ 0 and let R be a prime ring with char(R) = 0 or m + n + 1 ≤ char(R) ≠ 2. Suppose that there exists an additive mapping T : R → R satisfying the relation 2T(x ^m+n+1) = x ^m T(x) x ⁿ  + x ⁿ T(x)x ^m for all ${x\in R}$ . In this case T is a two-sided centralizer.     

Prime T-Ideals in Polynomial and Power Series Rings Over a Pseudo-Valuation Domain

Let R be an m-dimensional pseudo-valuation domain with residue field k, let V be the associated valuation domain with residue field K, and let k ₀ be the maximal separable extension of k in K. We compute the t-dimension of polynomial and power series rings over R. It is easy to see that t-dim R[x ₁,…, x _n ] = 2 if m = 1 and K is transcendental over k, but equals m otherwise, and that t-dim R[[x ₁,…, x _n ]] = ∞ if R is a nonSFT-ring. When R is an SFT-ring, we also show that: (1) t-dim R[[x]] = m; (2) t-dim R[[x ₁,…, x _n ]] = 2m ? 1, if n ≥ 2, K has finite exponent over k ₀, and [k ₀: k] < ∞; (3) t-dim R[[x ₁,…, x _n ]] = 2m, otherwise.     

Quasi-Armendariz Rings Relative to a Monoid

A ring R is called an M-quasi-Armendariz ring (a quasi-Armendariz ring relative to a monoid M) if whenever elements α = a ₁ g ₁ + a ₂ g ₂ + ··· + a _n g _n , β = b ₁ h ₁ + b ₂ h ₂ + ··· + b _m h _m  ? R[M] satisfy α R[M]β = 0, then a _i Rb _j  = 0 for each i, j. After discussing some basic properties of M-quasi-Armendariz rings, we consider the influence of transformation of the monoid M and the ring R on this property. Particularly, we give some sufficient conditions for the monoids M, N, and the ring R under which R is M × N-quasi-Armendariz if and only if R is M-quasi-Armendariz and N-quasi-Armendariz.     

Orders in regular rings with minimal condition for principal right ideals

ABSTRACT

A ring R is called an n-clean (resp. Σ-clean) ring if every element in R is n-clean (resp. Σ-clean). Clean rings are 1-clean and hence are Σ-clean. An example shows that there exists a 2-clean ring that is not clean. This shows that Σ-clean rings are a proper generalization of clean rings. The group ring ?_(p) G with G a cyclic group of order 3 is proved to be Σ-clean. The m× m matrix ring M _m (R) over an n-clean ring is n-clean, and the m×m (m>1) matrix ring M _m (R) over any ring is Σ-clean. Additionally, rings satisfying a weakly unit 1-stable range were introduced. Rings satisfying weakly unit 1-stable range are left-right symmetric and are generalizations of abelian π-regular rings, abelian clean rings, and rings satisfying unit 1-stable range. A ring R satisfies a weakly unit 1-stable range if and only if whenever a ₁ R + ˙˙˙ a _m R = dR, with m ≥ 2, a ₁,…, a _m, d ∈ R, there exist u ₁ ∈ U(R) and u ₂,…, u _m ∈ W(R) such that a ₁ u ₁ + ? a _m u _m = Rd.     

Archimedean zeta integrals on GL n × GL m and SO2n+1 × GL m

In this paper, we evaluate archimedean zeta integrals for automorphic L-functions on GL _n × GL _n-1+? and on SO_2n+1 × GL _n+? , for ? = ?1, 0, and 1. In each of these cases, the zeta integrals in question may be expressed as Mellin transforms of products of class one Whittaker functions. Here, we obtain explicit expressions for these Mellin transforms in terms of Gamma functions and Barnes integrals. When ? = 0 or ? = 1, the archimedean zeta integrals amount to integrals over the full torus. We show that, as has been predicted by Bump for such domains of integration, these zeta integrals are equal to the corresponding local L-factors—which are simple rational combinations of Gamma functions. (In the cases of GL _n × GL _n-1 and GL _n × GL _n this has, in large part, been shown previously by the second author of the present work, though the results here are more general in that they do not require the assumption of trivial central characters. Our techniques here are also quite different. New formulas for GL(n, R) Whittaker functions, obtained recently by the authors of this work, allow for substantially simplified computations). In the case ? = ?1, we express our archimedean zeta integrals explicitly in terms of Gamma functions and certain Barnes-type integrals. These evaluations rely on new recursive formulas, derived herein, for GL(n, R) Whittaker functions. Finally, we indicate an approach to certain unramified calculations, on SO_2n+1 × GL _n and SO_2n+1 × GL _n+1, that parallels our method herein for the corresponding archimedean situation. While the unramified theory has already been treated using more direct methods, we hope that the connections evoked herein might facilitate future archimedean computations.     

Prime and composite integers close to powers of a number

We prove that, for any real numbers ξ ≠ 0 and ν, the sequence of integer parts [ξ2 ⁿ  + ν], n = 0, 1, 2, . . . , contains infinitely many composite numbers. Moreover, if the number ξ is irrational, then the above sequence contains infinitely many elements divisible by 2 or 3. The same holds for the sequence [ξ( ? 2) ⁿ  + ν _n ], n = 0, 1, 2, . . . , where ν ₀, ν ₁, ν ₂, . . . all lie in a half open real interval of length 1/3. For this, we show that if a sequence of integers x ₁, x ₂, x ₃, . . . satisfies the recurrence relation x _n+d  = cx _n  + F(x _n+1, . . . , x _n+d-1) for each n  ≥  1, where c ≠ 0 is an integer, \({F(z_1,\dots,z_{d-1}) \in \mathbb {Z}[z_1,\dots,z_{d-1}],}\) and lim _{n→ ∞}|x _n | = ∞, then the number |x _n | is composite for infinitely many positive integers n. The proofs involve techniques from number theory, linear algebra, combinatorics on words and some kind of symbolic computation modulo 3.     

Real eigenvalues of nonnegative matrices which commute with a symmetric matrix involution

It is well known that if P is a nonnegative matrix, then its spectral radius is an eigenvalue of P (Perron-Frobenius theorem). In this paper it is shown that if P is an n × n nonnegative matrix and it commutes with a nonnegative symmetric involution when n=4m+3, then (1) P has at least two real eigenvalues if n=4m or 4m + 2, (2) P has at least one real eigenvalue if n=4m+1, and (3) P has at least three real eigenvalues if n=4m+3, where m is a nonnegative integer and n ? 1. Examples are given to show that these results are the best possible, and nonnegative symmetric involutions are classified.     

The Cohen–Macaulay and Gorenstein Properties of Rings Associated to Filtrations

Let (R, m) be a Cohen–Macaulay local ring, and let ? = {F _i } _i∈? be an F ₁-good filtration of ideals in R. If F ₁ is m-primary we obtain sufficient conditions in order that the associated graded ring G(?) be Cohen–Macaulay. In the case where R is Gorenstein, we use the Cohen–Macaulay result to establish necessary and sufficient conditions for G(?) to be Gorenstein. We apply this result to the integral closure filtration ? associated to a monomial parameter ideal of a polynomial ring to give necessary and sufficient conditions for G(?) to be Gorenstein. Let (R, m) be a Gorenstein local ring, and let F ₁ be an ideal with ht(F ₁) = g > 0. If there exists a reduction J of ? with μ(J) = g and reduction number u: = r _J (?), we prove that the extended Rees algebra R′(?) is quasi-Gorenstein with a-invariant b if and only if J ⁿ : F _u  = F _n+b?u+g?1 for every n ∈ ?. Furthermore, if G(?) is Cohen–Macaulay, then the maximal degree of a homogeneous minimal generator of the canonical module ω _G(?) is at most g and that of the canonical module ω _R′(?) is at most g ? 1; moreover, R′(?) is Gorenstein if and only if J ^u : F _u  = F _u . We illustrate with various examples cases where G(?) is or is not Gorenstein.     

Presimplifiable and Cyclic Group Rings

Let R be any commutative ring with identity, and let C be a (finite or infinite) cyclic group. We show that the group ring R(C) is presimplifiable if and only if its augmentation ideal I(C) is presimplifiable. We conjecture that the group rings R(C _n ) are presimplifiable if and only if n = p ^m , p ∈ J(R), p is prime, and R is presimplifiable. We show the necessity of n = p ^m , and we prove the sufficiency when n = 2, 3, 4. These results were made possible by a new formula derived herein for the circulant determinantal coefficients.     

A test for identities satisfied in lattices of submodules

SupposeR is ring with 1, andH?(R) denotes the variety of modular lattices generated by the class of lattices of submodules of allR-modules. An algorithm using Mal'cev conditions is given for constructing integersm≧0 andn≧1 from any given lattice polynomial inclusion formulad∈e. The main result is thatd∈e is satisfied in every lattice inH?(R) if and only if there existsx inR such that (m·1)x=n·1 inR, where 0·1=0 andk·1=1+1...+1 (k times) fork≧1. For example, this “divisibility” condition holds form=2 andn=1 if and only if 1+1 is an invertible element ofR, and it holds form=0 andn=12 if and only if the characteristic ofR divides 12. This result leads to a complete classification of the lattice varietiesH?(R),R a ring with 1. A set of representative rings is constructed, such that for each ringR there is a unique representative ringS satisfyingH?(R)=H?(R). There is exactly one representative ring with characteristick for eachk≧1, and there are continuously many representative rings with characteristic zero. IfR has nonzero characteristic, then all free lattices inH?(R) have recursively solvable word problems. A necessary and sufficient condition onR is given for all free lattices inH?(R) to have recursively solvable word problems, ifR is a ring with characteristic zero. All lattice varieties of the formH?(R) are self-dual. A varietyH?(R) is a congruence variety, that is, it is generated by the class of congruence lattices of all members of some variety of algebras. A family of continuously many congruence varieties related to the varietiesH?(R) is constructed.     

On multiplicative functions which are additive on sums of primes

Let ${f : \mathbb{N} \to \mathbb{C}}$ be a multiplicative function satisfying f(p ₀) ≠ 0 for at least one prime number p ₀, and let k ≥ 2 be an integer. We show that if the function f satisfies f(p ₁ + p ₂ + . . . + p _k ) = f(p ₁) + f(p ₂) + . . . + f(p _k ) for any prime numbers p ₁, p ₂, . . . ,p _k then f must be the identity f(n) = n for each ${n \in \mathbb{N}}$ . This result for k = 2 was established earlier by Spiro, whereas the case k = 3 was recently proved by Fang. In the proof of this result for k ≥ 6 we use a recent result of Tao asserting that every odd number greater than 1 is the sum of at most five primes.     

Approximating a class of combinatorial problems with rational objective function

In the late seventies, Megiddo proposed a way to use an algorithm for the problem of minimizing a linear function a ₀ + a ₁ x ₁ + . . . + a _n x _n subject to certain constraints to solve the problem of minimizing a rational function of the form (a ₀ + a ₁ x ₁ + . . . + a _n x _n )/(b ₀ + b ₁ x ₁ + . . . + b _n x _n ) subject to the same set of constraints, assuming that the denominator is always positive. Using a rather strong assumption, Hashizume et al. extended Megiddo’s result to include approximation algorithms. Their assumption essentially asks for the existence of good approximation algorithms for optimization problems with possibly negative coefficients in the (linear) objective function, which is rather unusual for most combinatorial problems. In this paper, we present an alternative extension of Megiddo’s result for approximations that avoids this issue and applies to a large class of optimization problems. Specifically, we show that, if there is an α-approximation for the problem of minimizing a nonnegative linear function subject to constraints satisfying a certain increasing property then there is an α-approximation (1/α-approximation) for the problem of minimizing (maximizing) a nonnegative rational function subject to the same constraints. Our framework applies to covering problems and network design problems, among others.     

Fast Growing Solutions of Linear Differential Equations in the Unit Disc

For $n \in \mathbb{N}$ , the n-order of an analytic function f in the unit disc D is defined by $$\sigma _{{{M,n}}} (f) = {\mathop {\lim \sup }\limits_{r \to 1^{ - } } }\frac{{\log ^{ + }_{{n + 1}} M(r,f)}} {{ - \log (1 - r)}},$$ where log⁺ x  =  max{log x, 0}, log ⁺ ₁ x  =  log ⁺ x, log ⁺ _n+1 x  =  log ⁺ log ⁺ _n x, and M(r, f) is the maximum modulus of f on the circle of radius r centered at the origin. It is shown, for example, that the solutions f of the complex linear differential equation $$f^{{(k)}} + a_{{k - 1}} (z)f^{{(k - 1)}} + \cdots + a_{1} (z)f^{\prime} + a_{0} (z)f = 0,\quad \quad \quad (\dag)$$ where the coefficients are analytic in D, satisfy σ _M,n+1(f)  ≤  α if and only if σ _M,n (a _j )  ≤  α for all j  =  0, ..., k ? 1. Moreover, if q ∈{0, ..., k ? 1} is the largest index for which $\sigma _{M,n} ( a_{q}) = {\mathop {\max }\limits_{0 \leq j \leq k - 1} }{\left\{ {\sigma _{{M,n}} {\left( {a_{j} } \right)}} \right\}}$ , then there are at least k ? q linearly independent solutions f of ( $\dag$ ) such that σ _M,n+1(f) = σ _M,n (a _q ). Some refinements of these results in terms of the n-type of an analytic function in D are also given.     

Sufficient Condition to Resolve Costa's First Conjecture

In this work, we give a sufficient condition to resolve Costa's first conjecture for each positive integer n and d with n ≥ 4. Precisely, we show that if there exists a local ring (A, M) such that λ _A (M) = n, and if there exists an (n + 2)-presented A-submodule of M ^m , where m is a positive integer (for instance, if M contains a regular element), then we may construct an example of (n + 4, d)-ring which is neither an (n + 3, d)-ring nor an (n + 4, d ? 1)-ring. Finally, we construct a local ring (B, M) such that λ _B (M) = 0 (resp., λ _B (M) = 1) and so we exhibit for each positive integer d, an example of a (4, d)-ring (resp., (5, d)-ring) which is neither a (4, d ? 1)-ring (resp., neither a (5, d ? 1)-ring) nor a (2, d′)-ring (resp., nor a (3, d′)-ring) for each positive integer d′.     

Generalized level crossings and tangencies of a random field with smooth sample functions

Tangencies and level crossings of a random field X:$\text{R}$^m₊×Ω→$\text{R}$ⁿ (which is not necessarily Gaussian) are studied under the assumption that almost every sample path is continuously differentiable. If n=m and if the random field has uniformly bounded sample derivatives and uniformly bounded densities for the distributions of the X_l, then for a compact K?$\text{R}$^m₊ and any fixed level, the restriction to K of almost every sample path has no tangencies to the level and at most finitely many crossings. The case of n≠m is also examined. Some generic properties, which hold for a residual set of random fields, are analyzed. Proofs involve the concepts of regularity and transversality from differential topology.     

Decomposition of Jordan Automorphisms of Strictly Upper Triangular Matrix Algebra Over Commutative Rings

Over a 2-torsionfree commutative ring R with identity, the algebra of all strictly upper triangular n + 1 by n + 1 matrices is denoted by n ₁. In this article, we prove that any Jordan automorphism of n ₁ can be uniquely decomposed as a product of a graph automorphism, a diagonal automorphism, a central automorphism and an inner automorphism for n ≥ 3. In the cases n = 1, 2, we also give a decomposition for any Jordan automorphism of n ₁.     

On proper oscillatory and vanishing-at-infinity solutions of differential equations with a deviating argument

Sufficient conditions are found for the existence of multiparametric families of proper oscillatory and vanishing-at-infinity solutions of the differential equation $$u^{(n)} (t) = g\left( {t, u(\tau _0 (t)), \ldots ,u^{(m - 1)} (\tau _{m - 1} (t))} \right)$$ , wheren≥4,m is the integer part of π/2,g:R ₊×R ^m →R is a function satisfying the local Carathéodory conditions, and τ _i :R ₊→R(i=0,...,m?1) are measurable functions such that τ _i (t) →+∞ fort→+∞(i=0,...,m?1).     

Hierarchical pinning models, quadratic maps and quenched disorder

We consider a hierarchical model of polymer pinning in presence of quenched disorder, introduced by Derrida et al. (J Stat Phys 66:1189–1213, 1992), which can be re-interpreted as an infinite dimensional dynamical system with random initial condition (the disorder). It is defined through a recurrence relation for the law of a random variable {R _n } _{n=1,2, ...}, which in absence of disorder (i.e., when the initial condition is degenerate) reduces to a particular case of the well-known logistic map. The large-n limit of the sequence of random variables 2^?n log R _n , a non-random quantity which is naturally interpreted as a free energy, plays a central role in our analysis. The model depends on a parameter α ? (0, 1), related to the geometry of the hierarchical lattice, and has a phase transition in the sense that the free energy is positive if the expectation of R ₀ is larger than a certain threshold value, and it is zero otherwise. It was conjectured in Derrida et al. (J Stat Phys 66:1189–1213, 1992) that disorder is relevant (respectively, irrelevant or marginally relevant) if 1/2 < α < 1 (respectively, α < 1/2 or α = 1/2), in the sense that an arbitrarily small amount of randomness in the initial condition modifies the critical point with respect to that of the pure (i.e., non-disordered) model if α ≥ 1/2, but not if α <  1/2. Our main result is a proof of these conjectures for the case α ≠ 1/2. We emphasize that for α >  1/2 we find the correct scaling form (for weak disorder) of the critical point shift.     

On a Question of Glasby,Praeger, and Xia

A Jordan partition λ(m, n, p) = (λ₁, λ₂, … , λ _m ) is a partition of mn associated with the expression of a tensor V _m  ? V _n of indecomposable KG-modules into a sum of indecomposables, where K is a field of characteristic p and G a cyclic group of p-power order. It is standard if λ _i  = m + n ? 2i + 1 for all i. We answer a recent question of Glasby, Praeger, and Xia who asked for necessary and sufficient conditions for λ(m, n, p) to be standard.