A comparative study of functional equations characterising sine and cosine

A comparative study of the functional equationsf(x+y)f(x–y)=f ²(x)–f ²(y),f(y){f(x+y)+f(x–y)}=f(x)f(2y) andf(x+y)+f(x–y)=2f(x){1–2f ²(y/2)} which characterise the sine function has been carried out. The zeros of the functionf satisfying any one of the above equations play a vital role in the investigations. The relation of the equationf(x+y)+f(x–y)=2f(x){1–2f ²(y/2)} with D'Alembert's equation,f(x+y)+f(x–y)=2f(x)f(y) and the sine-cosine equationg(x–y)=g(x)g(y) +f(x)f(y) has also been investigated.     

The smooth Banach submanifold B*(E, F) in B(E, F)

Let E,F be two Banach spaces,B(E,F),B+(E,F),Φ(E,F),SΦ(E,F) and R(E,F) be bounded linear,double splitting,Fredholm,semi-Frdholm and finite rank operators from E into F,respectively. Let Σ be any one of the following sets:{T ∈Φ(E,F):Index T=constant and dim N(T)=constant},{T ∈ SΦ(E,F):either dim N(T)=constant< ∞ or codim R(T)=constant< ∞} and {T ∈ R(E,F):Rank T=constant< ∞}. Then it is known that Σ is a smooth submanifold of B(E,F) with the tangent space TAΣ={B ∈ B(E,F):BN(A)-R(A) } for any A ∈Σ. However,for ...     

Divisibility of matrices associated with multiplicative functions

Let S={x₁,…,x_n} be a set of n distinct positive integers. For x,y∈S and y<x, we say the y is a greatest-type divisor of x in S if y∣x and it can be deduced that z=y from y∣z,z∣x,z<x and z∈S. For x∈S, let G_S(x) denote the set of all greatest-type divisors of x in S. For any arithmetic function f, let (f(x_i,x_j)) denote the n×n matrix having f evaluated at the greatest common divisor (x_i,x_j) of x_i and x_j as its i,j-entry and let (f[x_i,x_j]) denote the n×n matrix having f evaluated at the least common multiple [x_i,x_j] of x_i and x_j as its i,j-entry. In this paper, we assume that S is a gcd-closed set and . We show that if f is a multiplicative function such that (f∗μ)(d)∈Z whenever and f(a)|f(b) whenever a|b and a,b∈S and (f(x_i,x_j)) is nonsingular, then the matrix (f(x_i,x_j)) divides the matrix (f[x_i,x_j]) in the ring M_n(Z) of n×n matrices over the integers. As a consequence, we show that (f(x_i,x_j)) divides (f[x_i,x_j]) in the ring M_n(Z) if (f∗μ)(d)∈Z whenever and f is a completely multiplicative function such that (f(x_i,x_j)) is nonsingular. This confirms a conjecture of Hong raised in 2004.     

Decomposition tree of a lexicographic product of binary structures

Given a set S and a positive integer k, a binary structure is a function . The set S is denoted by V(B) and the integer k is denoted by . With each subset X of V(B) associate the binary substructure B[X] of B induced by X defined by B[X](x,y)=B(x,y) for any x≠y∈X. A subset X of V(B) is a clan of B if for any x,y∈X and v∈V(B)?X, B(x,v)=B(y,v) and B(v,x)=B(v,y). A subset X of V(B) is a hyperclan of B if X is a clan of B satisfying: for every clan Y of B, if X∩Y≠0?, then X⊆Y or Y⊆X. With each binary structure B associate the family Π(B) of the maximal proper and nonempty hyperclans under inclusion of B. The decomposition tree of a binary structure B is constituted by the hyperclans X of B such that Π(B[X])≠0? and by the elements of Π(B[X]). Given binary structures B and C such that , the lexicographic product B⌊C⌋ of C by B is defined on V(B)×V(C) as follows. For any (x,y)≠(x^′,y^′)∈V(B)×V(C), B⌊C⌋((x,x^′),(y,y^′))=B(x,y) if x≠y and B⌊C⌋((x,x^′),(y,y^′))=C(x^′,y^′) if x=y. The decomposition tree of the lexicographic product B⌊C⌋ is described from the decomposition trees of B and C.     

Localisation in rings equipped with a solvable Lie algebra action

Let k be an algebraically closed uncountable field of characteristic 0,g a finite dimensional solvable k-Lie algebraR a noetherian k-algebra on which g acts by k-derivationsU(g) the enveloping algebra of g,A=R*g the crossed product of R by U(g)P a prime ideal of A and Ω(P) the clique of P. Suppose that the prime ideals of the polynomial ring R[x] are completely prime. If R is g-hypernormal, then Ω(P) is classical. Denote by A_T the localised ring and let M be a primitive ideal of A_T Set Q=P∩R In this note, we show that if R is a strongly (R,g)-admissible integral domain and if QR_Q is generated by a regular g-centralising set of elements, then

(1)M is generated by a regular g-semi-invariant normalising set of elements of cardinald = dim (R_Q 0 + ∣X_A (P)∣

(2)d gldim(A_T ) = Kdim(A_T ) = ht(M) = ht(P).     

Upper and lower bounds of the valence-functional

For the non-negative integerg let (M, g) denote the closed orientable 2-dimensional manifold of genusg. K-realizationsP of (M, g) are geometric cell-complexes inP with convex facets such that set (P) is homeomorphic toM. ForK-realizationsP of (M, g) and verticesv ofP, val (v,P) denotes the number of edges ofP incident withv and the weighted vertex-number Σ(val(v, P)-3) taken over all vertices ofP is called valence-valuev (P) ofP. The valence-functionalV, which is important for the determination of all possiblef-vectors ofK-realisations of (M, g), in connection with Eberhard's problem etc., is defined byV(g):=min[v(P)|P is aK-realization of (M,g)]. The aim of the note is to prove the inequality 2g+1≦V(g)≦3g+3 for every positive integerg.     

On completeness of the quotient algebras {\cal P}(\kappa)/I

In this paper, the following are proved: Theorem A. The quotient algebra ${\cal P} (\kappa )/I$ is complete if and only if the only non-trivial I -closed ideals extending I are of the form $I\lceil A$ for some $A\in I^+$ . Theorem B. If $\kappa$ is a stationary cardinal, then the quotient algebra ${\cal P} (\kappa )/ NS_\kappa$ is not complete. Corollary. (1) If $\kappa$ is a weak compact cardinal, then the quotient algebra ${\cal P} (\kappa )/NS_\kappa$ is not complete. (2) If $\kappa$ bears $\kappa$ -saturated ideal, then the quotient algebra ${\cal P} (\kappa )/NS_\kappa$ is not complete. Theorem C. Assume that $\kappa$ is a strongly compact cardinal, I is a non-trivial normal $\kappa$ -complete ideal on $\kappa$ and B is an I -regular complete Boolean algebra. Then if ${\cal P} (\kappa )/I$ is complete, it is B -valid that for some $A\subseteq\check\kappa$ , ${\cal P} (\kappa )/({\bf J}\lceil A)$ is complete, where J is the ideal generated by $\check I$ in $V^B$ . Corollary. Let M be a transitive model of ZFC and in M , let $\kappa$ be a strongly compact cardinal and $\lambda$ a regular uncountable cardinal less than $\kappa$ . Then there exists a generic extension M [ G ] in which $\kappa =\lambda^+$ and $\kappa$ carries a non-trivial $\kappa$ -complete ideal I which is completive but not $\kappa^+$ -saturated. Received: 1 April 1997 / Revised version: 1 July 1998     

Illuminating high-dimensional convex sets

A setL of points in thed-spaceE ^d is said toilluminate a familyF={S ₁, ...,S _n } ofn disjoint compact sets inE ^d if for every setS _i inF and every pointx in the boundary ofS _i there is a pointv inL such thatv illuminatesx, i.e. the line segment joiningv tox intersects the union of the elements ofF in exactly {x}.The problem we treat is the size of a setS needed to illuminate a familyF={S ₁, ...,S _n } ofn disjoint compact sets inE ^d . We also treat the problem of putting these convex sets in mutually disjoint convex polytopes, each one having at most a certain number of facets.     

Chaos caused by a strong-mixing measure-preserving transformation

The chaos caused by a strong-mixing preserving transformation is discussed and it is shown that for a topological spaceX satisfying the second axiom of countability and for an outer measurem onX satisfying the conditions: (i) every non-empty open set ofX ism-measurable with positivem-measure; (ii) the restriction ofm on Borel σ-algebra ℬ(X) ofX is a probability measure, and (iii) for everyY⊂X there exists a Borel setB⊂ℬ(X) such thatB⊃Y andm(B) =m(Y), iff:X→X is a strong-mixing measure-preserving transformation of the probability space (X, ℬ(X),m), and if {m}, is a strictly increasing sequence of positive integers, then there exists a subsetC⊂X withm (C) = 1, finitely chaotic with respect to the sequence {m _i}, i.e. for any finite subsetA ofC and for any mapF:A→X there is a subsequencer _i such that lim_i→∞ f ^r i(a) =F(a) for anya ∈A. There are some applications to maps of one dimension. the National Natural Science Foundation of China.     

Graceful Signed Graphs

A (p, q)-sigraph S is an ordered pair (G, s) where G = (V, E) is a (p, q)-graph and s is a function which assigns to each edge of G a positive or a negative sign. Let the sets E ⁺ and E ^– consist of m positive and n negative edges of G, respectively, where m + n = q. Given positive integers k and d, S is said to be (k, d)-graceful if the vertices of G can be labeled with distinct integers from the set {0, 1, ..., k + (q – 1)d such that when each edge uv of G is assigned the product of its sign and the absolute difference of the integers assigned to u and v the edges in E ⁺ and E ^– are labeled k, k + d, k + 2d, ..., k + (m – 1)d and –k, – (k + d), – (k + 2d), ..., – (k + (n – 1)d), respectively.In this paper, we report results of our preliminary investigation on the above new notion, which indeed generalises the well-known concept of (k, d)-graceful graphs due to B. D. Acharya and S. M. Hegde.     

Fields for which the projective schur subgroup is the whole Brauer group

LetBr(K) denote the Brauer group of a fieldK andPS(K) the projective Schur subgroup. 1. LetK be a finitely generated infinite field. ThenPS(K)=Br(K) if and only ifK is a global field. 2.|LetK be a finitely generated infinite field, and letK((t)) denote the field of formal power series int overK. ThenPS(K((t)))=Br(K((t))) if and only ifK=ℚ.     

Coinvariants for a coadjoint action of quantum matrices

Let K be a (algebraically closed ) field. A morphism A ⟼ g ⁻¹ Ag, where A ∈ M(n) and g ∈ GL(n), defines an action of a general linear group GL(n) on an n × n-matrix space M(n), referred to as an adjoint action. In correspondence with the adjoint action is the coaction α: K[M(n)] → K[M(n)] ⊗ K[GL(n)] of a Hopf algebra K[GL(n)] on a coordinate algebra K[M(n)] of an n × n-matrix space, dual to the conjugation morphism. Such is called an adjoint coaction. We give coinvariants of an adjoint coaction for the case where K is a field of arbitrary characteristic and one of the following conditions is satisfied: (1) q is not a root of unity; (2) char K = 0 and q = ±1; (3) q is a primitive root of unity of odd degree. Also it is shown that under the conditions specified, the category of rational GL _q × GL _q -modules is a highest weight category.     

Additive Set of Idempotents in Rings

Let R be a ring with identity 1, I(R) be the set of all nonunit idempotents in R, and M(R) be the set of all primitive idempotents and 0 of R. We say that I(R) is additive if for all e, f ∈ I(R) (e ≠ f), e + f ∈ I(R), and M(R) is additive in I(R) if for all e, f ∈ M(R)(e ≠ f), e + f ∈ I(R). In this article, the following points are shown: (1) I(R) is additive if and only if I(R) is multiplicative and the characteristic of R is 2; M(R) is additive in I(R) if and only if M(R) is orthogonal. If 0 ≠ ef ∈ I(R) for some e ∈ M(R) and f ∈ I(R), then ef ∈ M(R), (2) If R has a complete set of primitive idempotents, then R is a finite product of connected rings if and only if I(R) is multiplicative if and only if M(R) is additive in I(R).     

Gaussian Property of the Rings R(X) and R〈X〉

The content of a polynomial f over a commutative ring R is the ideal c(f) of R generated by the coefficients of f. A commutative ring R is said to be Gaussian if c(fg) = c(f)c(g) for every polynomials f and g in R[X]. A number of authors have formulated necessary and sufficient conditions for R(X) (respectively, R?X?) to be semihereditary, have weak global dimension at most one, be arithmetical, or be Prüfer. An open question raised by Glaz is to formulate necessary and sufficient conditions that R(X) (respectively, R?X?) have the Gaussian property. We give a necessary and sufficient condition for the rings R(X) and R?X? in terms of the ring R in case the square of the nilradical of R is zero.     

The Convexity Number of a Graph

 For two vertices u and v of a connected graph G, the set I[u,v] consists of all those vertices lying on a u−v shortest path in G, while for a set S of vertices of G, the set I[S] is the union of all sets I[u,v] for u,v∈S. A set S is convex if I[S]=S. The convexity number con(G) of G is the maximum cardinality of a proper convex set of G. The clique number ω(G) is the maximum cardinality of a clique in G. If G is a connected graph of order n that is not complete, then n≥3 and 2≤ω(G)≤con(G)≤n−1. It is shown that for every triple l,k,n of integers with n≥3 and 2≤l≤k≤n−1, there exists a noncomplete connected graph G of order n with ω(G)=l and con(G)=k. Other results on convex numbers are also presented. Received: August 19, 1998 Final version received: May 17, 2000     

Some results on generalized exponents

A digraph G = (V, E) is primitive if, for some positive integer k, there is a u → v walk of length k for every pair u, v of vertices of V. The minimum such k is called the exponent of G, denoted exp(G). The exponent of a vertex u ∈ V, denoted exp(u), is the least integer k such that there is a u → v walk of length k for each v ∈ V. For a set X ⊆ V, exp(X) is the least integer k such that for each v ∈ V there is a X → v walk of length k, i.e., a u → v walk of length k for some u ∈ X. Let F(G, k) : = max{exp(X) : |X| = k} and F(n, k) : = max{F(G, k) : |V| = n}, where |X| and |V| denote the number of vertices in X and V, respectively. Recently, B. Liu and Q. Li proved F(n, k) = (n − k)(n − 1) + 1 for all 1 ≤ k ≤ n − 1. In this article, for each k, 1 ≤ k ≤ n − 1, we characterize the digraphs G such that F(G, k) = F(n, k), thereby answering a question of R. Brualdi and B. Liu. We also find some new upper bounds on the (ordinary) exponent of G in terms of the maximum outdegree of G, Δ⁺(G) = max{d⁺(u) : u ∈ V}, and thus obtain a new refinement of the Wielandt bound (n − 1)² + 1. © 1998 John Wiley & Sons, Inc. J. Graph Theory 28: 215–225, 1998     

Homotopy invariants of mappings to the circle

Homotopy classes of mappings of a space X to the circle T form an Abelian group B(X) (the Bruschlinsky group). If a: X → T is a continuous mapping, then [a] denotes the homotopy class of a, and I _r (a): (X × T) _r → \mathbbZ \mathbb{Z} is the indicator function of the rth Cartesian power of the graph of a. Let C be an Abelian group and let f: B(X) → C be a mapping. By definition, f has order not greater than r if the correspondence I _r (a) → f([a]) extends to a (partly defined) homomorphism from the Abelian group of Z-valued functions on (X × T) ^r to C. It is proved that the order of f equals the algebraic degree of f. (A mapping between Abelian groups has degree at most r if all of its finite differences of order r +1 vanish.) Bibliography: 2 titles.     

On edge star sets in trees

Let A be a Hermitian matrix whose graph is G (i.e. there is an edge between the vertices i and j in G if and only if the (i,j) entry of A is non-zero). Let λ be an eigenvalue of A with multiplicity m_A(λ). An edge e=ij is said to be Parter (resp., neutral, downer) for λ,A if m_A(λ)−m_A−e(λ) is negative (resp., 0, positive ), where A−e is the matrix resulting from making the (i,j) and (j,i) entries of A zero. For a tree T with adjacency matrix A a subset S of the edge set of G is called an edge star set for an eigenvalue λ of A, if |S|=m_A(λ) and A−S has no eigenvalue λ. In this paper the existence of downer edges and edge star sets for non-zero eigenvalues of the adjacency matrix of a tree is proved. We prove that neutral edges always exist for eigenvalues of multiplicity more than 1. It is also proved that an edge e=uv is a downer edge for λ,A if and only if u and v are both downer vertices for λ,A; and e=uv is a neutral edge if u and v are neutral vertices. Among other results, it is shown that any edge star set for each eigenvalue of a tree is a matching.     

Existence of Three Positive Pseudo-symmetric Solutions for a One Dimensional Discrete p-Laplacian

We apply the Five Functionals Fixed Point Theorem to verify the existence of at least three positive pseudo-symmetric solutions for the discrete three point boundary value problem, ?(g(?u(t-1)))+a(t))f(u(t))=0, for t∈{a+1,…,b+1} and u(a)=0 with u(v)=u(b+2) where g(v)=|v| ^p-2 v, p>1, for some fixed v∈{a+1,…,b+1} and σ=(b+2+v)/2 is an integer.