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

On the removal lemma for linear systems over Abelian groups

In this paper we present an extension of the removal lemma to integer linear systems over abelian groups. We prove that, if the k$k$-determinantal of an integer (k×m)$(k\times m)$ matrix A$A$ is coprime with the order n$n$ of a group G$G$ and the number of solutions of the system Ax=b$Ax=b$ with _x1∈_X1,…,_xm∈_Xm$x_1\in X_1,\dots ,x_m\in X_m$ is o(n^m−k)$o\left(n^{m-k}\right)$, then we can eliminate o(n)$o\left(n\right)$ elements in each set to remove all these solutions.     

On weighted Hilbert spaces and integration of functions of infinitely many variables

We study aspects of the analytic foundations of integration and closely related problems for functions of infinitely many variables _x1,_x2,…∈D$x_1,x_2,\dots \in D$. The setting is based on a reproducing kernel k$k$ for functions on D$D$, a family of non-negative weights _γu${\gamma }_u$, where u$u$ varies over all finite subsets of N$\mathbb{N}$, and a probability measure ρ$\rho$ on D$D$. We consider the weighted superposition K=_∑uγuku$K={\sum }_u{\gamma }_u{k}_u$ of finite tensor products _ku$k_u$ of k$k$. Under mild assumptions we show that K$K$ is a reproducing kernel on a properly chosen domain in the sequence space D^N$D^{\mathbb{N}}$, and that the reproducing kernel Hilbert space H(K)$H\left(K\right)$ is the orthogonal sum of the spaces H(_γuku)$H\left({\gamma }_u{k}_u\right)$. Integration on H(K)$H\left(K\right)$ can be defined in two ways, via a canonical representer or with respect to the product measure ρ^N${\rho }^{\mathbb{N}}$ on D^N$D^{\mathbb{N}}$. We relate both approaches and provide sufficient conditions for the two approaches to coincide.     

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.     

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

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

The scaling limit of Poisson-driven order statistics with applications in geometric probability

Let _ηt${\eta }_t$ be a Poisson point process of intensity t≥1$t\ge 1$ on some state space Y$\mathbb{Y}$ and let f$f$ be a non-negative symmetric function on Y^k${\mathbb{Y}}^k$ for some k≥1$k\ge 1$. Applying f$f$ to all k$k$-tuples of distinct points of _ηt${\eta }_t$ generates a point process _ξt${\xi }_t$ on the positive real half-axis. The scaling limit of _ξt${\xi }_t$ as t$t$ tends to infinity is shown to be a Poisson point process with explicitly known intensity measure. From this, a limit theorem for the m$m$-th smallest point of _ξt${\xi }_t$ is concluded. This is strengthened by providing a rate of convergence. The technical background includes Wiener–Itô chaos decompositions and the Malliavin calculus of variations on the Poisson space as well as the Chen–Stein method for Poisson approximation. The general result is accompanied by a number of examples from geometric probability and stochastic geometry, such as k$k$-flats, random polytopes, random geometric graphs and random simplices. They are obtained by combining the general limit theorem with tools from convex and integral geometry.     

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.     

Holomorphic mappings preserving Minkowski functionals

We show that the equality _m1(f(x))=_m2(g(x))$m_1\left(f\left(x\right)\right)=m_2\left(g\left(x\right)\right)$ for x$x$ in a neighborhood of a point a$a$ remains valid for all x$x$ provided that f$f$ and g$g$ are open holomorphic maps, f(a)=g(a)=0$f\left(a\right)=g\left(a\right)=0$ and _m1,_m2$m_1,m_2$ are Minkowski functionals of bounded balanced domains. Moreover, a polynomial relation between f$f$ and g$g$ is obtained.     

An approximation method for strictly pseudocontractive mappings

Let K$K$ be a closed convex subset of a q$q$-uniformly smooth separable Banach space, T:K→K$T:K\to K$ a strictly pseudocontractive mapping, and f:K→K$f:K\to K$ an L$L$-Lispschitzian strongly pseudocontractive mapping. For any t∈(0,1)$t\in (0,1)$, let _xt$x_t$ be the unique fixed point of tf+(1-t)T$\mathit{tf}+(1-t)T$. We prove that if T$T$ has a fixed point, then {_xt}$\{x_t\}$ converges to a fixed point of T$T$ as t$t$ approaches to 0.     

Weak convergence of censored and reflected stable processes

It is shown that if a sequence of open n$n$-sets _Dk$D_k$ increases to an open n$n$-set D$D$ then reflected stable processes in _Dk$D_k$ converge weakly to the reflected stable process in D$D$ for every starting point x$x$ in D$D$. The same result holds for censored α$\alpha$-stable processes for every x$x$ in D$D$ if D$D$ and _Dk$D_k$ satisfy the uniform Hardy inequality. Using the method in the proof of the above results, we also prove the weak convergence of reflected Brownian motions in unbounded domains.     

Minimum degree and disjoint cycles in generalized claw-free graphs

For s≥3$s\ge 3$ a graph is _K1,s$K_{1,s}$-free if it does not contain an induced subgraph isomorphic to _K1,s$K_{1,s}$. Cycles in _K1,3$K_{1,3}$-free graphs, called claw-free graphs, have been well studied. In this paper we extend results on disjoint cycles in claw-free graphs satisfying certain minimum degree conditions to _K1,s$K_{1,s}$-free graphs, normally called generalized claw-free graphs. In particular, we prove that if G$G$ is _K1,s$K_{1,s}$-free of sufficiently large order n=3k$n=3k$ with δ(G)≥n/2+c$\delta \left(G\right)\ge n/2+c$ for some constant c=c(s)$c=c\left(s\right)$, then G$G$ contains k$k$ disjoint triangles. Analogous results with the complete graph _K3$K_3$ replaced by a complete graph _Km$K_m$ for m≥3$m\ge 3$ will be proved. Also, the existence of 2$2$-factors for _K1,s$K_{1,s}$-free graphs with minimum degree conditions will be shown.     

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.