On tiling the integers with 4-sets of the same gap sequence

Partitioning a set into similar, if not, identical, parts is a fundamental research topic in combinatorics. The question of partitioning the integers in various ways has been considered throughout history. Given a set $\{x_1,\dots ,x_n\}$ of integers where $x_1<?<x_n$, let the gap sequence of this set be the unordered multiset $\{d_1,\dots ,d_{n?1}\}=\{x_{i+1}?x_i:i\in \{1,\dots ,n?1\}\}$. This paper addresses the following question, which was explicitly asked by Nakamigawa: can the set of integers be partitioned into sets with the same gap sequence? The question is known to be true for any set where the gap sequence has length at most two. This paper provides evidence that the question is true when the gap sequence has length three. Namely, we prove that given positive integers $p$ and $q$, there is a positive integer $r_0$ such that for all $r\ge r_0$, the set of integers can be partitioned into 4-sets with gap sequence $p,q$, $r$.     

A sufficient condition for DP-4-colorability

DP-coloring of a simple graph is a generalization of list coloring, and also a generalization of signed coloring of signed graphs. It is known that for each $k\in \{3,4,5,6\}$, every planar graph without $C_k$ is 4-choosable. Furthermore, Jin et al. (2016) showed that for each $k\in \{3,4,5,6\}$, every signed planar graph without $C_k$ is signed 4-choosable. In this paper, we show that for each $k\in \{3,4,5,6\}$, every planar graph without $C_k$ is 4-DP-colorable, which is an extension of the above results.     

The Hausdorff dimension of multivariate operator-self-similar Gaussian random fields

Let $\{X\left(t\right):t\in {\mathbb{R}}^d\}$ be a multivariate operator-self-similar random field with values in ${\mathbb{R}}^m$. Such fields were introduced in [22] and satisfy the scaling property $\{X\left(c^{E}t\right):t\in {\mathbb{R}}^d\}\stackrel{\mathrm{d}}{=}\{c^{D}X\left(t\right):t\in {\mathbb{R}}^d\}$ for all $c>0$, where $E$ is a $d\times d$ real matrix and $D$ is an $m\times m$ real matrix. We solve an open problem in [22] by calculating the Hausdorff dimension of the range and graph of a trajectory over the unit cube $K={[0,1]}^d$ in the Gaussian case. In particular, we enlighten the property that the Hausdorff dimension is determined by the real parts of the eigenvalues of $E$ and $D$ as well as the multiplicity of the eigenvalues of $E$ and $D$.     

Effect of stochastic perturbations for front propagation in Kolmogorov Petrovskii Piscunov equations

This article considers equations of Kolmogorov Petrovskii Piscunov type in one space dimension, with stochastic perturbation:

where the stochastic differential is taken in the sense of Itô and $\zeta$ is a Gaussian random field satisfying $\mathbb{E}\left[\zeta \right]=0$ and $\mathbb{E}\left[\zeta (s,x)\zeta (t,y)\right]=(s\wedge t)\Gamma (x?y)$. Two situations are considered: firstly, $\zeta$ is simply a standard Wiener process (i.e. $\Gamma \equiv 1$): secondly, $\Gamma \in C^{\infty }\left(\mathbb{R}\right)$ with ${lim}_{\left|z\right|\to +\infty }\left|\Gamma \left(z\right)\right|=0$.The results are as follows: in the first situation (standard Wiener process: i.e. $\Gamma \left(x\right)\equiv 1$), there is a non-degenerate travelling wave front if and only if $\frac{{?}^2}{2}<1$, with asymptotic wave speed $max\left(\sqrt{2\kappa (1?\frac{{?}^2}{2})},\left(\frac{1}{N}(1?\frac{{?}^2}{2})+\frac{\kappa N}{2}\right){\mathbf{1}}_{\{N<\sqrt{\frac{2}{\kappa }(1?\frac{{?}^2}{2})}\}}\right)$; the noise slows the wave speed. If the stochastic integral is taken instead in the sense of Stratonovich, then the asymptotic wave speed is the classical McKean wave speed and does not depend on $?$.In the second situation (noise with spatial covariance which decays to 0 at $\pm \infty$, stochastic integral taken in the sense of Itô), a travelling front can be defined for all $?>0$. Its average asymptotic speed does not depend on $?$ and is the classical wave speed of the unperturbed KPP equation.     

Minimal solutions of the isometry equation

For a finite vector space $W$ over ${\mathbb{F}}_q$, there are described all the pairs of multisets $\{V_1,\dots ,V_{q+1}\}$ and $\{U_1,\dots ,U_{q+1}\}$ of subspaces in $W$ such that for all $w\in W$ the equality $\left|\{i\mid w\in V_i\}\right|=\left|\{i\mid w\in U_i\}\right|$ holds.     

All double generalized Petersen graphs are Hamiltonian

The double generalized Petersen graph $DP(n,t)$, $n\ge 3$ and $t\in {\mathbb{Z}}_n?\left\{0\right\}$, $2\le 2t<n$, has vertex-set $\{x_i,y_i,u_i,v_i\mid i\in {\mathbb{Z}}_n\}$, edge-set $\{\{x_i,x_{i+1}\},\{y_i,y_{i+1}\},\{u_i,v_{i+t}\},\{v_i,u_{i+t}\},\{x_i,u_i\},\{y_i,v_i\}\mid i\in {\mathbb{Z}}_n\}$. These graphs were first defined by Zhou and Feng as examples of vertex-transitive non-Cayley graphs. Then, Kutnar and Petecki considered the structural properties, Hamiltonicity properties, vertex-coloring and edge-coloring of $DP(n,t)$, and conjectured that all $DP(n,t)$ are Hamiltonian. In this paper, we prove this conjecture.     

Some statistics on Stirling permutations and Stirling derangements

A permutation of the multiset $\{1,1,2,2,\dots ,n,n\}$ is called a Stirling permutation of order $n$ if every entry between the two occurrences of $i$ is greater than $i$ for each $i\in \{1,2,\dots ,n\}$. In this paper, we introduce the definitions of block, even indexed entry, odd indexed entry, Stirling derangement, marked permutation and bicolored increasing binary tree. We first study the joint distribution of ascent plateaux, even indexed entries and left-to-right minima over the set of Stirling permutations of order $n$. We then present an involution on Stirling derangements.     

Computation and theory of Euler sums of generalized hyperharmonic numbers

Recently, Dil and Boyadzhiev [10] proved an explicit formula for the sum of multiple harmonic numbers whose indices are the sequence $({\left\{0\right\}}_r,1)$. In this paper, we show that the sums of multiple harmonic numbers whose indices are the sequence $({\left\{0\right\}}_r,1;{\left\{1\right\}}_{k?1})$ can be expressed in terms of (multiple) zeta values, (multiple) harmonic numbers, and Stirling numbers of the first kind, and give an explicit formula.     

Longest cycles in 4-connected graphs

Let ${\sigma }_4^1=min\text{{}{\sum }_{i=1}^{4}d\left(v_i\right)+\left|{?}_{i=1}^{4}N\left(v_i\right)\right|?\left|{?}_{i=1}^{4}N\left(v_i\right)\right|:\{v_1,v_2,v_3,v_4\}$ is an independent set of a graph G$\text{}}$. In this paper, we give a low bound for the length of a longest cycle in a 4-connected graph and get the following result: If $G$ is a 4-connected graph on $n$ vertices, then the circumference $c\left(G\right)\ge min\{n,{\sigma }_4^1∕2\}$. Moreover, we give graphs to show that the connectivity in our result is best possible with respect to the low bound and the low bound in our result is also best possible with respect to the connectivity.     

The NLC-width and clique-width for powers of graphs of bounded tree-width

The $k$-power graph of a graph $G$ is a graph with the same vertex set as $G$, in that two vertices are adjacent if and only if, there is a path between them in $G$ of length at most $k$. A $k$-tree-power graph is the $k$-power graph of a tree, a $k$-leaf-power graph is the subgraph of some $k$-tree-power graph induced by the leaves of the tree.We show that (1) every $k$-tree-power graph has NLC-width at most $k+2$ and clique-width at most $k+2+max\{?\frac{k}{2}??1,0\}$, (2) every $k$-leaf-power graph has NLC-width at most $k$ and clique-width at most $k+max\{?\frac{k}{2}??2,0\}$, and (3) every $k$-power graph of a graph of tree-width $l$ has NLC-width at most ${(k+1)}^{l+1}?1$, and clique-width at most $2?{(k+1)}^{l+1}?2$.     

Enumeration formulas for standard Young tableaux of nearly hollow rectangular shapes

This paper considers the enumeration problem of a generalization of standard Young tableau (SYT) of truncated shape. Let $\lambda ?\mu |\left\{(i_0,j_0)\right\}$ be the SYT of shape $\lambda$ truncated by $\mu$ whose upper left cell is $(i_0,j_0)$, where $\lambda$ and $\mu$ are partitions of integers. The summation representation of the number of SYT of the truncated shape $(n+k+2,{(n+2)}^{m+1})?\left(n^m\right)|\left\{(2,2)\right\}$ is derived. Consequently, three closed formulas for SYT of hollow shapes are obtained, including the cases of (i). $m=n=1$, (ii). $k=0$, and (iii). $k=1,m=n$. Finally, an open problem is posed.