اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدConvex polyominoes revisited: Enumeration of outer site perimeter, interior vertices, and boundary vertices of certain degrees
58
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The main contribution of this paper is a new column-by-column method for the decomposition of generating functions of convex polyominoes suitable for enumeration with respect to various statistics including but not limited to interior vertices, boundary vertices of certain degrees, and outer site perimeter. Using this decomposition, among other things, we show that A) the average number of interior vertices over all convex polyominoes of perimeter $2n$ is asymptotic to $frac{n^2}{12}+frac{nsqrt{n}}{3sqrt{pi}} -frac{(21pi-16)n}{12pi}.$ B) the average number of boundary vertices with degree two over all convex polyominoes of perimeter $2n$ is asymptotic to $frac{n+6}{2}+frac{1}{sqrt{pi n}}+frac{(16-7pi)}{4pi n}.$ Additionally, we obtain an explicit generating function counting the number of convex polyominoes with $n$ boundary vertices of degrees at most three and show that this number is asymptotic to $ frac{n+1}{40}left(frac{3+sqrt{5}}{2}right)^{n-3} +frac{sqrt[4]{5}(2-sqrt{5})}{80sqrt{pi n}}left(frac{3+sqrt{5}}{2}right)^{n-2}. $ Moreover, we show that the expected number of the boundary vertices of degree four over all convex polyominoes with $n$ vertices of degrees at most three is asymptotically $ frac{n}{sqrt{5}}-frac{sqrt[4]{125}(sqrt{5}-1)sqrt{n}}{10sqrt{pi}}. $ C) the number of convex polyominoes with the outer-site perimeter $n$ is asymptotic to $frac{3(sqrt{5}-1)}{20sqrt{pi n}sqrt[4]{5}}left(frac{3+sqrt{5}}{2}right)^n,$ and show the expected number of the outer-site perimeter over all convex polyominoes with perimeter $2n$ is asymptotic to $frac{25n}{16}+frac{sqrt{n}}{4sqrt{pi}}+frac{1}{8}.$ Lastly, we prove that the expected perimeter over all convex polyominoes with the outer-site perimeter $n$ is asymptotic to $sqrt[4]{5}n$.
قيم البحث
اقرأ أيضاً
In this paper we enumerate the cardinalities for the set of all vertices of outdegree $ge k$ at level $ge ell$ among all rooted ordered $d$-trees with $n$ edges. Our results unite and generalize several previous works in the literature.
For $ngeq 3$, let $r=r(n)geq 3$ be an integer. A hypergraph is $r$-uniform if each edge is a set of $r$ vertices, and is said to be linear if two edges intersect in at most one vertex. In this paper, the number of linear $r$-uniform hypergraphs on $n
toinfty$ vertices is determined asymptotically when the number of edges is $m(n)=o(r^{-3}n^{ frac32})$. As one application, we find the probability of linearity for the independent-edge model of random $r$-uniform hypergraph when the expected number of edges is $o(r^{-3}n^{ frac32})$. We also find the probability that a random $r$-uniform linear hypergraph with a given number of edges contains a given subhypergraph.
In previous work, we gave asymptotic counting results for the number of tree-child and normal networks with $k$ reticulation vertices and explicit exponential generating functions of the counting sequences for $k=1,2,3$. The purpose of this note is t
wo-fold. First, we make some corrections to our previous approach which overcounted the above numbers and thus gives erroneous exponential generating functions (however, the overcounting does not effect our asymptotic counting results). Secondly, we use our (corrected) exponential generating functions to derive explicit formulas for the number of tree-child and normal networks with $k=1,2,3$ reticulation vertices. This re-derives recent results of Carona and Zhang, answers their question for normal networks with $k=2$, and adds new formulas in the case $k=3$.
In this paper we enumerate and give bijections for the following four sets of vertices among rooted ordered trees of a fixed size: (i) first-children of degree $k$ at level $ell$, (ii) non-first-children of degree $k$ at level $ell-1$, (iii) leaves h
aving $k-1$ elder siblings at level $ell$, and (iv) non-leaves of outdegree $k$ at level $ell-1$. Our results unite and generalize several previous works in the literature.
Let $k$ be a positive integer. Let $G$ be a balanced bipartite graph of order $2n$ with bipartition $(X, Y)$, and $S$ a subset of $X$. Suppose that every pair of nonadjacent vertices $(x,y)$ with $xin S, yin Y$ satisfies $d(x)+d(y)geq n+1$. We show t
hat if $|S|geq 2k+2$, then $G$ contains $k$ disjoint cycles covering $S$ such that each of the $k$ cycles contains at least two vertices of $S$. Here, both the degree condition and the lower bound of $|S|$ are best possible. And we also show that if $|S|=2k+1$, then $G$ contains $k$ disjoint cycles such that each of the $k$ cycles contains at least two vertices of $S$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
