The approximation characteristic of diagonal matrix in probabilistic setting

In this paper, the approximation characteristic of a diagonal matrix in probabilistic and average case settings is investigated. And the asymptotic degree of the probabilistic linear (n,δ)$(n,\delta )$-width and p$p$-average linear n$n$-width of diagonal matrix M$M$ are determined.     

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 new condition for maximal monotonicity via representative functions

In this paper we give a weaker sufficient condition for the maximal monotonicity of the operator S+A^∗TA$S+A^{\ast }TA$, where S:X?X^∗$S:X?X^{\ast }$, T:Y?Y^∗$T:Y?Y^{\ast }$ are two maximal monotone operators, A:X→Y$A:X\to Y$ is a linear continuous mapping and X,Y$X,Y$ are reflexive Banach spaces. We prove that our condition is weaker than the generalized interior-point conditions given so far in the literature. This condition is formulated using the representative functions of the operators involved. In particular, we rediscover some sufficient conditions given in the past using the so-called Fitzpatrick function for the maximal monotonicity of the sum of two maximal monotone operators and for the precomposition of a maximal monotone operator with a linear operator, respectively.     

Stable categories of higher preprojective algebras

We introduce (n+1)$(n+1)$-preprojective algebras of algebras of global dimension n$n$. We show that if an algebra is n$n$-representation-finite then its (n+1)$(n+1)$-preprojective algebra is self-injective. In this situation, we show that the stable module category of the (n+1)$(n+1)$-preprojective algebra is (n+1)$(n+1)$-Calabi–Yau, and, more precisely, it is the (n+1)$(n+1)$-Amiot cluster category of the stable n$n$-Auslander algebra of the original algebra. In particular this stable category contains an (n+1)$(n+1)$-cluster tilting object. We show that even if the (n+1)$(n+1)$-preprojective algebra is not self-injective, under certain assumptions (which are always satisfied for n∈{1,2}$n\in \{1,2\}$) the results above still hold for the stable category of Cohen–Macaulay modules.     

An algorithm based on resolvent operators for solving variational inequalities in Hilbert spaces

In this paper, a new monotonicity, M$M$-monotonicity, is introduced, and the resolvent operator of an M$M$-monotone operator is proved to be single valued and Lipschitz continuous. With the help of the resolvent operator, an equivalence between the variational inequality VI(C,F+G)$(C,F+G)$ and the fixed point problem of a nonexpansive mapping is established. A proximal point algorithm is constructed to solve the fixed point problem, which is proved to have a global convergence under the condition that F$F$ in the VI problem is strongly monotone and Lipschitz continuous. Furthermore, a convergent path Newton method, which is based on the assumption that the projection mapping _∏C(⋅)${\prod }_C(\cdot )$ is semismooth, is given for calculating ε$\epsilon$-solutions to the sequence of fixed point problems, enabling the proximal point algorithm to be implementable.     

Multidimensional extension of the Morse–Hedlund theorem

A celebrated result of Morse and Hedlund, stated in 1938, asserts that a sequence x$x$ over a finite alphabet is ultimately periodic if and only if, for some n$n$, the number of different factors of length n$n$ appearing in x$x$ is less than n+1$n+1$. Attempts to extend this fundamental result, for example, to higher dimensions, have been considered during the last fifteen years. Let d≥2$d\ge 2$. A legitimate extension to a multidimensional setting of the notion of periodicity is to consider sets of Z^d${\mathbb{Z}}^d$ definable by a first order formula in the Presburger arithmetic 〈Z;<,+〉$〈\mathbb{Z};<,+〉$. With this latter notion and using a powerful criterion due to Muchnik, we exhibit a complete extension of the Morse–Hedlund theorem to an arbitrary dimension d$d$ and characterize sets of Z^d${\mathbb{Z}}^d$ definable in 〈Z;<,+〉$〈\mathbb{Z};<,+〉$ in terms of some functions counting recurrent blocks, that is, blocks occurring infinitely often.     

Restrictions of an invertible chaotic operator to its invariant subspaces

Let M$M$ be a closed subspace of a separable, infinite dimensional Hilbert space H$H$ with dim(H/M)=∞$dim(H/M)=\infty$. We show that a bounded linear operator A:M→M$A:M\to M$ has an invertible chaotic extension T:H→H$T:H\to H$ if and only if A$A$ is bounded below. Motivated by our result, we further show that A:M→M$A:M\to M$ has a chaotic Fredholm extension T:H→H$T:H\to H$ if and only if A$A$ is left semi-Fredholm.     

Matchings in graphs of odd regularity and girth

We establish lower bounds on the matching number of graphs of given odd regularity d$d$ and odd girth g$g$, which are sharp for many values of d$d$ and g$g$. For d=g=5$d=g=5$, we characterize all extremal graphs.     

Growth order for the size of smallest hamiltonian chain saturated uniform hypergraphs

We say that a hypergraph H$H$ is hamiltonian chain saturated if H$H$ does not contain a hamiltonian chain but by adding any new edge we create a hamiltonian chain in H$H$. In this paper, for each k≥3$k\ge 3$, we establish the right order of magnitude n^k−1$n^{k-1}$ for the size of the smallest k$k$-uniform hamiltonian chain saturated hypergraph. This solves an open problem of G.Y. Katona.     

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.     

Quantizations of Kac–Moody algebras

We analyze the extent to which a quantum universal enveloping algebra of a Kac–Moody algebra g$\mathfrak{g}$ is defined by multidegrees of its defining relations. To this end, we consider a class of character Hopf algebras defined by the same number of defining relations of the same degrees as the Kac–Moody algebra g$\mathfrak{g}$. We demonstrate that if the generalized Cartan matrix A$A$ of g$\mathfrak{g}$ is connected then the algebraic structure, up to a finite number of exceptional cases, is defined by just one “continuous” parameter q$q$ related to a symmetrization of A$A$, and one “discrete” parameter m$\mathfrak{m}$ related to the modular symmetrizations of A$A$. The Hopf algebra structure is defined by n(n−1)/2$n(n-1)/2$ additional “continuous” parameters. We also consider the exceptional cases for Cartan matrices of finite or affine types in more detail, establishing the number of exceptional parameter values in terms of the Fibonacci sequence.     

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.     

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

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.     

Chern–Simons classes for a superconnection

In this note we define the Chern–Simons classes of a flat superconnection, D+L$D+L$, on a complex Z/2Z$\mathbb{Z}/2\mathbb{Z}$-graded vector bundle E$E$ on a manifold such that D$D$ preserves the grading and L$L$ is an odd endomorphism of E$E$. As an application, we obtain a definition of Chern–Simons classes of a (not necessarily flat) morphism between flat vector bundles on a smooth manifold. An application of Reznikov's theorem shows the triviality of these classes when the manifold is a compact Kähler manifold or a smooth complex quasi-projective variety in degrees >1$>1$.     

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.