Results 1 to 10 of about 1,042 (145)
Asymptotic enumeration of orientations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 We find the asymptotic number of 2-orientations of quadrangulations with n inner faces, and of 3-orientations of triangulations with n inner vertices.
Stefan Felsner, Eric Fusy, Marc Noy
doaj +3 more sources
On the asymptotic enumeration of accessible automata [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 Automata, Logic and ...
Elcio Lebensztayn
doaj +3 more sources
On the Asymptotic Enumeration of LEGO Structures [PDF]
Experimental Mathematics, 2011 We investigate experimentally the growth regimes of the number of LEGO structures that can be constructed contiguously from n blocks of equal shape and color.
Søren Eilers, Mikkel Abrahamsen
exaly +4 more sources
Asymptotic Enumeration of Non-Uniform Linear Hypergraphs
Discussiones Mathematicae Graph Theory, 2022 A linear hypergraph, also known as a partial Steiner system, is a collection of subsets of a set such that no two of the subsets have more than one element in common.
Hasheminezhad Mahdieh, McKay Brendan D.
doaj +3 more sources
Asymptotic enumeration of cographs
Electronic Notes in Discrete Mathematics, 2001 Abstract Abstract We consider here labelled and unlabelled cographs, i.e., graphs without induced P4, whose applications are important in computer science and logic, because of their representation by means of parse trees. After a new (analytical) approach for obtaining generating functions associated to parse trees, we solve the open problem of ...
Vlady Ravelomanana, Loÿs Thimonier
exaly +2 more sources
Asymptotic Enumeration of Sparse Multigraphs with Given Degrees [PDF]
SIAM Journal on Discrete Mathematics, 2013 Let J and J* be subsets of Z+ such that 0,1\in J and 0\in J*. For infinitely many n, let k=(k_1,..., k_n) be a vector of nonnegative integers whose sum M is even. We find an asymptotic expression for the number of multigraphs on the vertex set {1,..., n} with degree sequence given by k, such that every loop has multiplicity in J* and every non-loop ...
Catherine Greenhill, Brendan Mckay
exaly +4 more sources
Asymptotic enumeration of correlation-immune boolean functions [PDF]
Cryptography and Communications, 2010 A boolean function of $n$ boolean variables is {correlation-immune} of order $k$ if the function value is uncorrelated with the values of any $k$ of the arguments. Such functions are of considerable interest due to their cryptographic properties, and are also related to the orthogonal arrays of statistics and the balanced hypercube colourings of ...
Catherine Greenhill +2 more
exaly +6 more sources
Compositions into Powers of b: Asymptotic Enumeration and Parameters [PDF]
Algorithmica, 2015 For a fixed integer base $b\geq2$, we consider the number of compositions of $1$ into a given number of powers of $b$ and, related, the maximum number of representations a positive integer can have as an ordered sum of powers of $b$. We study the asymptotic growth of those numbers and give precise asymptotic formulae for them, thereby improving on ...
Stephan Wagner +2 more
exaly +4 more sources
Asymptotic enumeration of 2-covers and line graphs
Discrete Mathematics, 2010 In this paper we find asymptotic enumerations for the number of line graphs on $n$-labelled vertices and for different types of related combinatorial objects called 2-covers. We find that the number of 2-covers, $s_n$, and proper 2-covers, $t_n$, on $[n]$ both have asymptotic growth $$ s_n\sim t_n\sim B_{2n}2^{-n}\exp(-\frac12\log(2n/\log n))= B_{2n}2^{
Thomas Prellberg +2 more
exaly +4 more sources
Bounded affine permutations I. Pattern avoidance and enumeration [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 We introduce a new boundedness condition for affine permutations, motivated by the fruitful concept of periodic boundary conditions in statistical physics. We study pattern avoidance in bounded affine permutations.
Neal Madras, Justin M. Troyka
doaj +1 more source