Results 11 to 20 of about 1,141 (244)
Asymptotic enumeration of lonesum matrices [PDF]
Advances in Applied Mathematics, 2021 We provide bivariate asymptotics for the poly-Bernoulli numbers, a combinatorial array that enumerates lonesum matrices, using the methods of Analytic Combinatorics in Several Variables (ACSV). For the diagonal asymptotic (i.e., for the special case of square lonesum matrices) we present an alternative proof based on Parseval's identity.
Jessica Khera +2 more
openaire +2 more sources
Lattice Enumeration with Discrete Pruning: Improvements, Cost Estimation and Optimal Parameters
Mathematics, 2023 Lattice enumeration is a linear-space algorithm for solving the shortest lattice vector problem (SVP). Extreme pruning is a practical technique for accelerating lattice enumeration, which has a mature theoretical analysis and practical implementation ...
Luan Luan +3 more
doaj +1 more source
Lietuvos Matematikos Rinkinys, 2021 The paper extends the investigations of limit theorems for numbers satisfying a class of triangular arrays. We obtain analytical expressions for the semiexponential generating function the numbers, associated with Hermite polynomials.
Igoris Belovas
doaj +1 more source
A bijection for nonorientable general maps [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We give a different presentation of a recent bijection due to Chapuy and Dołe ̨ga for nonorientable bipartite quadrangulations and we extend it to the case of nonorientable general maps.
Jérémie Bettinelli
doaj +1 more source
Asymptotic enumeration on self-similar graphs with two boundary vertices [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 Combinatorics
Elmar Teufl, Stephan Wagner
doaj +1 more source
Central Limit Theorems for Combinatorial Numbers Associated with Laguerre Polynomials
Mathematics, 2022 In this paper, we study limit theorems for numbers satisfying a class of triangular arrays, which are defined by a bivariate linear recurrence with bivariate linear coefficients.
Igoris Belovas
doaj +1 more source
Asymptotic Enumeration of Hypergraphs by Degree Sequence [PDF]
Advances in Combinatorics, 2022 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 hypergraphs on n vertices provided that dn ≤ c(n/k) for a constant c > 0, and 3 ≤ k < n^c for any C < 1/9.
Kamčev, Nina +2 more
openaire +2 more sources
Accessible and Deterministic Automata: Enumeration and Boltzmann Samplers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We present a bijection between the set $\mathcal{A}_n$ of deterministic and accessible automata with $n$ states on a $k$-letters alphabet and some diagrams, which can themselves be represented as partitions of the set $[\![ 1..(kn+1) ]\!]$ into $n$ non ...
Frédérique Bassino, Cyril Nicaud
doaj +1 more source
Asymptotic enumeration of Latin rectangles [PDF]
Bulletin of the American Mathematical Society, 1984 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chris D. Godsil, Brendan D. McKay
openaire +3 more sources
Asymptotic enumeration and distributional properties of galled networks [PDF]
Journal of Combinatorial Theory, Series A, 2022 23 pages; revised ...
Michael Fuchs 0001 +2 more
openaire +4 more sources