Decompositions of edge-colored infinite complete graphs into monochromatic paths

An $r$-edge coloring of a graph or hypergraph $G=(V,E)$ is a map $c:E\to \{0, \dots, r-1\}$. Extending results of Rado and answering questions of Rado, Gy\'arf\'as and S\'ark\"ozy we prove that (1.) the vertex set of every $r$-edge colored countably infinite complete $k$-uniform hypergraph can be partitioned into $r$ monochromatic tight paths with distinct colors (a tight path in a $k$-uniform hypergraph is a sequence of distinct vertices such that every set of $k$ consecutive vertices forms an edge), (2.) for all natural numbers $r$ and $k$ there is a natural number $M$ such that the vertex set of every $r$-edge colored countably infinite complete graph can be partitioned into $M$ monochromatic $k^{th}$ powers of paths apart from a finite set (a $k^{th}$ power of a path is a sequence $v_0, v_1, \dots$ of distinct vertices such that $1\le|i-j| \le k$ implies that $v_iv_j$ is an edge), (3.) the vertex set of every $2$-edge colored countably infinite complete graph can be partitioned into $4$ monochromatic squares of paths, but not necessarily into $3$, (4.) the vertex set of every $2$-edge colored complete graph on $\omega_1$ can be partitioned into $2$ monochromatic paths with distinct colors

The adjacency matrix of one type of graph and the Fibonacci numbers

Recently there is huge interest in graph theory and intensive study on computing integer powers of matrices. In this paper, we investigate relationships between one type of graph and well-known Fibonacci sequence. In this content, we consider the adjacency matrix of one type of graph with 2k (k=1,2,...) vertices. It is also known that for any positive integer r, the (i,j)th entry of A^{r} (A is the adjacency matrix of the graph) is just the number of walks from vertex i to vertex j, that use exactly k edges

Multiple partitions, lattice paths and a Burge-Bressoud-type correspondence

A bijection is presented between (1): partitions with conditions $f_j+f_{j+1}\leq k-1$ and $f_1\leq i-1$, where $f_j$ is the frequency of the part $j$ in the partition, and (2): sets of $k-1$ ordered partitions $(n^{(1)}, n^{(2)}, ..., n^{(k-1)})$ such that $n^{(j)}_\ell \geq n^{(j)}_{\ell+1} + 2j$ and $n^{(j)}_{m_j} \geq j+ {\rm max} (j-i+1,0)+ 2j (m_{j+1}+... + m_{k-1})$, where $m_j$ is the number of parts in $n^{(j)}$. This bijection entails an elementary and constructive proof of the Andrews multiple-sum enumerating partitions with frequency conditions. A very natural relation between the $k-1$ ordered partitions and restricted paths is also presented, which reveals our bijection to be a modification of Bressoud's version of the Burge correspondence.Comment: 12 pages; minor corrections, version to appear in Discrete Mat

Laws relating runs, long runs, and steps in gambler's ruin, with persistence in two strata

Define a certain gambler's ruin process \mathbf{X}_{j}, \mbox{ \ }j\ge 0, such that the increments $\varepsilon_{j}:=\mathbf{X}_{j}-\mathbf{X}_{j-1}$ take values $\pm1$ and satisfy $P(\varepsilon_{j+1}=1|\varepsilon_{j}=1, |\mathbf{X}_{j}|=k)=P(\varepsilon_{j+1}=-1|\varepsilon_{j}=-1,|\mathbf{X}_{j}|=k)=a_k$, all $j\ge 1$, where $a_k=a$ if $0\le k\le f-1$, and $a_k=b$ if $f\le k<N$. Here $0<a, b <1$ denote persistence parameters and $f ,N\in \mathbb{N}$ with $f<N$. The process starts at $\mathbf{X}_0=m\in (-N,N)$ and terminates when $|\mathbf{X}_j|=N$. Denote by ${\cal R}'_N$, ${\cal U}'_N$, and ${\cal L}'_N$, respectively, the numbers of runs, long runs, and steps in the meander portion of the gambler's ruin process. Define $X_N:=\left ({\cal L}'_N-\frac{1-a-b}{(1-a)(1-b)}{\cal R}'_N-\frac{1}{(1-a)(1-b)}{\cal U}'_N\right )/N$ and let $f\sim\eta N$ for some $0<\eta <1$. We show $\lim_{N\to\infty} E\{e^{itX_N}\}=\hat{\varphi}(t)$ exists in an explicit form. We obtain a companion theorem for the last visit portion of the gambler's ruin.Comment: Presented at 8th International Conference on Lattice Path Combinatorics, Cal Poly Pomona, Aug., 2015. The 2nd version has been streamlined, with references added, including reference to a companion document with details of calculations via Mathematica. The 3rd version has 2 new figures and improved presentatio

Single hole dynamics in the t-J model on a square lattice

We present quantum Monte Carlo (QMC) simulations for a single hole in a t-J model from J=0.4t to J=4t on square lattices with up to 24 x 24 sites. The lower edge of the spectrum is directly extracted from the imaginary time Green's function. In agreement with earlier calculations, we find flat bands around $(0,\pm\pi)$, $(\pm\pi,0)$ and the minimum of the dispersion at $(\pm\pi/2,\pm\pi/2)$. For small J both self-consistent Born approximation and series expansions give a bandwidth for the lower edge of the spectrum in agreement with the simulations, whereas for J/t > 1, only series expansions agree quantitatively with our QMC results. This band corresponds to a coherent quasiparticle. This is shown by a finite size scaling of the quasiparticle weight $Z(\vec k)$ that leads to a finite result in the thermodynamic limit for the considered values of $J/t$. The spectral function $A(\vec k, \omega)$ is obtained from the imaginary time Green's function via the maximum entropy method. Resonances above the lowest edge of the spectrum are identified, whose J-dependence is quantitatively described by string excitations up to J/t=2

Statistics of Partial Minima

Motivated by multi-objective optimization, we study extrema of a set of N points independently distributed inside the d-dimensional hypercube. A point in this set is k-dominated by another point when at least k of its coordinates are larger, and is a k-minimum if it is not k-dominated by any other point. We obtain statistical properties of these partial minima using exact probabilistic methods and heuristic scaling techniques. The average number of partial minima, A, decays algebraically with the total number of points, A ~ N^{-(d-k)/k}, when 1<=k<d. Interestingly, there are k-1 distinct scaling laws characterizing the largest coordinates as the distribution P(y_j) of the jth largest coordinate, y_j, decays algebraically, P(y_j) ~ (y_j)^{-alpha_j-1}, with alpha_j=j(d-k)/(k-j) for 1<=j<=k-1. The average number of partial minima grows logarithmically, A ~ [1/(d-1)!](ln N)^{d-1}, when k=d. The full distribution of the number of minima is obtained in closed form in two-dimensions.Comment: 6 pages, 1 figur

On the uniform generation of modular diagrams

In this paper we present an algorithm that generates $k$-noncrossing, $\sigma$-modular diagrams with uniform probability. A diagram is a labeled graph of degree $\le 1$ over $n$ vertices drawn in a horizontal line with arcs $(i,j)$ in the upper half-plane. A $k$-crossing in a diagram is a set of $k$ distinct arcs $(i_1, j_1), (i_2, j_2),\ldots,(i_k, j_k)$ with the property $i_1 < i_2 < \ldots < i_k < j_1 < j_2 < \ldots< j_k$. A diagram without any $k$-crossings is called a $k$-noncrossing diagram and a stack of length $\sigma$ is a maximal sequence $((i,j),(i+1,j-1),\dots,(i+(\sigma-1),j-(\sigma-1)))$. A diagram is $\sigma$-modular if any arc is contained in a stack of length at least $\sigma$. Our algorithm generates after $O(n^k)$ preprocessing time, $k$-noncrossing, $\sigma$-modular diagrams in $O(n)$ time and space complexity.Comment: 21 pages, 7 figure