Related papers: Intervals in Dyck paths and the wreath conjecture

Let $0<k\in\mathbb{Z}$. A reinterpretation of the proof of existence of Hamilton cycles in the middle-levels graph $M_k$ induced by the vertices of the $(2k+1)$-cube representing the $k$- and $(k+1)$-subsets of $\{0,\ldots,2k\}$ is given…

A famous conjecture of Lov\'asz states that every connected vertex-transitive graph contains a Hamilton path. In this article we confirm the conjecture in the case that the graph is dense and sufficiently large. In fact, we show that such…

Let $k\geq 2$ be an integer. In the spirit of Kolesnikov-Werner \cite{KW}, for each $j\in\{2,\ldots,k\}$, we conjecture a sharp Santal\'{o} type inequality (we call it $j$-Santal\'{o} conjecture) for many sets (or more generally for many…

Let $b_{t,i}(n)$ denote the total number of the $i$ hooks in the $t$-regular partitions of $n$. Singh and Barman (J. Number Theory { 264} (2024), 41--58) raised two conjectures on $b_{t,i}(n)$. The first conjecture is on the positivity of…

Interval translation maps (ITMs) are a non-invertible generalization of interval exchange transformations (IETs). The dynamics of finite type ITMs is similar to IETs, while infinite type ITMs are known to exhibit new interesting effects. In…

Menger's theorem tells us that if $S,T$ are sets of vertices in a graph $G$, then (for $k\ge0$) either there are $k+1$ vertex-disjoint paths between $S$ and $T$, or there is a set of $k$ vertices separating $S$ and $T$. But what if we want…

A graph is reconstructible if it is determined up to isomorphism by the multiset of its proper induced subgraphs. The reconstruction conjecture postulates that every graph of order at least 3 is reconstructible. We show that interval graphs…

For integers $k\geq 1$ and $n\geq 2k+1$, the Kneser graph $K(n,k)$ is the graph whose vertices are the $k$-element subsets of $\{1,\ldots,n\}$ and whose edges connect pairs of subsets that are disjoint. The Kneser graphs of the form…

We show that the largest possible diameter $\delta(d,k)$ of a $d$-dimensional polytope whose vertices have integer coordinates ranging between $0$ and $k$ is at most $kd-\lceil2d/3\rceil$ when $k\geq3$. In addition, we show that…

We give a randomized algorithm that determines if a given graph has a simple path of length at least k in O(2^k poly(n,k)) time.

In this paper, we prove the following conjecture proposed by Gould, Hirohata and Keller [Discrete Math. submitted]: Let $G$ be a graph of sufficiently large order. If $\sigma_t(G) \geq 2kt - t + 1$ for any two integers $k \geq 2$ and $t…

We introduce a $q,t$-enumeration of Dyck paths which are forced to touch the main diagonal at specific points and forbidden to touch elsewhere and conjecture that it describes the action of the Macdonald theory $\nabla$ operator applied to…

We prove a general theorem to bound the total variation distance between the distribution of an integer valued random variable of interest and an appropriate discretized normal distribution. We apply the theorem to 2-runs in a sequence of…

Twenty years ago Bondy and Vince conjectured that for any nonnegative integer $k$, except finitely many counterexamples, every graph with $k$ vertices of degree less than three contains two cycles whose lengths differ by one or two. The…

We study a system of intervals $I_1,\ldots,I_k$ on the real line and a continuous map $f$ with $f(I_1 \cup I_2 \cup \ldots \cup I_k)\supseteq I_1 \cup I_2 \cup \ldots \cup I_k$. It's conjectured that there exists a periodic point of period…

We study combinatorial properties of a rational Dyck path by decomposing it into a tuple of Dyck paths. The combinatorial models such as $b$-Stirling permutations, $(b+1)$-ary trees, parenthesis presentations, and binary trees play central…

We show that the Combinatorial Invariance Conjecture for Kazhdan-Lusztig polynomials due to Lusztig and to Dyer, its parabolic analog due to Marietti, and a refined parabolic version that we introduce, are equivalent. We use this to give a…

We discuss the combinatorics of the decorated Dyck paths appearing in the Delta conjecture framework of Haglund, Remmel and Wilson (2015) and Zabrocki (2016), by introducing two new statistics, bounce and bounce'. We then provide plethystic…

In this paper, we develop a general theory on the coverage probability of random intervals defined in terms of discrete random variables with continuous parameter spaces. The theory shows that the minimum coverage probabilities of random…

We consider multifold convolutions of a combinatorial sequence $(a_n)_{n=0}^{\infty}$: namely, for each $k \in \N$ the $k$-fold convolution is $\mathcal{M}^{(k)}_n(\boldsymbol{a}) = \sum_{j_1+\dots+j_k=n} a_{j_1} \cdots a_{j_k}$. Let $C_n$…