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.     

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.     

Randomly weighted self-normalized Lévy processes

Let (_Ut,_Vt)$(U_t,V_t)$ be a bivariate Lévy process, where _Vt$V_t$ is a subordinator and _Ut$U_t$ is a Lévy process formed by randomly weighting each jump of _Vt$V_t$ by an independent random variable _Xt$X_t$ having cdf F$F$. We investigate the asymptotic distribution of the self-normalized Lévy process _Ut/_Vt$U_t/V_t$ at 0 and at ∞$\infty$. We show that all subsequential limits of this ratio at 0 (∞$\infty$) are continuous for any nondegenerate F$F$ with finite expectation if and only if _Vt$V_t$ belongs to the centered Feller class at 0 (∞$\infty$). We also characterize when _Ut/_Vt$U_t/V_t$ has a non-degenerate limit distribution at 0 and ∞$\infty$.     

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$.     

Structural instability of cookie-cutter sets

It is proved that the cookie-cutter set in R$\mathbb{R}$ is structurally instable in C¹$C^1$ topology, that means for the invariant set E$E$ of the IFS _{fi}i${\left\{f_i\right\}}_i$, we can always perturb _{fi}i${\left\{f_i\right\}}_i$ arbitrarily small in C¹$C^1$ topology to provide an IFS _{gi}i${\left\{g_i\right\}}_i$ with its invariant set F$F$, such that _dimHE=_dimHF${dim}_{H}E={dim}_{H}F$ and E,F$E,F$ are not Lipschitz equivalent.     

Pull-back morphisms for reflexive differential forms

Let f:X→Y$f:X\to Y$ be a morphism between normal complex varieties, where Y$Y$ is Kawamata log terminal. Given any differential form σ$\sigma$, defined on the smooth locus of Y$Y$, we construct a “pull-back form” on X$X$. The pull-back map obtained by this construction is _?Y${?}_Y$-linear, uniquely determined by natural universal properties and exists even in cases where the image of f$f$ is entirely contained in the singular locus of Y$Y$.     

Nonparametric estimation for stochastic differential equations with random effects

We consider N$N$ independent stochastic processes (_Xj(t),t∈[0,T])$(X_j\left(t\right),t\in [0,T])$, j=1,…,N$j=1,\dots ,N$, defined by a one-dimensional stochastic differential equation with coefficients depending on a random variable _?j${?}_j$ and study the nonparametric estimation of the density of the random effect _?j${?}_j$ in two kinds of mixed models. A multiplicative random effect and an additive random effect are successively considered. In each case, we build kernel and deconvolution estimators and study their L²$L^2$-risk. Asymptotic properties are evaluated as N$N$ tends to infinity for fixed T$T$ or for T=T(N)$T=T\left(N\right)$ tending to infinity with N$N$. For T(N)=N²$T\left(N\right)=N^2$, adaptive estimators are built. Estimators are implemented on simulated data for several examples.     

Cycles embedding on folded hypercubes with faulty nodes

Let F_Fv$F{F}_v$ be the set of faulty nodes in an n$n$-dimensional folded hypercube F_Qn$F{Q}_n$ with |F_Fv|≤n−2$\left|F{F}_v\right|\le n-2$. In this paper, we show that if n≥3$n\ge 3$, then every edge of F_Qn−F_Fv$F{Q}_n-F{F}_v$ lies on a fault-free cycle of every even length from 4$4$ to 2ⁿ−2|F_Fv|$2^n-2\left|F{F}_v\right|$, and if n≥2$n\ge 2$ and n$n$ is even, then every edge of F_Qn−F_Fv$F{Q}_n-F{F}_v$ lies on a fault-free cycle of every odd length from n+1$n+1$ to 2ⁿ−2|F_Fv|−1$2^n-2\left|F{F}_v\right|-1$.     

Mosco convergence of the sets of fixed points for one-parameter nonexpansive semigroups

We consider the Mosco convergence of the sets of fixed points for one-parameter strongly continuous semigroups of nonexpansive mappings. One of our main results is the following: Let C$C$ be a closed convex subset of a Hilbert space E$E$. Let {T(t):t≥0}$\{T\left(t\right):t\ge 0\}$ be a strongly continuous semigroup of nonexpansive mappings on C$C$. The set of all fixed points of T(t)$T\left(t\right)$ is denoted by F(T(t))$F\left(T\left(t\right)\right)$ for each t≥0$t\ge 0$. Let τ$\tau$ be a nonnegative real number and let {_tn}$\left\{t_n\right\}$ be a sequence in R$\mathbb{R}$ satisfying τ+_tn≥0$\tau +t_n\ge 0$ and _tn≠0$t_n\ne 0$ for n∈N$n\in \mathbb{N}$, and _limntn=0${lim}_n{t}_n=0$. Then {F(T(τ+_tn))}$\left\{F\left(T(\tau +t_n)\right)\right\}$ converges to _?t≥0F(T(t))${?}_{t\ge 0}F\left(T\left(t\right)\right)$ in the sense of Mosco.     

Positional graphs and conditional structure of weakly null sequences

We prove that, unless assuming additional set theoretical axioms, there are no reflexive spaces without unconditional sequences of the density continuum. We show that for every integer n$n$ there are normalized weakly-null sequences of length _ωn${\omega }_n$ without unconditional subsequences. This together with a result of Dodos et al. (2011) [7] shows that _ωω${\omega }_{\omega }$ is the minimal cardinal κ$\kappa$ that could possibly have the property that every weakly null κ$\kappa$-sequence has an infinite unconditional basic subsequence. We also prove that for every cardinal number κ$\kappa$ which is smaller than the first ω$\omega$-Erd?s cardinal there is a normalized weakly-null sequence without subsymmetric subsequences. Finally, we prove that mixed Tsirelson spaces of uncountable densities must always contain isomorphic copies of either _c0$c_0$ or _?p${?}_p$, with p≥1$p\ge 1$.     

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.     

A unified proof of Brooks’ theorem and Catlin’s theorem

Brooks’ theorem is a fundamental result in the theory of graph coloring. Catlin proved the following strengthening of Brooks’ theorem: Let d$d$ be an integer at least 3, and let G$G$ be a graph with maximum degree d$d$. If G$G$ does not contain _Kd+1$K_{d+1}$ as a subgraph, then G$G$ has a d$d$-coloring in which one color class has size α(G)$\alpha \left(G\right)$. Here α(G)$\alpha \left(G\right)$ denotes the independence number of G$G$. We give a unified proof of Brooks’ theorem and Catlin’s theorem.