Related papers: Frequent elements in union-closed set families

We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…

Let $F$ be a field with at least three elements and $G$ a locally finite group. This paper aims to show that if either $F$ is algebraically closed or the characteristic of $F$ is positive, then an element in the group algebra $FG$ is a…

A collection of sets is {\em intersecting} if every two members have nonempty intersection. We describe the structure of intersecting families of $r$-sets of an $n$-set whose size is quite a bit smaller than the maximum ${n-1 \choose r-1}$…

A set system $\mathcal{F}$ is $t$-\textit{intersecting}, if the size of the intersection of every pair of its elements has size at least $t$. A set system $\mathcal{F}$ is $k$-\textit{Sperner}, if it does not contain a chain of length…

In this note, we present a conjecture on intersections of set families, and a rephrasing of the conjecture in terms of principal downsets of Boolean lattices. The conjecture informally states that, whenever we can express the measure of a…

An n-element set contains an unknown number of excellent elements, and our goal is to identify at least one of these elements. The members of a family of subsets can be asked if they contain at least one excellent element or not. At most…

Let $G$ be a countable cancellative amenable semigroup and let $(F_n)$ be a (left) F{\o}lner sequence in $G$. We introduce the notion of an $(F_n)$-normal element of $\{0,1\}^G$. When $G$ = $(\mathbb N,+)$ and $F_n = \{1,2,...,n\}$, the…

The two part Sperner theorem of Katona and Kleitman states that if $X$ is an $n$-element set with partition $X_1 \cup X_2$, and $\cF$ is a family of subsets of $X$ such that no two sets $A, B \in \cF$ satisfy $A \subset B$ (or $B \subset…

Let $\mathcal{F}$ be a family of subsets of $[n]=\{1,\ldots,n\}$ and let $L$ be a set of nonnegative integers. The family $\mathcal{F}$ is \emph{$L$-intersecting} if $|F\cap F'|\in L$ for every two distinct members $F,F'\in\mathcal{F}$; and…

Let $k$ be any positive integer and $G$ a compact (Hausdorff) group. Let $\mf{np}_k(G)$ denote the probability that $k+1$ randomly chosen elements $x_1,\dots,x_{k+1}$ satisfy $[x_1,x_2,\dots,x_{k+1}]=1$. We study the following problem: If…

Let $G$ be a regular graph of degree $d$ and let $A\subset V(G)$. Say that $A$ is $\eta$-closed if the average degree of the subgraph induced by $A$ is at least $\eta d$. This says that if we choose a random vertex $x\in A$ and a random…

We prove that given a constant $k \ge 2$ and a large set system $\mathcal{F}$ of sets of size at most $w$, a typical $k$-tuple of sets $(S_1, \cdots, S_k)$ from $\mathcal{F}$ can be ``blown up" in the following sense: for each $1 \le i \le…

Let $\mathcal{F}$ be a family of $k$-sized subsets of $[n]$ that does not contain $s$ pairwise disjoint subsets. The Erd\H{o}s Matching Conjecture, a celebrated and long-standing open problem in extremal combinatorics, asserts the maximum…

In 2011, Dyer published a series of conjectures on the weak order of Coxeter groups. One of these conjectures stated that the inversion set of the join of two elements in a Coxeter group is equal to some "closure" of the union of their…

Let $H$ be a multiplicatively written monoid. Given $k\in{\bf N}^+$, we denote by $\mathscr U_k$ the set of all $\ell\in{\bf N}^+$ such that $a_1\cdots a_k=b_1\cdots b_\ell$ for some atoms $a_1,\ldots,a_k,b_1,\ldots,b_\ell\in H$. The sets…

Given a family $\mathcal F$ of $k$-element sets, $S_1,\ldots,S_r\in\mathcal F$ form an {\em $r$-sunflower} if $S_i \cap S_j =S_{i'} \cap S_{j'}$ for all $i \neq j$ and $i' \neq j'$. According to a famous conjecture of Erd\H os and Rado…

In a recent work, Andrews gave analytic proofs of two conjectures concerning some variations of two combinatorial identities between partitions of a positive integer into odd parts and partitions into distinct parts discovered by Beck.…

A family F is intersecting if any two members have a nonempty intersection. Erdos, Ko, and Rado showed that |F|\leq {n-1\choose k-1} holds for an intersecting family of k-subsets of [n]:={1,2,3,...,n}, n\geq 2k. For n> 2k the only extremal…

We prove bounds for the number of solutions to $$a_1 + \dots + a_k = a_1' + \dots + a_k'$$ over $N$-element sets of reals, which are sufficiently convex or near-convex. A near-convex set will be the image of a set with small additive…

A sunflower with $k$ petals, or $k$-sunflower, is a family of $k$ sets every two of which have a common intersection. Known since 1960, the sunflower conjecture states that a family ${\mathcal F}$ of sets each of cardinality $m$ includes a…