scholarly journals Antichains on Three Levels

10.37236/1803 ◽  
2004 ◽  
Vol 11 (1) ◽  
Author(s):  
Paulette Lieby

An antichain is a collection of sets in which no two sets are comparable under set inclusion. An antichain ${\cal A}$ is flat if there exists an integer $k\geq 0$ such that every set in ${\cal A}$ has cardinality either $k$ or $k+1$. The size of ${\cal A}$ is $|{\cal A}|$ and the volume of ${\cal A}$ is $\sum_{A\in{\cal A}}|A|$. The flat antichain theorem states that for any antichain ${\cal A}$ on $[n]=\{1,2,\ldots,n\}$ there exists a flat antichain on $[n]$ with the same size and volume as ${\cal A}$. In this paper we present a key part of the proof of the flat antichain theorem, namely we show that the theorem holds for antichains on three consecutive levels; that is, in which every set has cardinality $k+1$, $k$ or $k-1$ for some integer $k\geq 1$. In fact we prove a stronger result which should be of independent interest. Using the fact that the flat antichain theorem holds for antichains on three consecutive levels, together with an unpublished result by the author and A. Woods showing that the theorem also holds for antichains on four consecutive levels, Á. Kisvölcsey completed the proof of the flat antichain theorem. This proof is to appear in Combinatorica. The squashed (or colex) order on sets is the set ordering with the property that the number of subsets of a collection of sets of size $k$ is minimised when the collection consists of an initial segment of sets of size $k$ in squashed order. Let $p$ be a positive integer, and let ${\cal A}$ consist of $p$ subsets of $[n]$ of size $k+1$ such that, in the squashed order, these subsets are consecutive. Let ${\cal B}$ consist of any $p$ subsets of $[n]$ of size $k-1$. Let $|\triangle_N{\cal A}|$ be the number of subsets of size $k$ of the sets in ${\cal A}$ which are not subsets of any set of size $k+1$ preceding the sets in ${\cal A}$ in the squashed order. Let $|{\bigtriangledown}{\cal B}|$ be the number of supersets of size $k$ of the sets in ${\cal B}$. We show that $|\triangle_N{\cal A}| + |{\bigtriangledown}{\cal B}| > 2 p$. We call this result the 3-levels result. The 3-levels result implies that the flat antichain theorem is true for antichains on at most three, consecutive, levels.

2018 ◽  
Vol 83 (04) ◽  
pp. 1345-1362
Author(s):  
WEI WANG

AbstractA set $G \subseteq \omega$ is n-generic for a positive integer n if and only if every ${\rm{\Sigma }}_n^0$ formula of G is decided by a finite initial segment of G in the sense of Cohen forcing. It is shown here that every n-generic set G is properly ${\rm{\Sigma }}_n^0$ in some G-recursive X. As a corollary, we also prove that for every $n > 1$ and every n-generic set G there exists a G-recursive X which is generalized ${\rm{lo}}{{\rm{w}}_n}$ but not generalized ${\rm{lo}}{{\rm{w}}_{n - 1}}$. Thus we confirm two conjectures of Jockusch [4].


2021 ◽  
Vol 68 (3) ◽  
pp. 1-36
Author(s):  
Yi-Jun Chang ◽  
Seth Pettie ◽  
Thatchaphol Saranurak ◽  
Hengjie Zhang

We present improved distributed algorithms for variants of the triangle finding problem in the model. We show that triangle detection, counting, and enumeration can be solved in rounds using expander decompositions . This matches the triangle enumeration lower bound of by Izumi and Le Gall [PODC’17] and Pandurangan, Robinson, and Scquizzato [SPAA’18], which holds even in the model. The previous upper bounds for triangle detection and enumeration in were and , respectively, due to Izumi and Le Gall [PODC’17]. An -expander decomposition of a graph is a clustering of the vertices such that (i) each cluster induces a subgraph with conductance at least and (ii) the number of inter-cluster edges is at most . We show that an -expander decomposition with can be constructed in rounds for any and positive integer . For example, a -expander decomposition only requires rounds to compute, which is optimal up to subpolynomial factors, and a -expander decomposition can be computed in rounds, for any arbitrarily small constant . Our triangle finding algorithms are based on the following generic framework using expander decompositions, which is of independent interest. We first construct an expander decomposition. For each cluster, we simulate algorithms with small overhead by applying the expander routing algorithm due to Ghaffari, Kuhn, and Su [PODC’17] Finally, we deal with inter-cluster edges using recursive calls.


2020 ◽  
pp. 1-14
Author(s):  
Maciej Zakarczemny

Let D(G) be the Davenport constant of a finite Abelian group G. For a positive integer m (the case m=1, is the classical case) let Em(G) (or ηm(G)) be the least positive integer t such that every sequence of length t in G contains m disjoint zero-sum sequences, each of length |G| (or of length ≤exp(G), respectively). In this paper, we prove that if G is an Abelian group, then Em(G)=D(G)–1+m|G|, which generalizes Gao’s relation. Moreover, we examine the asymptotic behaviour of the sequences (Em(G))m≥1 and (ηm(G))m≥1. We prove a generalization of Kemnitz’s conjecture. The paper also contains a result of independent interest, which is a stronger version of a result by Ch. Delorme, O. Ordaz, D. Quiroz. At the end, we apply the Davenport constant to smooth numbers and make a natural conjecture in the non-Abelian case.


1995 ◽  
Vol 4 (3) ◽  
pp. 241-255 ◽  
Author(s):  
János Komlós ◽  
Gábor N. Sárközy ◽  
Endre Szemerédi

Béla Bollobás [1] conjectured the following. For any positive integer Δ and real 0 < c < ½ there exists an n0 with the following properties. If n ≥ n0, T is a tree of order n and maximum degree Δ, and G is a graph of order n and maximum degree not exceeding cn, then there is a packing of T and G. Here we prove this conjecture. Auxiliary Theorem 2.1 is of independent interest.


1980 ◽  
Vol 87 (2) ◽  
pp. 207-211
Author(s):  
W. R. Brakes

Any ribbon knot K in S3 can be obtained from the unlink of r + 1 components {U0, U1,…, Ur}, for some positive integer r, by the simultaneous performance of r band operations (fusions), using disjoint bands. These bands may be assumed to run from U0 to U1, U2, …, Ur respectively, and labelled b1, b2…, br accordingly. This paper investigates the question of what conditions on these bands guarantee that the knot K so constructed is non-trivial. Besides being of independent interest (see 1·2 (A) of (2), and the example below), this problem is related to the ‘slice implies ribbon’ conjecture (1·33 of (2)), to the triviality question for 2-spheres in the 4-sphere (section 10 of (4)), and other unknotting questions for surfaces in 4-space (see, for example, 4·30 of (2)). The main result proved here is that K is non-trivial if the union of the bands ‘geometrically links’ (in a sense made precise below) every Ui at most once, and at least one U0 exactly once. The linking of the bands with U0 does not affect the argument, so may be completely arbitrary.


Author(s):  
Matthew Bisatt ◽  
Tim Dokchitser

AbstractFix a positive integer g and a squarefree integer m. We prove the existence of a genus g curve $$C/{\mathbb {Q}}$$ C / Q such that the mod m representation of its Jacobian is tame. The method is to analyse the period matrices of hyperelliptic Mumford curves, which could be of independent interest. As an application, we study the tame version of the inverse Galois problem for symplectic matrix groups over finite fields.


Sign in / Sign up

Export Citation Format

Share Document