Picard Groups of Rings of Coinvariants

Let k be a field, H a Hopf k-algebra with bijective antipode, A a right H-comodule algebra and C a Hopf algebra with bijective antipode which is also a right H-module coalgebra. Under some appropriate assumptions, and assuming that the set of grouplike elements G(A ⊗ C) of the coring A ⊗ C is a group, we show how to calculate, via an exact sequence, the Picard group of the subring of coinvariants in terms of the Picard group of A and various subgroups of G(A ⊗ C). Presented by: Claus Ringel.     

A topological characterization of the goldman prime spectrum of a commutative ring

A prime ideal p of a commutative ring R is said to be a Goldman ideal (or a G-ideal) if there exists a maximal ideal M of the polynomial ring R[X] such that p = M ∩ R. A topological space is said to be goldspectral if it is homeomorphic to the space Gold(R) of G-ideals of R (Gold(R) is considered as a subspace of the prime spectrum Spec(R) equipped with the Zariski topology). We give here a topological characterization of goldspectral spaces.     

Linear maps between C*-algebras that are *-homomorphisms at a fixed point

Let A and B be C*-algebras. A linear map T : A → B is said to be a *-homomorphism at an element z ∈ A if ab* = z in A implies T (ab*) = T (a)T (b)* = T (z), and c*d = z in A gives T (c*d) = T (c)*T (d) = T (z). Assuming that A is unital, we prove that every linear map T : A → B which is a *-homomorphism at the unit of A is a Jordan *-homomorphism. If A is simple and infinite, then we establish that a linear map T : A → B is a *-homomorphism if and only if T is a *-homomorphism at the unit of A. For a general unital C*-algebra A and a linear map T : A → B, we prove that T is a *-homomorphism if, and only if, T is a *-homomorphism at 0 and at 1. Actually if p is a non-zero projection in A, and T is a ^?-homomorphism at p and at 1 ? p, then we prove that T is a Jordan *-homomorphism. We also study bounded linear maps that are *-homomorphisms at a unitary element in A.     

The structure of the 3-separations of 3-connected matroids

Tutte defined a k-separation of a matroid M to be a partition (A,B) of the ground set of M such that |A|,|B|k and r(A)+r(B)−r(M)<k. If, for all m<n, the matroid M has no m-separations, then M is n-connected. Earlier, Whitney showed that (A,B) is a 1-separation of M if and only if A is a union of 2-connected components of M. When M is 2-connected, Cunningham and Edmonds gave a tree decomposition of M that displays all of its 2-separations. When M is 3-connected, this paper describes a tree decomposition of M that displays, up to a certain natural equivalence, all non-trivial 3-separations of M.     

An Optimal Multisecret Threshold Scheme Construction

A multisecret threshold scheme is a system which protects a number of secret keys among a group of n participants. There is a secret s_K associated with every subset K of k participants such that any t participants in K can reconstruct the secret s_K, but a subset of w participants cannot get any information about a secret they are not associated with. This paper gives a construction for the parameters t = 2, k = 3 and for any n and w that is optimal in the sense that participants hold the minimal amount of information. Communicated by: P. Wild     

-Operator frames for a Banach space

In this paper, (p,Y)-Bessel operator sequences, operator frames and (p,Y)-Riesz bases for a Banach space X are introduced and discussed as generalizations of the usual concepts for a Hilbert space and of the g-frames. It is proved that the set of all (p,Y)-Bessel operator sequences for a Banach space X is a Banach space and isometrically isomorphic to the operator space B(X,ℓ^p(Y)). Some necessary and sufficient conditions for a sequence of operators to be a (p,Y)-Bessel operator sequence are given. Also, a characterization of an independent (p,Y)-operator frame for X is obtained. Lastly, it is shown that an independent (p,Y)-operator frame for X is just a (p,Y)-Riesz basis for X and has a unique dual (q,Y^*)-operator frame for X^*.     

Locally connected models for Julia sets

Let P be a polynomial with a connected Julia set J. We use continuum theory to show that it admits a finest monotone map φ onto a locally connected continuumJP_∼, i.e. a monotone map φ:J→JP_∼ such that for any other monotone map ψ:J→J^′ there exists a monotone map h with ψ=h°φ. Then we extend φ onto the complex plane C (keeping the same notation) and show that φ monotonically semiconjugates PC_| to a topological polynomialg:C→C. If P does not have Siegel or Cremer periodic points this gives an alternative proof of Kiwi's fundamental results on locally connected models of dynamics on the Julia sets, but the results hold for all polynomials with connected Julia sets. We also give a characterization and a useful sufficient condition for the map φ not to collapse all of J into a point.     

Autocommuting probability of a finite group

Let G be a finite group and Aut(G) the automorphism group of G. The autocommuting probability of G, denoted by Pr(G,Aut(G)), is the probability that a randomly chosen automorphism of G fixes a randomly chosen element of G. In this paper, we study Pr(G,Aut(G)) through a generalization. We obtain a computing formula, several bounds and characterizations of G through Pr(G,Aut(G)). We conclude the paper by showing that the generalized autocommuting probability of G remains unchanged under autoisoclinism.     

Solitary Subgroups

We call a subgroup A of a finite group G a solitary subgroup of G if G does not contain another isomorphic copy of A. We call a normal subgroup A of a finite group G a normal solitary subgroup of G if G does not contain another normal isomorphic copy of A. The property of being (normal) solitary can be viewed as a strengthening of the requirement that A is normal in G. We derive various results on the existence of (normal) solitary subgroups.     

Equivariant Reduction to Torus of a Principal Bundle

Let M be an irreducible projective variety, over an algebraically closed field k of characteristic zero, equipped with an action of a connected algebraic group S over k. Let E _G be a principal G-bundle over M equipped with a lift of the action of S on M, where G is a connected reductive linear algebraic group. Assume that E _G admits a reduction of structure group to a maximal torus TG. We give a necessary and sufficient condition for the existence of a T-reduction of E _G which is left invariant by the action of S on E _G .     

On JB -Rings

A ring R is a QB-ring provided that aR + bR = R with a, b ∈ R implies that there exists a y ∈ R such that It is said that a ring R is a JB-ring provided that R/J(R) is a QB-ring, where J(R) is the Jacobson radical of R. In this paper, various necessary and sufficient conditions, under which a ring is a JB-ring, are established. It is proved that JB-rings can be characterized by pseudo-similarity. Furthermore, the author proves that R is a JB-ring iff so is R/J(R)².     

Trees with Equal Domination and Restrained Domination Numbers

Let G = (V,E) be a graph and let S V. The set S is a packing in G if the vertices of S are pairwise at distance at least three apart in G. The set S is a dominating set (DS) if every vertex in V − S is adjacent to a vertex in S. Further, if every vertex in V − S is also adjacent to a vertex in V − S, then S is a restrained dominating set (RDS). The domination number of G, denoted by γ(G), is the minimum cardinality of a DS of G, while the restrained domination number of G, denoted by γ_r(G), is the minimum cardinality of a RDS of G. The graph G is γ-excellent if every vertex of G belongs to some minimum DS of G. A constructive characterization of trees with equal domination and restrained domination numbers is presented. As a consequence of this characterization we show that the following statements are equivalent: (i) T is a tree with γ(T)=γ_r(T); (ii) T is a γ-excellent tree and T ≠ K₂; and (iii) T is a tree that has a unique maximum packing and this set is a dominating set of T. We show that if T is a tree of order n with ℓ leaves, then γ_r(T) ≤ (n + ℓ + 1)/2, and we characterize those trees achieving equality.     

Topological properties of the multifunction space <Emphasis Type="Italic">L</Emphasis>(<Emphasis Type="Italic">X</Emphasis>) of cusco maps

A set-valued mapping F from a topological space X to a topological space Y is called a cusco map if F is upper semicontinuous and F(x) is a nonempty, compact and connected subset of Y for each x ∈ X. We denote by L(X), the space of all subsets F of X × ℝ such that F is the graph of a cusco map from the space X to the real line ℝ. In this paper, we study topological properties of L(X) endowed with the Vietoris topology. The second author is supported by the SPM fellowship awarded by the Council of Scientific and Industrial Research, India.     

On the chromatic spectrum of acyclic decompositions of graphs

If G is any graph, a G‐decomposition of a host graph H = (V, E) is a partition of the edge set of H into subgraphs of H which are isomorphic to G. The chromatic index of a G‐decomposition is the minimum number of colors required to color the parts of the decomposition so that two parts which share a node get different colors. The G‐spectrum of H is the set of all chromatic indices taken on by G‐decompositions of H. If both S and T are trees, then the S‐spectrum of T consists of a single value which can be computed in polynomial time. On the other hand, for any fixed tree S, not a single edge, there is a unicyclic host whose S‐spectrum has two values, and if the host is allowed to be arbitrary, the S‐spectrum can take on arbitrarily many values. Moreover, deciding if an integer k is in the S‐spectrum of a general bipartite graph is NP‐hard. We show that if G has c > 1 components, then there is a host H whose G‐spectrum contains both 3 and 2c + 1. If G is a forest, then there is a tree T whose G‐spectrum contains both 2 and 2c. Furthermore, we determine the complete spectra of both paths and cycles with respect to matchings. © 2007 Wiley Periodicals, Inc. J Graph Theory 56: 83–104, 2007     

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.     

On the theta completions for maximal subalgebras

Let L be a finite dimensional Lie algebra. Then for a maximal subalgebra M of L, a 𝜃-completion for M is a subalgebra C of L such that CM and M_L?C and C∕M_L contains no non-zero ideal of L∕M_L, properly. And a 𝜃-completion C of M is said to be a strong 𝜃-completion, if C = L or there exists a subalgebra B of L such that C be maximal in B and B is not a 𝜃-completion for M. These are analogous to the concepts of 𝜃-completion and strong 𝜃-completion of a maximal subgroup of a finite group. Now, we consider the influence of these concepts on the structure of a finite dimensional Lie algebra.     

On Trees with Double Domination Number Equal to the 2-Outer-Independent Domination Number Plus One

A vertex of a graph is said to dominate itself and all of its neighbors.A double dominating set of a graph G is a set D of vertices of G,such that every vertex of G is dominated by at least two vertices of D.The double domination number of a graph G is the minimum cardinality of a double dominating set of G.For a graph G =(V,E),a subset D V(G) is a 2-dominating set if every vertex of V(G) \ D has at least two neighbors in D,while it is a 2-outer-independent dominating set of G if additionally the set V(G)\D is independent.The 2-outer-independent domination number of G is the minimum cardinality of a 2-outer-independent dominating set of G.This paper characterizes all trees with the double domination number equal to the 2-outer-independent domination number plus one.     

Limiting -subgradient characterizations of constrained best approximation

In this paper, we show that the strong conical hull intersection property (CHIP) completely characterizes the best approximation to any x in a Hilbert space X from the set

K:=C∩{xX:-g(x)S},