English
Related papers

Related papers: Asymptotic enumeration of incidence matrices

200 papers

This is a survey of the recent progress and open questions on the structure of the sets of 0-1 and non-negative integer matrices with prescribed row and column sums. We discuss cardinality estimates, the structure of a random matrix from…

Combinatorics · Mathematics 2010-10-28 Alexander Barvinok

In a multi-base representation of an integer (in contrast to, for example, the binary or decimal representation) the base (or radix) is replaced by products of powers of single bases. The resulting numeral system has desirable properties…

Number Theory · Mathematics 2015-11-10 Daniel Krenn , Dimbinaina Ralaivaosaona , Stephan Wagner

The paper investigates the asymptotic behavior of (non-normalized) traces of certain classes of matrices with non-commutative random variables as entries. We show that, unlike in the commutative framework, the asymptotic behavior of…

Operator Algebras · Mathematics 2013-04-02 Mihai Popa , yong Jiao

Several statistics-based detectors, based on unimodal matrix models, for determining the number of sources in a field are designed. A new variance ratio statistic is proposed, and its asymptotic distribution is analyzed. The variance ratio…

Applications · Statistics 2021-06-09 Rui Zhang , Junting Chen , Yao Xie , Alexander Shapiro , Urbashi Mitra

We present four constructions of inversion sequences, and use them to compute the enumeration sequences of 24 classes of pattern-avoiding inversion sequences. This completes the enumeration of inversion sequences avoiding one or two…

Combinatorics · Mathematics 2025-11-25 Benjamin Testart

We consider graph classes $\mathcal G$ in which every graph has components in a class $\mathcal{C}$ of connected graphs. We provide a framework for the asymptotic study of $\lvert\mathcal{G}_{n,N}\rvert$, the number of graphs in…

Combinatorics · Mathematics 2018-01-17 Konstantinos Panagiotou , Leon Ramzews

We consider planar maps adjusted with a (regular critical) Boltzmann distribution and show that the expected number of pattern occurrences of a given map is asymptotically linear when the number n of edges goes to infinity. The main…

Combinatorics · Mathematics 2019-05-20 Michael Drmota , Benedikt Stufler

We consider the ensemble of N-dimensional random symmetric matrices A that have, in average, p non-zero elements per row. We study the asymptotic behavior of the norm of A in the limit of infinitely increasing N and p. We prove that the…

Probability · Mathematics 2014-11-18 A. Khorunzhy

We present a set of conditions which, if satisfied, provide for a complete asymptotic analysis of random matrices with source term containing two distinct eigenvalues. These conditions are shown to be equivalent to the existence of a…

Mathematical Physics · Physics 2009-11-11 K. D. T-R McLaughlin

The number of $n \times n$ matrices whose entries are either -1, 0, or 1, whose row- and column- sums are all 1, and such that in every row and every column the non-zero entries alternate in sign, is proved to be $[1!4! >...…

Combinatorics · Mathematics 2008-02-03 Doron Zeilberger

We obtain an asymptotic series $\sum_{j=0}^\infty\frac{I_j}{n^j}$ for the integral $\int_0^1[x^n+(1-x)^n]^{\frac1{n}}dx$ as $n\to\infty$, and compute $I_j$ in terms of alternating (or "colored") multiple zeta value. We also show that $I_j$…

Number Theory · Mathematics 2018-03-13 Michael E. Hoffman , Markus Kuba , Moti Levy , Guy Louchard

Scale-free networks contain many small cliques and cycles. We model such networks as inhomogeneous random graphs with regularly varying infinite-variance weights. For these models, the number of cliques and cycles have exact integral…

Probability · Mathematics 2019-03-27 A. J. E. M. Janssen , Johan S. H. van Leeuwaarden , Seva Shneer

We prove a formula for the asymptotic number of edge-colored regular graphs with a prescribed set of allowed vertex-incidence structures. The formula depends on specific critical points of a polynomial encoding the vertex-incidences. As an…

Combinatorics · Mathematics 2026-01-28 Michael Borinsky , Chiara Meroni , Maximilian Wiesmann

We consider the problem of enumerating integer tetrahedra of fixed perimeter (sum of side-lengths) and/or diameter (maximum side-length), up to congruence. As we will see, this problem is considerably more difficult than the corresponding…

Combinatorics · Mathematics 2021-12-03 James East , Michael Hendriksen , Laurence Park

In this note we give a combinatorial and non-computational proof of the asymptotics of the integer moments of the moments of the characteristic polynomials of Haar distributed unitary matrices as the size of the matrix goes to infinity.…

Probability · Mathematics 2020-02-18 Theodoros Assiotis , Jonathan P. Keating

In this document we achieve exact and asymptotic enumeration of words, compositions over a finite group, and/or integer compositions characterized by local restrictions and, separately, subsequence pattern avoidance. We also count…

Combinatorics · Mathematics 2019-04-19 Andrew MacFie

The asyptotic number of nonequivalent binary n-codes is determined. This is also the asymptotic number of nonisomorphic binary n-matroids. The connection to a result of Lefmann, Roedl, Phelps is explored. The latter states that almost all…

Information Theory · Computer Science 2017-03-01 Marcel Wild

In this paper, we pursue our study of asymptotic properties of families of random matrices that have a tensor structure. In previous work, the first- and second-named authors provided conditions under which tensor products of unitary random…

Probability · Mathematics 2023-10-25 Benoît Collins , Pierre Yves Gaudreau Lamarre , Camille Male

We prove that if a $7\times 7$ matrix is potentially stable, then it has at least 11 non-zero entries. The results for $n\times n$ matrix with $n$ up to 6 are known previously. We prove the result by making a list of possible associated…

Combinatorics · Mathematics 2018-05-24 Christopher Hambric , Chi-Kwong Li , Diane Christine Pelejo , Junping Shi

Let $(u_n)_{n \geq 0}$ be a nondegenerate linear recurrence of integers, and let $\mathcal{A}$ be the set of positive integers $n$ such that $u_n$ and $n$ are relatively prime. We prove that $\mathcal{A}$ has an asymptotic density, and that…

Number Theory · Mathematics 2020-12-15 Carlo Sanna