ترغب بنشر مسار تعليمي؟ اضغط هنا

An infinite combinatorial statement with a poset parameter

196   0   0.0 ( 0 )
 نشر من قبل Friedrich Wehrung
 تاريخ النشر 2009
  مجال البحث
والبحث باللغة English
 تأليف Pierre Gillibert




اسأل ChatGPT حول البحث

We introduce an extension, indexed by a partially ordered set P and cardinal numbers k,l, denoted by (k,l)-->P, of the classical relation (k,n,l)--> r in infinite combinatorics. By definition, (k,n,l)--> r holds, if every map from the n-element subsets of k to the subsets of k with less than l elements has a r-element free set. For example, Kuratowskis Free Set Theorem states that (k,n,l)-->n+1 holds iff k is larger than or equal to the n-th cardinal successor l^{+n} of the infinite cardinal k. By using the (k,l)-->P framework, we present a self-contained proof of the first authors result that (l^{+n},n,l)-->n+2, for each infinite cardinal l and each positive integer n, which solves a problem stated in the 1985 monograph of Erdos, Hajnal, Mate, and Rado. Furthermore, by using an order-dimension estimate established in 1971 by Hajnal and Spencer, we prove the relation (l^{+(n-1)},r,l)-->2^m, where m is the largest integer below (1/2)(1-2^{-r})^{-n/r}, for every infinite cardinal l and all positive integers n and r with r larger than 1 but smaller than n. For example, (aleph_{210},4,aleph_0)-->32,768. Other order-dimension estimates yield relations such as (aleph_{109},4,aleph_0)--> 257 (using an estimate by Furedi and Kahn) and (aleph_7,4,aleph_0)-->10 (using an exact estimate by Dushnik).



قيم البحث

اقرأ أيضاً

Let $mathrm{G}$ be a subgroup of the symmetric group $mathfrak S(U)$ of all permutations of a countable set $U$. Let $overline{mathrm{G}}$ be the topological closure of $mathrm{G}$ in the function topology on $U^U$. We initiate the study of the poset $overline{mathrm{G}}[U]:={f[U]mid fin overline{mathrm{G}}}$ of images of the functions in $overline{mathrm{G}}$, being ordered under inclusion. This set $overline{mathrm{G}}[U]$ of subsets of the set $U$ will be called the emph{poset of copies for} the group $mathrm{G}$. A denomination being justified by the fact that for every subgroup $mathrm{G}$ of the symmetric group $mathfrak S(U)$ there exists a homogeneous relational structure $R$ on $U$ such that $overline G$ is the set of embeddings of the homogeneous structure $R$ into itself and $overline{mathrm{G}}[U]$ is the set of copies of $R$ in $R$ and that the set of bijections $overline Gcap mathfrak S(U)$ of $U$ to $U$ forms the group of automorphisms of $mathrm{R}$.
A classical result by Rado characterises the so-called partition-regular matrices $A$, i.e. those matrices $A$ for which any finite colouring of the positive integers yields a monochromatic solution to the equation $Ax=0$. We study the {sl asymmetric } random Rado problem for the (binomial) random set $[n]_p$ in which one seeks to determine the threshold for the property that any $r$-colouring, $r geq 2$, of the random set has a colour $i in [r]$ admitting a solution for the matrical equation $A_i x = 0$, where $A_1,ldots,A_r$ are predetermined partition-regular matrices pre-assigned to the colours involved. We prove a $1$-statement for the asymmetric random Rado property. In the symmetric setting our result retrieves the $1$-statement of the {sl symmetric} random Rado theorem established in a combination of results by Rodl and Rucinski~cite{RR97} and by Friedgut, Rodl and Schacht~cite{FRS10}. We conjecture that our $1$-statement in fact unveils the threshold for the asymmetric random Rado property, yielding a counterpart to the so-called {em Kohayakawa-Kreuter conjecture} concerning the threshold for the asymmetric random Ramsey problem in graphs. We deduce the aforementioned $1$-statement for the asymmetric random Rado property after establishing a broader result generalising the main theorem of Friedgut, Rodl and Schacht from~cite{FRS10}. The latter then serves as a combinatorial framework through which $1$-statements for Ramsey-type problems in random sets and (hyper)graphs alike can be established in the asymmetric setting following a relatively short combinatorial examination of certain hypergraphs. To establish this framework we utilise a recent approach put forth by Mousset, Nenadov and Samotij~cite{MNS18} for the Kohayakawa-Kreuter conjecture.
The abstract induced subgraph poset of a graph is the isomorphism class of the induced subgraph poset of the graph, suitably weighted by subgraph counting numbers. The abstract bond lattice and the abstract edge-subgraph poset are defined similarly b y considering the lattice of subgraphs induced by connected partitions and the poset of edge-subgraphs, respectively. Continuing our development of graph reconstruction theory on these structures, we show that if a graph has no isolated vertices, then its abstract bond lattice and the abstract induced subgraph poset can be constructed from the abstract edge-subgraph poset except for the families of graphs that we characterise. The construction of the abstract induced subgraph poset from the abstract edge-subgraph poset generalises a well known result in reconstruction theory that states that the vertex deck of a graph with at least 4 edges and without isolated vertices can be constructed from its edge deck.12
The maximum size, $La(n,P)$, of a family of subsets of $[n]={1,2,...,n}$ without containing a copy of $P$ as a subposet, has been intensively studied. Let $P$ be a graded poset. We say that a family $mathcal{F}$ of subsets of $[n]={1,2,...,n}$ cont ains a emph{rank-preserving} copy of $P$ if it contains a copy of $P$ such that elements of $P$ having the same rank are mapped to sets of same size in $mathcal{F}$. The largest size of a family of subsets of $[n]={1,2,...,n}$ without containing a rank-preserving copy of $P$ as a subposet is denoted by $La_{rp}(n,P)$. Clearly, $La(n,P) le La_{rp}(n,P)$ holds. In this paper we prove asymptotically optimal upper bounds on $La_{rp}(n,P)$ for tree posets of height $2$ and monotone tree posets of height $3$, strengthening a result of Bukh in these cases. We also obtain the exact value of $La_{rp}(n,{Y_{h,s},Y_{h,s}})$ and $La(n,{Y_{h,s},Y_{h,s}})$, where $Y_{h,s}$ denotes the poset on $h+s$ elements $x_1,dots,x_h,y_1,dots,y_s$ with $x_1<dots<x_h<y_1,dots,y_s$ and $Y_{h,s}$ denotes the dual poset of $Y_{h,s}$.
The partition lattice and noncrossing partition lattice are well studied objects in combinatorics. Given a graph $G$ on vertex set ${1,2,dots, n}$, its bond lattice, $L_G$, is the subposet of the partition lattice formed by restricting to the partiti ons whose blocks induce connected subgraphs of $G$. In this article, we introduce a natural noncrossing analogue of the bond lattice, the noncrossing bond poset, $NC_G$, obtained by restricting to the noncrossing partitions of $L_G$. Both the noncrossing partition lattice and the bond lattice have many nice combinatorial properties. We show that, for several families of graphs, the noncrossing bond poset also exhibits these properties. We present simple necessary and sufficient conditions on the graph to ensure the noncrossing bond poset is a lattice. Additionally, for several families of graphs, we give combinatorial descriptions of the Mobius function and characteristic polynomial of the noncrossing bond poset. These descriptions are in terms of a noncrossing analogue of non-broken circuit (NBC) sets of the graphs and can be thought of as a noncrossing version of Whitneys NBC theorem for the chromatic polynomial. We also consider the shellability and supersolvability of the noncrossing bond poset, providing sufficient conditions for both. We end with some open problems.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا