A weak Galerkin finite element method for the stokes equations

This paper introduces a weak Galerkin (WG) finite element method for the Stokes equations in the primal velocity-pressure formulation. This WG method is equipped with stable finite elements consisting of usual polynomials of degree k≥1 for the velocity and polynomials of degree k?1 for the pressure, both are discontinuous. The velocity element is enhanced by polynomials of degree k?1 on the interface of the finite element partition. All the finite element functions are discontinuous for which the usual gradient and divergence operators are implemented as distributions in properly-defined spaces. Optimal-order error estimates are established for the corresponding numerical approximation in various norms. It must be emphasized that the WG finite element method is designed on finite element partitions consisting of arbitrary shape of polygons or polyhedra which are shape regular.     

A realization theorem in the context of the Schur-Szegő composition

Every real polynomial of degree n in one variable with root ?1 can be represented as the Schur-Szeg? composition of n ? 1 polynomials of the form (x + 1) ^n?1(x + a _i ), where the numbers a _i are uniquely determined up to permutation. Some a _i are real, and the others form complex conjugate pairs. In this note, we show that for each pair (ρ, r), where 0 ? ρ, r ? [n/2], there exists a polynomial with exactly ρ pairs of complex conjugate roots and exactly r complex conjugate pairs in the corresponding set of numbers a _i .     

New algorithm for computing the Hermite interpolation polynomial

Let x ₀, x ₁,? , x _n , be a set of n + 1 distinct real numbers (i.e., x _i ≠ x _j , for i ≠ j) and y _{i, k} , for i = 0,1,? , n, and k = 0 ,1 ,? , n _i , with n _i ≥ 1, be given of real numbers, we know that there exists a unique polynomial p _{N ? 1}(x) of degree N ? 1 where \(N={\sum }_{i=0}^{n}(n_{i}+1)\), such that \(p_{N-1}^{(k)}(x_{i})=y_{i,k}\), for i = 0,1,? , n and k = 0,1,? , n _i . P _N?1(x) is the Hermite interpolation polynomial for the set {(x _i , y _{i, k} ), i = 0,1,? , n, k = 0,1,? , n _i }. The polynomial p _N?1(x) can be computed by using the Lagrange polynomials. This paper presents a new method for computing Hermite interpolation polynomials, for a particular case n _i = 1. We will reformulate the Hermite interpolation polynomial problem and give a new algorithm for giving the solution of this problem, the Matrix Recursive Polynomial Interpolation Algorithm (MRPIA). Some properties of this algorithm will be studied and some examples will also be given.     

Minimal logarithmic signatures for classical groups

The minimal logarithmic signature conjecture states that in any finite simple group there are subsets A _i , 1 ≤ i ≤ k such that the size |A _i | of each A _i is a prime or 4 and each element of the group has a unique expression as a product \({\prod_{i=1}^k x_i}\) of elements \({x_i \in A_i}\). The conjecture is known to be true for several families of simple groups. In this paper the conjecture is shown to be true for the groups \({\Omega^-_{2m}(q), \Omega^+_{2m}(q)}\), when q is even, by studying the action on suitable spreads in the corresponding projective spaces. It is also shown that the method can be used for the finite symplectic groups. The construction in fact gives cyclic minimal logarithmic signatures in which each A _i is of the form \({\{y_i^j \ |\ 0 \leq j < |A_i|\}}\) for some element y _i of order ≥ |A _i |.     

Finite 2-groups whose length of chain of nonnormal subgroups is at most 2

Assume that G is a finite non-Dedekind p-group. D. S. Passman introduced the following concept: we say that H₁ < H₂ < ? < H_k is a chain of nonnormal subgroups of G if each H_i ? G and if |H_i : H_i?1| = p for i = 2, 3,…, k. k is called the length of the chain. chn(G) denotes the maximum of the lengths of the chains of nonnormal subgroups of G. In this paper, finite 2-groups G with chn(G) ? 2 are completely classified up to isomorphism.     

Graded Lie algebras with few nontrivial components

We prove that if a (?/n?)-graded Lie algebra L = ? _i=0 ^n?1 L _i has d nontrivial components L _i and the null component L ₀ has finite dimension m, then L has a homogeneous solvable ideal of derived length bounded by a function of d and of codimension bounded by a function of m and d. An analogous result holds also for the (?/n?)-graded Lie rings L = ? _i=0 ^n?1 with few nontrivial components L _i if the null component L ₀ has finite order m. These results generalize Kreknin’s theorem on the solvability of the (?/n?)-graded Lie rings L = ? _i=0 ^n?1 L _i with trivial component L ₀ and Shalev’s theorem on the solvability of such Lie rings with few nontrivial components L _i . The proof is based on the method of generalized centralizers which was created by E. I. Khukhro for Lie rings and nilpotent groups with almost regular automorphisms of prime order [1], as well as on the technique developed in the work of N. Yu. Makarenko and E. I. Khukhro on the almost solvability of Lie algebras with an almost regular automorphism of finite order [2].     

On Ditsman’s lemma

Let H be a subgroup of a group G generated by a finite G-invariant subset X = tU _i=1 ^k C _i that consists of elements of finite order, where C _i is a class of conjugate elements of G with representative a _i . We prove that

$$|H| \leqslant \prod\limits_{i = 1}^k {o(a_i )^{|C_i |} } ,$$

where o(a _i ) is the order of the element a _i ∈ C _i . Best estimates are obtained for some important special cases.

     

Thompson’s conjecture for the alternating group of degree 2<Emphasis Type="Italic">p</Emphasis> and 2<Emphasis Type="Italic">p</Emphasis>+1

For a finite group G denote by N(G) the set of conjugacy class sizes of G. In 1980s, J.G.Thompson posed the following conjecture: If L is a finite nonabelian simple group, G is a finite group with trivial center and N(G) = N(L), then G ? L. We prove this conjecture for an infinite class of simple groups. Let p be an odd prime. We show that every finite group G with the property Z(G) = 1 and N(G) = N(A _i ) is necessarily isomorphic to A _i , where i ∈ {2p, 2p + 1}.     

Polynomials defining many units

We classify the polynomials with integral coefficients that, when evaluated on a group element of finite order n, define a unit in the integral group ring for infinitely many positive integers n. We show that this happens if and only if the polynomial defines generic units in the sense of Marciniak and Sehgal. We also classify the polynomials with integral coefficients which provides units when evaluated on n-roots of a fixed integer a for infinitely many positive integers n.     

Eulerian graphs and automorphisms of a maximal graph

Let R be a commutative ring with identity. Let Γ(R) denote the maximal graph corresponding to the non-unit elements of R, i.e., Γ(R) is a graph with vertices the non-unit elements of R, where two distinct vertices a and b are adjacent if and only if there is a maximal ideal of R containing both. In this paper, we have shown that, for any finite ring R which is not a field, Γ(R) is a Euler graph if and only if R has odd cardinality. Moreover, for any finite ring R ? R ₁×R ₂× · · · ×R _n, where the R _i is a local ring of cardinality p _i ^αi for all i, and the p _i’s are distinct primes, it is shown that Aut(Γ(R)) is isomorphic to a finite direct product of symmetric groups. We have also proved that clique(G(R)’) = χ(G(R)’) for any semi-local ring R, where G(R)’ denote the comaximal graph associated to R.     

SCAP-subalgebras of Lie algebras

A subalgebra H of a finite dimensional Lie algebra L is said to be a SCAP-subalgebra if there is a chief series 0 = L₀ ? L₁ ?... ? L_t = L of L such that for every i = 1, 2,..., t, we have H + L_i = H + L_i-1 or H ∩ L_i = H ∩ L_i-1. This is analogous to the concept of SCAP-subgroup, which has been studied by a number of authors. In this article, we investigate the connection between the structure of a Lie algebra and its SCAP-subalgebras and give some sufficient conditions for a Lie algebra to be solvable or supersolvable.     

A General Approach to Isolating Roots of a Bitstream Polynomial

We describe a new approach to isolate the roots (either real or complex) of a square-free polynomial F with real coefficients. It is assumed that each coefficient of F can be approximated to any specified error bound and refer to such coefficients as bitstream coefficients. The presented method is exact, complete and deterministic. Compared to previous approaches (Eigenwillig in Real root isolation for exact and approximate polynomials using Descartes’ rule of signs, PhD thesis, Universität des Saarlandes, 2008; Eigenwillig et al. in CASC, LNCS, 2005; Mehlhorn and Sagraloff in J. Symb. Comput. 46(1):70–90, 2011) we improve in two aspects. Firstly, our approach can be combined with any existing subdivision method for isolating the roots of a polynomial with rational coefficients. Secondly, the approximation demand on the coefficients and the bit complexity of our approach is considerably smaller. In particular, we can replace the worst-case quantity σ(F) by the average-case quantity \({\prod_{i=1}^n\sqrt[n] {\sigma_i}}\) , where σ _i denotes the minimal distance of the i -th root ξ _i of F to any other root of F, σ(F) := min _i σ _i , and n = deg F. For polynomials with integer coefficients, our method matches the best bounds known for existing practical algorithms that perform exact operations on the input coefficients.     

Asymptotic behavior of the spectrum of one-dimensional vibrations in a layered medium consisting of elastic and Kelvin–Voigt viscoelastic materials

For every algebraically closed field k of characteristic different from 2, we prove the following: (1) Finite-dimensional (not necessarily associative) k-algebras of general type of a fixed dimension, considered up to isomorphism, are parametrized by the values of a tuple of algebraically independent (over k) rational functions of the structure constants. (2) There exists an “algebraic normal form” to which the set of structure constants of every such algebra can be uniquely transformed by means of passing to its new basis—namely, there are two finite systems of nonconstant polynomials on the space of structure constants, {f_i}i∈I and {b_j}j∈J, such that the ideal generated by the set {f_i}i∈I is prime and, for every tuple c of structure constants satisfying the property b_j(c) ≠ 0 for all j ∈ J, there exists a unique new basis of this algebra in which the tuple c′ of its structure constants satisfies the property f_i(c′) = 0 for all i ∈ I.     

Some new sums related to D. H. Lehmer problem

About Lehmer’s number, many people have studied its various properties, and obtained a series of interesting results. In this paper, we consider a generalized Lehmer problem: Let p be a prime, and let N(k; p) denote the number of all 1 ? a _i ? p ? 1 such that a ₁ a ₂ … a _k ≡ 1 mod p and 2 | a _i + ā _i + 1, i = 1, 2, …, k. The main purpose of this paper is using the analytic method, the estimate for character sums and trigonometric sums to study the asymptotic properties of the counting function N(k; p), and give an interesting asymptotic formula for it.     

Chain Blockers and Convoluted Catalan Numbers

We give new interpretations of Catalan and convoluted Catalan numbers in terms of trees and chain blockers. For a poset P we say that a subset A ? P is a chain blocker if it is an inclusionwise minimal subset of P that contains at least one element from every maximal chain. In particular, we study the set of chain blockers for the class of posets P = C _a × C _b where C _i is the chain 1 < ? < i. We show that subclasses of these chain blockers are counted by Catalan and convoluted Catalan numbers.     

On iterative methods for solving equations with covering mappings

In this paper we propose an iterative method for solving the equation Υ(x, x) = y, where the mapping Υ acts in metric spaces and is covering in the first argument and Lipschitzian in the second one. Each subsequent element x _i+1 of the sequence of iterations is defined by the previous one as a solution to the equation Υ(x, x _i) = y _i, where y _i can be an arbitrary point sufficiently close to y. Conditions for convergence and error estimates are obtained. The method proposed is an iterative development of the Arutyunov method for finding coincidence points of mappings. In order to determine x _i+1 in practical implementation of the method in linear normed spaces, it is proposed to perform one step by using the Newton–Kantorovich method. The thus-obtained method of solving the equation of the form Υ(x, u) = ψ(x) ? φ(u) coincides with the iterative method proposed by A.I. Zinchenko,M.A. Krasnosel’skii, and I.A. Kusakin.     

LIFTING DIFFERENTIABLE CURVES FROM ORBIT SPACES

Let ρ: G → O(V) be a real finite dimensional orthogonal representation of a compact Lie group, let σ = (σ ₁, ?, σn): V → ? ⁿ , where σ ₁, ?, σn n form a minimal system of homogeneous generators of the G-invariant polynomials on V, and set d = max_i deg σ _i . We prove that for each C ^d?1,1-curve c in σ(V) ?? ⁿ there exits a locally Lipschitz lift over σ, i.e., a locally Lipschitz curve \( \overline{c} \) in V so that c = σ ° \( \overline{c} \), and we obtain explicit bounds for the Lipschitz constant of \( \overline{c} \) in terms of c. Moreover, we show that each C ^d -curve in σ(V) admits a C ¹-lift. For finite groups G we deduce a multivariable version and some further results.     

Convergence of some finite element iterative methods related to different Reynolds numbers for the 2D/3D stationary incompressible magnetohydrodynamics

Based on finite element method (FEM), some iterative methods related to different Reynolds numbers are designed and analyzed for solving the 2D/3D stationary incompressible magnetohydrodynamics (MHD) numerically. Two-level finite element iterative methods, consisting of the classical m-iteration methods on a coarse grid and corrections on a fine grid, are designed to solve the system at low Reynolds numbers under the strong uniqueness condition. One-level Oseen-type iterative method is investigated on a fine mesh at high Reynolds numbers under the weak uniqueness condition. Furthermore, the uniform stability and convergence of these methods with respect to equation parameters R_e,R_m, S_c, mesh sizes h,H and iterative step m are provided. Finally, the efficiency of the proposed methods is confirmed by numerical investigations.     

Finite Groups with Given Weakly <Emphasis Type="Italic">σ</Emphasis>-Permutable Subgroups

Let G be a finite group and let σ = {σ _i | i ∈ I} be a partition of the set of all primes P. A set ? of subgroups of G is said to be a complete Hall σ-set of G if each nonidentity member of ? is a Hall σ _i -subgroup of G and ? has exactly one Hall σ _i -subgroup of G for every σ _i ∈ σ(G). A subgroup H of G is said to be σ-permutable in G if G possesses a complete Hall σ-set ? such that HA ^x = A ^x H for all A ∈ ? and all x ∈ G. A subgroup H of G is said to be weakly σ-permutable in G if there exists a σ-subnormal subgroup T of G such that G = HT and H ∩ T ≤ H _σG , where H _σG is the subgroup of H generated by all those subgroups of H which are σ-permutable in G. We study the structure of G under the condition that some given subgroups of G are weakly σ-permutable in G. In particular, we give the conditions under which a normal subgroup of G is hypercyclically embedded. Some available results are generalized.     

Characterization of the alternating groups by their order and one conjugacy class length

Let G be a finite group, and let N(G) be the set of conjugacy class sizes of G. By Thompson’s conjecture, if L is a finite non-abelian simple group, G is a finite group with a trivial center, and N(G) = N(L), then L and G are isomorphic. Recently, Chen et al. contributed interestingly to Thompson’s conjecture under a weak condition. They only used the group order and one or two special conjugacy class sizes of simple groups and characterized successfully sporadic simple groups (see Li’s PhD dissertation). In this article, we investigate validity of Thompson’s conjecture under a weak condition for the alternating groups of degrees p+1 and p+2, where p is a prime number. This work implies that Thompson’s conjecture holds for the alternating groups of degree p + 1 and p + 2.