相关论文: Paired 3-disjoint path covers of balanced hypercub…

We say that a $k$-uniform hypergraph $C$ is a Hamilton cycle of type $\ell$, for some $1\le \ell \le k$, if there exists a cyclic ordering of the vertices of $C$ such that every edge consists of $k$ consecutive vertices and for every pair…

We consider the question of when the $n$-dimensional hypercube can be decomposed into paths of length $k$. Mollard and Ramras \cite{MR2013} noted that for odd $n$ it is necessary that $k$ divides $n2^{n-1}$ and that $k\leq n$. Later, Anick…

We discuss the combinatorics of decorated Dyck paths and decorated parallelogram polyominoes, extending to the decorated case the main results of both [Haglund 2004] and [Aval et al. 2014]. This settles in particular the cases…

The varietal hypercube $VQ_n$ is a variant of the hypercube $Q_n$ and has better properties than $Q_n$ with the same number of edges and vertices. This paper proves that $VQ_n$ is vertex-transitive. This property shows that when $VQ_n$ is…

We consider the random walk on the hypercube which moves by picking an ordered pair $(i,j)$ of distinct coordinates uniformly at random and adding the bit at location $i$ to the bit at location $j$, modulo $2$. We show that this Markov…

The $k$-cut complex was recently introduced by Bayer et al. as a generalization of earlier work of Fr{\"o}berg (1990) and Eagon and Reiner (1998), and was shown to be shellable for several classes of graphs. In this article, we prove that…

We demonstrate that a pair consisting of a second-order homogeneous Hamiltonian structure in $N$ components and its associated system of conservation laws is in bijective correspondence with an alternating three-form on a $N+2$-dimensional…

A decomposition of a graph is a set of subgraphs whose edges partition those of $G$. The 3-decomposition conjecture posed by Hoffmann-Ostenhof in 2011 states that every connected cubic graph can be decomposed into a spanning tree, a…

A covering path for a planar point set is a path drawn in the plane with straight-line edges such that every point lies at a vertex or on an edge of the path. A covering tree is defined analogously. Let $\pi(n)$ be the minimum number such…

The Benalcazar-Bernevig-Hughes(BBH) model is one of the most representative higher-order topological insulators with different bulk-edge correspondence comparing conventional topological states. In this work, we propose to realize a…

For infinitely many $d$, Hassett showed that special cubic fourfolds of discriminant $d$ are related to polarized K3 surfaces of degree $d$ via their Hodge structures. For half of the $d$, each associated K3 surface $(S,L)$ canonically…

We study the Khovanov complex of closed piecewise linear curves in the 3-space. A polygonal link representation endows the cube of resolutions with an additional combinatorial structure. The set of symmetries preserving this structure and…

We show how wall-crossing formulas in coupled 2d-4d systems, introduced by Gaiotto, Moore and Neitzke, can be interpreted geometrically in terms of the deformation theory of holomorphic pairs, given by a complex manifold together with a…

Suppose $k\nmid n$ and $H$ is an $n$-vertex $k$-uniform hypergraph. A near perfect matching in $H$ is a matching of size $\lfloor n/k\rfloor$. We give a divisibility barrier construction that prevents the existence of near perfect matchings…

We give bijective results between several variants of lattice paths of length $2n$ (or $2n-2$) and integer compositions of n, all enumerated by the seemingly innocuous formula $4^{n-1}$. These associations lead us to make new connections…

In the Disjoint Shortest Paths problem one is given a graph $G$ and a set $\mathcal{T}=\{(s_1,t_1),\dots,(s_k,t_k)\}$ of $k$ vertex pairs. The question is whether there exist vertex-disjoint paths $P_1,\dots,P_k$ in $G$ so that each $P_i$…

The well-known Erd\H{o}s-Gallai Theorem gave the Tur\'an number of paths. Bushaw and Kettle generalized this result to consider the Tur\'an number of disjoint paths. Since then, many studies are focused on the Tur\'an number of linear…

In discrete planar last passage percolation (LPP), random values are assigned independently to each vertex in $\mathbb Z^2$, and each finite upright path in $\mathbb Z^2$ is ascribed the weight given by the sum of values of its vertices.…

The main aim of this survey paper is to gather together some results concerning the Calabi type duality discovered by Hojoo Lee between certain families of (spacelike) graphs with constant mean curvature in Riemannian and Lorentzian…

Let $n,k,s$ be three integers such that $k\geq 2$ and $n\geq s\geq 1$. Let $H$ be a $k$-partite $k$-uniform hypergraph with $n$ vertices in each class. Aharoni (2017) showed that if $e(H)>(s-1)n^{k-1}$, then $H$ has a matching of size $s$.…