A boundary blow-up elliptic problem with an inhomogeneous term

By a perturbation method and constructing comparison functions, we reveal how the inhomogeneous term h$h$ affects the exact asymptotic behaviour of solutions near the boundary to the problem △u=b(x)g(u)+λh(x)$△u=b\left(x\right)g\left(u\right)+\lambda h\left(x\right)$, u>0$u>0$ in Ω$\Omega$, u_|∂Ω=∞$u{|}_{\partial \Omega }=\infty$, where Ω$\Omega$ is a bounded domain with smooth boundary in R^N${\mathbb{R}}^N$, λ>0$\lambda >0$, g∈C¹[0,∞)$g\in C^1[0,\infty )$ is increasing on [0,∞)$[0,\infty )$, g(0)=0$g\left(0\right)=0$, g^′$g^{\prime }$ is regularly varying at infinity with positive index ρ$\rho$, the weight b$b$, which is non-trivial and non-negative in Ω$\Omega$, may be vanishing on the boundary, and the inhomogeneous term h$h$ is non-negative in Ω$\Omega$ and may be singular on the boundary.     

The relaxed Newton method derivative: Its dynamics and non-linear properties

The dynamic behaviour of the one-dimensional family of maps f(x)=_c2[(a−1)x+_c1]^{−λ/(α−1)}$f\left(x\right)=c_2{[(a-1)x+c_1]}^{-\lambda /(\alpha -1)}$ is examined, for representative values of the control parameters a,_c1$a,c_1$, _c2$c_2$ and λ$\lambda$. The maps under consideration are of special interest, since they are solutions of the relaxed Newton method derivative being equal to a constant a$a$. The maps f(x)$f\left(x\right)$ are also proved to be solutions of a non-linear differential equation with outstanding applications in the field of power electronics. The recurrent form of these maps, after excessive iterations, shows, in an _xn$x_n$ versus λ$\lambda$ plot, an initial exponential decay followed by a bifurcation. The value of λ$\lambda$ at which this bifurcation takes place depends on the values of the parameters a,_c1$a,c_1$ and _c2$c_2$. This corresponds to a switch to an oscillatory behaviour with amplitudes of f(x)$f\left(x\right)$ undergoing a period doubling. For values of a$a$ higher than 1 and at higher values of λ$\lambda$ a reverse bifurcation occurs. The corresponding branches converge and a bleb is formed for values of the parameter _c1$c_1$ between 1 and 1.20. This behaviour is confirmed by calculating the corresponding Lyapunov exponents.     

Frobenius groups and retract rationality

Let k$k$ be any field, G$G$ be a finite group acting on the rational function field k(_xg:g∈G)$k(x_g:g\in G)$ by h⋅_xg=_xhg$h\cdot x_g=x_{hg}$ for any h,g∈G$h,g\in G$. Define k(G)=k(_xg:g∈G)^G$k\left(G\right)=k{(x_g:g\in G)}^G$. Noether’s problem asks whether k(G)$k\left(G\right)$ is rational (= purely transcendental) over k$k$. A weaker notion, retract rationality introduced by Saltman, is also very useful for the study of Noether’s problem. We prove that, if G$G$ is a Frobenius group with abelian Frobenius kernel, then k(G)$k\left(G\right)$ is retract k$k$-rational for any field k$k$ satisfying some mild conditions. As an application, we show that, for any algebraic number field k$k$, for any Frobenius group G$G$ with Frobenius complement isomorphic to S_L2(_F5)$S{L}_2\left({\mathbb{F}}_5\right)$, there is a Galois extension field K$K$ over k$k$ whose Galois group is isomorphic to G$G$, i.e. the inverse Galois problem is valid for the pair (G,k)$(G,k)$. The same result is true for any non-solvable Frobenius group if k(_ζ8)$k\left({\zeta }_8\right)$ is a cyclic extension of k$k$.     

Parametric inference for discretely observed multidimensional diffusions with small diffusion coefficient

We consider a multidimensional diffusion X$X$ with drift coefficient b(α,_Xt)$b(\alpha ,X_t)$ and diffusion coefficient ?σ(β,_Xt)$?\sigma (\beta ,X_t)$. The diffusion sample path is discretely observed at times _tk=kΔ$t_k=k\Delta$ for k=1…n$k=1\dots n$ on a fixed interval [0,T]$[0,T]$. We study minimum contrast estimators derived from the Gaussian process approximating X$X$ for small ?$?$. We obtain consistent and asymptotically normal estimators of α$\alpha$ for fixed Δ$\Delta$ and ?→0$?\to 0$ and of (α,β)$(\alpha ,\beta )$ for Δ→0$\Delta \to 0$ and ?→0$?\to 0$ without any condition linking ?$?$ and Δ$\Delta$. We compare the estimators obtained with various methods and for various magnitudes of Δ$\Delta$ and ?$?$ based on simulation studies. Finally, we investigate the interest of using such methods in an epidemiological framework.     

Crossing number additivity over edge cuts

Consider a graph G$G$ with a minimal edge cut F$F$ and let _G1$G_1$, _G2$G_2$ be the two (augmented) components of G−F$G-F$. A long-open question asks under which conditions the crossing number of G$G$ is (greater than or) equal to the sum of the crossing numbers of _G1$G_1$ and _G2$G_2$—which would allow us to consider those graphs separately. It is known that crossing number is additive for |F|∈{0,1,2}$\left|F\right|\in \{0,1,2\}$ and that there exist graphs violating this property with |F|≥4$\left|F\right|\ge 4$. In this paper, we show that crossing number is additive for |F|=3$\left|F\right|=3$, thus closing the final gap in the question.     

On functional limits of short- and long-memory linear processes with GARCH(1,1) noises

This paper considers the short- and long-memory linear processes with GARCH (1,1) noises. The functional limit distributions of the partial sum and the sample autocovariances are derived when the tail index α$\alpha$ is in (0,2)$(0,2)$, equal to 2, and in (2,∞)$(2,\infty )$, respectively. The partial sum weakly converges to a functional of α$\alpha$-stable process when α<2$\alpha <2$ and converges to a functional of Brownian motion when α≥2$\alpha \ge 2$. When the process is of short-memory and α<4$\alpha <4$, the autocovariances converge to functionals of α/2$\alpha /2$-stable processes; and if α≥4$\alpha \ge 4$, they converge to functionals of Brownian motions. In contrast, when the process is of long-memory, depending on α$\alpha$ and β$\beta$ (the parameter that characterizes the long-memory), the autocovariances converge to either (i) functionals of α/2$\alpha /2$-stable processes; (ii) Rosenblatt processes (indexed by β$\beta$, 1/2<β<3/4$1/2<\beta <3/4$); or (iii) functionals of Brownian motions. The rates of convergence in these limits depend on both the tail index α$\alpha$ and whether or not the linear process is short- or long-memory. Our weak convergence is established on the space of càdlàg functions on [0,1]$[0,1]$ with either (i) the _J1$J_1$ or the _M1$M_1$ topology (Skorokhod, 1956); or (ii) the weaker form S$S$ topology (Jakubowski, 1997). Some statistical applications are also discussed.     

Density estimation for compound Poisson processes from discrete data

In this article we investigate the nonparametric estimation of the jump density of a compound Poisson process from the discrete observation of one trajectory over [0,T]$[0,T]$. We consider the case where the sampling rate Δ=_ΔT→0$\Delta ={\Delta }_T\to 0$ as T→∞$T\to \infty$. We propose an adaptive wavelet threshold density estimator and study its performance for _Lp$L_p$ losses, p≥1$p\ge 1$, over Besov spaces. The main novelty is that we achieve minimax rates of convergence for sampling rates _ΔT${\Delta }_T$ that vanish slowly. The estimation procedure is based on the explicit inversion of the operator giving the law of the increments as a nonlinear transformation of the jump density.     

A note on distance-regular graphs with a small number of vertices compared to the valency

In this note we study distance-regular graphs with a small number of vertices compared to the valency. We show that for a given α>2$\alpha >2$, there are finitely many distance-regular graphs Γ$\Gamma$ with valency k$k$, diameter D≥3$D\ge 3$ and v$v$ vertices satisfying v≤αk$v\le \alpha k$ unless (D=3$D=3$ and Γ$\Gamma$ is imprimitive) or (D=4$D=4$ and Γ$\Gamma$ is antipodal and bipartite). We also show, as a consequence of this result, that there are finitely many distance-regular graphs with valency k≥3$k\ge 3$, diameter D≥3$D\ge 3$ and _c2≥εk$c_2\ge \epsilon k$ for a given 0<ε<1$0<\epsilon <1$ unless (D=3$D=3$ and Γ$\Gamma$ is imprimitive) or (D=4$D=4$ and Γ$\Gamma$ is antipodal and bipartite).     

On first-fit coloring of ladder-free posets

Bosek and Krawczyk exhibited an on-line algorithm for partitioning an on-line poset of width w$w$ into w^14lgw$w^{14lgw}$ chains. They also observed that the problem of on-line chain partitioning of general posets of width w$w$ could be reduced to First-Fit chain partitioning of 2w²+1$2w^2+1$-ladder-free posets of width w$w$, where an m$m$-ladder is the transitive closure of the union of two incomparable chains _x1≤?≤_xm$x_1\le ?\le x_m$, _y1≤?≤_ym$y_1\le ?\le y_m$ and the set of comparabilities {_x1≤_y1,…,_xm≤_ym}$\{x_1\le y_1,\dots ,x_m\le y_m\}$. Here, we provide a subexponential upper bound (in terms of w$w$ with m$m$ fixed) for the performance of First-Fit chain partitioning on m$m$-ladder-free posets, as well as an exact quadratic bound when m=2$m=2$, and an upper bound linear in m$m$ when w=2$w=2$. Using the Bosek–Krawczyk observation, this yields an on-line chain partitioning algorithm with a somewhat improved performance bound. More importantly, the algorithm and the proof of its performance bound are much simpler.     

On the least distance eigenvalue of a graph

Denote by D(G)=_(di,j)n×n$D(G)={(d_{i,j})}_{n\times n}$ the distance matrix of a connected graph G with n   vertices, where _dij$d_{ij}$ is equal to the distance between vertices _vi$v_i$ and _vj$v_j$ in G  . The least eigenvalue of D(G)$D(G)$ is called the least distance eigenvalue of G  , denoted by _λn${\lambda }_n$. In this paper, we determine all the graphs with _λn∈[−2.383,0]${\lambda }_n\in [-2.383,0]$.     

Large scale properties of the IIIC for 2D percolation

We reinvestigate the 2D problem of the inhomogeneous incipient infinite cluster   where, in an independent percolation model, the density decays to _pc$p_c$ with an inverse power, λ$\lambda$, of the distance to the origin. Assuming the existence of critical exponents (as is known in the case of the triangular site lattice) if the power is less than 1/ν$1/\nu$, with ν$\nu$ the correlation length exponent, we demonstrate an infinite cluster with scale dimension given by _DH=2−βλ$D_H=2-\beta \lambda$. Further, we investigate the critical case _λc=1/ν${\lambda }_c=1/\nu$ and show that iterated logarithmic corrections will tip the balance between the possibility and impossibility of an infinite cluster.     

On a family of differential operators with the coupling parameter in the boundary condition

We study a family of differential operators _Lα${\mathbf{L}}_{\alpha }$ in two variables, depending on the coupling parameter α?0$\alpha ?0$ that appears only in the boundary conditions. Our main concern is the spectral properties of _Lα${\mathbf{L}}_{\alpha }$, which turn out to be quite different for α<1$\alpha <1$ and for α>1$\alpha >1$. In particular, _Lα${\mathbf{L}}_{\alpha }$ has a unique self-adjoint realization for α<1$\alpha <1$ and many such realizations for α>1$\alpha >1$. In the more difficult case α>1$\alpha >1$ an analysis of non-elliptic pseudodifferential operators in dimension one is involved.     

Heat-kernel estimates for random walk among random conductances with heavy tail

We study models of discrete-time, symmetric, Z^d${\mathbb{Z}}^d$-valued random walks in random environments, driven by a field of i.i.d. random nearest-neighbor conductances _ωxy∈[0,1]${\omega }_{xy}\in [0,1]$, with polynomial tail near 0 with exponent γ>0$\gamma >0$. We first prove for all d≥5$d\ge 5$ that the return probability shows an anomalous decay (non-Gaussian) that approaches (up to sub-polynomial terms) a random constant times n⁻²$n^{-2}$ when we push the power γ$\gamma$ to zero. In contrast, we prove that the heat-kernel decay is as close as we want, in a logarithmic sense, to the standard decay n^−d/2$n^{-d/2}$ for large values of the parameter γ$\gamma$.     

Characterizations of hypersurfaces of a Danielewski type

Let k$k$ be a field of characteristic zero and R$R$ a factorial affine k$k$-domain. Let B$B$ be an affineR$R$-domain. In terms of locally nilpotent derivations, we give criteria for B$B$ to be R$R$-isomorphic to the residue ring of a polynomial ring R[_X1,_X2,Y]$R[X_1,X_2,Y]$ over R$R$ by the ideal (_X1X2−φ(Y))$(X_1{X}_2-\phi \left(Y\right))$ for φ(Y)∈R[Y]?R$\phi \left(Y\right)\in R\left[Y\right]?R$.     

Regularity for the fractional Gelfand problem up to dimension 7

We study the problem (−Δ)^su=λe^u${(-\mathrm{\Delta })}^{s}u=\lambda e^u$ in a bounded domain Ω⊂Rⁿ$\Omega \subset {\mathbb{R}}^n$, where λ   is a positive parameter. More precisely, we study the regularity of the extremal solution to this problem. Our main result yields the boundedness of the extremal solution in dimensions n≤7$n\le 7$ for all s∈(0,1)$s\in (0,1)$ whenever Ω   is, for every i=1,...,n$i=1,...,n$, convex in the _xi$x_i$-direction and symmetric with respect to {_xi=0}$\{x_i=0\}$. The same holds if n=8$n=8$ and s?0.28206...$s?0.28206...$, or if n=9$n=9$ and s?0.63237...$s?0.63237...$. These results are new even in the unit ball Ω=_B1$\Omega =B_1$.