Related papers: Increasing Subsequences and Kronecker Coefficients
We prove that the Poisson distribution maximises entropy in the class of ultra-log-concave distributions, extending a result of Harremo\"{e}s. The proof uses ideas concerning log-concavity, and a semigroup action involving adding Poisson…
We prove that in a large collection of naturally defined sets of permutations of fixed length, the numbers of permutations at Ulam distance k from the identity form a log-concave sequence in k.
Consider the number of permutations in the symmetric group on n letters that contain c copies of a given pattern. As c varies (with n held fixed) these numbers form a sequence whose properties we study for the monotone patterns and the…
This paper is devoted to the study of the log-convexity of combinatorial sequences. We show that the log-convexity is preserved under componentwise sum, under binomial convolution, and by the linear transformations given by the matrices of…
We study the Kronecker symbol $\left(\frac st\right)$ for the sequence of the convergents $s/t$ of a purely periodic continued fraction expansion. Whereas the corresponding sequence of Jacobi symbols is always periodic, it turns out that…
Assume $X_n$ is a random sample of $n$ uniform, independent points from a triangle $T$. The longest convex chain, $Y$, of $X_n$ is defined naturally. The length $|Y|$ of $Y$ is a random variable, denoted by $L_n$. In this article, we…
Given uniform probability on words of length M=Np+k, from an alphabet of size p, consider the probability that a word (i) contains a subsequence of letters (p, p-1,...,1) in that order and (ii) that the maximal length of the disjoint union…
The Hammersley process relates to the statistical properties of the maximum length of all up/right paths connecting random points of a given density in the unit square from (0,0) to (1,1). This process can also be interpreted in terms of…
We study the entropy $S$ of longest increasing subsequences (LIS), i.e., the logarithm of the number of distinct LIS. We consider two ensembles of sequences, namely random permutations of integers and sequences drawn i.i.d.\ from a limited…
Koksma's equidistribution theorem from 1935 states that for Lebesgue almost every $\alpha>1$, the fractional parts of the geometric progression $(\alpha^{n})_{n\geq1}$ are equidistributed modulo one. In the present paper we sharpen this…
In this note, we present new properties for a sequence arising in some refinements of Carleman's inequality. Our results extend some results of Yang [Approximations for constant e and their applications J. Math. Anal. Appl. 262 (2001)…
We study the relationship between the discrete and the continuous versions of the Kronecker--Weyl equidistribution theorem, as well as their possible extension to manifolds in higher dimensions. We also investigate a way to deduce in some…
We settle the question of where exactly the reduced Kronecker coefficients lie on the spectrum between the Littlewood-Richardson and Kronecker coefficients by showing that every Kronecker coefficient of the symmetric group is equal to a…
We present a certain generalization of a recent result of M. I. Cirnu on linear recurrence relations with coefficient in progressions [2]. We provide some interesting examples related to some well-known integer sequences, such as Fibonacci…
Zeckendorf proved that any integer can be decomposed uniquely as a sum of non-adjacent Fibonacci numbers, $F_n$. Using continued fractions, Lekkerkerker proved the average number of summands of an $m \in [F_n, F_{n+1})$ is essentially…
Sufficient conditions are developed, under which the compound Poisson distribution has maximal entropy within a natural class of probability measures on the nonnegative integers. Recently, one of the authors [O. Johnson, {\em Stoch. Proc.…
Selecting N random points in a unit square corresponds to selecting a random permutation. By putting 5 types of symmetry restrictions on the points, we obtain subsets of permutations : involutions, signed permutations and signed…
Let A be a set of integers dense in a finite interval. We establish upper and lower bounds for the longest regularly-spaced and convex subsets of A and of A-A.
This paper reformulates the problem of finding a longest common increasing subsequence of the two given input sequences in a very succinct way. An extremely simple linear space algorithm based on the new formula can find a longest common…
We show that a wide variety of generalized increasing subsequence problems admit a one parameter family of extensions for which we can exactly compute the mean length of the longest increasing subsequence. By the nature of the extension,…