A variant smoothing Newton method for P0-NCP based on a new smoothing function

In this paper, we present a new one-step smoothing Newton method proposed for solving the non-linear complementarity problem with _P0$P_0$-function based on a new smoothing NCP$NCP$-function. We adopt a variant merit function. Our algorithm needs only to solve one linear system of equations and perform one line search per iteration. It shows that any accumulation point of the iteration sequence generated by our algorithm is a solution of _P0-NCP$P_0\text{-}NCP$. Furthermore, under the assumption that the solution set is non-empty and bounded, we can guarantee at least one accumulation point of the generated sequence. Numerical experiments show the feasibility and efficiency of the algorithm.     

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.     

Necessary and sufficient condition for uniqueness of solution to the first boundary value problem for the diffusion equation in unbounded domains

This paper introduces a notion of regularity of t=-∞$t=-\infty$ for the diffusion (or heat) equation and establishes a necessary and sufficient condition for the existence of a unique bounded solution to the first boundary value problem for the diffusion equation in a general domain Ω⊂R^N+1$\Omega \subset {\mathbb{R}}^{N+1}$ which extends up to t=-∞$t=-\infty$.     

Existence and multiplicity of weak solutions for elliptic Dirichlet problems with variable exponent

Under appropriate growth conditions on the nonlinearity, the existence of multiple solutions for nonlinear elliptic Dirichlet problems with variable exponent is established. The approach is based on variational methods. Some applications and examples illustrate the obtained results.     

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.     

A counterexample to weighted estimates for multilinear Fourier multipliers with Sobolev regularity

The problem whether the weighted estimates for multilinear Fourier multipliers with Sobolev regularity hold under weak condition on weights is considered.     

On symmetric and locally finite actions of groups on the quintic tree

In this paper, we determine all faithful, symmetric and locally finite actions of a group on the tree of valency five. As a corollary we complete the classification of the isomorphism types of vertex and edge stabilisers in a group acting symmetrically on a graph of valency five. This builds on work of Weiss and recent work of Feng, Zhou and Feng, Guo. Our approach is to classify the isomorphism types of finite, faithful amalgams of degree (5, 2).     

The primitive ideals of the Cuntz–Krieger algebra of a row-finite higher-rank graph with no sources

We catalogue the primitive ideals of the Cuntz–Krieger algebra of a row-finite higher-rank graph with no sources. Each maximal tail in the vertex set has an abelian periodicity group of finite rank at most that of the graph; the primitive ideals in the Cuntz–Krieger algebra are indexed by pairs consisting of a maximal tail and a character of its periodicity group. The Cuntz–Krieger algebra is primitive if and only if the whole vertex set is a maximal tail and the graph is aperiodic.     

An approximation of the Mumford–Shah energy by a family of discrete edge-preserving functionals

We show the Γ$\Gamma$-convergence of a family of discrete functionals to the Mumford and Shah image segmentation functional. The functionals of the family are constructed by modifying the elliptic approximating functionals proposed by Ambrosio and Tortorelli. The quadratic term of the energy related to the edges of the segmentation is replaced by a nonconvex functional.     

Generalized vector variational inequalities with star-pseudomonotone and discontinuous operators

It is well known that a vector variational inequality can be a very efficient model for use in studying vector optimization problems. By using the Ky Fan fixed point theorem and the scalarization method we will prove some existence theorems for strong solutions for generalized vector variational inequalities where discontinuous and star-pseudomonotone operators are involved. Our results can be applied to the study of the existence of solutions of vector optimal problems. Some examples are given and analyzed.     

Second-order multiobjective symmetric duality with cone constraints

In this paper, we formulate Wolfe and Mond–Weir type second-order multiobjective symmetric dual problems over arbitrary cones. Weak, strong and converse duality theorems are established under η$\eta$-bonvexity/η$\eta$-pseudobonvexity assumptions. This work also removes several omissions in definitions, models and proofs for Wolfe type problems studied in Mishra [9]. Moreover, self-duality theorems for these pairs are obtained assuming the function involved to be skew symmetric.     

Cycle-maximal triangle-free graphs

We conjecture that the balanced complete bipartite graph _{K⌊n/2⌋,⌈n/2⌉}$K_{\lfloor n/2\rfloor ,\lceil n/2\rceil }$ contains more cycles than any other n$n$-vertex triangle-free graph, and we make some progress toward proving this. We give equivalent conditions for cycle-maximal triangle-free graphs; show bounds on the numbers of cycles in graphs depending on numbers of vertices and edges, girth, and homomorphisms to small fixed graphs; and use the bounds to show that among regular graphs, the conjecture holds. We also consider graphs that are close to being regular, with the minimum and maximum degrees differing by at most a positive integer k$k$. For k=1$k=1$, we show that any such counterexamples have n≤91$n\le 91$ and are not homomorphic to _C5$C_5$; and for any fixed k$k$ there exists a finite upper bound on the number of vertices in a counterexample. Finally, we describe an algorithm for efficiently computing the matrix permanent (a #P$\#P$-complete problem in general) in a special case used by our bounds.     

Solutions to degenerate complex Hessian equations

Let (X,ω)$(X,\omega )$ be an n-dimensional compact Kähler manifold and fix an integer m   such that 1?m?n$1?m?n$. We study degenerate complex Hessian equations of the form (ω+dd^cφ)^m∧ω^n−m=F(x,φ)ωⁿ${(\omega +d{d}^c\phi )}^m\wedge {\omega }^{n-m}=F(x,\phi ){\omega }^n$. Under some natural conditions on F, this equation has a unique continuous solution. When X is homogeneous and ω is invariant under the Lie group action, we further show that the solution is Hölder continuous.     

A new parametric method for ranking fuzzy numbers

Ranking fuzzy numbers is important in decision-making, data analysis, artificial intelligence, economic systems and operations research. In this paper, to overcome the limitations of the existing studies and simplify the computational procedures an approach to ranking fuzzy numbers based on α$\alpha$-cuts is proposed. The approach is illustrated by numerical examples, showing that it overcomes several shortcomings such as the indiscriminative and counterintuitive behavior of existing fuzzy ranking approaches.