Cluster Categories Coming from Cyclic Posets

Cyclic posets are generalizations of cyclically ordered sets. In this article, we show that any cyclic poset gives rise to a Frobenius category over any discrete valuation ring R. The stable category of a Frobenius category is always triangulated and has a cluster structure in many cases. The continuous cluster categories of [14 Igusa , K. , Todorov , G. ( 2013 ). Continuous Frobenius categories . Proceedings of the Abel Symposium 2011 : 115 – 143 .[Crossref] , [Google Scholar]], the infinity-gon of [12 Holm , T. , Jøot rgensen , P. ( 2012 ). On a cluster category of infinite Dynkin type, and the relation to triangulations of the infinity-gon . Math. Z. 270 : 277 – 295 .[Crossref], [Web of Science ®] , [Google Scholar]], and the m-cluster category of type A _∞ (m ≥ 3) [13 Holm , T. , Jøot rgensen , P. ( 2015 ). Cluster tilting vs. weak cluster tilting in Dynkin type A infinity . Forum Math. 27 : 1117 – 1137 .[Crossref], [Web of Science ®] , [Google Scholar]] are examples of this construction as well as some new examples such as the cluster category of ?². An extension of this construction and further examples are given in [16 Igusa, K., Todorov, G. Continuous Cluster Categories of Type D. arXiv:1309.7409 . [Google Scholar]].     

On the threshold dividend strategy for a generalized jump-diffusion risk model

In this paper, we generalize the Cramér-Lundberg risk model perturbed by diffusion to incorporate jumps due to surplus fluctuation and to relax the positive loading condition. Assuming that the surplus process has exponential upward and arbitrary downward jumps, we analyze the expected discounted penalty (EDP) function of Gerber and Shiu (1998) under the threshold dividend strategy. An integral equation for the EDP function is derived using the Wiener-Hopf factorization. As a result, an explicit analytical expression is obtained for the EDP function by solving the integral equation. Finally, phase-type downward jumps are considered and a matrix representation of the EDP function is presented.     

An alternating direction algorithm for matrix completion with nonnegative factors

This paper introduces an algorithm for the nonnegative matrix factorization-and-completion problem, which aims to find nonnegative low-rank matrices X and Y so that the product XY approximates a nonnegative data matrix M whose elements are partially known (to a certain accuracy). This problem aggregates two existing problems: (i) nonnegative matrix factorization where all entries of M are given, and (ii) low-rank matrix completion where nonnegativity is not required. By taking the advantages of both nonnegativity and low-rankness, one can generally obtain superior results than those of just using one of the two properties. We propose to solve the non-convex constrained least-squares problem using an algorithm based on the classical alternating direction augmented Lagrangian method. Preliminary convergence properties of the algorithm and numerical simulation results are presented. Compared to a recent algorithm for nonnegative matrix factorization, the proposed algorithm produces factorizations of similar quality using only about half of the matrix entries. On tasks of recovering incomplete grayscale and hyperspectral images, the proposed algorithm yields overall better qualities than those produced by two recent matrix-completion algorithms that do not exploit nonnegativity.     

一类求解非线性代数方程组的并行多分裂AOR算法

本文提出了求解大型非线性代数方程组Aф(x)+Bψ(x)=b的并行多分裂AOR(Accelerated Overrela Xation)算法。在一定的条件下,证明了非线性代数方程组解的存在唯一性,并建立了新算法的全局收敛性理论。     

On the geometry of null hypersurfaces in Minkowski space

The present work is divided into three parts. First we study the null hypersurfaces of the Minkowski space ${\mathbb{R}}_1^{n+2}$, classifying all rotation null hypersurfaces in ${\mathbb{R}}_1^{n+2}$. In the second part we start our analysis of the submanifold geometry of the null hypersurfaces. In the particular case of the $(n+1)$-dimensional light cone, we characterize its totally umbilical spacelike hypersurfaces, show the existence of non-totally umbilical ones and give a uniqueness result for the minimal spacelike rotation surfaces in the $3$-dimensional light cone. In the third and final part we consider an isolated umbilical point on a spacelike surface immersed in the 3-dimensional light cone of ${\mathbb{R}}_1^4$ and obtain the differential equation of the principal configuration associated to this point, showing that every classical generic Darbouxian principal configuration appears in this context.     

ORTHOGONAL (g,f)-FACTORIZAFIONS OF BIPARTITE GRAPHS

1 IntroductionIn this paper we con8ider finite undirected simple graphs. Let G be a graph with vertexset V(G) and edge set E(G). Let g and f be two po8itive iuteger-valued functions defined onV(G) such that g(x) 5 f(x) for every vertex x of V(G). Then a (g, f)-factor of G is a spanningsubgraph H of G satisfying g(x) 5 dH(x) 5 f(x) for each x E V(H). In particular, if G itselfis a (g, f)-factor, then G is called a (g, f)-grapl1. A subgrapl1 H of G is called an rmsubgraphif H has m edg…     

Mixed symbolic–numerical computations with general DAEs II: An applications case study

A variety of theorems and properties of nonlinear DAEs were discussed in part I. This paper illustrates many of these ideas within the context of analyzing a specific nonlinear system that exhibits a variety of interesting features. This revised version was published online in June 2006 with corrections to the Cover Date.     

Interior-Point Solver for Large-Scale Quadratic Programming Problems with Bound Constraints

In this paper, we present an interior-point algorithm for large and sparse convex quadratic programming problems with bound constraints. The algorithm is based on the potential reduction method and the use of iterative techniques to solve the linear system arising at each iteration. The global convergence properties of the potential reduction method are reassessed in order to take into account the inexact solution of the inner system. We describe the iterative solver, based on the conjugate gradient method with a limited-memory incomplete Cholesky factorization as preconditioner. Furthermore, we discuss some adaptive strategies for the fill-in and accuracy requirements that we use in solving the linear systems in order to avoid unnecessary inner iterations when the iterates are far from the solution. Finally, we present the results of numerical experiments carried out to verify the effectiveness of the proposed strategies. We consider randomly generated sparse problems without a special structure. Also, we compare the proposed algorithm with the MOSEK solver. Research partially supported by the MIUR FIRB Project RBNE01WBBB “Large-Scale Nonlinear Optimization.”     

Next-to-leading-order calculation in kT factorization

We explain the framework for calculating next-to-leading-order (NLO) corrections to exclusive processes in the kT factorization theorem, taking πγ→γ T as an example. Partons off-shell by k2T are considered in both the quark diagrams from full QCD and the effective diagrams for the pion wave function. The gauge dependences in the above two sets of diagrams cancel, when deriving the kT-dependent hard kernel as their difference. The light-cone singularities in the kT-dependent pion wave function are regularized by rotating the Wilson lines away from the light cone. Both the large double logarithms In2 kT and ln2x, x being a parton momentum fraction, arise from the loop correction to the virtual photon vertex, the former being absorbed into the pion wave function, and the latter into a jet function.