<Emphasis Type="Italic">M</Emphasis><Superscript><Emphasis Type="Italic">X</Emphasis></Superscript>/<Emphasis Type="Italic">M</Emphasis>/<Emphasis Type="Italic">c</Emphasis> Queue with catastrophes and state-dependent control at idle time

We consider an M ^X /M/c queue with catastrophes and state-dependent control at idle time. Properties of the queues which terminate when the servers become idle are first studied. Recurrence, equilibrium distribution, and equilibrium queue-size structure are studied for the case of resurrection and no catastrophes. All of these properties and the first effective catastrophe occurrence time are then investigated for the case of resurrection and catastrophes. In particular, we obtain the Laplace transform of the transition probability for the absorbing M ^X /M/c queue.     

On the minimum size of binary codes with length 2<Emphasis Type="Italic">R</Emphasis> + 4 and covering radius <Emphasis Type="Italic">R</Emphasis>

The minimum size of a binary code with length n and covering radius R is denoted by K(n, R). For arbitrary R, the value of K(n, R) is known when n ≤  2R +  3, and the corresponding optimal codes have been classified up to equivalence. By combining combinatorial and computational methods, several results for the first open case, K(2R +  4, R), are here obtained, including a proof that K(10, 3) =  12 with 11481 inequivalent optimal codes and a proof that if K(2R +  4, R) <  12 for some R then this inequality cannot be established by the existence of a corresponding self-complementary code.     

Euclidean and Hermitian LCD MDS codes

Linear codes with complementary duals (abbreviated LCD) are linear codes whose intersection with their dual is trivial. When they are binary, they play an important role in armoring implementations against side-channel attacks and fault injection attacks. Non-binary LCD codes in characteristic 2 can be transformed into binary LCD codes by expansion. On the other hand, being optimal codes, maximum distance separable codes (abbreviated MDS) are of much interest from many viewpoints due to their theoretical and practical properties. However, little work has been done on LCD MDS codes. In particular, determining the existence of q-ary [n, k] LCD MDS codes for various lengths n and dimensions k is a basic and interesting problem. In this paper, we firstly study the problem of the existence of q-ary [n, k] LCD MDS codes and solve it for the Euclidean case. More specifically, we show that for \(q>3\) there exists a q-ary [n, k] Euclidean LCD MDS code, where \(0\le k \le n\le q+1\), or, \(q=2^{m}\), \(n=q+2\) and \(k= 3 \text { or } q-1\). Secondly, we investigate several constructions of new Euclidean and Hermitian LCD MDS codes. Our main techniques in constructing Euclidean and Hermitian LCD MDS codes use some linear codes with small dimension or codimension, self-orthogonal codes and generalized Reed-Solomon codes.     

On <Emphasis Type="Italic">c</Emphasis><Superscript>#</Superscript>-normal subgroups infinite groups

A subgroup H of a finite group G is called a c^#-normal subgroup of G if there exists a normal subgroup K of G such that G = HK and H ∩ K is a CAP-subgroup of G: In this paper, we investigate the influence of fewer c^#-normal subgroups of Sylow p-subgroups on the p-supersolvability, p-nilpotency, and supersolvability of finite groups. We obtain some new sufficient and necessary conditions for a group to be p-supersolvable, p-nilpotent, and supersolvable. Our results improve and extend many known results.     

The construction of infinite families of any κ-tight optimal and singular κ-tight optimal directed double loop networks

The double loop network (DLN) is a circulant digraph with n nodes and outdegree 2. It is an important topological structure of computer interconnection networks and has been widely used in the designing of local area networks and distributed systems. Given the number n of nodes, how to construct a DLN which has minimum diameter? This problem has attracted great attention. A related and longtime unsolved problem is for any given non-negative integer k, is there an infinite family of k-tight optimal DLN? In this paper, two main results are obtained (1) for any k ≥ 0, the infinite families of k-tight optimal DLN can be constructed, where the number n(k,e,c) of their nodes is a polynomial of degree 2 in e with integral coefficients containing a parameter c. (2) for any k ≥ 0,an infinite family of singular k-tight optimal DLN can be constructed.     

Evaluation of the Hamming weights of a class of linear codes based on Gauss sums

Linear codes with a few weights have been widely investigated in recent years. In this paper, we mainly use Gauss sums to represent the Hamming weights of a class of q-ary linear codes under some certain conditions, where q is a power of a prime. The lower bound of its minimum Hamming distance is obtained. In some special cases, we evaluate the weight distributions of the linear codes by semi-primitive Gauss sums and obtain some one-weight, two-weight linear codes. It is quite interesting that we find new optimal codes achieving some bounds on linear codes. The linear codes in this paper can be used in secret sharing schemes, authentication codes and data storage systems.     

<Emphasis Type="Italic">r</Emphasis>-Dynamic Chromatic Number of Some Line Graphs

An r-dynamic coloring of a graph G is a proper coloring c of the vertices such that |c(N(v))| ≥ min {r, deg(v)}, for each v ∈ V (G). The r-dynamic chromatic number of a graph G is the smallest k such that G admits an r-dynamic coloring with k colors. In this paper, we obtain the r-dynamic chromatic number of the line graph of helm graphs H_n for all r between minimum and maximum degree of H_n. Moreover, our proofs are constructive, what means that we give also polynomial time algorithms for the appropriate coloring. Finally, as the first, we define an equivalent model for edge coloring.     

Group analysis of the one-dimensional boltzmann equation: II. Equivalence groups and symmetry groups in the special case

We obtain relations that define the equivalence algebra of the family of one-dimensional Boltzmann equations f _t + cf _x + F(t, x, c)f _c = 0 and show that all equations of that form are locally equivalent. We carry out the group classification of the equation with respect to the function F in the special case where the function F and the transformations of the variables t and x are assumed to be independent of c. We show that, under such constraints for the transformation and the family of equations, the maximum possible symmetry algebra is eight-dimensional, which corresponds to an equation with a linear function F.     

Group analysis of the one-dimensional Boltzmann equation: I. symmetry groups

We consider the one-dimensional Boltzmann equation f _t + cf _x + Ff _c = 0, where the functions f and F are assumed to depend on three variables t, x, and c. We obtain relations defining the symmetry algebra in the general case and also under the additional conditions of conservation of the relations dx = c dt and dc = F dt, which arise from physical considerations. We show that the widest symmetry algebra is obtained in the case of conservation of both relations. This algebra is infinite-dimensional, and its structure is independent of the form of the function F.     

Liouville type results for a <Emphasis Type="Italic">p</Emphasis>-Laplace equation with negative exponent

Positive entire solutions of the equation \(\Delta _p u = u^{ - q} in \mathbb{R}^N (N \geqslant 2)\) where 1 < p ≤ N, q > 0, are classified via their Morse indices. It is seen that there is a critical power q = q _c such that this equation has no positive radial entire solution that has finite Morse index when q > q _c but it admits a family of stable positive radial entire solutions when 0 < q ≤ q _c. Proof of the stability of positive radial entire solutions of the equation when 1 < p < 2 and 0 < q ≤ q _c relies on Caffarelli–Kohn–Nirenberg’s inequality. Similar Liouville type result still holds for general positive entire solutions when 2 < p ≤ N and q > q _c. The case of 1 < p < 2 is still open. Our main results imply that the structure of positive entire solutions of the equation is similar to that of the equation with p = 2 obtained previously. Some new ideas are introduced to overcome the technical difficulties arising from the p-Laplace operator.     

On <Emphasis Type="Italic">g</Emphasis><Subscript><Emphasis Type="Italic">c</Emphasis></Subscript>-colorings of nearly bipartite graphs

Let G be a simple graph, let d(v) denote the degree of a vertex v and let g be a nonnegative integer function on V (G) with 0 ≤ g(v) ≤ d(v) for each vertex v ∈ V (G). A g _c -coloring of G is an edge coloring such that for each vertex v ∈ V (G) and each color c, there are at least g(v) edges colored c incident with v. The g _c -chromatic index of G, denoted by χ′g _c (G), is the maximum number of colors such that a gc-coloring of G exists. Any simple graph G has the g _c -chromatic index equal to δ _g (G) or δ _g (G) ? 1, where \({\delta _g}\left( G \right) = \mathop {\min }\limits_{v \in V\left( G \right)} \left\lfloor {d\left( v \right)/g\left( v \right)} \right\rfloor \). A graph G is nearly bipartite, if G is not bipartite, but there is a vertex u ∈ V (G) such that G ? u is a bipartite graph. We give some new sufficient conditions for a nearly bipartite graph G to have χ′g _c (G) = δ _g (G). Our results generalize some previous results due to Wang et al. in 2006 and Li and Liu in 2011.     

<Emphasis Type="Italic">c</Emphasis>-Semipermutable subgroups of finite groups

A subgroup is called c-semipermutable in G if A has a minimal supplement T in G such that for every subgroup T ₁ of T there is an element x ∈ T satisfying AT ₁ ^x = T ₁ ^x A. We obtain a few results about the c-semipermutable subgroups and use them to determine the structures of some finite groups.     

Inverse problem with nonlocal observation of finding the coefficient multiplying <Emphasis Type="Italic">u</Emphasis> <Subscript> <Emphasis Type="Italic">t</Emphasis> </Subscript> in the parabolic equation

We study the inverse problem of the reconstruction of the coefficient ?(x, t) = ?⁰(x, t) + r(x) multiplying u_t in a nonstationary parabolic equation. Here ?⁰(x, t) ≥ ?⁰ > 0 is a given function, and r(x) ≥ 0 is an unknown function of the class L_∞(Ω). In addition to the initial and boundary conditions (the data of the direct problem), we pose the problem of nonlocal observation in the form ∫₀^Tu(x, t) dμ(t) = χ(x) with a known measure dμ(t) and a function χ(x). We separately consider the case dμ(t) = ω(t)dt of integral observation with a smooth function ω(t). We obtain sufficient conditions for the existence and uniqueness of the solution of the inverse problem, which have the form of ready-to-verify inequalities. We suggest an iterative procedure for finding the solution and prove its convergence. Examples of particular inverse problems for which the assumptions of our theorems hold are presented.     

The rate of decay of stable periodic solutions for Duffing equation with <Emphasis Type="Italic">L</Emphasis><Superscript><Emphasis Type="Italic">p</Emphasis></Superscript>-conditions

For a new class of g(t, x), the existence, uniqueness and stability of \({2\pi}\)-periodic solution of Duffing equation \({x'' + cx' + g(t, x) = h(t)}\) are presented. Moreover, the unique \({2\pi}\)-periodic solution is (exponentially asymptotically stable) and its rate of exponential decay c/2 is sharp. The new criterion characterizes \({g_{x}^{\prime}(t, x) - c^2/4}\) with L ^p -norms \({(p \in [1, \infty])}\), and the classical criterion employs the \({L^{\infty}}\)-norm. The advantage is that we can deal with the case that \({g_{x}^{\prime}(t, x) - c^2/4}\) is beyond the optimal bounds of the \({L^{\infty}}\)-norm, because of the difference between the L ^p -norm and the \({L^{\infty}}\)-norm.     

Lattices with Defining Relations Close to Distributivity

We consider the 3-generated lattices whose generators enjoy the defining relations of the type a∨(b∧c) = (a∨b)∧(a∨c). Moreover, if the lattice is finite then we obtain its diagram; otherwise, we prove that the corresponding lattice is infinite.     

Sharpened forms of the generalized Schwarz inequality on the boundary

In this paper, a boundary version of the Schwarz inequality is investigated. We obtain more general results at the boundary. If we know the second coefficient in the expansion of the function f(z) = 1 + c_pz^p + c_{p + 1}z^{p + 1}…, then we obtain new inequalities of the Schwarz inequality at boundary by taking into account c_{p + 1} and zeros of the function f(z) ? 1. The sharpness of these inequalities is also proved.     

On holomorphic immersions into kähler manifolds of constant holomorphic sectional curvature

We study holomorphic immersions f:X →M from a complex manifoldX into a Kähler manifold of constant holomorphic sectional curvatureM, i.e. a complex hyperbolic space form, a complex Euclidean space form, or the complex projective space equipped with the Fubini-Study metric. ForX compact we show that the tangent sequence splits holomorphically if and only iff is a totally geodesic immersion. ForX not necessarily compact we relate an intrinsic cohomological invariantp(X) onX, viz. the invariant defined by Gunning measuring the obstruction to the existence of holomorphic projective connections, to an extrinsic cohomological invariant(f) measuring the obstruction to the holomorphic splitting of the tangent sequence. The two invariantsp(X) and?(f) are related by a linear map on cohomology groups induced by the second fundamental form. In some cases, especially whenX is a complex surface andM is of complex dimension 4, under the assumption thatX admits a holomorphic projective connection we obtain a sufficient condition for the holomorphic splitting of the tangent sequence in terms of the second fundamental form.     

Some class 1 graphs on <Emphasis Type="Italic">g</Emphasis><Subscript><Emphasis Type="Italic">c</Emphasis></Subscript>-colorings

An edge-coloring of a graph G is an assignment of colors to all the edges of G. A g _c -coloring of a graph G is an edge-coloring of G such that each color appears at each vertex at least g(v) times. The maximum integer k such that G has a g _c -coloring with k colors is called the g _c -chromatic index of G and denoted by \(\chi\prime_{g_{c}}\)(G). In this paper, we extend a result on edge-covering coloring of Zhang and Liu in 2011, and give a new sufficient condition for a simple graph G to satisfy \(\chi\prime_{g_{c}}\)(G) = δ _g (G), where \(\delta_{g}\left(G\right) = min_{v\epsilon V (G)}\left\{\lfloor\frac{d\left(v\right)}{g\left(v\right)}\rfloor\right\}\).     

On compact splitting complex submanifolds of quotients of bounded symmetric domains

We study compact complex submanifolds S of quotient manifolds X = ?/Γ of irreducible bounded symmetric domains by torsion free discrete lattices of automorphisms, and we are interested in the characterization of the totally geodesic submanifolds among compact splitting complex submanifolds S ? X, i.e., under the assumption that the tangent sequence over S splits holomorphically. We prove results of two types. The first type of results concerns S ? X which are characteristic complex submanifolds, i.e., embedding ? as an open subset of its compact dual manifold M by means of the Borel embedding, the non-zero(1, 0)-vectors tangent to S lift under a local inverse of the universal covering map π : ? → X to minimal rational tangents of M.We prove that a compact characteristic complex submanifold S ? X is necessarily totally geodesic whenever S is a splitting complex submanifold. Our proof generalizes the case of the characterization of totally geodesic complex submanifolds of quotients of the complex unit ball Bnobtained by Mok(2005). The proof given here is however new and it is based on a monotonic property of curvatures of Hermitian holomorphic vector subbundles of Hermitian holomorphic vector bundles and on exploiting the splitting of the tangent sequence to identify the holomorphic tangent bundle TSas a quotient bundle rather than as a subbundle of the restriction of the holomorphic tangent bundle TXto S. The second type of results concerns characterization of total geodesic submanifolds among compact splitting complex submanifolds S ? X deduced from the results of Aubin(1978)and Yau(1978) which imply the existence of K¨ahler-Einstein metrics on S ? X. We prove that compact splitting complex submanifolds S ? X of sufficiently large dimension(depending on ?) are necessarily totally geodesic. The proof relies on the Hermitian-Einstein property of holomorphic vector bundles associated to TS,which implies that endomorphisms of such bundles are parallel, and the construction of endomorphisms of these vector bundles by means of the splitting of the tangent sequence on S. We conclude with conjectures on the sharp lower bound on dim(S) guaranteeing total geodesy of S ? X for the case of the type-I domains of rank2 and the case of type-IV domains, and examine a case which is critical for both conjectures, i.e., on compact complex surfaces of quotients of the 4-dimensional Lie ball, equivalently the 4-dimensional type-I domain dual to the Grassmannian of 2-planes in C~4.     

Pointfree Functorial Polar Functions

C denotes the category of compact regular frames with frame homomorphisms. A function \(\mathcal {X}\), which assigns to each C-object F a subalgebra of \(\mathcal {P}(F)\) that contains the complemented elements of F is said to be a polar function. An essential extension H of F is a \(\mathcal {X}\)-splitting frame of F if whenever \(p \in \mathcal {X}(F)\), then the polar generated by p in H is complemented. For F∈ C we examine the least \(\mathcal {X}\)-splitting extension and prove that every invariant polar function generates a C-hull class of frames. In addition, we define the concept of a functorial polar function and prove that each functorial polar function generates an epireflective subcategory of the category compact regular frames with skeletal maps.