## Abstract

We explore the size of the largest (permuted) triangular submatrix of a random matrix, and more precisely its asymptotical behavior as the size of the ambient matrix tends to infinity. The importance of such permuted triangular submatrices arises when dealing with certain combinatorial algebraic settings in which these submatrices determine the rank of the ambient matrix and thus attract special attention.

Original language | English |
---|---|

Pages (from-to) | 407-418 |

Number of pages | 12 |

Journal | Proceedings of the American Mathematical Society |

Volume | 143 |

Issue number | 1 |

Early online date | 15 Sept 2014 |

DOIs | |

Publication status | Published - Jan 2015 |