Results 21 to 30 of about 1,141 (244)
On the enumeration of column-convex permutominoes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 We study the enumeration of \emphcolumn-convex permutominoes, i.e. column-convex polyominoes defined by a pair of permutations. We provide a direct recursive construction for the column-convex permutominoes of a given size, based on the application of ...
Nicholas R. Beaton +3 more
doaj +1 more source
Probabilistic models for the analysis of inverse extremal problems in combinatorics [PDF]
Vestnik Samarskogo Gosudarstvennogo Tehničeskogo Universiteta. Seriâ: Fiziko-Matematičeskie Nauki, 2022 In an inverse extremal problem for a combinatorial scheme with a given value of the objective function of the form of a certain extreme value of its characteristic, a probabilistic model is developed that ensures that this value is obtained in its ...
Nataliya Yu. Enatskaya
doaj +1 more source
The number of planar graphs and properties of random planar graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We show an asymptotic estimate for the number of labelled planar graphs on $n$ vertices. We also find limit laws for the number of edges, the number of connected components, and other parameters in random planar graphs.
Omer Gimenez, Marc Noy
doaj +1 more source
On trees, tanglegrams, and tangled chains [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 Tanglegrams are a class of graphs arising in computer science and in biological research on cospeciation and coevolution. They are formed by identifying the leaves of two rooted binary trees. The embedding of the trees in the plane is irrelevant for this
Sara Billey +2 more
doaj +1 more source
Globalization of the analysis of particle placement models by cells [PDF]
Vestnik Samarskogo Gosudarstvennogo Tehničeskogo Universiteta. Seriâ: Fiziko-Matematičeskie Nauki, 2021 The title of the paper means that its goal is a general approach to the pre-asmptotic analysis of schemes with different qualities in all combinations of their distinguishability of their constituent elements (cells and particles).
Nataliya Yu. Enatskaya
doaj +1 more source
On the number of series parallel and outerplanar graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We show that the number $g_n$ of labelled series-parallel graphs on $n$ vertices is asymptotically $g_n \sim g \cdot n^{-5/2} \gamma^n n!$, where $\gamma$ and $g$ are explicit computable constants.
Manuel Bodirsky +3 more
doaj +1 more source
Mixed Powers of Generating Functions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 Given an integer $m \geq 1$, let $\| \cdot \|$ be a norm in $\mathbb{R}^{m+1}$ and let $\mathbb{S}_+^m$ denote the set of points $\mathbf{d}=(d_0,\ldots,d_m)$ in $\mathbb{R}^{m+1}$ with nonnegative coordinates and such that $\| \mathbf{d} \|=1$. Consider
Manuel Lladser
doaj +1 more source
ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS [PDF]
Journal of Mathematical Logic, 2013 We study connections between classical asymptotic density, computability and computable enumerability. In an earlier paper, the second two authors proved that there is a computably enumerable set A of density 1 with no computable subset of density 1.
Rodney G. Downey +2 more
openaire +2 more sources
Asymptotic Enumeration of RNA Structures with Pseudoknots [PDF]
Bulletin of Mathematical Biology, 2008 In this paper we present the asymptotic enumeration of RNA structures with pseudoknots. We develop a general framework for the computation of exponential growth rate and the sub exponential factors for $k$-noncrossing RNA structures. Our results are based on the generating function for the number of $k$-noncrossing RNA pseudoknot structures, ${\sf S}_k(
Jin, Emma Y., Reidys, Christian M.
openaire +3 more sources
Spanning forests in regular planar maps (conference version) [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 We address the enumeration of $p$-valent planar maps equipped with a spanning forest, with a weight $z$ per face and a weight $u$ per component of the forest.
Mireille Bousquet-Mélou +1 more
doaj +1 more source