We discuss the invariant subspace problem of polynomially bounded operators on a Banach space and obtain an invariant subspace theorem for polynomially bounded operators. At the same time, we state two open problems, which are relative propositions of this invariant subspace theorem. By means of the two relative propositions (if they are true), together with the result of this paper and the result of C. Ambrozie and V. Müller (2004) one can obtain an important conclusion that every polynomially bounded operator on a Banach space whose spectrum contains the unit circle has a nontrivial invariant closed subspace. This conclusion can generalize remarkably the famous result that every contraction on a Hilbert space whose spectrum contains the unit circle has a nontrivial invariant closed subspace (1988 and 1997)., Junfeng Liu., and Obsahuje bibliografii
Let G be an undirected connected graph with n, n\geqslant 3, vertices and m edges with Laplacian eigenvalues µ^{1}\geqslant µ_{2}\geq ...\geq µ_{n-1> µ_{n}}=0. Denote by {\mu _I} = {\mu _{{r_1}}} + {\mu _{{r_2}}} + \ldots + {\mu _{{r_k}}}, 1\leq k\leq n-2, 1\leq r_{1}< r_{2}< ...< r_{k} \leq n-1, the sum of k arbitrary Laplacian eigenvalues, with {\mu _{{I_1}}} = {\mu _1} + {\mu _2} + \ldots + {\mu _k} and {\mu _{{I_n}}} = {\mu _{n - k}} + \ldots + {\mu _{n - 1}}. Lower bounds of graph invariants {\mu _{{I_1}}} - {\mu _{{I_n}}} and {\mu _{{I_1}}}/{\mu _{{I_n}}} are obtained. Some known inequalities follow as a special case., Igor Ž. Milovanović, Emina I. Milovanović, Edin Glogić., and Obsahuje seznam literatury
A subgroup H of a finite group G is said to be conjugate-permutable if HHg = HgH for all g\in G. More generaly, if we limit the element g to a subgroup R of G, then we say that the subgroup H is R-conjugate-permutable. By means of the R-conjugatepermutable subgroups, we investigate the relationship between the nilpotence of G and the R-conjugate-permutability of the Sylow subgroups of A and B under the condition that G = AB, where A and B are subgroups of G. Some results known in the literature are improved and generalized in the paper., Xianhe Zhao, Ruifang Chen., and Obsahuje seznam literatury
Let $R$ be a commutative ring, $M$ an $R$-module and $G$ a group of $R$-automorphisms of $M$, usually with some sort of rank restriction on $G$. We study the transfer of hypotheses between $M/C_M(G)$ and $[M,G]$ such as Noetherian or having finite composition length. In this we extend recent work of Dixon, Kurdachenko and Otal and of Kurdachenko, Subbotin and Chupordia. For example, suppose $[M,G]$ is $R$-Noetherian. If $G$ has finite rank, then $M/C_M(G)$ also is $R$-Noetherian. Further, if $[M,G]$ is $R$-Noetherian and if only certain abelian sections of $G$ have finite rank, then $G$ has finite rank and is soluble-by-finite. If $M/C_M(G)$ is $R$-Noetherian and $G$ has finite rank, then $[M,G]$ need not be $R$-Noetherian., Bertram A. F. Wehrfritz., and Obsahuje bibliografické odkazy
We analyse multivalued stochastic differential equations driven by semimartingales. Such equations are understood as the corresponding multivalued stochastic integral equations. Under suitable conditions, it is shown that the considered multivalued stochastic differential equation admits at least one solution. Then we prove that the set of all solutions is closed and bounded., Marek T. Malinowski, Ravi P. Agarwal., and Obsahuje bibliografii
A subgroup H of a finite group G is said to be ss-supplemented in G if there exists a subgroup K of G such that G = HK and H ∩ K is s-permutable in K. In this paper, we first give an example to show that the conjecture in A.A. Heliel’s paper (2014) has negative solutions. Next, we prove that a finite group G is solvable if every subgroup of odd prime order of G is ss-supplemented in G, and that G is solvable if and only if every Sylow subgroup of odd order of G is ss-supplemented in G. These results improve and extend recent and classical results in the literature., Jiakuan Lu, Yanyan Qiu., and Obsahuje seznam literatury
We present new sharp embedding theorems for mixed-norm analytic spaces in pseudoconvex domains with smooth boundary. New related sharp results in minimal bounded homogeneous domains in higher dimension are also provided. Last domains we consider are domains which are direct generalizations of the well-studied so-called bounded symmetric domains in Cn. Our results were known before only in the very particular case of domains of such type in the unit ball. As in the unit ball case, all our proofs are heavily based on nice properties of the r-lattice. Some results of this paper can be also obtained in some unbounded domains, namely tubular domains over symmetric cones., Romi F. Shamoyan, Olivera R. Mihić., and Obsahuje seznam literatury
In this paper we present some theoretical results about the irreducibility of the Laplacian matrix ordered by the Reverse Cuthill-McKee (RCM) algorithm. We consider undirected graphs with no loops consisting of some connected components. RCM is a well-known scheme for numbering the nodes of a network in such a way that the corresponding adjacency matrix has a narrow bandwidth. Inspired by some properties of the eigenvectors of a Laplacian matrix, we derive some properties based on row sums of a Laplacian matrix that was reordered by the RCM algorithm. One of the theoretical results serves as a basis for writing an easy MATLAB code to detect connected components, by using the function “symrcm” of MATLAB. Some examples illustrate the theoretical results., Francisco Pedroche, Miguel Rebollo, Carlos Carrascosa, Alberto Palomares., and Obsahuje seznam literatury
We study the arithmetic properties of hyperelliptic curves given by the affine equation y^{2} = x^{n} + a by exploiting the structure of the automorphism groups. We show that these curves satisfy Lang’s conjecture about the covering radius (for some special covering maps)., Kevser Aktaş, Hasan Şenay., and Obsahuje seznam literatury
Let µ_{n-1}(G) be the algebraic connectivity, and let µ_{1}(G) be the Laplacian spectral radius of a k-connected graph G with n vertices and m edges. In this paper, we prove that {\mu _{n - 1}}(G) \geqslant \frac{{2n{k^2}}}{{(n(n - 1) - 2m)(n + k - 2) + 2{k^2}}} , with equality if and only if G is the complete graph Kn or Kn − e. Moreover, if G is non-regular, then {\mu _1}(G) < 2\Delta - \frac{{2(n\Delta - 2m){k^2}}}{{2(n\Delta - 2m)({n^2} - 2n + 2k) + n{k^2}}} , where ▵ stands for the maximum degree of G. Remark that in some cases, these two inequalities improve some previously known results., Xiaodan Chen, Yaoping Hou., and Obsahuje seznam literatury