Related papers: The shallow permutations are the unlinked permutat…
We investigate the mixing properties of a model of reversible Markov chains in random environment, which notably contains the simple random walk on the superposition of a deterministic graph and a second graph whose vertex set has been…
A number system coding for the permutations generated by cyclic shift is described. The system allows to find the rank of a permutation given how it has been generated, and to determine a permutation given its rank. It defines a code…
Inspired by work of McKay, Morse, and Wilf, we give an exact count of the involutions in S_n which contain a given permutation \tau in S_k as a subsequence; this number depends on the patterns of the first j values of \tau for 1<=j<=k. We…
We show that the Mallows measure on permutations of $1,\ldots,n$ arises as the law of the unique Gale-Shapley stable matching of the random bipartite graph conditioned to be perfect, where preferences arise from a total ordering of the…
Skewed probit regression is but one example of a statistical model that generalizes a simpler model, like probit regression. All skew-symmetric distributions and link functions arise from symmetric distributions by incorporating a skewness…
We define a pseudometric on the set of all unbounded subsets of a metric space. The Kolmogorov quotient of this pseudometric space is a complete metric space. The definition of the pseudometric is guided by the principle that two unbounded…
Let M(n, d) be the maximum size of a permutation array on n symbols with pairwise Hamming distance at least d. We use various combinatorial, algebraic, and computational methods to improve lower bounds for M(n, d). We compute the Hamming…
Knot and link polynomials are topological invariants calculated from the expectation value of loop operators in topological field theories. In 3D Chern-Simons theory, these invariants can be found from crossing and braiding matrices of…
A large driver of the complexity of graph learning is the interplay between structure and features. When analyzing the expressivity of graph neural networks, however, existing approaches ignore features in favor of structure, making it…
We consider so-called univariate unlinked (sometimes ``decoupled,'' or ``shuffled'') regression when the unknown regression curve is monotone. In standard monotone regression, one observes a pair $(X,Y)$ where a response $Y$ is linked to a…
We study numerically the distributions of the length $L$ of the longest increasing subsequence (LIS) for the two cases of random permutations and of one-dimensional random walks. Using sophisticated large-deviation algorithms, we are able…
In the present work some geometric and topological implications of noncommutative Wilson loops are explored via the Seiberg-Witten map. In the abelian Chern-Simons theory on a three dimensional manifold, it is shown that the effect of…
Permutations with bounded drop size, which we also call bounded permutations, was introduced by Chung, Claesson, Dukes and Graham. Petersen introduced a new Mahonian statistic the sorting index, which is denoted by $\sor$. Meanwhile, Wilson…
We develop the theoretical foundations of a generalized Gromov-Hausdorff distance between functions on networks that has recently been applied to various subfields of topological data analysis and optimal transport. These functional…
The objects of our interest are the so-called $A$-permutations, which are permutations whose cycle length lie in a fixed set $A$. They have been extensively studied with respect to the uniform or the Ewens measure. In this paper, we extend…
Deep neural networks have attained remarkable success across diverse classification tasks. Recent empirical studies have shown that deep networks learn features that are linearly separable across classes. However, these findings often lack…
Permutation resemblance measures the distance of a function from being a permutation. Here we show how to determine the permutation resemblance through linear integer programming techniques. We also present an algorithm for constructing…
Brualdi and Ma found a connection between involutions of length $n$ with $k$ descents and symmetric $k\times k$ matrices with non-negative integer entries summing to $n$ and having no row or column of zeros. From their main theorem they…
Two skew cyclic codes can be equivalent for the Hamming metric only if they have the same length, and only the zero code is degenerate. The situation is completely different for the rank metric, where lengths of codes correspond to the…
Unimodal (i.e. single-humped) permutations may be decomposed into a product of disjoint cycles. Some enumerative results concerning their cyclic structure -- e.g. 2/3 of them contain fixed points -- are given. We also obtain in effect a…