اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدFamilies of m-convex polygons: m = 2
84
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Polygons are described as almost-convex if their perimeter differs from the perimeter of their minimum bounding rectangle by twice their `concavity index, $m$. Such polygons are called emph{$m$-convex} polygons and are characterised by having up to $m$ indentations in the side. We use a `divide and conquer approach, factorising 2-convex polygons by extending a line along the base of its indents. We then use the inclusion-exclusion principle, the Hadamard product and extensions to known methods to derive the generating functions for each case.
قيم البحث
اقرأ أيضاً
Polygons are described as almost-convex if their perimeter differs from the perimeter of their minimum bounding rectangle by twice their `concavity index, $m$. Such polygons are called emph{$m$-convex} polygons and are characterised by having up to $
m$ indentations in their perimeter. We first describe how we conjectured the (isotropic) generating function for the case $m=2$ using a numerical procedure based on series expansions. We then proceed to prove this result for the more general case of the full anisotropic generating function, in which steps in the $x$ and $y$ direction are distinguished. In so doing, we develop tools that would allow for the case $m > 2$ to be studied. %In our proof we use a `divide and conquer approach, factorising 2-convex %polygons by extending a line along the base of its indents. We then use %the inclusion-exclusion principle, the Hadamard product and extensions to %known methods to derive the generating functions for each case.
A binary poset code of codimension M (of cardinality 2^{N-M}, where N is the code length) can correct maximum M errors. All possible poset metrics that allow codes of codimension M to be M-, (M-1)- or (M-2)-perfect are described. Some general conditi
ons on a poset which guarantee the nonexistence of perfect poset codes are derived; as examples, we prove the nonexistence of R-perfect poset codes for some R in the case of the crown poset and in the case of the union of disjoin chains. Index terms: perfect codes, poset codes
Let $S$ be a set of $n$ points in general position in the plane, and let $X_{k,ell}(S)$ be the number of convex $k$-gons with vertices in $S$ that have exactly $ell$ points of $S$ in their interior. We prove several equalities for the numbers $X_{k,e
ll}(S)$. This problem is related to the ErdH{o}s-Szekeres theorem. Some of the obtained equations also extend known equations for the numbers of empty convex polygons to polygons with interior points. Analogous results for higher dimension are shown as well.
We characterize the topological configurations of points and lines that may arise when placing n points on a circle and drawing the n perpendicular bisectors of the sides of the corresponding convex cyclic n-gon. We also provide exact and asymptotic
formulas describing a random realizable configuration, obtained either by sampling the points uniformly at random on the circle or by sampling a realizable configuration uniformly at random.
Given a graph whose edges are labeled by ideals in a ring, a generalized spline is a labeling of each vertex by a ring element so that adjacent vertices differ by an element of the ideal associated to the edge. We study splines over the ring Z/mZ. Pr
evious work considered splines over domains, in which very different phenomena occur. For instance when the ring is the integers, the elements of bases for spline modules are indexed by the vertices of the graph. However we prove that over Z/mZ spline modules can essentially have any rank between 1 and n. Using the classification of finite Z-modules, we begin the work of classifying splines over Z/mZ and produce minimum generating sets for splines on cycles over Z/mZ. We close with many open questions.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
