Disjoint cycles with different length in 4-arc-dominated digraphs

A d$d$-arc-dominated digraph is a digraph D$D$ of minimum out-degree d$d$ such that for every arc (x,y)$(x,y)$ of D$D$, there exists a vertex u$u$ of D$D$ of out-degree d$d$ such that (u,x)$(u,x)$ and (u,y)$(u,y)$ are arcs of D$D$. Henning and Yeo [Vertex disjoint cycles of different length in digraphs, SIAM J. Discrete Math. 26 (2012) 687–694] conjectured that a digraph with minimum out-degree at least four contains two vertex-disjoint cycles of different length. In this paper, we verify this conjecture for 4-arc-dominated digraphs.     

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.     

Scaling limits for one-dimensional long-range percolation: Using the corrector method

In this paper, by using the corrector method we give another proof of the quenched invariance principle for the random walk on the infinite random graph generated by a one-dimensional long-range percolation under the conditions that the connection probability p(1)=1$p\left(1\right)=1$ and the percolation exponent s>2$s>2$. The key step of the proof is the construction of the corrector. We show that the corrector can be constructed under either s∈(2,3]$s\in (2,3]$ or s>3$s>3$, though the corresponding underlying measures may be different. As an application of the main result we get a new lower bound of the quenched diagonal transition probability for the random walk.     

On the complexity of the bondage and reinforcement problems

Let G=(V,E)$G=(V,E)$ be a graph. A subset D⊆V$D\subseteq V$ is a dominating set if every vertex not in D$D$ is adjacent to a vertex in D$D$. A dominating set D$D$ is called a total dominating set if every vertex in D$D$ is adjacent to a vertex in D$D$. The domination (resp. total domination) number of G$G$ is the smallest cardinality of a dominating (resp. total dominating) set of G$G$. The bondage (resp. total bondage) number of a nonempty graph G$G$ is the smallest number of edges whose removal from G$G$ results in a graph with larger domination (resp. total domination) number of G$G$. The reinforcement (resp. total reinforcement) number of G$G$ is the smallest number of edges whose addition to G$G$ results in a graph with smaller domination (resp. total domination) number. This paper shows that the decision problems for the bondage, total bondage, reinforcement and total reinforcement numbers are all NP-hard.     

[1, 2]-sets in graphs

A subset S⊆V$S\subseteq V$ in a graph G=(V,E)$G=(V,E)$ is a [j,k]$[j,k]$-set if, for every vertex v∈V?S$v\in V?S$, j≤|N(v)∩S|≤k$j\le |N\left(v\right)\cap S|\le k$ for non-negative integers j$j$ and k$k$, that is, every vertex v∈V?S$v\in V?S$ is adjacent to at least j$j$ but not more than k$k$ vertices in S$S$. In this paper, we focus on small j$j$ and k$k$, and relate the concept of [j,k]$[j,k]$-sets to a host of other concepts in domination theory, including perfect domination, efficient domination, nearly perfect sets, 2-packings, and k$k$-dependent sets. We also determine bounds on the cardinality of minimum [1, 2]-sets, and investigate extremal graphs achieving these bounds. This study has implications for restrained domination as well. Using a result for [1, 3]-sets, we show that, for any grid graph G$G$, the restrained domination number is equal to the domination number of G$G$.     

Critical edges for the assignment problem: Complexity and exact resolution

This paper investigates two problems related to the determination of critical edges for the minimum cost assignment problem. Given a complete bipartite balanced graph with n$n$ vertices on each part and with costs on its edges, k$k$Most Vital Edges Assignment consists of determining a set of k$k$ edges whose removal results in the largest increase in the cost of a minimum cost assignment. A dual problem, Min Edge Blocker Assignment, consists of removing a subset of edges of minimum cardinality such that the cost of a minimum cost assignment in the remaining graph is larger than or equal to a specified threshold. We show that k$k$Most Vital Edges Assignment is NP$NP$-hard to approximate within a factor c<2$c<2$ and Min Edge Blocker Assignment is NP$NP$-hard to approximate within a factor 1.36$1.36$. We also provide an exact algorithm for k$k$Most Vital Edges Assignment that runs in O(n^k+2)$O\left(n^{k+2}\right)$. This algorithm can also be used to solve exactly Min Edge Blocker Assignment.     

Analysis of symmetric matrix valued functions I

For any symmetric function f:Rⁿ?Rⁿ$f:{\mathbb{R}}^n?{\mathbb{R}}^n$, one can define a corresponding function on the space of n×n$n\times n$ real symmetric matrices by applying f$f$ to the eigenvalues of the spectral decomposition. We show that this matrix valued function inherits from f$f$ the properties of continuity, Lipschitz continuity, strict continuity, directional differentiability, Frechet differentiability, continuous differentiability.     

The Laplacian polynomial and Kirchhoff index of graphs derived from regular graphs

Let R(G)$R\left(G\right)$ be the graph obtained from G$G$ by adding a new vertex corresponding to each edge of G$G$ and by joining each new vertex to the end vertices of the corresponding edge, and Q(G)$Q\left(G\right)$ be the graph obtained from G$G$ by inserting a new vertex into every edge of G$G$ and by joining by edges those pairs of these new vertices which lie on adjacent edges of G$G$. In this paper, we determine the Laplacian polynomials of R(G)$R\left(G\right)$ and Q(G)$Q\left(G\right)$ of a regular graph G$G$; on the other hand, we derive formulae and lower bounds of the Kirchhoff index of these graphs.     

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.     

Resolving sets for Johnson and Kneser graphs

A set of vertices S$S$ in a graph G$G$ is a resolving set   for G$G$ if, for any two vertices u,v$u,v$, there exists x∈S$x\in S$ such that the distances d(u,x)≠d(v,x)$d(u,x)\ne d(v,x)$. In this paper, we consider the Johnson graphs J(n,k)$J(n,k)$ and Kneser graphs K(n,k)$K(n,k)$, and obtain various constructions of resolving sets for these graphs. As well as general constructions, we show that various interesting combinatorial objects can be used to obtain resolving sets in these graphs, including (for Johnson graphs) projective planes and symmetric designs, as well as (for Kneser graphs) partial geometries, Hadamard matrices, Steiner systems and toroidal grids.     

Large deviations of infinite intersections of events in Gaussian processes

Consider events of the form {_Zs≥ζ(s),s∈S}$\{Z_s\ge \zeta \left(s\right),s\in S\}$, where Z$Z$ is a continuous Gaussian process with stationary increments, ζ$\zeta$ is a function that belongs to the reproducing kernel Hilbert space R$R$ of process Z$Z$, and S⊂R$S\subset \mathbb{R}$ is compact. The main problem considered in this paper is identifying the function β^∗∈R${\beta }^{\ast }\in R$ satisfying β^∗(s)≥ζ(s)${\beta }^{\ast }\left(s\right)\ge \zeta \left(s\right)$ on S$S$ and having minimal R$R$-norm. The smoothness (mean square differentiability) of Z$Z$ turns out to have a crucial impact on the structure of the solution. As examples, we obtain the explicit solutions when ζ(s)=s$\zeta \left(s\right)=s$ for s∈[0,1]$s\in [0,1]$ and Z$Z$ is either a fractional Brownian motion or an integrated Ornstein–Uhlenbeck process.     

Global solutions with shock waves to the generalized Riemann problem for a class of quasilinear hyperbolic systems of balance laws

It is proven that the generalized Riemann problem for a class of quasilinear hyperbolic systems of balance laws admits a unique global piecewise C¹$C^1$ solution u=u(t,x)$u=u(t,x)$ containing only n$n$ shock waves with small amplitude on t?0$t?0$ and this solution possesses a global structure similar to that of the similarity solution u=U(x/t)$u=U(x/t)$ of the corresponding homogeneous Riemann problem. As an application of our result, we prove the existence of global shock solutions, piecewise continuous and piecewise smooth solution with shock discontinuities, of the flow equations of a model class of fluids with viscosity induced by fading memory with a single jump initial data.     

Boundary value problems in spaces of distributions on smooth and polygonal domains

We study boundary value problems of the form -Δu=f$-\mathrm{\Delta }u=f$ on Ω$\Omega$ and Bu=g$\mathit{Bu}=g$ on the boundary ∂Ω$\mathrm{\partial }\Omega$, with either Dirichlet or Neumann boundary conditions, where Ω$\Omega$ is a smooth bounded domain in Rⁿ${\mathbb{R}}^n$ and the data f,g$f,g$ are distributions  . This problem has to be first properly reformulated and, for practical applications, it is of crucial importance to obtain the continuity of the solution u$u$ in terms of f and g  . For f=0$f=0$, taking advantage of the fact that u$u$ is harmonic on Ω$\Omega$, we provide four formulations of this boundary value problem (one using nontangential limits of harmonic functions, one using Green functions, one using the Dirichlet-to-Neumann map, and a variational one); we show that these four formulations are equivalent. We provide a similar analysis for f≠0$f\ne 0$ and discuss the roles of f and g, which turn to be somewhat interchangeable in the low regularity case. The weak formulation is more convenient for numerical approximation, whereas the nontangential limits definition is closer to the intuition and easier to check in concrete situations. We extend the weak formulation to polygonal domains using weighted Sobolev spaces. We also point out some new phenomena for the “concentrated loads” at the vertices in the polygonal case.     

Zero separation results for solutions of second order linear differential equations

The oscillation of solutions of f^″+Af=0$f^{″}+Af=0$ is discussed by focusing on four separate situations. In the complex case A$A$ is assumed to be either analytic in the unit disc D$\mathbb{D}$ or entire, while in the real case A$A$ is continuous either on (−1,1)$(-1,1)$ or on (0,∞)$(0,\infty )$. In all situations A$A$ is expected to grow beyond bounds that ensure finite oscillation for all (non-trivial) solutions, and the separation between distinct zeros of solutions is considered.     

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.     

Convergence of the modified Mann’s iteration method for asymptotically strict pseudo-contractions

Let C$C$ be a closed convex subset of a real Hilbert space H$H$ and assume that T$T$ is an asymptotically κ$\kappa$-strict pseudo-contraction on C$C$ with a fixed point, for some 0≤κ<1$0\le \kappa <1$. Given an initial guess _x0∈C$x_0\in C$ and given also a real sequence {_αn}$\left\{{\alpha }_n\right\}$ in (0, 1), the modified Mann’s algorithm generates a sequence {_xn}$\left\{x_n\right\}$ via the formula: _xn+1=_αnxn+(1−_αn)Tⁿ_xn$x_{n+1}={\alpha }_n{x}_n+(1-{\alpha }_n)T^n{x}_n$, n≥0$n\ge 0$. It is proved that if the control sequence {_αn}$\left\{{\alpha }_n\right\}$ is chosen so that κ+δ<_αn<1−δ$\kappa +\delta <{\alpha }_n<1-\delta$ for some δ∈(0,1)$\delta \in (0,1)$, then {_xn}$\left\{x_n\right\}$ converges weakly to a fixed point of T$T$. We also modify this iteration method by applying projections onto suitably constructed closed convex sets to get an algorithm which generates a strongly convergent sequence.