Let D be a Cd q-convex intersection, d > 2, 0 6 q 6 n − 1, in a complex manifold X of complex dimension n, n > 2, and let E be a holomorphic vector bundle of rank N over X. In this paper, Ck-estimates, k = 2, 3, . . . ,1, for solutions to the -equation with small loss of smoothness are obtained for E-valued (0, s)-forms on D when n − q 6 s 6 n. In addition, we solve the -equation with a support condition in Ck-spaces. More precisely, we prove that for a -closed form f in Ck 0,q(X \ D,E), 1 6 q 6 n − 2, n > 3, with compact support and for " with 0 < " < 1 there exists a form u in Ck−ε 0,q−1(X \ D,E) with compact support such that u = f in X \ D. Applications are given for a separation theorem of Andreotti-Vesentini type in Ck-setting and for the solvability of the -equation for currents., Shaban Khidr, Osama Abdelkader., and Seznam literatury
A Lie algebra $L$ is called 2-step nilpotent if $L$ is not abelian and $[L, L]$ lies in the center of $L$. 2-step nilpotent Lie algebras are useful in the study of some geometric problems, and their classification has been an important problem in Lie theory. In this paper, we give a classification of 2-step nilpotent Lie algebras of dimension 9 with 2-dimensional center., Ren Bin, Zhu Lin Sheng., and Obsahuje bibliografii
Let R be a commutative ring with nonzero identity and J(R) the Jacobson radical of R. The Jacobson graph of R, denoted by JR, is defined as the graph with vertex set RJ(R) such that two distinct vertices x and y are adjacent if and only if 1 − xy is not a unit of R. The genus of a simple graph G is the smallest nonnegative integer n such that G can be embedded into an orientable surface Sn. In this paper, we investigate the genus number of the compact Riemann surface in which JR can be embedded and explicitly determine all finite commutative rings R (up to isomorphism) such that JR is toroidal., Krishnan Selvakumar, Manoharan Subajini., and Obsahuje seznam literatury
The nullity of a graph G is the multiplicity of zero as an eigenvalue in the spectrum of its adjacency matrix. From the interlacing theorem, derived from Cauchy’s inequalities for matrices, a vertex of a graph can be a core vertex if, on deleting the vertex, the nullity decreases, or a Fiedler vertex, otherwise. We adopt a graph theoretical approach to determine conditions required for the identification of a pair of prescribed types of root vertices of two graphs to form a cut-vertex of unique type in the coalescence. Moreover, the nullity of subgraphs obtained by perturbations of the coalescence G is determined relative to the nullity of G. This has direct applications in spectral graph theory as well as in the construction of certain ipso-connected nano-molecular insulators., Didar A. Ali, John Baptist Gauci, Irene Sciriha, Khidir R. Sharaf., and Obsahuje seznam literatury
Let $(R,\mathfrak m)$ be a commutative Noetherian regular local ring of dimension $d$ and $I$ be a proper ideal of $R$ such that ${\rm mAss}_R(R/I)={\rm Assh}_R(I)$. It is shown that the $R$-module $H^{{\rm ht}(I)}_I(R)$ is $I$-cofinite if and only if
${\rm cd}(I,R)={\rm ht}(I)$. Also we present a sufficient condition under which this condition the $R$-module $H^i_I(R)$ is finitely generated if and only if it vanishes., Jafar A'zami, Naser Pourreza., and Obsahuje bibliografické odkazy
Let \Omega \in L^{s}\left ( S^{n-1} \right ) for s\geqslant 1 be a homogeneous function of degree zero and b a BMO function. The commutator generated by the Marcinkiewicz integral μΩ and b is defined by \left[ {b,{\mu _\Omega }} \right](f)(x) = {\left( {\int_0^\infty {{{\left| {\int_{\left| {x - y} \right| \leqslant t} {\frac{{\Omega (x - y)}}{{{{\left| {x - y} \right|}^{n - 1}}}}\left[ {b(x) - b(y)} \right]f(y){\text{d}}y} } \right|}^2}\frac{{{\text{d}}t}}{{{t^3}}}} } \right)^{1/2}}. In this paper, the author proves the \left (L^{p\left ( \cdot \right )}\left ( \mathbb{R}^{n} \right ),L^{p\left ( \cdot \right )}\left ( \mathbb{R}^{n} \right ) \right )-boundedness of the Marcinkiewicz integral operator μΩ and its commutator [b, μΩ ] when p(·) satisfies some conditions. Moreover, the author obtains the corresponding result about μΩ and [b, μΩ ] on Herz spaces with variable exponent., Hongbin Wang., and Obsahuje seznam literatury
The numerical range of an n × n matrix is determined by an n degree hyperbolic ternary form. Helton-Vinnikov confirmed conversely that an n degree hyperbolic ternary form admits a symmetric determinantal representation. We determine the types of Riemann theta functions appearing in the Helton-Vinnikov formula for the real symmetric determinantal representation of hyperbolic forms for the genus g = 1. We reformulate the Fiedler-Helton-Vinnikov formulae for the genus g = 0, 1, and present an elementary computation of the reformulation. Several examples are provided for computing the real symmetric matrices using the reformulation., Mao-Ting Chien, Hiroshi Nakazato., and Obsahuje seznam literatury
Let Ω \subset \mathbb{R}^{n} be a domain and let α < n − 1. We prove the Concentration-Compactness Principle for the embedding of the space W_{0}^{1}L^{n} log^{\alpha } L(Ω) into an Orlicz space corresponding to a Young function which behaves like (t^{n/n-1-\alpha }) for large t. We also give the result for the embedding into multiple exponential spaces. Our main result is Theorem 1.6 where we show that if one passes to unbounded domains, then, after the usual modification of the integrand in the Moser functional, the statement of the Concentration-Compactnes Principle is very similar to the statement in the case of a bounded domain. In particular, in the case of a nontrivial weak limit the borderline exponent is still given by the formula P: = \left( {1 - \left\| {\Phi (|\nabla u|)} \right\|_{L^1 (\mathbb{R}^n )} } \right)^{ - 1/(n - 1)} ., Robert Černý., and Obsahuje seznam literatury
The eigenvalues of graphs are related to many of its combinatorial properties. In his fundamental work, Fiedler showed the close connections between the Laplacian eigenvalues and eigenvectors of a graph and its vertex-connectivity and edge-connectivity. We present some new results describing the connections between the spectrum of a regular graph and other combinatorial parameters such as its generalized connectivity, toughness, and the existence of spanning trees with bounded degree., Sebastian M. Cioabă, Xiaofeng Gu., and Obsahuje seznam literatury
We extend Rump’s verified method (S.Oishi, K.Tanabe, T.Ogita, S.M.Rump (2007)) for computing the inverse of extremely ill-conditioned square matrices to computing the Moore-Penrose inverse of extremely ill-conditioned rectangular matrices with full column (row) rank. We establish the convergence of our numerical verified method for computing the Moore-Penrose inverse. We also discuss the rank-deficient case and test some ill-conditioned examples. We provide our Matlab codes for computing the Moore-Penrose inverse., Yunkun Chen, Xinghua Shi, Yimin Wei., and Obsahuje seznam literatury