Related papers: The Ulam-Hammersley problem for multiset permutati…
Permutation patterns and pattern avoidance have been intensively studied in combinatorics and computer science, going back at least to the seminal work of Knuth on stack-sorting (1968). Perhaps the most natural algorithmic question in this…
Universal cycle for $k$-permutations is a cyclic arrangement in which each $k$-permutation appears exactly once as $k$ consecutive elements. Enumeration problem of universal cycles for $k$-permutations is discussed and one new enumerating…
Given a subset of size $k$ of a very large universe a randomized way to find this subset could consist of deleting half of the universe and then searching the remaining part. With a probability of $2^{-k}$ one will succeed. By probability…
Let $G_{k,n}$ be a group of permutations of $kn$ objects which permutes things independently in disjoint blocks of size $k$ and then permutes the blocks. We investigate the probabilistic and/or enumerative aspects of random elements of…
The on-line nearest-neighbour graph on a sequence of $n$ uniform random points in $(0,1)^d$ ($d \in \N$) joins each point after the first to its nearest neighbour amongst its predecessors. For the total power-weighted edge-length of this…
In parameterized complexity, it is a natural idea to consider different generalizations of classic problems. Usually, such generalization are obtained by introducing a "relaxation" variable, where the original problem corresponds to setting…
We consider high-dimensional estimation problems where the number of parameters diverges with the sample size. General conditions are established for consistency, uniqueness, and asymptotic normality in both unpenalized and penalized…
We consider physical Hamiltonians that can be represented by the multiparametric Gaussian ensembles, theoretically derive the state ensembles for its eigenstates and analyze the effect of varying system conditions on its bipartite…
We use moment method to understand the cycle structure of the composition of independent invariant permutations. We prove that under a good control on fixed points and cycles of length 2, the limiting joint distribution of the number of…
We give an algorithm for learning a mixture of {\em unstructured} distributions. This problem arises in various unsupervised learning scenarios, for example in learning {\em topic models} from a corpus of documents spanning several topics.…
In these lecture notes I will give a pedagogical introduction to some common aspects of 4 different problems: (i) random matrices (ii) the longest increasing subsequence problem (also known as the Ulam problem) (iii) directed polymers in…
Let $ k, n \in \mathbb{N}^+ $ and $ m \in \mathbb{N}^+ \cup \{\infty \} $. A $ k $-multiset in $ [n]_m $ is a $ k $-set whose elements are integers from $ \{1, 2, \ldots, n\} $, and each element is allowed to have at most $ m $ repetitions.…
We present a finite-order system of recurrence relations for a permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k = 1, 2, and 3) as well as the method for deriving such recurrence…
We explore how the asymptotic structure of a random $n$-term weak integer composition of $m$ evolves, as $m$ increases from zero. The primary focus is on establishing thresholds for the appearance and disappearance of substructures. These…
We prove an asymptotic formula for the number of $k$-uniform hypergraphs with a given degree sequence, for a wide range of parameters. In particular, we find a formula that is asymptotically equal to the number of $d$-regular $k$-uniform…
We extend Stanley's work on alternating permutations with extremal number of fixed points in two directions: first, alternating permutations are replaced by permutations with a prescribed descent set; second, instead of simply counting…
We use the theory of symmetric functions to enumerate various classes of alternating permutations w of {1,2,...,n}. These classes include the following: (1) both w and w^{-1} are alternating, (2) w has certain special shapes, such as…
We find a formula for the number of permutations of $[n]$ that have exactly $s$ runs up and down. The formula is at once terminating, asymptotic, and exact.
We derive the asymptotic distribution of ordinal-pattern frequencies under weak dependence conditions and investigate the long-run covariance matrix not only analytically for moving-average, Gaussian, and the novel generalized coin-tossing…
The article studies the reiterated homogenization of linear elliptic variational inequalities arising in problems with unilateral constrains. We assume that the coefficients of the equations satisfy and abstract hypothesis covering on each…