Related papers: Induced and non-induced forbidden subposet problem…

Consider the set of all sequences of $n$ outcomes, each taking one of $m$ values, that satisfy a number of linear constraints. If $m$ is fixed while $n$ increases, most sequences that satisfy the constraints result in frequency vectors…

A good range of problems on trees can be described by the following general setting: Given a bilinear map $*:\mathbb R^d\times\mathbb R^d\to\mathbb R^d$ and a vector $s\in\mathbb R^d$, we need to estimate the largest possible absolute value…

In the theory of partially-ordered sets, the two-dimensional Boolean lattice is known as the diamond. In this paper, we show that, if $\mathcal{F}$ is a family in the $n$-dimensional Boolean lattice that has no diamond as a subposet, then…

We show that there is a constant $k$ such that Buss's intuitionistic theory $\mathsf{IS}^1_2$ does not prove that SAT requires co-nondeterministic circuits of size at least $n^k$. To our knowledge, this is the first unconditional…

This is the second in a sequence of three papers investigating the question for which positive integers $m$ there exists a maximal antichain of size $m$ in the Boolean lattice $B_n$ (the power set of $[n]:=\{1,2,\dots,n\}$, ordered by…

We determine the shape of all sum-free sets in $\{1,2,\ldots,n\}^2$ of size close to the maximum $\frac{3}{5}n^2$, solving a problem of Elsholtz and Rackham. We show that all such asymptotic maximum sum-free sets lie completely in the…

Let M to be a matroid defined on a finite set E. A subset L of E is locked in M if L is 2-connected in M, the complement of L is 2-connected in the dual M*, and min{r(L), r*(complement of L)} is greater than 1. In this paper, we prove that…

Let $(X,\le)$ be a {\em non-empty strictly inductive poset}, that is, a non-empty partially ordered set such that every non-empty chain $Y$ has a least upper bound lub$(Y)\in X$, a chain being a subset of $X$ totally ordered by $\le$. We…

Given a finite poset $\mathcal P$, we say that a family $\mathcal F$ of subsets of $[n]$ is $\mathcal P$-saturated if $\mathcal F$ does not contain an induced copy of $\mathcal P$, but adding any other set to $\mathcal F$ creates an induced…

We consider the binomial random graph $G(n,p)$, where $p$ is a constant, and answer the following two questions. First, given $e(k)=p{k\choose 2}+O(k)$, what is the maximum $k$ such that a.a.s.~the binomial random graph $G(n,p)$ has an…

We consider the possible sizes of large sumfree sets contained in the discrete hypercube $\{1,...,n\}^k$, and we determine upper and lower bounds for the maximal size as $n$ becomes large. We also discuss a continuous analogue in which our…

A partial order $\prec$ on $[n]$ is naturally labelled (NL) if $x\prec y$ implies $x<y$. We establish a bijection between {3, 2+2}-free NL posets and 12-34-avoiding permutations, determine functional equations satisfied by their generating…

We prove matching asymptotic lower and upper bounds on the variances of the intrinsic volumes and the number of $k$-faces of $d$-dimensional random beta-polytopes. Using Stein's methods, we establish central limit theorems for the intrinsic…

Given a family $\mathcal{H}$ of graphs, we say that a graph $G$ is $\mathcal{H}$-induced-minor-free if no induced minor of $G$ is isomorphic to a member of $\mathcal{H}$, We denote by $W_{t\times t}$ the $t$-by-$t$ hexagonal grid, and by…

Resolving a conjecture of Methuku and the first author we determine the size of the largest family of subsets of an $n$-element set avoiding both $Y_k$ and $Y_k'$ as induced subposets. The result follows as a consequence of the analogous…

Given a finite poset $\mathcal P$, we call a family $\mathcal F$ of subsets of $[n]$ $\mathcal P$-saturated if $\mathcal F$ does not contain an induced copy of $\mathcal P$, but adding any other set to $\mathcal F$ creates an induced copy…

We consider the large-$N$ asymptotics of a system of discrete orthogonal polynomials on an infinite regular lattice of mesh $\frac{1}{N}$, with weight $e^{-NV(x)}$, where $V(x)$ is a real analytic function with sufficient growth at…

We determine the density of the largest sum-free subset of the lattice cube $\{1, 2, \dots, n\}^d$ for $d = 3$ and $d = 4$. This solves a conjecture of Cameron and Aydinian in dimensions $3$ and $4$.

Given two finite posets $\mathcal P$ and $\mathcal Q$, their Ramsey number, denoted by $R(\mathcal P,\mathcal Q)$, is defined to be the smallest integer $N$ such that any blue/red colouring of the vertices of the hypercube $Q_N$ has either…

We study the minimum number of constraints needed to formulate random instances of the maximum stable set problem via linear programs (LPs), in two distinct models. In the uniform model, the constraints of the LP are not allowed to depend…