Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs

A semicomplete multipartite or semicomplete c$c$-partite digraph D$D$ is a biorientation of a c$c$-partite graph. A semicomplete multipartite digraph D$D$ is called strongly quasi-Hamiltonian-connected, if for any two distinct vertices x$x$ and y$y$ of D$D$, there is a path P$P$ from x$x$ to y$y$ such that P$P$ contains at least one vertex from each partite set of D$D$.     

Backward stochastic differential equations associated to jump Markov processes and applications

In this paper we study backward stochastic differential equations (BSDEs) driven by the compensated random measure associated to a given pure jump Markov process X$X$ on a general state space K$K$. We apply these results to prove well-posedness of a class of nonlinear parabolic differential equations on K$K$, that generalize the Kolmogorov equation of X$X$. Finally we formulate and solve optimal control problems for Markov jump processes, relating the value function and the optimal control law to an appropriate BSDE that also allows to construct probabilistically the unique solution to the Hamilton–Jacobi–Bellman equation and to identify it with the value function.     

Multi-dimensional G-Brownian motion and related stochastic calculus under G-expectation

We develop a notion of nonlinear expectation–G$G$-expectation–generated by a nonlinear heat equation with infinitesimal generator G$G$. We first study multi-dimensional G$G$-normal distributions. With this nonlinear distribution we can introduce our G$G$-expectation under which the canonical process is a multi-dimensional G$G$-Brownian motion. We then establish the related stochastic calculus, especially stochastic integrals of Itô’s type with respect to our G$G$-Brownian motion, and derive the related Itô’s formula. We have also obtained the existence and uniqueness of stochastic differential equations under our G$G$-expectation.     

On prime ideals and radicals of polynomial rings and graded rings

We extend some known results on radicals and prime ideals from polynomial rings and Laurent polynomial rings to Z$\mathbb{Z}$-graded rings, i.e, rings graded by the additive group of integers. The main of them concerns the Brown–McCoy radical G$G$ and the radical S$S$, which for a given ring A$A$ is defined as the intersection of prime ideals I$I$ of A$A$ such that A/I$A/I$ is a ring with a large center. The studies are related to some open problems on the radicals G$G$ and S$S$ of polynomial rings and situated in the context of Koethe’s problem.     

Strong convergence theorems for finitely many nonexpansive mappings

Under the assumption that E$E$ is a reflexive Banach space whose norm is uniformly Gêteaux differentiable and which has a weakly continuous duality mapping _Jφ$J_{\phi }$ with gauge function φ$\phi$, Ceng–Cubiotti–Yao [Strong convergence theorems for finitely many nonexpansive mappings and applications, Nonlinear Analysis 67 (2007) 1464–1473] introduced a new iterative scheme for a finite commuting family of nonexpansive mappings, and proved strong convergence theorems about this iteration. In this paper, only under the hypothesis that E$E$ is a reflexive Banach space which has a weakly continuous duality mapping _Jφ$J_{\phi }$ with gauge function φ$\phi$, and several control conditions about the iterative coefficient are removed, we present a short and simple proof of the above theorem.     

Quandle cocycles from invariant theory

Let G$G$ be a group. Any G$G$-module M$M$ has an algebraic structure called a G$G$-family of Alexander quandles. Given a 2-cocycle of a cohomology associated with this G$G$-family, topological invariants of (handlebody) knots in the 3-sphere are defined. We develop a simple algorithm to algebraically construct n$n$-cocycles of this G$G$-family from G$G$-invariant group n$n$-cocycles of the abelian group M$M$. We present many examples of 2-cocycles of these G$G$-families using facts from (modular) invariant theory.     

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.     

Oscillation of harmonic functions for subordinate Brownian motion and its applications

In this paper, we establish an oscillation estimate of nonnegative harmonic functions for a pure-jump subordinate Brownian motion. The infinitesimal generator of such subordinate Brownian motion is an integro-differential operator. As an application, we give a probabilistic proof of the following form of relative Fatou theorem for such subordinate Brownian motion X$X$ in a bounded κ$\kappa$-fat open set; if u$u$ is a positive harmonic function with respect to X$X$ in a bounded κ$\kappa$-fat open set D$D$ and h$h$ is a positive harmonic function in D$D$ vanishing on D^c$D^c$, then the non-tangential limit of u/h$u/h$ exists almost everywhere with respect to the Martin-representing measure of h$h$.     

Products of conjugacy classes in finite and algebraic simple groups

We prove the Arad–Herzog conjecture for various families of finite simple groups — if A$A$ and B$B$ are nontrivial conjugacy classes, then AB$AB$ is not a conjugacy class. We also prove that if G$G$ is a finite simple group of Lie type and A$A$ and B$B$ are nontrivial conjugacy classes, either both semisimple or both unipotent, then AB$AB$ is not a conjugacy class. We also prove a strong version of the Arad–Herzog conjecture for simple algebraic groups and in particular show that almost always the product of two conjugacy classes in a simple algebraic group consists of infinitely many conjugacy classes. As a consequence we obtain a complete classification of pairs of centralizers in a simple algebraic group which have dense product. A special case of this has been used by Prasad to prove a uniqueness result for Tits systems in quasi-reductive groups. Our final result is a generalization of the Baer–Suzuki theorem for p$p$-elements with p≥5$p\ge 5$.     

A short proof of the Doob–Meyer theorem

Every submartingale S$S$ of class D$D$ has a unique Doob–Meyer decomposition S=M+A$S=M+A$, where M$M$ is a martingale and A$A$ is a predictable increasing process starting at 0.     

Fixed point theorem for generalized Φ -pseudocontractive mappings

Let E$E$ be a real Banach space, C$C$ be a nonempty closed convex subset of E$E$ and T:C→C$T:C\to C$ be a continuous generalized Φ$\Phi$-pseudocontractive mapping. It is proved that T$T$ has a unique fixed point in C$C$.     

Tournaments associated with multigraphs and a theorem of Hakimi

A tournament of order n$n$ is usually considered as an orientation of the complete graph _Kn$K_n$. In this note, we consider a more general definition of a tournament that we call aC$C$-tournament, where C$C$ is the adjacency matrix of a multigraph G$G$, and a C$C$-tournament is an orientation of G$G$. The score vector of a C$C$-tournament is the vector of outdegrees of its vertices. In 1965 Hakimi obtained necessary and sufficient conditions for the existence of a C$C$-tournament with a prescribed score vector R$R$ and gave an algorithm to construct such a C$C$-tournament which required, however, some backtracking. We give a simpler and more transparent proof of Hakimi’s theorem, and then provide a direct construction of such a C$C$-tournament which works even for weighted graphs.     

Every point is critical

We show that, for any compact Alexandrov surface S$S$ (without boundary) and any point y$y$ in S$S$, there exists a point x$x$ in S$S$ for which y$y$ is a critical point. Moreover, we prove that uniqueness characterizes the surfaces homeomorphic to the sphere among smooth orientable surfaces.     

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.     

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.     

Sensitivity of Boolean formulas

The sensitivity set of a Boolean function at a particular input is the set of input positions where changing that one bit changes the output. Analogously we define the sensitivity set of a Boolean formula in a conjunctive normal form at a particular truth assignment, it is the set of positions where changing that one bit of the truth assignment changes the evaluation of at least one of the conjunct in the formula. We consider Boolean formulas in a generalized conjunctive normal form. Given a set ?$?$ of Boolean functions, an ?$?$-constraint is an application of a function from ?$?$ to a tuple of literals built upon distinct variables, an ?$?$-formula is then a conjunction of ?$?$-constraints. In this framework, given a truth assignment I$I$ and a set of positions S$S$, we are able to enumerate all ?$?$-formulas that are satisfied by I$I$ and that have S$S$ as the sensitivity set at I$I$. We prove that this number depends on the cardinality of S$S$ only, and can be expressed according to the sensitivity of the Boolean functions in ?$?$.     

Asymptotic results for the two-parameter Poisson–Dirichlet distribution

The two-parameter Poisson–Dirichlet distribution is the law of a sequence of decreasing nonnegative random variables with total sum one. It can be constructed from stable and gamma subordinators with the two parameters, α$\alpha$ and θ$\theta$, corresponding to the stable component and the gamma component respectively. The moderate deviation principle is established for the distribution when θ$\theta$ approaches infinity, and the large deviation principle is established when both α$\alpha$ and θ$\theta$ approach zero.     

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.     

Presenting higher stacks as simplicial schemes

We show that an n$n$-geometric stack may be regarded as a special kind of simplicial scheme, namely a Duskin n$n$-hypergroupoid in affine schemes, where surjectivity is defined in terms of covering maps, yielding Artin n$n$-stacks, Deligne–Mumford n$n$-stacks and n$n$-schemes as the notion of covering varies. This formulation adapts to all HAG contexts, so in particular works for derived n$n$-stacks (replacing rings with simplicial rings). We exploit this to describe quasi-coherent sheaves and complexes on these stacks, and to draw comparisons with Kontsevich’s dg-schemes. As an application, we show how the cotangent complex controls infinitesimal deformations of higher and derived stacks.