اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCounting regions of the boxed threshold arrangement
77
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper we consider the hyperplane arrangement in $mathbb{R}^n$ whose hyperplanes are ${x_i + x_j = 1mid 1leq i < jleq n}cup {x_i=0,1mid 1leq ileq n}$. We call it the emph{boxed threshold arrangement} since we show that the bounded regions of this arrangement are contained in an $n$-cube and are in one-to-one correspondence with the labeled threshold graphs on $n$ vertices. The problem of counting regions of this arrangement was studied earlier by Joungmin Song. He determined the characteristic polynomial of this arrangement by relating its coefficients to the count of certain graphs. Here, we provide bijective arguments to determine the number of regions. In particular, we construct certain signed partitions of the set ${-n,dots, n}setminus{0}$ and also construct colored threshold graphs on $n$ vertices and show that both these objects are in bijection with the regions of the boxed threshold arrangement. We independently count these objects and provide closed form formula for the number of regions.
قيم البحث
اقرأ أيضاً
In this paper, we give a basis for the derivation module of the cone over the Shi arrangement of the type $D_ell$ explicitly.
Arrangement theory plays an essential role in the study of the unfolding model used in many fields. This paper describes how arrangement theory can be usefully employed in solving the problems of counting (i) the number of admissible rankings in an u
nfolding model and (ii) the number of ranking patterns generated by unfolding models. The paper is mostly expository but also contains some new results such as simple upper and lower bounds for the number of ranking patterns in the unidimensional case.
For all positive integers $t$ exceeding one, a matroid has the cyclic $(t-1,t)$-property if its ground set has a cyclic ordering $sigma$ such that every set of $t-1$ consecutive elements in $sigma$ is contained in a $t$-element circuit and $t$-elemen
t cocircuit. We show that if $M$ has the cyclic $(t-1,t)$-property and $|E(M)|$ is sufficiently large, then these $t$-element circuits and $t$-element cocircuits are arranged in a prescribed way in $sigma$, which, for odd $t$, is analogous to how 3-element circuits and cocircuits appear in wheels and whirls, and, for even $t$, is analogous to how 4-element circuits and cocircuits appear in swirls. Furthermore, we show that any appropriate concatenation $Phi$ of $sigma$ is a flower. If $t$ is odd, then $Phi$ is a daisy, but if $t$ is even, then, depending on $M$, it is possible for $Phi$ to be either an anemone or a daisy.
The Shi arrangement is an affine arrangement of hyperplanes consisting of the hyperplanes of the Weyl arrangement and their parallel translations. It was introduced by J.-Y. Shi in the study of the Kazhdan-Lusztig representation of the affine Weyl gr
oups. M. Yoshinaga showed that the cone over every Shi arrangement is free. In this paper, we construct an explicit basis for the derivation module of the cone over the Shi arrangements of the type $B_{ell}$ or $C_{ell}$.
For graphs $G$ and $H$, let $G {displaystylesmash{begin{subarray}{c} hbox{$tinyrm rb$} longrightarrow hbox{$tinyrm p$} end{subarray}}}H$ denote the property that for every proper edge-colouring of $G$ there is a rainbow $H$ in $G$. It is known that
, for every graph $H$, an asymptotic upper bound for the threshold function $p^{rm rb}_H=p^{rm rb}_H(n)$ of this property for the random graph $G(n,p)$ is $n^{-1/m^{(2)}(H)}$, where $m^{(2)}(H)$ denotes the so-called maximum $2$-density of $H$. Extending a result of Nenadov, Person, v{S}koric, and Steger [J. Combin. Theory Ser. B 124 (2017),1-38] we prove a matching lower bound for $p^{rm rb}_{K_k}$ for $kgeq 5$. Furthermore, we show that $p^{rm rb}_{K_4} = n^{-7/15}$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
