On Edge Singularity and Eigenvectors of Mixed Graphs

Let G be a mixed glaph which is obtained from an undirected graph by orienting some of its edges. The eigenvalues and eigenvectors of G are, respectively, defined to be those of the Laplacian matrix L（G） of G. As L（G） is positive semidefinite, the singularity of L（G） is determined by its least eigenvalue λ1 （G）. This paper introduces a new parameter edge singularity εs（G） that reflects the singularity of L（G）, which is the minimum number of edges of G whose deletion yields that all the components of the resulting graph are singular. We give some inequalities between εs（G） and λ1 （G） （and other parameters） of G. In the case of εs（G） = 1, we obtain a property on the structure of the eigenvectors of G corresponding to λ1 （G）, which is similar to the property of Fiedler vectors of a simple graph given by Fiedler.     

On the Ratio Between 2-Domination and Total Outer-Independent Domination Numbers of Trees

A 2-dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)\D has at least two neighbors in D.A total outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D,and the set V(G)\D is independent.The 2-domination(total outer-independent domination,respectively)number of a graph G is the minimum cardinality of a 2-dominating(total outer-independent dominating,respectively)set of G.We investigate the ratio between2-domination and total outer-independent domination numbers of trees.     

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.     

On pointwise bounded approximation

Let G be an open subset in the extended complex plane and let A（G） denote the algebra of all functions analytic on G and continuous on G. We call a domain multi-nicely connected if there is a circular domain W and a conformal map ~ from W onto G such that the boundary value function of φ is univalent almost everywhere with respect to the arclength on aW. Suppose that every component of G is finitely connected and none of the components of G have single point boundary components. We show that for every bounded analytic function on G to be the pointwise limit of a bounded sequence of functions in A（G）, it is necessary and sufficient that each component of G is multi-nicely connected and the harmonic measures of G are mutually singular. This generalizes the corresponding result of Davie for the case when the components of G are simply connected.     

Finite groups whose minimal subgroups are weakly H-subgroups

Let G be a finite group.A subgroup H of G is called an H-subgroup in G if NG(H) ∩Hg≤H for all g∈G.A subgroup H of G is called a weakly H-subgroup in G if there exists a normal subgroup K of G such that G=HK and H∩K is an H-subgroup in G.In this paper,we investigate the structure of the finite group G under the assumption that every subgroup of G of prime order or of order 4 is a weakly H-subgroup in G.Our results improve and generalize several recent results in the literature.     

Vertex-distinguishing IE-total Colorings of Complete Bipartite Graphs K8,n

Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. For each vertex x of G, let C(x) be the set of colors of vertex x and edges incident to x under f. For an IE-total coloring f of G using k colors, if C(u) 6= C(v) for any two different vertices u and v of G, then f is called a k-vertex-distinguishing IE-total-coloring of G or a k-VDIET coloring of G for short. The minimum number of colors required for a VDIET coloring of G is denoted by χievt(G) and is called vertex-distinguishing IE-total chromatic number or the VDIET chromatic number of G for short. The VDIET colorings of complete bipartite graphs K8,n are discussed in this paper. Particularly, the VDIET chromatic number of K8,n are obtained.     

$m$个$C_{3}$的并和$m$个$C_{4}$的并的点可区别 $E$-全染色

Let G be a simple graph. A total coloring f of G is called E-total-coloring if no two adjacent vertices of G receive the same color and no edge of G receives the same color as one of its endpoints. For E-total-coloring f of a graph G and any vertex u of G, let Cf （u） or C（u） denote the set of colors of vertex u and the edges incident to u. We call C（u） the color set of u. If C（u） ≠ C（v） for any two different vertices u and v of V（G）, then we say that f is a vertex-distinguishing E-total-coloring of G, or a VDET coloring of G for short. The minimum number of colors required for a VDET colorings of G is denoted by X^evt（G）, and it is called the VDET chromatic number of G. In this article, we will discuss vertex-distinguishing E-total colorings of the graphs mC3 and mC4.     

Some results on metric n-Lie algebras

We study the structure of a metric n-Lie algebra G over the complex field C. Let G = SR be the Levi decomposition, where R is the radical of G and S is a strong semisimple subalgebra of G. Denote by m(G) the number of all minimal ideals of an indecomposable metric n-Lie algebra and R ⊥ the orthogonal complement of R. We obtain the following results. As S-modules, R ⊥ is isomorphic to the dual module of G/R. The dimension of the vector space spanned by all nondegenerate invariant symmetric bilinear forms on G is equal to that of the vector space of certain linear transformations on G; this dimension is greater than or equal to m(G) + 1. The centralizer of R in G is equal to the sum of all minimal ideals; it is the direct sum of R ⊥ and the center of G. Finally, G has no strong semisimple ideals if and only if R⊥■R.     

Automorphisms of Extensions of Q by a Direct Sum of Finitely Many Copies of Q

Let G be an extension of Q by a direct sum of r copies of Q.(1) If G is abelian, then G is a direct sum of r + 1 copies of Q and Aut G = GL(r + 1, Q);(2) If G is non-abelian, then G is a direct product of an extraspecial Q-group E and m copies of Q, where E/ζ E is a linear space over Q with dimension 2 n and m + 2 n = r. Furthermore, let Aut_G'G be the normal subgroup of Aut G consisting of all elements of Aut G which act trivially on the derived subgroup G of G, and Aut_(G/ζG),_(ζG)G be the normal subgroup of Aut G consisting of all central automorphisms of G which also act trivially on the center ζ G of G. Then(i) The extension 1→ Aut_(G')G→ Aut G→ Aut G'→ 1 is split;(ii)Aut_(G')G/Aut_(G/ζG),_(ζG)G = Sp(2 n, Q) ×(GL(m, Q) Q~(m));(iii) Aut_(G/ζG),ζGG/Inn G= Q~(2 nm).     

Vertex-distinguishing IE-total Colorings of Cycles and Wheels

Let G be a simple graph. An IE-total coloring f of G refers to a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. Let C（u） be the set of colors of vertex u and edges incident to u under f. For an IE-total coloring f of G using k colors, if C（u）=C（v） for any two different vertices u and v of V （G）, then f is called a k-vertex-distinguishing IE-total-coloring of G, or a k-VDIET coloring of G for short. The minimum number of colors required for a VDIET coloring of G is denoted by χievt（G）, and is called the VDIET chromatic number of G. We get the VDIET chromatic numbers of cycles and wheels, and propose related conjectures in this paper.     

ASYMPTOTIC BEHAVIOR OF ECKHOFF＇S METHOD FOR FOURIER SERIES CONVERGENCE ACCELERATION

The current paper considers the problem of recovering a function using a limited number of its Fourier coefficients. Specifically, a method based on Bernoulli-like polynomials suggested and developed by Krylov, Lanczos, Gottlieb and Eckhoff is examined. Asymptotic behavior of approximate calculation of the so-called ＂jumps＂ is studied and asymptotic L2 constants of the rate of convergence of the method are computed.     

When a compact (countably compact) set is closed. II

We obtain (a) necessary and sufficient conditions and (b) sufficient conditions for a compact (countably compact) set to be closed in products (sequential products) and subspaces (sequential subspaces) of normal spaces. As a consequence of these, sufficient conditions are obtained for (i) the closedness of arbitrary (countable) union of closed sets and (ii) the equality of the union of the closures and the closure of the union of arbitrary (countable) families of sets in these spaces. It is also shown that these results do not hold for quotients of even T ₄,-spaces.     

Comparison principle and analogues of the phragmen—lindelöf theorem for solutions of parabolic inequalities

It is well known that a Monotonicity Condition and a Coerciveness Condition principally lie in the basis of most results of the Theory of PDE's. The necessity of these important assumptions for the validity of a comparison principle and analogues of the Phragmen-Lindelöf theorem for solutions of quasilinear parabolic inequalities is discussed in the paper. In the first part of the work we introduce a new concept of monotonicity for nonlinear differential operators-nonlinear monotonicity concept-and on its basis we obtain new phenomena for solutions, subsolutions and supersolutions of the well-known quasilinear differential equations. In the second part we omit the current coerciveness condition and change it by a weaker one. In spite of this we obtain a series of new qualitative properties of solutions for wide classes of quasilinear parabolic inequalities. Most of these properties are also new for solutions of the well-known equations, which we consider in the paper.     

On a family of vector space categories

In continuation of our earlier work [2] we describe the indecomposable representations and the Auslander-Reiten quivers of a family of vector space categories playing an important role in the study of domestic finite dimensional algebras over an algebraically closed field. The main results of the paper are applied in our paper [3] where we exhibit a wide class of almost sincere domestic simply connected algebras of arbitrary large finite global dimensions and describe their Auslander-Reiten quivers.     

Boundary-Value Problems of the Theory of Thin and Nonthin Orthotropic Shells with Account of Nonlinearly Elastic Properties and Low Shear Rigidity of Composite Materials

The basic geometric and physical relations and resolving equations of the theory of thin and nonthin orthotropic composite shells with account of nonlinear properties and low shear rigidity of their materials are presented. They are derived based on two theories, namely the theory of anisotropic shells employing the Timoshenko or Kirchhoff-Love hypothesis and the nonlinear theory of elasticity and plasticity of anisotropic media in combination with the Lagrange variational principle. The procedure and algorithm for the numerical solution of nonlinear (linear) problems are based on the method of successive approximations, the difference-variational method, and the Lagrange multiplier method. Calculations of the stress-strain state for a spherical shell with a circular opening loaded with internal pressure are presented. The effect of transverse shear strains and physical nonlinearity of the material on the distribution of maximum deflections and circumferential stresses in the shell, obtained according to two variants of the shell theories, is studied. A comparison of the results of the problem solution in linear and nonlinear statements with and without account of the shell shear strains is given. The numerical data obtained for thin and nonthin (medium thick) composite shells are analyzed.     

Cartan matrices of selfinjective algebras of tubular type

The Cartan matrix of a finite dimensional algebra A is an important combinatorial invariant reflecting frequently structural properties of the algebra and its module category. For example, one of the important features of the modular representation theory of finite groups is the nonsingularity of Cartan matrices of the associated group algebras (Brauer’s theorem). Recently, the class of all tame selfinjective algebras having simply connected Galois coverings and the stable Auslander-Reiten quiver consisting only of stable tubes has been shown to be the class of selfinjective algebras of tubular type, that is, the orbit algebras /G of the repetitive algebras of tubular algebras B with respect to the actions of admissible groups G of automorphisms of . The aim of the paper is to describe the determinants of the Cartan matrices of selfinjective algebras of tubular type and derive some consequences.     

Representation of finite groups and the first Betti number of branched coverings of a universal Borromean orbifold

The paper studies the first homology of finite regular branched coverings of a universal Borromean orbifold called B _4,4,4ℍ³. We investigate the irreducible components of the first homology as a representation space of the finite covering transformation group G. This gives information on the first betti number of finite coverings of general 3-manifolds by the universality of B _4,4,4. The main result of the paper is a criterion in terms of the irreducible character whether a given irreducible representation of G is an irreducible component of the first homology when G admits certain symmetries. As a special case of the motivating argument the criterion is applied to principal congruence subgroups of B _4,4,4. The group theoretic computation shows that most of the, possibly nonprincipal, congruence subgroups are of positive first Betti number. This work is partially supported by the Sonderforschungsbereich 288.     

Hausdorff measures of a class of Sierpinski carpets

thenandIn this paper, a lemma as a new method to calculate the Hausdorff measure of fractal is given. And the exact values of Hausdorff measure of a class of Sierpinski sets which satisfy balance distribution ang dimension ≤1 are obtained     

Effects of permeability and viscosity in linear polymeric gels

We propose and analyze a mathematical model of the mechanics of gels, consisting of the laws of balance of mass and linear momentum of the polymer and liquid components of the gel. We consider a gel to be an immiscible and incompressible mixture of a nonlinearly elastic polymer and a fluid. The problems that we study are motivated by predictions of the life cycle of body‐implantable medical devices. Scaling arguments suggest neglecting inertia terms, and therefore, we consider the quasi‐static approximation to the dynamics. We focus on the linearized system about stress‐free states, uniform expansions, and compressions and derive sufficient conditions for the solvability of the time‐dependent problems. These turn out to be conditions that guarantee local stability of the equilibrium solutions. We also consider non‐stress free equilibria and states with residual stress and derive an energy law for the corresponding time‐dependent system. The conditions that guarantee stability of solutions provide a selection criteria of the material parameters of devices. The boundary conditions that we consider are of two types, displacement‐traction and permeability of the gel surface to the fluid. We address the cases of viscous and inviscid solvent, assume Newtonian dissipation for the polymer component, and establish existence of weak solutions for the different boundary permeability conditions and viscosity assumptions. We present two‐dimensional, finite element numerical simulations to study stress concentration on edges, this being the precursor to debonding of the gel from its substrate. Copyright © 2015 John Wiley & Sons, Ltd.     

Bounds for the zeros of polynomials

Let P(z)=∑↓j=0↑n ajx^j be a polynomial of degree n. In this paper we prove a more general result which interalia improves upon the bounds of a class of polynomials. We also prove a result which includes some extensions and generalizations of Enestrǒm-Kakeya theorem.