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
Let $G$ be a finite group $G$, $K$ a field of characteristic $p\geq17$ and let $U$ be the group of units in $KG$. We show that if the derived length of $U$ does not exceed $4$, then $G$ must be abelian., Dishari Chaudhuri, Anupam Saikia., and Obsahuje bibliografické odkazy
The developmental stages and life cycle of the nematode Camallanus anabantis Pcarse, 1933 an intestinal parasite of Anabas testudineus (Bloch) arc described. The copepod Mesocyclops leuckarti (Claus) was used as experimental intermediate host. After being ingested by the copepods the nematode first-stage larvae enter its haemocoel, where they moult twice, 4 d.p.i. and 11 d.p.i., at 21-26°C, respectively to become the infective third-stage larvae. The definitive fish hosts become infected when feeding on copcpods harbouring infective larvae. In the fish host’s intestine the larvae undergo two more moults, the third on day 15 p.i. The fourth moult of “male” larvae occurred on day 68 p.i. and that of “female” larvae on day 86 pi. at water temperatures 24-36°C- A female with eggs and few larvae in the uteri was first observed on day 187 p.i.
The development of Spirocamallanus mysti (Karve, 1952) was studied in the copepod hosts Mesocyclops crassus (Fischer) and M. leuckarti (Claus) and in the fish host Mystus viltatus (Bloch). When eaten by copepods the first-stage larvae burrow through the intestinal wall into the haemocoel and there they moulted twice to become the third, infective stage. The first moulting occurred on day 4 p.i. at 18-2ГС (on day 6 p.i. at 16-20"C) and the second moultingoccurred on day 8 p.i. at 18-19.5"C (on day 11 p.i. at 16-20"C. Further development occurred only after reaching the stomach of the fish definitive host. In the fish stomach two more larval moultings occurred, the third on day 15 p.i. and the fourth (final) on day 37 p.i. in “male” larvae and day 67 p.i. in “female” larvae. The individual developmental stages and the morphological changes occurring during development are described in detail.
Let G be a finite group. The intersection graph ΔG of G is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper nontrivial subgroups of G, and two distinct vertices X and Y are adjacent if X ∩ Y ≠ 1, where 1 denotes the trivial subgroup of order 1. A question was posed by Shen (2010) whether the diameters of intersection graphs of finite non-abelian simple groups have an upper bound. We answer the question and show that the diameters of intersection graphs of finite non-abelian simple groups have an upper bound 28. In particular, the intersection graph of a finite non-abelian simple group is connected., Xuanlong Ma., and Obsahuje seznam literatury