15,290 research outputs found

    LĀ² -estimates for the evolving surface finite element method

    Get PDF
    In this paper we consider the evolving surface ļ¬nite element method for the advection and diļ¬€usion of a conserved scalar quantity on a moving surface. In an earlier paper using a suitable variational formulation in time dependent Sobolev space we proposed and analysed a ļ¬nite element method using surface ļ¬nite elements on evolving triangulated surfaces. An optimal order HĀ¹ -error bound was proved for linear ļ¬nite elements. In this work we prove the optimal error bound in LĀ² (Ī“(t)) uniformly in time

    Triaxial Black-Hole Nuclei

    Get PDF
    We demonstrate that the nuclei of galaxies containing supermassive black holes can be triaxial in shape. Schwarzschild's method was first used to construct self-consistent orbital superpositions representing nuclei with axis ratios of 1:0.79:0.5 and containing a central point mass representing a black hole. Two different density laws were considered, with power-law slopes of -1 and -2. We constructed two solutions for each power law: one containing only regular orbits and the other containing both regular and chaotic orbits. Monte-Carlo realizations of the models were then advanced in time using an N-body code to verify their stability. All four models were found to retain their triaxial shapes for many crossing times. The possibility that galactic nuclei may be triaxial complicates the interpretation of stellar-kinematical data from the centers of galaxies and may alter the inferred interaction rates between stars and supermassive black holes.Comment: 4 pages, 4 postscript figures, uses emulateapj.st

    Calculating conjugacy classes in Sylow p-subgroups of finite Chevalley groups of rank six and seven

    Get PDF
    Let G(q) be a finite Chevalley group, where q is a power of a good prime p, and let U(q) be a Sylow p-subgroup of G(q). Then a generalized version of a conjecture of Higman asserts that the number k(U(q)) of conjugacy classes in U(q) is given by a polynomial in q with integer coefficients. In an earlier paper, the first and the third authors developed an algorithm to calculate the values of k(U(q)). By implementing it into a computer program using GAP, they were able to calculate k(U(q)) for G of rank at most 5, thereby proving that for these cases k(U(q)) is given by a polynomial in q. In this paper we present some refinements and improvements of the algorithm that allow us to calculate the values of k(U(q)) for finite Chevalley groups of rank six and seven, except E_7. We observe that k(U(q)) is a polynomial, so that the generalized Higman conjecture holds for these groups. Moreover, if we write k(U(q)) as a polynomial in q-1, then the coefficients are non-negative. Under the assumption that k(U(q)) is a polynomial in q-1, we also give an explicit formula for the coefficients of k(U(q)) of degrees zero, one and two.Comment: 16 page

    Orbits of parabolic subgroups on metabelian ideals

    Full text link
    We consider the action of a parabolic subgroup of the General Linear Group on a metabelian ideal. For those actions, we classify actions with finitely many orbits using methods from representation theory.Comment: 10 pages, 6 eps figure

    A fully discrete evolving surface finite element method

    Get PDF
    In this paper we consider a time discrete evolving surface finite element method for the advection and diffusion of a conserved scalar quantity on a moving surface. In earlier papers using a suitable variational formulation in time dependent Sobolev space we proposed and analyzed a finite element method using surface finite elements on evolving triangulated surfaces [IMA J. Numer Anal., 25 (2007), pp. 385--407; Math. Comp., to appear]. Optimal order L2(Ī“(t)) and H1(Ī“(t)) error bounds were proved for linear finite elements. In this work we prove optimal order error bounds for a backward Euler time discretization
    • ā€¦
    corecore