Auslander–Reiten sequences are the central item of Auslander–Reiten theory, which is one of the most important techniques for the investigation of the structure of abelian categories.

Laplace operators on metric graphs are considered. It is proven that for compact graphs the spectrum of the Laplace operator determines the total length, the number of connected components, and the Euler characteristic. For a class of non-compact graphs the same characteristics are determined by the scattering data consisting of the scattering matrix and the discrete eigenvalues.

Abstract In this note we establish the uniform (Formula presented.)-bound for the weak solutions to a degenerate Keller-Segel equation with the diffusion exponent (Formula presented.) under a sharp condition on the initial data for the global existence. As a consequence, the uniqueness of the weak solutions is also proved.

We study chiral algebras associated with Argyres-Douglas theories engineered from M5 brane. For the theory engineered using 6d (2,0) type J theory on a sphere with a single irregular singularity (without mass parameter), its chiral algebra is the minimal model of W algebra of J type. For the theory engineered using an irregular singularity and a regular full singularity, its chiral algebra is the affine Kac-Moody algebra of J type. We can obtain the Schur index of these theories by computing the vacua character of the corresponding chiral algebra.

We propose and study a new parallel one-shot Lagrange--Newton--Krylov--Schwarz (LNKSz) algorithm for shape optimization problems constrained by steady incompressible Navier--Stokes equations discretized by finite element methods on unstructured moving meshes. Most existing algorithms for shape optimization problems iteratively solve the three components of the optimality system: the state equations for the constraints, the adjoint equations for the Lagrange multipliers, and the design equations for the shape parameters. Such approaches are relatively easy to implement, but generally are not easy to converge as they are basically nonlinear Gauss--Seidel algorithms with three large blocks. In this paper, we introduce a fully coupled, or the so-called one-shot, approach which solves the three components simultaneously. First, we introduce a moving mesh finite element method for the shape optimization