OD-Characterization of alternating and symmetric groups of degrees 16 and 22

Let G be a finite group and π(G) be the set of all prime divisors of its order. The prime graph GK(G) of G is a simple graph with vertex set π(G), and two distinct primes p, q ∈ π(G) are adjacent by an edge if and only if G has an element of order pq. For a vertex p ∈ π(G), the degree of p is denoted by deg(p) and as usual is the number of distinct vertices joined to p. If π(G) = {p ₁, p ₂,...,p _k }, where p ₁ < p ₂ < ... < p _k , then the degree pattern of G is defined by D(G) = (deg(p ₁), deg(p ₂),...,deg(p _k )). The group G is called k-fold OD-characterizable if there exist exactly k non-isomorphic groups H satisfying conditions |H| = |G| and D(H) = D(G). In addition, a 1-fold OD-characterizable group is simply called OD-characterizable. In the present article, we show that the alternating group A ₂₂ is OD-characterizable. We also show that the automorphism groups of the alternating groups A ₁₆ and A ₂₂, i.e., the symmetric groups S ₁₆ and S ₂₂ are 3-fold OD-characterizable. It is worth mentioning that the prime graph associated to all these groups are connected.     

Eigenvalues and homology of flag complexes and vector representations of graphs

The flag complex of a graph G = (V, E) is the simplicial complex X(G) on the vertex set V whose simplices are subsets of V which span complete subgraphs of G. We study relations between the first eigenvalues of successive higher Laplacians of X(G). One consequence is the following:Theorem: Let λ₂(G) denote the second smallest eigenvalue of the Laplacian of G. If \,\frac{k}{k+1}|V|$$" align="middle" border="0"> then Applications include a lower bound on the homological connectivity of the independent sets complex I(G), in terms of a new graph domination parameter Γ(G) defined via certain vector representations of G. This in turns implies Hall type theorems for systems of disjoint representatives in hypergraphs.Received: January 2004 Revised: August 2004 Accepted: August 2004     

Equations of Mathematical Physics and Compositions of Brownian and Cauchy Processes

We consider different types of processes obtained by composing Brownian motion B(t), fractional Brownian motion B _H (t) and Cauchy processes C(t) in different manners. We study also multidimensional iterated processes in ? ^d , like, for example, (B ₁(|C(t)|),…, B _d (|C(t)|)) and (C ₁(|C(t)|),…, C _d (|C(t)|)), deriving the corresponding partial differential equations satisfied by their joint distribution. We show that many important partial differential equations, like wave equation, equation of vibration of rods, higher-order heat equation, are satisfied by the laws of the iterated processes considered in the work. Similarly, we prove that some processes like C(|B ₁(|B ₂(…|B _n+1(t)|…)|)|) are governed by fractional diffusion equations.     

Coordinates and automorphisms of polynomial and free associative algebras of rank three

We study z-automorphisms of the polynomial algebra K[x, y, z] and the free associative algebra K 〈x, y, z〉 over a field K, i.e., automorphisms that fix the variable z. We survey some recent results on such automorphisms and on the corresponding coordinates. For K 〈x, y, z〉 we include also results about the structure of the z-tame automorphisms and algorithms that recognize z-tame automorphisms and z-tame coordinates.      

Points of continuity and quasicontinuity

Let C(f), Q(f), E(f) and A(f) be the sets of all continuity, quasicontinuity, upper and lower quasicontinuity and cliquishness points of a real function f: X → ℝ, respectively. The triplets (C(f),Q(f),A(f)), (C(f),E(f),A(f) and (Q(f),E(f),A(f)are characterized for functions defined on Baire metric spaces without isolated points.     

Regularity and Substructures of Hom

ABSTRACT

We define “regular” for maps in a Hom group. This notion specializes to the well-known notions of (Von Neumann) regular in rings and modules. A map f ∈ Hom _R (A,M) is regular if and only if Ker(f) ?^⊕ A and Im(f) ?^⊕ M. There exists a unique maximal regular End(M)-End(A)-submodule in Hom _R (A,M). We study regularity in Hom _R (A ₁ ⊕ A ₂, M ₁ ⊕ M ₂). The existence of a regular function Hom _R (A,M) implies the existence of projective summands of Hom _R (A,M) _{End R (A)} and of _{End R ( M )} Hom _R (A,M). We consider regularity in endomorphism rings, and generalize a theorem of Ware-Zelmanowitz. We examine connections between the maximum regular bimodule and other substructures of Hom, mention two generalizations of regularity, and raise some questions.     

Necessary and Sufficient Conditions for Existence and Uniqueness of Bounded and Almost-Periodic Solutions of Nonlinear Differential Equations

Necessary and sufficient conditions of the existence and uniqueness of bounded and almost-periodic solutions of nonlinear dif ferential equation dx/dt+f(x)=h(t), tR, are obtained. Here f: RR is continuous, h: RR is continuous and bounded.     

Finite-Dimensional Motives and the Conjectures of Beilinson and Murre

We relate the notion of finite dimensionality of the Chow motive M(X) of a smooth projective variety X (as defined by S. Kimura) with the conjectures of Beilinson, Bloch and Murre on the existence of a filtration on the Chow ring CH*(X). We show (Theorem 3) that finite dimensionality of M(X) implies uniqueness, up to isomorphism, of Murre's decomposition of M(X). Conversely (Theorem 4), Murre's conjecture for X ^m ×X ^m (for a suitable m) implies finite-dimensionality of M(X). We also show (Theorem 7) that, for a surface X with p _g = 0, the motive M(X) is finite-dimensional if and only if the Chow group of 0-cycles of X is finite-dimensional in the sense of Mumford, i.e. iff the Bloch conjecture holds for X.The second named author is a member of GNSAGA of CNR.     

Normal families and uniqueness of entire functions and their derivatives

In this paper we use the theory of normal families to prove: Let a and b be two complex numbers such that b ≠ a, 0, and let f be a non-constant entire function. If f and f′ share the value a CM and if f = b whenever f′ = b, then f ≡ f′. This result improves a result due to Rubel and Yang. Received: 13 June 2005     

Products of groups and group classes

Letχ be a Schunck class, and let the finite groupG=AB=BC=AC be the product of two nilpotent subgroupsA andB andχ-subgroupC. If for every common prime divisorp of the orders ofA andB the cyclic group of orderp is anχ-group, thenG is anχ-group. This generalizes earlier results of O. Kegel and F. Peterson. Some related results for groups of the formG=AB=AK=BK, whereK is a nilpotent normal subgroup ofG andA andB areχ-groups for some saturated formationχ, are also proved.     

Empirical wavelet analysis of tail and memory properties of LARCH and FIGARCH models

Using computationally efficient wavelet methods, we study two nonlinear models of financial returns {r _t }: linear ARCH (LARCH) and fractionally integrated GARCH (FIGARCH). We estimate the tail index α and the long memory parameter d of the squared returns X_t = r_t²{X_t= r_t^2} of LARCH, and of the powers X _t = |r _t | ^p of FIGARCH. We find that the X _t have infinite variance and long memory, and show how the estimates of α and d depend on the model parameters. These relationships are determined empirically, as the setting is quite complex, and no suitable theory has been developed so far. In particular, we provide empirical relationships between the estimates [^(d)]{\hat d} and the difference parameters in LARCH and FIGARCH. Our computational work uncovers tail and memory properties of LARCH and FIGARCH for practically relevant parameter ranges, and provides some guidance on modeling returns on speculative assets including FX rates, stocks and market indices.     

Hyperidentities of lattices and semilattices

Following W. Taylor we define a hyperidentity ∈ to be formally the same as an identity (e.g.,F(G(x, y, z), G(x, y, z))=G(x, y, z)). However, a varietyV is said to satisfy a hyperidentity ∈, if whenever the operation symbols of ∈ are replaced by any choice of polynomials (appropriate forV) of the same arity as the corresponding operation symbols of ∈, then the resulting identity holds inV in the usual sense. For example, if a varietyV of type <2,2> with operation symbols ∨ and ∧ satisfies the hyperidentity given above, then substituting the polynomial (x∨y)∨z for the symbolG, and the polynomialx∧y forF, we see thatV must in particular satisfy the identity ((x∨y)∨z)∧((x∨y)∨z)=((x∨y)∨z). The set of all hyperidentities satisfied by a varietyV, will be denoted byH(V). We shall letH ^m (V) be the set of all hyperidentities hoiding inV with operation symbols of arity at mostm, andH _n (V) will denote the set of all hyperidentities ofV with at mostn distinct variables. In this paper we shall show that ifV is a nontrivial variety of lattices or the variety of all semilattices, then for any integersm andn, there exists a hyperidentity ∈ such that ∈ holds inV, and ∈ is not a consequence ofH ^m (V)∪H _n (V). From this it is deduced that the hyperidentities ofV are not finitely based, partly soling a problem of Taylor [7, Problem 3]. The research of the author was supported by NSERC of Canada. Presented by W. Taylor.     

Laws of Iterated Logarithm and Related Asymptotics for Estimators of Conditional Density and Mode

Let (X _i , Y _i ) be a sequence of i.i.d. random vectors in R with an absolutely continuous distribution function H and let g _x (y), y R denote the conditional density of Y given X = x(F), the support of F, assuming that it exists. Also let M(x) be the (unique) conditional mode of Y given X = x defined by M(x) = arg max _y (y)). In this paper new classes of smoothed rank nearest neighbor (RNN) estimators of g _x (y), its derivatives and M(x) are proposed and the laws of iterated logarithm (pointwise), uniform a.s. convergence over – < y < and x a compact C(F) and the asymptotic normality for the proposed estimators are established. Our results and proofs also cover the Nadayara-Watson (NW) case. It is shown using the concept of the relative efficiency that the proposed RNN estimator is superior (asymtpotically) to the corresponding NW type estimator of M(x), considered earlier in literature.     

Restriction of characters and products of characters

Let G be a finite p-group, for some prime p, and ψ, θ ∈ Irr(G) be irreducible complex characters of G. It has been proved that if, in addition, ψ and θ are faithful characters, then the product ψθ is a multiple of an irreducible or it is the nontrivial linear combination of at least (p + 1)/2 distinct irreducible characters of G. We show that if we do not require the characters to be faithful, then given any integer k > 0, we can always find a p-group P and irreducible characters Ψ and Θ of P such that the product ΨΘ is the nontrivial combination of exactly k distinct irreducible characters. We do this by translating examples of decompositions of restrictions of characters into decompositions of products of characters.     

Bicommutants and ranges of derivations

Let V be a vector space, V* its dual space and L(V) the algebra of all linear operators on V. For an operator a?∈?L(V) let a* be its adjoint acting on V*, and for a subset R of L(V) let R″ be its bicommutant. If R is a left noetherian subalgebra of L(V), then {a*: a?∈?R}″?=?{a*: a?∈?R″}. When R is singly generated R″ is described precisely. Further, for any two operators a, b?∈?L(V), b?∈?(a)″ if and only if the derivations d _a and d _b satisfy d _b (F(V))???d _a (F(V)), where F(V) is the set of all finite rank operators on V. In this case the inclusion d _b (L(V))???d _a (L(V)) also holds.     

Graphs and ranks of monoids

For a finite monoid S, let ν(S) (ν_d(S)) denote the least number n such that there exists a graph (directed graph) Γ of order n with End(Γ)?S. Also let rank(S) be the smallest number of elements required to generate S. In this paper, we use Cayley digraphs of monoids, to connect lower bounds of ν(S) (ν_d(S)) to the lower bounds of rank(S). On the other hand, we connect upper bounds of rank(S) to upper bounds of ν(S) (ν_d(S)).     

Normal Families and Uniqueness of Entire Functions and Their Derivatives

Let f be a nonconstant entire function; let k ≥ 2 be a positive integer; and let a be a nonzero complex number. If f（z） = a→f′（z） = a, and f′（z） = a →f^（k）（z） = a, then either f = Ce^λz ＋ a or f = Ce^λz ＋ a（λ - 1）/）λ, where C and ）, are nonzero constants with λ^k-1 = 1. The proof is based on the Wiman-Vlairon theory and the theory of normal families in an essential way.     

图和线图的谱性质

Let G be a simple connected graph with n vertices and m edges,Lo be the line graph of G and λ1(LG)≥λ2 (LG)≥...≥λm(LG) be the eigenvalues of the graph LG,.. In this paper, the range of eigenvalues of a line graph is considered. Some sharp upper bounds and sharp lower bounds of the eigenvalues of Lc. are obtained. In oarticular,it is oroved that-2cos(π/n)≤λn-1(LG)≤n-4 and λn(LG)=-2 if and only if G is bipartite.     

Automorphisms and Isomorphisms of Symmetric and Affine Designs

Given a finite group G, for all sufficiently large d and for each q > 3 there are symmetric designs and affine designs having the same parameters as PG(d, q) and AG(d, q), respectively, and having full automorphism group isomorphic to G.     

Connectivity and separating sets of cages

A (k; g)-cage is a graph of minimum order among k-regular graphs with girth g. We show that for every cutset S of a (k; g)-cage G, the induced subgraph G[S] has diameter at least ⌊g/2⌋, with equality only when distance ⌊g/2⌋ occurs for at least two pairs of vertices in G[S]. This structural property is used to prove that every (k; g)-cage with k ≥ 3 is 3-connected. This result supports the conjecture of Fu, Huang, and Rodger that every (k; g)-cage is k-connected. A nonseparating g-cycle C in a graph G is a cycle of length g such that G − V(C) is connected. We prove that every (k; g)-cage contains a nonseparating g-cycle. For even g, we prove that every g-cycle in a (k; g)-cage is nonseparating. © 1998 John Wiley & Sons, Inc. J. Graph Theory 29: 35–44, 1998