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

We prove that for all $0\leq t\leq k$ and $d\geq 2k$, every graph $G$ with treewidth at most $k$ has a `large' induced subgraph $H$, where $H$ has treewidth at most $t$ and every vertex in $H$ has degree at most $d$ in $G$. The order of $H$…

We present existence and nonexistence results on the solution of an overdetermined problem for the normalized p-Laplacian in a bounded open set, with p ranging from 1 to infinity. More precisely we consider a non-constant Neumann condition…

Given a constraint satisfaction problem (CSP) predicate $P \subseteq D^r$, the non-redundancy (NRD) of $P$ is maximum-sized instance on $n$ variables such that for every clause of the instance, there is an assignment which satisfies all but…

We prove several rigorous results about the asymptotic behaviour of the numbers of tadpoles (or lassos) embedded in a lattice, including cases where the head is subject to a constraint like being unknotted, or where the tail pierces the…

We find a layered permutation $w\in S_n$ whose Schubert polynomial $\mathfrak S_w(x_1, \dots, x_n)$ has support of size asymptotically at least $n!/4^n$. This gives precise asymptotics for the growth rate of $\beta(n):= \max_{w\in…

In this paper we consider the classical problem of computing linear extensions of a given poset which is well known to be a difficult problem. However, in our setting the elements of the poset are multivariate polynomials, and only a small…

Lattice induced threshold function is a Boolean function determined by a particular linear combination of lattice elements. We prove that every isotone Boolean function is a lattice induced threshold function and vice versa. We also…

Given a linear equation $\mathcal{L}$, a set $A \subseteq [n]$ is $\mathcal{L}$-free if $A$ does not contain any `non-trivial' solutions to $\mathcal{L}$. In this paper we consider the following three general questions: (i) What is the size…

Let G be a graph of order n and let q(G) be that largest eigenvalue of the signless Laplacian of G. In this note it is shown that if k>1 and q(G)>=n+2k-2, then G contains cycles of length l whenever 2<l<2k+3. This bound is asymptotically…

In 1981, Kelly showed that planar posets can have arbitrarily large dimension. However, the posets in Kelly's example have bounded Boolean dimension and bounded local dimension, leading naturally to the questions as to whether either…

A word~$w$ has a border $u$ if $u$ is a non-empty proper prefix and suffix of $u$. A word~$w$ is said to be \emph{closed} if $w$ is of length at most $1$ or if $w$ has a border that occurs exactly twice in $w$. A word~$w$ is said to be…

Kahn and Kim (J. Comput. Sci., 1995) have shown that for a finite poset $P$, the entropy of the incomparability graph of $P$ (normalized by multiplying by the order of $P$) and the base-$2$ logarithm of the number of linear extensions of…

For integers $m$ and $n$, we study the problem of finding good lower bounds for the size of progression-free sets in $(\mathbb{Z}_{m}^{n},+)$. Let $r_{k}(\mathbb{Z}_{m}^{n})$ denote the maximal size of a subset of $\mathbb{Z}_{m}^{n}$…

The linear extension diameter of a finite poset P is the maximum distance between a pair of linear extensions of P, where the distance between two linear extensions is the number of pairs of elements of P appearing in different orders in…

We introduce a method of decomposing the family of intervals along a cyclic permutation into chains to determine the size of the largest family of subsets of $[n]:= \{1,2,...,n\}$ not containing one or more given posets as a subposet. De…

We study delay of jobs that consist of multiple parallel tasks, which is a critical performance metric in a wide range of applications such as data file retrieval in coded storage systems and parallel computing. In this problem, each job is…

A classical open problem in combinatorial geometry is to obtain tight asymptotic bounds on the maximum number of k-level vertices in an arrangement of n hyperplanes in d dimensions (vertices with exactly k of the hyperplanes passing below…

A balanced pattern of order $2d$ is an element $P \in \{+,-\}^{2d}$, where both signs appear $d$ times. Two sets $A,B \subset [n]$ form $P$-pattern, which we denote by $\operatorname{pat}(A,B) = P$, if $A\triangle B = \{j_1,\ldots…

We consider the Gaussian interface model in the presence of random external fields, that is the finite volume (random) Gibbs measure on $\mathbb{R}^{\Lambda_N}$, $\Lambda_N=[-N, N]^d\cap \mathbb{Z}^d$ with Hamiltonian $H_N(\phi)=…

We observe a sudden breakdown of the transport of a strongly repulsive Bose-Einstein condensate through a shallow optical lattice of finite width. We are able to attribute this behavior to the development of a self-trapped state by using…