On probabilistic results for the discrepancy of a hybrid-Monte Carlo sequence

In many applications it has been observed that hybrid-Monte Carlo sequences perform better than Monte Carlo and quasi-Monte Carlo sequences, especially in difficult problems. For a mixed s$s$-dimensional sequence m$m$, whose elements are vectors obtained by concatenating d$d$-dimensional vectors from a low-discrepancy sequence q$q$ with (s−d)$(s-d)$-dimensional random vectors, probabilistic upper bounds for its star discrepancy have been provided. In a paper of G. Ökten, B. Tuffin and V. Burago [G. Ökten, B. Tuffin, V. Burago, J. Complexity 22 (2006), 435–458] it was shown that for arbitrary ε>0$\epsilon >0$ the difference of the star discrepancies of the first N$N$ points of m$m$ and q$q$ is bounded by ε$\epsilon$ with probability at least 1−2exp(−ε²N/2)$1-2exp(-{\epsilon }^{2}N/2)$ for N$N$ sufficiently large. The authors did not study how large N$N$ actually has to be and if and how this actually depends on the parameters s$s$ and ε$\epsilon$. In this note we derive a lower bound for N$N$, which significantly depends on s$s$ and ε$\epsilon$. Furthermore, we provide a probabilistic bound for the difference of the star discrepancies of the first N$N$ points of m$m$ and q$q$, which holds without any restrictions on N$N$. In this sense it improves on the bound of Ökten, Tuffin and Burago and is more helpful in practice, especially for small sample sizes N$N$. We compare this bound to other known bounds.     

Modules satisfying the weak Nakayama property

Let R$R$ be a commutative ring with identity. We will say that an R$R$-module M$M$ satisfies the weak Nakayama property, if IM=M$IM=M$, where I$I$ is an ideal of R$R$, implies that for any x∈M$x\in M$ there exists a∈I$a\in I$ such that (a−1)x=0$(a-1)x=0$. In this paper, we will study modules satisfying the weak Nakayama property. It is proved that if R$R$ is a local ring, then R$R$ is a Max ring if and only if J(R)$J\left(R\right)$, the Jacobson radical of R$R$, is T$T$-nilpotent if and only if every R$R$-module satisfies the weak Nakayama property.     

Optimality conditions and duality for nondifferentiable multiobjective programming problems involving d-r-type I functions

In this paper, new classes of nondifferentiable functions constituting multiobjective programming problems are introduced. Namely, the classes of d$d$-r$r$-type I objective and constraint functions and, moreover, the various classes of generalized d$d$-r$r$-type I objective and constraint functions are defined for directionally differentiable multiobjective programming problems. Sufficient optimality conditions and various Mond–Weir duality results are proved for nondifferentiable multiobjective programming problems involving functions of such type. Finally, it is showed that the introduced d$d$-r$r$-type I notion with r≠0$r\ne 0$ is not a sufficient condition for Wolfe weak duality to hold. These results are illustrated in the paper by suitable examples.     

Sister Beiter and Kloosterman: A tale of cyclotomic coefficients and modular inverses

For a fixed prime p$p$, the maximum coefficient (in absolute value) M(p)$M\left(p\right)$ of the cyclotomic polynomial _Φpqr(x)${\Phi }_{pqr}\left(x\right)$, where r$r$ and q$q$ are free primes satisfying r>q>p$r>q>p$ exists. Sister Beiter conjectured in 1968 that M(p)≤(p+1)/2$M\left(p\right)\le (p+1)/2$. In 2009 Gallot and Moree showed that M(p)≥2p(1−?)/3$M\left(p\right)\ge 2p(1-?)/3$ for every p$p$ sufficiently large. In this article Kloosterman sums (‘cloister man sums’) and other tools from the distribution of modular inverses are applied to quantify the abundancy of counter-examples to Sister Beiter’s conjecture and sharpen the above lower bound for M(p)$M\left(p\right)$.     

On affine motions and universal rigidity of tensegrity frameworks

Recently, Alfakih and Ye (2013) [4] proved that if an r  -dimensional bar framework (G,p)$(G,p)$ on n?r+2$n?r+2$ nodes in general position in R^r${\mathbb{R}}^r$ admits a positive semidefinite stress matrix with rank n−r−1$n-r-1$, then (G,p)$(G,p)$ is universally rigid. In this paper, we generalize this result in two directions. First, we extend this result to tensegrity frameworks. Second, we replace the general position assumption by the weaker assumption that in configuration p, each point and its neighbors in G   affinely span R^r${\mathbb{R}}^r$.     

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

Estimating the ground state energy of the Schrödinger equation for convex potentials

In 2011, the fundamental gap conjecture for Schrödinger operators was proven. This can be used to estimate the ground state energy of the time-independent Schrödinger equation with a convex potential and relative error ε$\epsilon$. Classical deterministic algorithms solving this problem have cost exponential in the number of its degrees of freedom d$d$. We show a quantum algorithm, that is based on a perturbation method, for estimating the ground state energy with relative error ε$\epsilon$. The cost of the algorithm is polynomial in d$d$ and ε⁻¹${\epsilon }^{-1}$, while the number of qubits is polynomial in d$d$ and logε⁻¹$log{\epsilon }^{-1}$. In addition, we present an algorithm for preparing a quantum state that overlaps within 1−δ,δ∈(0,1)$1-\delta ,\delta \in (0,1)$, with the ground state eigenvector of the discretized Hamiltonian. This algorithm also approximates the ground state with relative error ε$\epsilon$. The cost of the algorithm is polynomial in d$d$, ε⁻¹${\epsilon }^{-1}$ and δ⁻¹${\delta }^{-1}$, while the number of qubits is polynomial in d$d$, logε⁻¹$log{\epsilon }^{-1}$ and logδ⁻¹$log{\delta }^{-1}$.     

Asymptotic average shadowing property on compact metric spaces

We prove that if for a continuous map f$f$ on a compact metric space X$X$, the chain recurrent set, R(f)$R\left(f\right)$ has more than one chain component, then f$f$ does not satisfy the asymptotic average shadowing property. We also show that if a continuous map f$f$ on a compact metric space X$X$ has the asymptotic average shadowing property and if A$A$ is an attractor for f$f$, then A$A$ is the single attractor for f$f$ and we have A=R(f)$A=R\left(f\right)$. We also study diffeomorphisms with asymptotic average shadowing property and prove that if M$M$ is a compact manifold which is not finite with dimM=2$dimM=2$, then the C¹$C^1$ interior of the set of all C¹$C^1$ diffeomorphisms with the asymptotic average shadowing property is characterized by the set of Ω$\Omega$-stable diffeomorphisms.     

On topological entropy of commuting tree maps

Let T$T$ be a tree with s$s$ ends and f,g$f,g$ be continuous maps from T$T$ to T$T$ with f°g=g°f$f°g=g°f$. In this note we show that if there exists a positive integer m≥2$m\ge 2$ such that gcd(m,l)=1$gcd(m,l)=1$ for any 2≤l≤s$2\le l\le s$ and f,g$f,g$ share a periodic point which is a km$km$-periodic point of f$f$ for some positive integer k$k$, then the topological entropy of f°g$f°g$ is positive.     

Convergence of invariant measures for singular stochastic diffusion equations

It is proved that the solutions to the singular stochastic p$p$-Laplace equation, p∈(1,2)$p\in (1,2)$ and the solutions to the stochastic fast diffusion equation with nonlinearity parameter r∈(0,1)$r\in (0,1)$ on a bounded open domain Λ⊂R^d$\Lambda \subset {\mathbb{R}}^d$ with Dirichlet boundary conditions are continuous in mean, uniformly in time, with respect to the parameters p$p$ and r$r$ respectively (in the Hilbert spaces L²(Λ)$L^2\left(\Lambda \right)$, H⁻¹(Λ)$H^{-1}\left(\Lambda \right)$ respectively). The highly singular limit case p=1$p=1$ is treated with the help of stochastic evolution variational inequalities, where P$\mathbb{P}$-a.s. convergence, uniformly in time, is established.     

Hamilton decompositions of regular expanders: A proof of Kelly’s conjecture for large tournaments

A long-standing conjecture of Kelly states that every regular tournament on n$n$ vertices can be decomposed into (n−1)/2$(n-1)/2$ edge-disjoint Hamilton cycles. We prove this conjecture for large n$n$. In fact, we prove a far more general result, based on our recent concept of robust expansion and a new method for decomposing graphs. We show that every sufficiently large regular digraph G$G$ on n$n$ vertices whose degree is linear in n$n$ and which is a robust outexpander has a decomposition into edge-disjoint Hamilton cycles. This enables us to obtain numerous further results, e.g. as a special case we confirm a conjecture of Erd?s on packing Hamilton cycles in random tournaments. As corollaries to the main result, we also obtain several results on packing Hamilton cycles in undirected graphs, giving e.g. the best known result on a conjecture of Nash-Williams. We also apply our result to solve a problem on the domination ratio of the Asymmetric Travelling Salesman problem, which was raised e.g. by Glover and Punnen as well as Alon, Gutin and Krivelevich.     

On testing Hamiltonicity of graphs

Let us fix a function f(n)=o(nlnn)$f\left(n\right)=o(nlnn)$ and real numbers 0≤α<β≤1$0\le \alpha <\beta \le 1$. We present a polynomial time algorithm which, given a directed graph G$G$ with n$n$ vertices, decides either that one can add at most βn$\beta n$ new edges to G$G$ so that G$G$ acquires a Hamiltonian circuit or that one cannot add αn$\alpha n$ or fewer new edges to G$G$ so that G$G$ acquires at least e^−f(n)n!$e^{-f\left(n\right)}n!$ Hamiltonian circuits, or both.     

On the effectiveness of a generalization of Miller’s primality theorem

Berrizbeitia and Olivieri showed in a recent paper that, for any integer r$r$, the notion of ω$\omega$-prime to base a$a$ leads to a primality test for numbers n≡1$n\equiv 1$ mod r$r$, that under the Extended Riemann Hypothesis (ERH) runs in polynomial time. They showed that the complexity of their test is at most the complexity of the Miller primality test (MPT), which is O((logn)^4+o(1))$O\left({(logn)}^{4+o\left(1\right)}\right)$. They conjectured that their test is more effective than the MPT if r$r$ is large.     

Transformation formulas for fractional Brownian motion

We derive a Molchan–Golosov-type integral transform which changes fractional Brownian motion of arbitrary Hurst index K$K$ into fractional Brownian motion of index H$H$. Integration is carried out over [0,t]$[0,t]$, t>0$t>0$. The formula is derived in the time domain. Based on this transform, we construct a prelimit which converges in L²(P)$L^2\left(\mathbb{P}\right)$-sense to an analogous, already known Mandelbrot–Van Ness-type integral transform, where integration is over (−∞,t]$(-\infty ,t]$, t>0$t>0$.     

Existence and multiplicity of nonnegative solutions for semilinear elliptic problems involving nonlinearities indefinite in sign

Let r,s∈]1,2[$r,s\in ]1,2[$ and λ,μ∈]0,+∞[$\lambda ,\mu \in ]0,+\infty [$. In this paper, we deal with the existence and multiplicity of nonnegative and nonzero solutions of the Dirichlet problem with 0$0$ boundary data for the semilinear elliptic equation −Δu=λu^s−1−u^r−1$-\Delta u=\lambda u^{s-1}-u^{r-1}$ in Ω⊂R^N$\Omega \subset {\mathbb{R}}^N$, where N≥2$N\ge 2$. We prove that there exists a positive constant Λ$\Lambda$ such that the above problem has at least two solutions, at least one solution or no solution according to whether λ>Λ$\lambda >\Lambda$, λ=Λ$\lambda =\Lambda$ or λ<Λ$\lambda <\Lambda$. In particular, a result by Hernandéz, Macebo and Vega is improved and, for the semilinear case, a result by Díaz and Hernandéz is partially extended to higher dimensions. Finally, an answer to a conjecture, recently stated by the author, is also given.