Monochromatic Clique Decompositions of Graphs

Let $G$ be a graph whose edges are coloured with $k$ colours, and $\mathcal H=(H_1,\dots , H_k)$ be a $k$-tuple of graphs. A monochromatic $\mathcal H$-decomposition of $G$ is a partition of the edge set of $G$ such that each part is either a single edge or forms a monochromatic copy of $H_i$ in colour $i$, for some $1\le i\le k$. Let $\phi_{k}(n,\mathcal H)$ be the smallest number $\phi$, such that, for every order-$n$ graph and every $k$-edge-colouring, there is a monochromatic $\mathcal H$-decomposition with at most $\phi$ elements. Extending the previous results of Liu and Sousa ["Monochromatic $K_r$-decompositions of graphs", Journal of Graph Theory}, 76:89--100, 2014], we solve this problem when each graph in $\mathcal H$ is a clique and $n\ge n_0(\mathcal H)$ is sufficiently large.Comment: 14 pages; to appear in J Graph Theor

Scaling laws for weakly interacting cosmic (super)string and p-brane networks

In this paper we find new scaling laws for the evolution of $p$-brane networks in $N+1$-dimensional Friedmann-Robertson-Walker universes in the weakly-interacting limit, giving particular emphasis to the case of cosmic superstrings ($p=1$) living in a universe with three spatial dimensions (N=3). In particular, we show that, during the radiation era, the root-mean-square velocity is ${\bar v} =1/{\sqrt 2}$ and the characteristic length of non-interacting cosmic string networks scales as $L \propto a^{3/2}$ ($a$ is the scale factor), thus leading to string domination even when gravitational backreaction is taken into account. We demonstrate, however, that a small non-vanishing constant loop chopping efficiency parameter $\tilde c$ leads to a linear scaling solution with constant $L H \ll 1$ ($H$ is the Hubble parameter) and ${\bar v} \sim 1/{\sqrt 2}$ in the radiation era, which may allow for a cosmologically relevant cosmic string role even in the case of light strings. We also determine the impact that the radiation-matter transition has on the dynamics of weakly interacting cosmic superstring networks.Comment: 5 pages, 2 figure

Domain wall network evolution in (N+1)-dimensional FRW universes

We develop a velocity-dependent one-scale model for the evolution of domain wall networks in flat expanding or collapsing homogeneous and isotropic universes with an arbitrary number of spatial dimensions, finding the corresponding scaling laws in frictionless and friction dominated regimes. We also determine the allowed range of values of the curvature parameter and the expansion exponent for which a linear scaling solution is possible in the frictionless regime.Comment: 5 pages, 2 figure

Evolution of domain wall networks: the PRS algorithm

The Press-Ryden-Spergel (PRS) algorithm is a modification to the field theory equations of motion, parametrized by two parameters ($\alpha$ and $\beta$), implemented in numerical simulations of cosmological domain wall networks, in order to ensure a fixed comoving resolution. In this paper we explicitly demonstrate that the PRS algorithm provides the correct domain wall dynamics in $N+1$-dimensional Friedmann-Robertson-Walker (FRW) universes if $\alpha+\beta/2=N$, fully validating its use in numerical studies of cosmic domain evolution. We further show that this result is valid for generic thin featureless domain walls, independently of the Lagrangian of the model.Comment: 4 page