Searcharxiv⌕ Search

arXiv subjects

Peter Borg

Publications and source records attributed to Peter Borg.

40 records · Page 3Linked to original sources

Intersecting integer partitions

If $a_1, a_2, ..., a_k$ and $n$ are positive integers such that $n = a_1 + a_2 + ... + a_k$, then the sum $a_1 + a_2 + ... + a_k$ is said to be a \emph{partition of $n$} of \emph{length $k$}, and $a_1, a_2, ..., a_k$ are said to be the \emph{parts} of the partition. Two partitions that differ only in the order of their parts are considered to be the same. We say that two partitions \emph{intersect} if they have at least one common part. We call a set $A$ of partitions \emph{intersecting} if any two partitions in $A$ intersect. Let $P_{n,k}$ be the set of all partitions of $n$ of length $k$. We conjecture that if $2 \leq k \leq n$, then the size of any intersecting subset of $P_{n,k}$ is at most the size of $P_{n-1,k-1}$, which is the size of the intersecting subset of $P_{n,k}$ consisting of those partitions which have 1 as a part. The conjecture is trivially true for $n \leq 2k$, and we prove it for $n \geq 5k^5$. We also generalise this for subsets of $P_{n,k}$ with the property that any two of their members have at least $t$ common parts.

math.CO↗

The maximum sum and maximum product of sizes of cross-intersecting families

We say that a set $A$ \emph{$t$-intersects} a set $B$ if $A$ and $B$ have at least $t$ common elements. A family $\mathcal{A}$ of sets is said to be \emph{$t$-intersecting} if each set in $\mathcal{A}$ $t$-intersects any other set in $\mathcal{A}$. Families $\mathcal{A}_1, \mathcal{A}_2, ..., \mathcal{A}_k$ are said to be \emph{cross-$t$-intersecting} if for any $i$ and $j$ in $\{1, 2, ..., k\}$ with $i \neq j$, any set in $\mathcal{A}_i$ $t$-intersects any set in $\mathcal{A}_j$. We prove that for any finite family $\mathcal{F}$ that has at least one set of size at least $t$, there exists an integer $κ\leq |\mathcal{F}|$ such that for any $k \geq κ$, both the sum and the product of sizes of any $k$ cross-$t$-intersecting sub-families $\mathcal{A}_1, ..., \mathcal{A}_k$ (not necessarily distinct or non-empty) of $\mathcal{F}$ are maxima if $\mathcal{A}_1 = ... = \mathcal{A}_k = \mathcal{L}$ for some largest $t$-intersecting sub-family $\mathcal{L}$ of $\mathcal{F}$. We then study the smallest possible value of $κ$ and investigate the case $k < κ$; this includes a cross-intersection result for straight lines that demonstrates that it is possible to have $\mathcal{F}$ and $κ$ such that for any $k < κ$, the configuration $\mathcal{A}_1 = ... = \mathcal{A}_k = \mathcal{L}$ is neither optimal for the sum nor optimal for the product. We also outline solutions for various important families $\mathcal{F}$, and we provide solutions for the case when $\mathcal{F}$ is a power set.

math.CO↗

Intersecting families of sets and permutations: a survey

A family $\mathcal{A}$ of sets is said to be \emph{$t$-intersecting} if any two sets in $\mathcal{A}$ have at least $t$ common elements. A central problem in extremal set theory is to determine the size or structure of a largest $t$-intersecting sub-family of a given family $\mathcal{F}$. We give a survey of known results, conjectures and open problems for various important families $\mathcal{F}$, namely, power sets, levels of power sets, hereditary families, families of signed sets, families of labeled sets, and families of permutations. We also provide some extensions and consequences of known results.

math.CO↗

Cross-intersecting sub-families of hereditary families

Families $\mathcal{A}_1, \mathcal{A}_2, ..., \mathcal{A}_k$ of sets are said to be \emph{cross-intersecting} if for any $i$ and $j$ in $\{1, 2, ..., k\}$ with $i \neq j$, any set in $\mathcal{A}_i$ intersects any set in $\mathcal{A}_j$. For a finite set $X$, let $2^X$ denote the \emph{power set of $X$} (the family of all subsets of $X$). A family $\mathcal{H}$ is said to be \emph{hereditary} if all subsets of any set in $\mathcal{H}$ are in $\mathcal{H}$; so $\mathcal{H}$ is hereditary if and only if it is a union of power sets. We conjecture that for any non-empty hereditary sub-family $\mathcal{H} \neq \{\emptyset\}$ of $2^X$ and any $k \geq |X|+1$, both the sum and product of sizes of $k$ cross-intersecting sub-families $\mathcal{A}_1, \mathcal{A}_2, ..., \mathcal{A}_k$ (not necessarily distinct or non-empty) of $\mathcal{H}$ are maxima if $\mathcal{A}_1 = \mathcal{A}_2 = ... = \mathcal{A}_k = \mathcal{S}$ for some largest \emph{star $\mathcal{S}$ of $\mathcal{H}$} (a sub-family of $\mathcal{H}$ whose sets have a common element). We prove this for the case when $\mathcal{H}$ is \emph{compressed with respect to an element $x$ of $X$}, and for this purpose we establish new properties of the usual \emph{compression operation}. For the product, we actually conjecture that the configuration $\mathcal{A}_1 = \mathcal{A}_2 = ... = \mathcal{A}_k = \mathcal{S}$ is optimal for any hereditary $\mathcal{H}$ and any $k \geq 2$, and we prove this for a special case too.

math.CO↗