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 σ.     

Difference algebraic subgroups of commutative algebraic groups over finite fields

We study the question of which torsion subgroups of commutative algebraic groups over finite fields are contained in modular difference algebraic groups for some choice of a field automorphism. We show that if G is a simple commutative algebraic group over a finite field of characteristic p, ? is a prime different from p, and for some difference closed field (?, σ) the ?-primary torsion of G(?) is contained in a modular group definable in (?, σ), then it is contained in a group of the form {x∈G(?) :σ(x) =[a](x) } with a∈ℕ\p ^ℕ. We show that no such modular group can be found for many G of interest. In the cases that such equations may be found, we recover an effective version of a theorem of Boxall. Received: 28 May 1998 / Revised version: 20 December 1998     

Jacobson radical of skew polynomial rings and skew group rings

LetR be a ring and σ an automorphism ofR. We prove the following results: (i)J(R _σ[x])={Σ_ir_i x ⁱ:r₀∈I∩J(R]), r _i∈I for alliε 1} whereI↪ {r∈R:rx ∈J(R _Σ[x])|s= (ii)J(R _σ<x>)=(J(R _σ<x>)∩R)_σ<x>. As an application of the second result we prove that ifG is a solvable group such thatG andR, + have disjoint torsions thenJ(R)=0 impliesJ(R(G))=0.     

Gauss-Bonnet Formula, Finiteness Condition, and Characterizations of Graphs Embedded in Surfaces

Let G be an infinite graph embedded in a closed 2-manifold, such that each open face of the embedding is homeomorphic to an open disk and is bounded by finite number of edges. For each vertex x of G, define the combinatorial curvature

Classification of finite groups according to the number of conjugacy classes II

In the following,G denotes a finite group,r(G) the number of conjugacy classes ofG, β(G) the number of minimal normal subgroups ofG andα(G) the number of conjugate classes ofG not contained in the socleS(G). Let Φ _j = {G|β(G) =r(G) −j}. In this paper, the family Φ₁₁ is classified. In addition, from a simple inspection of the groups withr(G) =b conjugate classes that appear in ϒ _j ^=1/11 Φ _j , we obtain all finite groups satisfying one of the following conditions: (1)r(G) = 12; (2)r(G) = 13 andβ(G) > 1; …; (9)r(G) = 20 andβ(G) > 8; (10)r(G) =n andβ(G) =n −a with 1 ≦a ≦ 11, for each integern ≧ 21. Also, we obtain all finite groupsG with 13 ≦r(G) ≦ 20,β(G) ≦r(G) − 12, and satisfying one of the following conditions: (i) 0 ≦α(G) ≦ 4; (ii) 5 ≦α(G) ≦ 10 andS(G) solvable.     

The roots of <Emphasis Type="Italic">σ</Emphasis>-polynomials

Let G be a connected graph. We denote by σ(G,x) and δ(G) respectively the σ-polynomial and the edge-density of G, where . If σ(G,x) has at least an unreal root, then G is said to be a σ-unreal graph. Let δ(n) be the minimum edgedensity over all n vertices graphs with σ-unreal roots. In this paper, by using the theory of adjoint polynomials, a negative answer to a problem posed by Brenti et al. is given and the following results are obtained: For any positive integer a and rational number 0≤c≤1, there exists at least a graph sequence {G _i}_1≤i≤a such that G _i is σ-unreal and δ(G _i)→c as n→∞ for all 1 ≤i≤a, and moreover, δ(n)→0 as n→∞. Supported by the National Natural Science Foundation of China (10061003) and the Science Foundation of the State Education Ministry of China.     

Some Elements of Finite Order in K2Q

Let K2 be the Milnor functor and let Фn （x）∈ Q[X] be the n-th cyclotomic polynomial. Let Gn（Q） denote a subset consisting of elements of the form {a, Фn（a）}, where a ∈ Q^＊ and {, } denotes the Steinberg symbol in K2Q. J. Browkin proved that Gn（Q） is a subgroup of K2Q if n = 1,2, 3, 4 or 6 and conjectured that Gn（Q） is not a group for any other values of n. This conjecture was confirmed for n =2^T 3S or n = p^r, where p ≥ 5 is a prime number such that h（Q（ζp）） is not divisible by p. In this paper we confirm the conjecture for some n, where n is not of the above forms, more precisely, for n = 15, 21,33, 35, 60 or 105.     

Distinguishing labeling of the actions of almost simple groups

Suppose Γ is a group acting on a set X, written as (Γ,X). An r-labeling f: X→{1,2, ..., r} of X is called distinguishing for (Γ,X) if for all σ∈Γ,σ≠1, there exists an element x∈X such that f(x)≠f(x ^σ ). The distinguishing number d(Γ,X) of (Γ,X) is the minimum r for which there is a distinguishing r-labeling for (Γ,X). If Γ is the automorphism group of a graph G, then d(Γ,V (G)) is denoted by d(G), and is called the distinguishing number of the graph G. The distinguishing set of Γ-actions is defined to be D*(Γ)={d(Γ,X): Γ acts on X}, and the distinguishing set of Γ-graphs is defined to be D(Γ)={d(G): Aut(G)≅Γ}. This paper determines the distinguishing set of Γ-actions and the distinguishing set of Γ-graphs for almost simple groups Γ.     

A problem on semigroups satisfying permutation identities

Let σ be a nontrivial permutation of ordern. A semigroupS is said to be σ-permutable ifx ₁ x ₂ ...x _n =x _σ(1) x _σ(2) ...x _σ(n) , for every (x ₁ ,x ₂,...,x _n )∈S ⁿ . A semigroupS is called(r,t)-commutative, wherer,t are in ℕ^*, ifx ₁ ...x _r x _r+1 ...x _r+t =x _r+1 ...x _r+t x ₁ ...x _r , for every (x ₁ ,x ₂,...,x _r+t ∈S ^r+t . According to a result of M. Putcha and A. Yaqub ([11]), if σ is a fixed-point-free permutation andS is a σ-permutable semigroup then there existsk ∈ ℕ^* such thatS is (1,k)-commutative. In [8], S. Lajos raises up the problem to determine the leastk=k(n) ∈ ℕ^* such that, for every fixed-point-free permutation σ of ordern, every σ-permutable semigroup is also (1,k)-commutative. In this paper this problem is solved for anyn less than or equal to eight and also whenn is any odd integer. For doing this we establish that if a semigroup satisfies a permutation identity of ordern then inevitably it also satisfies some permutation identities of ordern+1.     

On the length of commutators in Chevalley groups

Let G = G(Φ,R) be the simply connected Chevalley group with root system Φ over a ring R. Denote by E(Φ,R) its elementary subgroup. The main result of the article asserts that the set of commutators C = {[a, b]|a ∈ G(Φ, R), b ∈ E(Φ, R)} has bounded width with respect to elementary generators. More precisely, there exists a constant L depending on Φ and dimension of maximal spectrum of R such that any element from C is a product of at most L elementary root unipotent elements. A similar result for Φ = A _l , with a better bound, was earlier obtained by Sivatski and Stepanov.     

On based-free actions of compact lie groups on the hilbert cube

It is proved that a based-free action α of a given compact Lie groupG on the Hilbert cubeQ is equivalent to the standard based-free action σ if and only if the orbit spaceQ ₀/α of the free partQ ₀=Q* is aQ-manifold having the proper homotopy type of the orbit spaceQ ₀/σ. The existence of an equivariant retraction (Q ₀, σ)→(Q ₀, α) is established. It is proved that for any TikhonovG-spaceX the family of all equivariant mapsX→ conG separates the points and the closed sets inX. Translated fromMatematicheskie Zametki, Vol. 65, No. 2, pp. 163–174, February, 1999.     

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 λ.     

Additive summable processes and their stochastic integral

We define and study a class of summable processes, called additive summable processes, that is larger than the class used by Dinculeanu and Brooks [D-B]. We relax the definition of a summable processesX:Ω×ℝ₊→E⊂L(F, G) by asking for the associated measureI _X to have just an additive extension to the predictableσ-algebra ℘, such that each of the measures (I _X) _z , forz∈(L _G ^p )*, beingσ-additive, rather than having aσ-additive extension. We define a stochastic integral with respect to such a process and we prove several properties of the integral. After that we show that this class of summable processes contains all processesX:Ω×ℝ₊→E⊂L(F, G) with integrable semivariation ifc ₀ ∋G.     

Universal groups on semilattices of reversible cancellative semigroups

LetS be a semigroup which is a semilattice Ω of reversible cancellative semigroupsS _α, α∈Ω. This paper studies the relationship between the universal groupG onS and the universal groupsG _α onS _α. We also show that the universal homorphismsf _α∶S _α→G _α, α∈Ω fromS _α to the category of groups combine to a homomorphismf∶S→G ofS into the category of groups.     

On some special measures on βG

LetG be a discrete abelian group,Ĝ the character group ofG, andl ^∞(G)^* the conjugate ofl ^∞(G) equipped with an Arens product. In many cases, we can find unitary functionsf such that χf is almost convergent to zero for all χ∈Ĝ. Some of these functions are then used to produce elements μ∈l ^∞(G)^* such that γμ=0 whenever γ is an annihilator ofC ₀(G). Regarded as Borel measures on βG, these elements satisfyxμ=0 for allx∈βG/G. They belong to the radical ofl ^∞(G)^*, and each of them generates a left ideal ofl ^∞(G)^* that contains no minimal left ideal.     

Partial Parity (g,f )-Factors and Subgraphs Covering Given Vertex Subsets

 Let G be a graph and W a subset of V(G). Let g,f:V(G)→Z be two integer-valued functions such that g(x)≤f(x) for all x∈V(G) and g(y)≡f(y) (mod 2) for all y∈W. Then a spanning subgraph F of G is called a partial parity (g,f)-factor with respect to W if g(x)≤deg _F (x)≤f(x) for all x∈V(G) and deg _F (y)≡f(y) (mod 2) for all y∈W. We obtain a criterion for a graph G to have a partial parity (g,f)-factor with respect to W. Furthermore, by making use of this criterion, we give some necessary and sufficient conditions for a graph G to have a subgraph which covers W and has a certain given property. Received: June 14, 1999?Final version received: August 21, 2000     

Generalizations of spectrally multiplicative surjections between uniform algebras

Let $ A $ A and ℬ be unital semisimple commutative Banach algebras. It is shown that if surjections S,T: $ A $ A → ℬ with S(1)=T(1)= 1 and α ∈ ℂ \ {0} satisfy r(S(a)T(b) − α)= r(ab− α) for all a,b ∈ $ A $ A , then S=T and S is a real algebra isomorphism, where r(a) is the spectral radius of a. Let I be a nonempty set, A and B be uniform algebras. Let ρ, τ: I → A and S,T: I → B be maps satisfying σ _π (S(p)T(q)) ⊂ σ _π (ρ(p) τ(q)) for all p,q ∈ I, where σ _π (f) is the peripheral spectrum of f. Suppose that the ranges ρ(I), τ(I) ⊂ A and S(I),T(I) ⊂ B are closed under multiplication in a sense, and contain peaking functions “enough”. There exists a homeomorphism ϕ: Ch(B)→Ch(A) such that S(p)(y)= ρ(p)(ϕ(y)) and T(p)(y)= τ(p)(ϕ(y)) for every p ∈ I and y ∈ Ch(B), where Ch(A) is the Choquet boundary of A.     

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     

On the Cauchy difference on normed spaces

LetX be a real linear normed space, (G, +) be a topological group, andK be a discrete normal subgroup ofG. We prove that if a continuous at a point or measurable (in the sense specified later) functionf:X →G fulfils the condition:f(x +y) -f(x) -f(y) ∈K whenever ‖x‖ = ‖y‖, then, under some additional assumptions onG,K, andX, there esists a continuous additive functionA :X →G such thatf(x) -A(x) ∈K.     

Possible limit laws for entrance times of an ergodic aperiodic dynamical system

LetG denote the set of decreasingG: ℝ→ℝ withGэ1 on ]−∞,0], and ƒ ₀ ^∞ G(t)dt⩽1. LetX be a compact metric space, andT: X→X a continuous map. Let μ denone aT-invariant ergodic probability measure onX, and assume (X, T, μ) to be aperiodic. LetU⊂X be such that μ(U)>0. Let τ _U (x)=inf{k⩾1:T ^k xεU}, and defineG _U (t)=1/u(U)u({xεU:u(U)τU(x)>t),tεℝ We prove that for μ-a.e.x∈X, there exists a sequence (U _n ) _n≥1 of neighbourhoods ofx such that {x}=∩ _n U _n , and for anyG ∈G, there exists a subsequence (n _k ) _k≥1 withG _{U n k} ↑U weakly. We also construct a uniquely ergodic Toeplitz flowO(x ^∞,S, μ), the orbit closure of a Toeplitz sequencex ^∞, such that the above conclusion still holds, with moreover the requirement that eachU _n be a cylinder set. In memory of Anzelm Iwanik