In this article, a laminar magnetohydrodynamics (MHD) developing flow of an incompressible electrically conducting fluid subjected to an external magnetic field is considered. The aim of the study is to propose a correlation for computing the development length of the laminar MHD developing flow in a pipe. A numerical approach is considered to solve the problem. In the first step, the numerical...

Abstract In this note, we study the mean length of longest increasing subsequence a uniformly sampled involution that avoids pattern 3412 and another pattern.

We show that the longest k-alternating substring of a random permutation has length asymptotic to 2(n− k)/3.

This paper is concerned with certain connections between the ensemble of n × n unitary matrices—specifically the characteristic function of the random variable tr(U)—and combinatorics—specifically Ulam’s problem concerning the distribution of the length of the longest increasing subsequence in permutation groups—and the appearance of Painlevé functions in the answers to apparently unrelated que...

We study the uctuations, in the large deviations regime, of the longest increasing subsequence of a random i.i.d. sample on the unit square. In particular, our results yield the precise upper and lower exponential tails for the length of the longest increasing subsequence of a random permutation. i=1 denote a sequence of i.i.d. random variables with marginal law on the unit square Q = 0; 1] 2. ...

An algorithm is corrected here that was presented as Theorem 2 in [Š. Holub, RAIRO-Theor. Inf. Appl. 40 (2006) 583–591]. It is designed to calculate the maximum length of a nontrivial word with a given set of periods. Mathematics Subject Classification. 68R15. The purpose of this contribution is to fill a gap in the algorithm presented in my paper [1] as Theorem 2. The theorem contains a formul...

For words of length n, generated by independent geometric random variables, we consider the mean and variance, and thereafter the distribution of the number of runs of equal letters in the words. In addition, we consider the mean length of a run as well as the length of the longest run over all words of length n.

The recently introduced longest common substring with kmismatches (k-LCF) problem is to find, given two sequences S1 and S2 of length n each, a longest substring A1 of S1 and A2 of S2 such that the Hamming distance between A1 and A2 is at most k. So far, the only subquadratic time result for this problem was known for k = 1 [6]. We first present two output-dependent algorithms solving the k-LCF...

evaluation of morphological variations in 70 genotypes of seven accessions of thymus caramanicus jalas.growing in central iran was carried out, for determining valuable characters for future breeding programs and medicinal purposes. in this study 30 quantitative and qualitative characters were evaluated. the results revealed great variabilities of important traits among populations. results of ...

It is proved in [BOO], [J2] and [Ok1] that the joint distribution of suitably scaled rows of a partition with respect to the Plancherel measure of the symmetric group converges to the corresponding distribution of eigenvalues of a Hermitian matrix from the Gaussian Unitary Ensemble. We introduce a new measure on strict partitions, which is analogous to the Plancherel measure, and prove that the...