On a problem of Nirenberg concerning expanding maps

Let X be a Banach space and T:X → X a continuous map, which is expanding (i.e., ∥Tu ? Tv∥ ? ∥u ? v∥ for all u, v?X) and such that T(X) has a nonempty interior. Does this guarantee that T is onto? We give a counterexample in the case of X=L¹(N).     

Infinitely many non-radial solutions for fractional Nirenberg problem

In this paper, the prescribed \(\sigma \)-curvature problem

$$\begin{aligned} P_{\sigma }^{g_0} u={\tilde{K}}(x)u^{\frac{N+2\sigma }{N-2\sigma }}, x\in {\mathbb {S}}^N,u>0 \end{aligned}$$

is considered. When \({\tilde{K}}(x)\) is some axis symmetric function on \({\mathbb {S}}^N\), by using singular perturbation method, it is proved that this problem possesses infinitely many non-radial solutions for \(0<\sigma \le 1\) and \(N> 2\sigma +2\).

     

Curvature estimates for the Ricci flow II

In this paper we present several curvature estimates and convergence results for solutions of the Ricci flow, including the volume normalized Ricci flow and the normalized Kähler-Ricci flow. The curvature estimates depend on smallness of certain local space-time integrals of the norm of the Riemann curvature tensor, while the convergence results require finiteness of space-time integrals of this norm. These results also serve as characterization of blow-up singularities.     

Curvature estimates for the Ricci flow I

In this paper we present several curvature estimates for solutions of the Ricci flow and the modified Ricci flow (including the volume normalized Ricci flow and the normalized Kähler-Ricci flow), which depend on the smallness of certain local \(L^{\frac{n}{2}}\) integrals of the norm of the Riemann curvature tensor |Rm|, where n denotes the dimension of themanifold. These local integrals are scaling invariant and very natural.     

Curvature integrals under the Ricci flow on surfaces

In this paper, we consider the behavior of the total absolute and the total curvature under the Ricci flow on complete surfaces with bounded curvature. It is shown that they are monotone non-increasing and constant in time, respectively, if they exist and are finite at the initial time. As a related result, we prove that the asymptotic volume ratio is constant under the Ricci flow with non-negative Ricci curvature, at the end of the paper.      

A flow method to the Orlicz-Aleksandrov problem

In this paper, we obtain an existence result of smooth solutions to the Orlicz-Aleksandrov problem from the perspective of geometric flow. Furthermore, a special uniqueness result of solutions to this problem shall be discussed.     

Correction to: Using the minimum maximum flow degree to approximate the flow coloring problem

Annals of Operations Research -     

Solving the resource constrained deadline scheduling problem via reduction to the network flow problem

In this paper the problem of the equivalence of scheduling tasks on processors with the presence of deadlines and additional resources and the network flow problem is studied. This equivalence permits it to be proven that the problem of finding a maximal flow in a binary network with multipliers equal to 1 or 2 is NP-complete.     

An algorithm to solve the proportional network flow problem

The proportional network flow problem is a generalization of the equal flow problem on a generalized network in which the flow on arcs in given sets must all be proportional. This problem appears in several natural contexts, including processing networks and manufacturing networks. This paper describes a transformation on the underlying network that reduces the problem to the equal flow problem; this transformation is used to show that algorithms that solve the equal flow problem can be directly applied to the proportional network flow problem as well, with no increase in asymptotic running time. Additionally, computational results are presented for the proportional network flow problem demonstrating equivalent performance to the same algorithm for the equal flow problem.     

Curvature flow of complete hypersurfaces in hyperbolic space

In this paper we continue our study of finding the curvature flow of complete hypersurfaces in hyperbolic space with a prescribed asymptotic boundary at infinity. Our main results are proved by deriving a priori global gradient estimates and C ² estimates.     

Multicommodity flow problem

The problem of nonmixing multicommodity flow is investigated. The theorem on the number of nonmixing flows of different commodities passing simultaneously through an oriented network is proved.Translated from Dinamicheskie Sistemy, No. 5, pp. 95–97, 1986.     

Curvature flow with driving force on fixed boundary points

In this paper, we consider the curvature flow with driving force on fixed boundary points in the plane. We give a general local existence and uniqueness result of this problem with \(C^2\) initial curve. For a special family of initial curves, we classify the solutions into three categories. Moreover, in each category, the asymptotic behavior is given.     

Curvature bounds by isoperimetric comparison for normalized Ricci flow on the two-sphere

We prove a comparison theorem for the isoperimetric profiles of solutions of the normalized Ricci flow on the two-sphere: If the isoperimetric profile of the initial metric is greater than that of some positively curved axisymmetric metric, then the inequality remains true for the isoperimetric profiles of the evolved metrics. We apply this using the Rosenau solution as the model metric to deduce sharp time-dependent curvature bounds for arbitrary solutions of the normalized Ricci flow on the two-sphere. This gives a simple and direct proof of convergence to a constant curvature metric without use of any blowup or compactness arguments, Harnack estimates, or any classification of behaviour near singularities.     

Inverse minimum flow problem

In this paper we consider the inverse minimum flow (ImF) problem, where lower and upper bounds for the flow must be changed as little as possible so that a given feasible flow becomes a minimum flow. A linear time and space method to decide if the problem has solution is presented. Strongly and weakly polynomial algorithms for solving the ImF problem are proposed. Some particular cases are studied and a numerical example is given.     

The quickest flow problem

Consider a network =(G, c, ) whereG=(N, A) is a directed graph andc _ij and _ij , respectively, denote the capacity and the transmission time of arc (i, j) A. The quickest flow problem is then to determine for a given value the minimum numberT() of time units that are necessary to transmit (send) units of flow in from a given sources to a given sinks.In this paper we show that the quickest flow problem is closely related to the maximum dynamic flow problem and to linear fractional programming problems. Based on these relationships we develop several polynomial algorithms and a strongly polynomial algorithm for the quickest flow problem.Finally we report computational results on the practical behaviour of our metholds. It turns out that some of them are practically very efficient and well-suited for solving large problem instances.Partial financial support by the Air Force Office of Scientific Research under grants AFOSR-89-0512 and AFOSR-90-0008 is gratefully acknowledged by the first author.     

Curvature flow with a general forcing term in Euclidean spaces

We consider closed convex hypersurfaces moving in Euclidean spaces with normal velocity equal to h−F, where h=h(t) is a nonnegative continuous function of t and F is evaluated at the principal curvatures and satisfies the standard conditions. We study long time existence and convergence of the evolving hypersurfaces in three different cases, which include Andrews' contractive case, McCoy's mixed volume preserving case and the additional expanding case.     

Asymptotic Estimates for Gagliardo–Nirenberg Embedding Constants

Sharp asymptotic information is determined for the Gagliardo–Nirenberg embedding constants in high dimension. This analysis is motivated by the earlier observation that the logarithmic Sobolev inequality controls the Nash inequality. Moreover, one sees here that Hardy's inequality can be interpreted as the asymptotic limit of the logarithmic Sobolev inequality.     

Bilevel programming approach applied to the flow shop scheduling problem under fuzziness

This paper presents a fuzzy bilevel programming approach to solve the flow shop scheduling problem. The problem considered here differs from the standard form in that operators are assigned to the machines and imposing a hierarchy of two decision makers with fuzzy processing times. The shop owner considered higher level and assigns the jobs to the machines in order to minimize the flow time while the customer is the lower level and decides on a job schedule in order to minimize the makespan. In this paper, we use the concepts of tolerance membership function at each level to define a fuzzy decision model for generating optimal (satisfactory) solution for bilevel flow shop scheduling problem. A solution algorithm for solving this problem is given. Mathematics Subject Classification: 90C70, 90B36, 90C99     

The flow circulation sharing problem

The flow circulation sharing problem is defined as a network flow circulation problem with a maximin objective function. The arcs in the network are partitioned into regular arcs and tradeoff arcs where each tradeoff arc has a non-decreasing tradeoff function associated with it. All arcs have lower and upper bounds on their flow while the value of the smallest tradeoff function is maximized. The model is useful in equitable resource allocation problems over time which is illustrated in a coal strike example and a submarine assignment example. Some properties including optimality conditions are developed. Each cut in the network defines a knapsack sharing problem which leads to an optimality condition similar to the max flow/min cut theorem. An efficient algorithm for both the continuous and integer versions of the flow circulation sharing problem is developed and computational experience given. In addition, efficient algorithms are developed for problems where some of the arcs have infinite flow upper bounds.