The problem of finding a longest increasing subsequence (LIS) is a well known task in sequence processing. There are many variants of the basic task. We discuss a recently introduced variant of LIS, a minimal height longest increasing subsequence problem and propose a new algorithm for it, which improves its time complexity. Moreover, we define a family of similar problems and introduce algorit...

Let Ln be the length of the longest increasing subsequence of a random permutation of the numbers 1, . . . , n, for the uniform distribution on the set of permutations. We discuss the “hydrodynamical approach” to the analysis of the limit behavior, which probably started with Hammersley (1972), and was subsequently further developed by several authors. We also give two proofs of an exact (non-a...

Two-dimensional Lorentzian geometry has recently found application in some models of nonrelativistic systems, most profitably for the process of boarding an aeroplane. The duration of the boarding process is assumed to be a result of passengers standing in the isle and blocking each others’ way. According to this model, the expected boarding time is equal to the length of the longest timelike g...

New algorithm for finding longest increasing subsequence is discussed. This algorithm is based on the ideas of idempotent mathematic and uses Max-Plus idempotent semiring. Problem of finding longest increasing subsequence is reformulated in a matrix form and solved with linear algebra.

Background: Green tea is a popular type of tea that is made of unfermented tea leaves. Green tea has been used for thousands of years by people in Eastern countries for a variety of health reasons. One of the primary benefits of Green Tea in regard to fertility is not in what it contains, but rather in what it does not contain. Materials and Methods: In the present study attempts to investigate...