ARTICLE
TITLE

Almost all Permutation Matrices have Bounded Saturation Functions

SUMMARY

No disponible

PAGES
pp. P2.16

 Articles related

Kyungyong Lee, George D. Nasr, Jamie Radcliffe    

We present a combinatorial formula using skew Young tableaux for the coefficients of Kazhdan-Lusztig polynomials for sparse paving matroids. These matroids are known to be logarithmically almost all matroids, but are conjectured to be almost all matroids... see more


Norman Do, Jian He, Daniel V. Mathews    

Given a surface with boundary and some points on the boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on the surface. If only bi... see more


Ameera Chowdhury    

Let Fq\mathbb{F}_{q} be a finite field of order qq with characteristic pp. An arc is an ordered family of at least kk vectors in Fkq\mathbb{F}_{q}^{k} in which every subfamily of size kk is a basis of Fkq\mathbb{F}_{q}^{k}. The MDS conjecture, which was ... see more


Konstantinos Georgiou, Somnath Kundu, Pawel Pralat    

Let GG be a graph in which each vertex initially has weight 1. In each step, the unit weight from a vertex uu to a neighbouring vertex vv can be moved, provided that the weight on vv is at least as large as the weight on uu. The unit acquisition number o... see more


Andrzej Dudek, Jaroslaw Grytczuk, Andrzej Rucinski    

Let p\pi be a permutation of the set [n]={1,2,…,n}[n]=\{1,2,\dots, n\}. Two disjoint order-isomorphic subsequences of p\pi are called twins. How long twins are contained in every permutation? The well known Erdos-Szekeres theorem implies that there is al... see more