A new phase transition in the parabolic Anderson model with partially duplicated potential

We investigate a variant of the parabolic Anderson model, introduced in previous work, in which an i.i.d. potential is partially duplicated in a symmetric way about the origin, with each potential value duplicated independently with a certain probability. In previous work we established a phase transition for this model on the integers in the case of Pareto distributed potential with parameter $\alpha >1$ and fixed duplication probability $p\in (0,1)$: if $\alpha \ge 2$ the model completely localises, whereas if $\alpha \in (1,2)$ the model may localise on two sites. In this paper we prove a new phase transition in the case that $\alpha \ge 2$ is fixed but the duplication probability $p\left(n\right)$ varies with the distance from the origin. We identify a critical scale $p\left(n\right)\to 1$, depending on $\alpha$, below which the model completely localises and above which the model localises on exactly two sites. We further establish the behaviour of the model in the critical regime.     

On cycles in regular 3-partite tournaments

A $c$-partite tournament is an orientation of a complete $c$-partite graph. In 2006, Volkmann conjectured that every arc of a regular 3-partite tournament $D$ is contained in an $m$-, $(m+1)$- or $(m+2)$-cycle for each $m\in \{3,4,\dots ,\left|V\left(D\right)\right|?2\}$, and this conjecture was proved to be correct for $3\le m\le 7$. In 2012, Xu et al. conjectured that every arc of an $r$-regular 3-partite tournament $D$ with $r\ge 2$ is contained in a $(3k?1)$- or $3k$-cycle for $k=2,3,\dots ,r$. They proved that this conjecture is true for $k=2$. In this paper, we confirm this conjecture for $k=3$, which also implies that Volkmann’s conjecture is correct for $m=7,8$.     

Statistical inference for Vasicek-type model driven by Hermite processes

Let $Z$ denote a Hermite process of order $q\ge 1$ and self-similarity parameter $H\in (\frac{1}{2},1)$. This process is $H$-self-similar, has stationary increments and exhibits long-range dependence. When $q=1$, it corresponds to the fractional Brownian motion, whereas it is not Gaussian as soon as $q?2$. In this paper, we deal with a Vasicek-type model driven by $Z$, of the form $d{X}_t=a(b?X_t)dt+d{Z}_t$. Here, $a>0$ and $b\in \mathbb{R}$ are considered as unknown drift parameters. We provide estimators for $a$ and $b$ based on continuous-time observations. For all possible values of $H$ and $q$, we prove strong consistency and we analyze the asymptotic fluctuations.     

The higher-order differential operator for the generalized Jacobi polynomials — new representation and symmetry

For a long time it has been a challenging goal to identify all orthogonal polynomial systems that occur as eigenfunctions of a linear differential equation. One of the widest classes of such eigenfunctions known so far, is given by Koornwinder’s generalized Jacobi polynomials with four parameters $\alpha ,\beta \in {\mathbb{N}}_0$ and $M,N\ge 0$ determining the orthogonality measure on the interval $?1\le x\le 1$. The corresponding differential equation of order $2\alpha +2\beta +6$ is presented here as a linear combination of four elementary components which make the corresponding differential operator widely accessible for applications. In particular, we show that this operator is symmetric with respect to the underlying scalar product and thus verify the orthogonality of the eigenfunctions.     

3-Vertices with fewest 2-neighbors in plane graphs with no long paths of 2-vertices

Let $g(k,t)$ be the minimum integer such that every plane graph with girth g at least $g(k,t)$, minimum degree $\delta =2$ and no $(k+1)$-paths consisting of vertices of degree 2, where $k\ge 1$, has a 3-vertex with at least t neighbors of degree 2, where $1\le t\le 3$.In 2015, Jendrol' and Maceková proved $g(1,1)\le 7$. Later on, Hudák et al. established $g(1,3)=10$, Jendrol', Maceková, Montassier, and Soták proved $g(1,1)\ge 7$, $g(1,2)=8$ and $g(2,2)\ge 11$, and we recently proved that $g(2,2)=11$ and $g(2,3)=14$.Thus $g(k,t)$ is already known for $k=1$ and all t. In this paper, we prove that $g(k,1)=3k+4$, $g(k,2)=3k+5$, and $g(k,3)=3k+8$ whenever $k\ge 2$.     

On the smallest non-trivial tight sets in Hermitian polar spaces H(d,q2), d even

We show that every $x$-tight set of a Hermitian polar spaces $\mathrm{H}(2n,q^2)$, $n\ge 2$, is the union of $x$ disjoint generators of the polar space provided that $x\le \frac{1}{2}(q+1)$. This was known before only when $n\in \{2,3\}$. This result is a contribution to the conjecture that the smallest $x$-tight set of $H(2n,q^2)$ that is not a union of disjoint generators occurs for $x=q+1$ and is for sufficiently large $q$ an embedded subgeometry.     

Generating infinitely many satisfactory colorings of positive integers

An $n$-satisfactory coloring of the $n$-smooth integers is an assignment of $n$ colors to the positive integers whose prime factors are at most $n$ so that for each such $m$, the integers $m,2m,\dots ,nm$ receive different colors. In this note, we give a short proof that infinitely many 6-satisfactory colorings of the 6-smooth integers exist and show how the technique of the proof can be applied more generally, including for $n\in \{8,10,12\}$.     

Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations

Brualdi and Hollingsworth conjectured in Brualdi and Hollingsworth (1996) that in any complete graph $K_{2n}$, $n\ge 3$, which is properly colored with $2n?1$ colors, the edge set can be partitioned into $n$ edge disjoint rainbow spanning trees (where a graph is said to be rainbow if its edges have distinct colors). Constantine (2002) strengthened this conjecture asking the rainbow spanning trees to be pairwise isomorphic. He also showed an example satisfying his conjecture for every $2n\in \{2^s:s\ge 3\}\cup \{5?2^s,s\ge 1\}$ . Caughmann, Krussel and Mahoney (2017) recently showed a first infinite family of edge colorings for which the conjecture of Brualdi and Hollingsworth can be verified. In the present paper, we extend this result to all edge-colorings arising from cyclic 1-factorizations of $K_{2n}$ constructed by Hartman and Rosa (1985). Finally, we remark that our constructions permit to extend Constatine’s result also to all $2n\in \{2^{s}d:s\ge 1,d>3\text{odd}\}$.     

Nonlinear stochastic time-fractional slow and fast diffusion equations on Rd

This paper studies the nonlinear stochastic partial differential equation of fractional orders both in space and time variables: $\left({?}^{\beta }+\frac{\nu }{2}{(?\Delta )}^{\alpha ∕2}\right)u(t,x)=I_t^{\gamma }\left[\rho \left(u(t,x)\right)\stackrel{?}{W}(t,x)\right],t>0,x\in {\mathbb{R}}^d,$where $\stackrel{?}{W}$ is the space–time white noise, $\alpha \in (0,2]$, $\beta \in (0,2)$, $\gamma \ge 0$ and $\nu >0$. Fundamental solutions and their properties, in particular the nonnegativity, are derived. The existence and uniqueness of solution together with the moment bounds of the solution are obtained under Dalang’s condition: $d<2\alpha +\frac{\alpha }{\beta }min(2\gamma ?1,0)$. In some cases, the initial data can be measures. When $\beta \in (0,1]$, we prove the sample path regularity of the solution.     

Rough differential equations with power type nonlinearities

In this note we consider differential equations driven by a signal $x$ which is $\gamma$-Hölder with $\gamma >\frac{1}{3}$, and is assumed to possess a lift as a rough path. Our main point is to obtain existence of solutions when the coefficients of the equation behave like power functions of the form $|\xi {|}^{\kappa }$ with $\kappa \in (0,1)$. Two different methods are used in order to construct solutions: (i) In a 1-d setting, we resort to a rough version of Lamperti’s transform. (ii) For multidimensional situations, we quantify some improved regularity estimates when the solution approaches the origin.     

Largest regular multigraphs with three distinct eigenvalues

We deal with connected $k$-regular multigraphs of order $n$ that has only three distinct eigenvalues. In this paper, we study the largest possible number of vertices of such a graph for given $k$. For $k=2,3,7$, the Moore graphs are largest. For $k\ne 2,3,7,57$, we show an upper bound $n\le k^2?k+1$, with equality if and only if there exists a finite projective plane of order $k?1$ that admits a polarity.     

SLE intersecting with random hulls

Lawler, Schramm, and Werner gave in 2003 an explicit formula of the probability that $\mathrm{SLE}(8/3)$ does not intersect a deterministic hull. For general $\mathrm{SLE}(\kappa )$ with $\kappa \ne 8/3$, no such explicit formula has been obtained so far. In this paper, we shall consider a random hull generated by an independent chordal conformal restriction measure and obtain an explicit formula for the probability that $\mathrm{SLE}(\kappa )$ does not intersect this random hull for any $\kappa \in (0,8)$. As a corollary, we will give a new proof of Werner's result on conformal restriction measures.     

Matching in 3-uniform hypergraphs

A matching in a 3-uniform hypergraph is a set of pairwise disjoint edges. We use $E_3(2d?1,n?2d+1)$ to denote the 3-uniform hypergraph whose vertex set can be partitioned into two vertex classes $V_1$ and $V_2$ of size $2d?1$ and $n?2d+1$, respectively, and whose edge set consists of all the triples containing at least two vertices of $V_1$. Let $H$ be a 3-uniform hypergraph of order $n\ge 13d$ with no isolated vertex and $\text{deg}\left(u\right)+\text{deg}\left(v\right)>2\left(\left(\genfrac{}{}{0ex}{}{n?1}{2}\right)?\left(\genfrac{}{}{0ex}{}{n?d}{2}\right)\right)$ for any two adjacent vertices $u,v\in V\left(H\right)$. In this paper, we show that $H$ contains a matching of size $d$ if and only if $H$ is not a subgraph of $E_3(2d?1,n?2d+1)$. This result improves our previous one in Zhang and Lu (2018).