Stability of <Emphasis Type="Italic">C</Emphasis>-regularized Semigroups

Let T = (T(t))t≥0 be a bounded C-regularized semigroup generated by A on a Banach space X and R(C) be dense in X. We show that if there is a dense subspace Y of X such that for every x ∈ Y, σu(A, Cx), the set of all points λ ∈ iR to which (λ - A)^-1 Cx can not be extended holomorphically, is at most countable and σr(A) N iR = Ф, then T is stable. A stability result for the case of R(C) being non-dense is also given. Our results generalize the work on the stability of strongly continuous senfigroups.     

Functional equations on abelian groups with involution

Summary We produce complete solution formulas of selected functional equations of the formf(x +y) ±f(x + σ (ν)) = Σ _I ² =₁ g _l (x)h _l (y),x, y∈G, where the functionsf,g ₁,h ₁ to be determined are complex valued functions on an abelian groupG and where σ:G→G is an involution ofG. The special case of σ=−I encompasses classical functional equations like d’Alembert’s, Wilson’s first generalization of it, Jensen’s equation and the quadratic equation. We solve these equations, the equation for symmetric second differences in product form and similar functional equations for a general involution σ.     

Random matrix products and applications to cellular automata

Let λ be the upper Lyapunov exponent corresponding to a product of i.i.d. randomm×m matrices (X _i) _i ^0/∞ over ℂ. Assume that theX _i's are chosen from a finite set {D ₀,D ₁...,D _t-1(ℂ), withP(X _i=D_j)>0, and that the monoid generated byD ₀, D₁,…, D_q−1 contains a matrix of rank 1. We obtain an explicit formula for λ as a sum of a convergent series. We also consider the case where theX _i's are chosen according to a Markov process and thus generalize a result of Lima and Rahibe [22]. Our results on λ enable us to provide an approximation for the numberN _≠0(F(x)ⁿ,r) of nonzero coefficients inF(x) ⁿ.(modr), whereF(x) ∈ ℤ[x] andr≥2. We prove the existence of and supply a formula for a constant α (<1) such thatN _≠0(F(x)ⁿ,r) ≈n ^α for “almost” everyn. Supported in part by FWF Project P16004-N05     

On the finiteness of a field-theoretic invariant for commutative rings

If T is a (commutative unital) ring extension of a ring R, then Λ(T /R) is defined to be the supremum of the lengths of chains of intermediate fields between R _P /P R _P and T _Q /QT _Q , where Q varies over Spec(T) and P:= Q ∩ R. The invariant σ(R):= sup Λ(T/R), where T varies over all the overrings of R. It is proved that if Λ(S/R)< ∞ for all rings S between R and T, then (R, T) is an INC-pair; and that if (R, T) is an INC-pair such that T is a finite-type R-algebra, then Λ(T/R)< ∞. Consequently, if R is a domain with σ(R) < ∞, then the integral closure of R is a Prüfer domain; and if R is a Noetherian G-domain, then σ(R) < ∞, with examples showing that σ(R) can be any given non-negative integer. Other examples include that of a onedimensional Noetherian locally pseudo-valuation domain R with σ(R)=∞.     

Augmented group systems and shifts of finite type

Let (G, χ, x) be a triple consisting of a finitely presented groupG, epimorphism χ:G →Z, and distinguished elementx ∈G such that χ(x)=1. Given a finite symmetric groupS _r, we construct a finite directed graph Γ that describes the set Φ _r of representations π: Ker χ →S _r as well as the mapping σ _x :Φ _r →Φ _r defined by (σ _x ϱ)(a) = ϱ(x ⁻¹ ax) for alla ∈ Ker χ. The pair (Φ _r ,σ _x has the structure of a shift of finite type, a well-known type of compact 0-dimensional dynamical system. We discuss basic properties and applications of therepresentation shift (Φ _r ,σ _x ), including applications to knot theory.     

Chinese remainder codes

Chinese remainder codes are constructed by applying weak block designs and the Chinese remainder theorem of ring theory. The new type of linear codes take the congruence class in the congruence class ring R/I ₁ ∩ I ₂ ∩ ··· ∩ I _n for the information bit, embed R/J _i into R/I ₁ ∩ I ₂ ∩ ··· ∩ I _n, and assign the cosets of R/J _i as the subring of R/I ₁ ∩ I ₂ ∩ ··· ∩ I _n and the cosets of R/J _i in R/I ₁ ∩ I ₂ ∩ ··· ∩ I _n as check lines. Many code classes exist in the Chinese remainder codes that have high code rates. Chinese remainder codes are the essential generalization of Sun Zi codes. Selected from Journal of Mathematical Research and Exposition, 2004, 24(2): 347–352     

Multilinear polynomials and cocentralizing conditions in prime rings

Let R be a noncommutative prime ring of characteristic different from 2, let Z(R) be its center, let U be the Utumi quotient ring of R, let C be the extended centroid of R, and let f(x ₁,..., x _n ) be a noncentral multilinear polynomial over C in n noncommuting variables. Denote by f(R) the set of all evaluations of f(x ₁, …, xn) on R. If F and G are generalized derivations of R such that [[F(x), x], [G(y), y]] ∈ Z(R) for any x, y ∈ f(R), then one of the following holds:

Power cocentralizing generalized derivations on prime rings

Let R be a prime ring, U the Utumi quotient ring of R, C = Z(U) the extended centroid of R, L a non-central Lie ideal of R, H and G non-zero generalized derivations of R. Suppose that there exists an integer n ≥ 1 such that (H(u)u − uG(u)) ⁿ = 0, for all u ∈ L, then one of the following holds: (1) there exists c ∈ U such that H(x) = xc, G(x) = cx; (2) R satisfies the standard identity s ₄ and char (R) = 2; (3) R satisfies s ₄ and there exist a, b, c ∈ U, such that H(x) = ax+xc, G(x) = cx+xb and (a − b) ⁿ = 0.     

On the iteration of holomorphic self-maps of ℂ*

Letf be a holomorphic self-map of the punctured plane ℂ^*=ℂ\{0} with essentially singular points 0 and ∞. In this note, we discuss the setsI ₀(f)={z ∈ ℂ^*:f ⁿ (z) → 0,n → ∞} andI _∞(f)={z ∈ ℂ^*:f ⁿ (z) → 0,n → ∞}. We try to find the relation betweenI ₀(f),I _∞(t) andJ(f). It is proved that both the boundary ofI ₀(f) and the boundary ofI _∞)f) equal toJ(f),I ₀(f) ∩J(f) ≠ θ andI _∞(f) ∩J(f) ≠ θ. As a consequence of these results, we find bothI ₀(f) andI _∞(f) are not doubly-bounded. Supported by the National Natural Science Foundation of China     

Theorems for generalized Favard-Kantorovich and Favard-Durrmeyer operators in exponential function spaces

We consider the Kantorovich and the Durrmeyer type modifications of the generalized Favard operators and we prove some direct approximation theorems for functions f such that w _σ f ∈ L _p (R), where 1 ≤ p ≤ ∞ and w _σ (x) = exp(−σx ²), σ > 0.     

On semi-infinite systems of linear inequalities

The ordered fieldR(M) consists of the realsR with a transcendentalM adjoined, which is larger than any realr ∈R. Given any semi-infinite matrix (s.i.m.) interpreted as linear inequalities:u ^tP_i≧c _i, ∀ _i ∈I, an arbitrary index set, it is also shown that the following are equivalent. (1) For every finiteJ ⊆I the systemu ^tP_i≧c _i,i ∈J is consistent, and (2) the s.i.m. has a solutionu ∈R(M) ⁿ. Some consequences for “duality gaps” are also given. These results were obtained as part of the activities of the Management Science Research Group and School of Urban and Public Affairs, Carnegie-Mellon University.     

Large centralizers in finite solvable groups

In 1955 R. Brauer and K. A. Fowler showed that ifG is a group of even order >2, and the order |Z(G)| of the center ofG is odd, then there exists a strongly real) elementx∈G−Z whose centralizer satisfies|C _G(x)|>|G|^1/3. In Theorem 1 we show that every non-abeliansolvable groupG contains an elementx∈G−Z such that|C _G(x)|>[G:G′∩Z]^1/2 (and thus|C _G(x)|>|G|^1/3). We also note that if non-abelianG is either metabelian, nilpotent or (more generally) supersolvable, or anA-group, or any Frobenius group, then|C _G(x)|>|G|^1/2 for somex∈G−Z. In Theorem 2 we prove that every non-abelian groupG of orderp ^mqⁿ (p, q primes) contains a proper centralizer of order >|G|^1/2. Finally, in Theorem 3 we show that theaverage |C(x)|, x∈G, is ≧c|G| ^1/3 for metabelian groups, wherec is constant and the exponent 1/3 is best possible.     

The total reducibility order of a polynomial in two variables

LetK be an algebraically closed field of characteristic zero. ForA ∈K[x, y] let σ(A) = {λ ∈K:A − λ is reducible}. For λ ∈ σ(A) letA − λ = ∏ _i=1 ^n(λ) A _iλ ^k _μ whereA _iλ are distinct primes. Let ϱ_λ(A) =n(λ) − 1 and let ρ(A) = Σ_λɛσ(A)ϱ_λ(A). The main result is the following: Theorem.If A ∈ K[x, y] is not a composite polynomial, then ρ(A) < degA.     

Cycles in Partially Square Graphs

. In this work we consider finite undirected simple graphs. If G=(V,E) is a graph we denote by α(G) the stability number of G. For any vertex x let N[x] be the union of x and the neighborhood N(x). For each pair of vertices ab of G we associate the set J(a,b) as follows. J(a,b)={u∈N[a]∩N[b]∣N(u)⊆N[a]∪N[b]}. Given a graph G, its partially squareG ^* is the graph obtained by adding an edge uv for each pair u,v of vertices of G at distance 2 whenever J(u,v) is not empty. In the case G is a claw-free graph, G ^* is equal to G ². If G is k-connected, we cover the vertices of G by at most ⌈α(G ^*)/k⌉ cycles, where α(G ^*) is the stability number of the partially square graph of G. On the other hand we consider in G ^* conditions on the sum of the degrees. Let G be any 2-connected graph and t be any integer (t≥2). If ∑ _{x ∈ S} deg _G (x)≥|G|, for every t-stable set S⊆V(G) of G ^* then the vertex set of G can be covered with t−1 cycles. Different corollaries on covering by paths are given. Received: January 22, 1997 Final version received: February 15, 2000     

A note on nil power serieswise Armendariz rings

A ring R is called nil power serieswise Armendariz if $ \forall f = \sum\limits_{i = 0}^\infty {a_i X^i } $ \forall f = \sum\limits_{i = 0}^\infty {a_i X^i } and $ g = \sum\limits_{i = 0}^\infty {b_i X^i } $ g = \sum\limits_{i = 0}^\infty {b_i X^i } in R[[X]] such that f g ∈ Nil(R)[[X]], then a _i b _j ∈ Nil(R) for all i and j. In this note we characterize completely nil power serieswise Armendariz rings with their nilradical Nil(R) (where the nilradical is the set of nilpotent elements). We prove that a ring is nil power serieswise Armendariz if and only if Nil(R) is an ideal of R. We prove that each power serieswise Armendariz ring is nil power serieswise Armendariz and we give examples of nil power serieswise Armendariz rings.     

On the divisor function of sets with even partition functions

Summary For P∈ F₂[z] with P(0)=1 and deg(P)≧ 1, let A =A(P) be the unique subset of N (cf. [9]) such that Σ_n≧0 p(A,n)zⁿ ≡ P(z) mod 2, where p(A,n) is the number of partitions of n with parts in A. To determine the elements of the set A, it is important to consider the sequence σ(A,n) = Σ _{d|n, d∈A} d, namely, the periodicity of the sequences (σ(A,2^kn) mod 2^k+1)_n≧1 for all k ≧ 0 which was proved in [3]. In this paper, the values of such sequences will be given in terms of orbits. Moreover, a formula to σ(A,2^kn) mod 2^k+1 will be established, from which it will be shown that the weight σ(A₁,2^kz_i) mod 2^k+1 on the orbit <InlineEquation ID=IE"1"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"2"><EquationSource Format="TEX"><![CDATA[$]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>z_i$ is moved on some other orbit z_j when A₁ is replaced by A₂ with A₁= A(P₁) and A₂= A(P₂) P₁ and P₂ being irreducible in F₂[z] of the same odd order.     

Accuracy of several multidimensional refinable distributions

Compactly supported distributions f₁,..., f_r on ℝ^d are fefinable if each f_i is a finite linear combination of the rescaled and translated distributions f_j(Ax−k), where the translates k are taken along a lattice Γ ⊂ ∝^d and A is a dilation matrix that expansively maps Γ into itself. Refinable distributions satisfy a refinement equation f(x)=Σ_k∈Λ c_k f(Ax−k), where Λ is a finite subset of Γ, the c_k are r×r matrices, and f=(f₁,...,f_r)^T. The accuracy of f is the highest degree p such that all multivariate polynomials q with degree(q)<p are exactly reproduced from linear combinations of translates of f₁,...,f_r along the lattice Γ. We determine the accuracy p from the matrices c_k. Moreover, we determine explicitly the coefficients y_α,i(k) such that x^α=Σ _i=1 ^r Σ_k∈Γy_α,i(k) fi(x+k). These coefficients are multivariate polynomials y_α,i(x) of degree |α| evaluated at lattice points k∈Γ.     

Nearly flat almost monotone measures are big pieces of lipschitz graphs

A concentrated (ξ, m) almost monotone measure inR ⁿ is a Radon measure Φ satisfying the two following conditions: (1) Θ ^m (Φ,x)≥1 for every x ∈spt (Φ) and (2) for everyx ∈R ⁿ the ratioexp [ξ(r)]r^−mΦ(B(x,r)) is increasing as a function of r>0. Here ξ is an increasing function such thatlim _r→0-ξ(r)=0. We prove that there is a relatively open dense setReg (Φ) ∋spt (Φ) such that at each x∈Reg(Φ) the support of Φ has the following regularity property: given ε>0 and λ>0 there is an m dimensional spaceW ⊂R ⁿ and a λ-Lipschitz function f from x+W into x+W^‖ so that (100-ε)% ofspt(Φ) ∩B (x, r) coincides with the graph of f, at some scale r>0 depending on x, ε, and λ.     

Commutative rings whose zero-divisor graph is a proper refinement of a star graph

A graph is called a proper refinement of a star graph if it is a refinement of a star graph, but it is neither a star graph nor a complete graph. For a refinement of a star graph G with center c, let G _c ^* be the subgraph of G induced on the vertex set V (G)\ {c or end vertices adjacent to c}. In this paper, we study the isomorphic classification of some finite commutative local rings R by investigating their zero-divisor graphs G = Γ(R), which is a proper refinement of a star graph with exactly one center c. We determine all finite commutative local rings R such that G _c ^* has at least two connected components. We prove that the diameter of the induced graph G _c ^* is two if Z(R)² ≠ {0}, Z(R)³ = {0} and G _c ^* is connected. We determine the structure of R which has two distinct nonadjacent vertices α, β ∈ Z(R)* \ {c} such that the ideal [N(α) ∩ N(β)]∪ {0} is generated by only one element of Z(R)*\{c}. We also completely determine the correspondence between commutative rings and finite complete graphs K _n with some end vertices adjacent to a single vertex of K _n .