HAJóS'''' CONJECTURE AND CONNECTIVITY OF EULERIAN GRAPHS

Hajos' conjecture asserts that a simple eulerian graph on n vertices can be decomposed into at most n-1/2 circuits. In this paper, we propose a new conjecture which is equivalent to Hajos' conjecture, and show that to prove Hajos' conjecture, it is sufficient to prove this new conjecture for 3-connected graphs. Furthermore, a special 3-cut is considered also.     

On the nonexistence of nontrivial small cycles of the µ function in 3x+1 conjecture

This paper studies the property of the recursive sequences in the 3x+ 1 conjecture.The authors introduce the concept ofμfunction,with which the 3x + 1 conjecture can be transformed into two other conjectures:one is eventually periodic conjecture of theμfunction and the other is periodic point conjecture.The authors prove that the 3x + 1 conjecture is equivalent to the two conjectures above.In 2007,J.L.Simons proved the non-existence of nontrivial 2-cycle for the T function.In this paper,the authors prove that theμfunction has no l-periodic points for 2≤l≤12.In 2005, J.L.Simons and B.M.M de Weger proved that there is no nontrivial 2-cycle for the T function for l≤68,and in this paper,the authors prove that there is no nontrivial l-cycle for theμfunction for 2≤l≤102.     

The Log-Concavity of Kazhdan-Lusztig Polynomials of Uniform Matroids

Elias, et al.(2016) conjectured that the Kazhdan-Lusztig polynomial of any matroid is logconcave. Inspired by a computer proof of Moll’s log-concavity conjecture given by Kauers and Paule,the authors use a computer algebra system to prove the conjecture for arbitrary uniform matroids.     

The Irregular Linear Quadratic Control Problem for Deterministic Case with Time Delay

This study deals with the irregular linear quadratic control problem governed by continuous time system with time delay. Linear quadratic(LQ) control for irregular Riccati equation with time delay remains challenging since the controller could not be solved from the equilibrium condition directly. The merit of this paper is that based on a new approach of ‘two-layer optimization', the controller entries of irregular case with time delay are deduced from two equilibrium conditions in two different layers, which is fundamentally different from the classical regular LQ control. The authors prove that the irregular LQ with time delay is essentially different from the regular case. Specifically,the predictive controller bases on the feedback gain matrix and the state is given in the last part. The presented conclusions are completely new to our best knowledge. Examples is presented to show the effectiveness of the proposed approach.     

On functional decomposition of multivariate polynomials with differentiation and homogenization

This paper gives a theoretical analysis for the algorithms to compute functional decomposition for multivariate polynomials based on differentiation and homogenization which were proposed by Ye,Dai,and Lam(1999) and were developed by Faugere,Perret(2006,2008,2009).The authors show that a degree proper functional decomposition for a set of randomly decomposable quartic homogenous polynomials can be computed using the algorithm with high probability.This solves a conjecture proposed by Ye,Dai,and Lam(1999).The authors also propose a conjecture which asserts that the decomposition for a set of polynomials can be computed from that of its homogenization and show that the conjecture is valid with high probability for quartic polynomials.Finally,the authors prove that the right decomposition factors for a set of polynomials can be computed from its right decomposition factor space.     

EDGE RECONSTRUCTION OF PLANAR GRAPHS WITH MINIMUM DEGREE AT LEAST THREE-(Ⅰ)

The object of this series of papers is to show that every planar graph ofminimum degree at least 3 is edge reconstructible. In this paper, we prove that such agraph with connectivity 2 is edge reconstructible.     

A novel mixed integer programming formulation and progressively stochastic search for capacitated lot sizing

The capacitated multi-level lot sizing problem is to schedule a number of different items with a bill-of-materials structure over a horizon of finite periods.To advance techniques of solving this class of problems,this paper proposes a new mixed integer programming formulation.Theoretical proofs and computational tests are provided to show that this formulation is able to provide better linear programming relaxation lower bounds than a previously-proposed strong mixed integer programming formulation.Based on the new strong formulation,a progressively stochastic search approach is proposed for solving the problem.Computational results showed that the approach generates high quality solutions,especially for problems of large sizes.     

ON LOCAL STABILIZATION OF NONLINEAR CONTROL SYSTEMS

Based on the notion of maximal absolute observability and its normalforms,a new method for studying the local stabilization for a kind of nonlinearcontrol systems is established.Different from the previous results given by Byrnes-Isitori and others,this new method can deal with more general systems,and hasmuch simpler way to prove the stabilization conditions and to design the feedbacklaws.     

CONVOLUTION THEOREM AND ASYMPTOTIC EFFICIENCY IN TWO SIDE TRUNCATED DISTRIBUTION FAMILY—THE NORMAL CASE

In the distribution family with common support and the one side truncated distribution family, Bickle, I. A. Ibragimov and R. Z. Hasminskii proved two important convolution theorems. As to the two-side truncated case, we also proved a convolution theorem, which plays an extraordinary role in the efficiency theory. In this paper, we will study another kind of two-side truncated distribution family, and prove a convolution result with normal form. On the basis of this convolution result, a new kind of efficiency concept is given; meanwhile, we will show that MLE is an efficient estimate in this distribution family.     

THE LINEAR ARBORICITY 0F COMPOSITl0N GRAPHS

The linear arboricity la(G) of a graph G is the minimum number of linear forests which partition the edges of G.Akiyama,Exoo and Harary conjectured that la(G)=[Δ（G） 1/2] for any regular graph G.In this papedr,we prove the conjecture for some composition graphs,in particular,forcomplets multipartite graphs.     

A New Criterion for Environmental Risk Management of Multiplication Processes

This paper aims to propose ERT （Expected Reaching Time）, a new risk adverse evaluation criterion of finite multiplication processes, and to examine its properties in relation to the dominance criterion. The ERT means the expected time that takes for an objective valiable to reach a target value. To deal with the environmental risk involved in the process, the expectation maximizing strategy may be the most well known. However, for many cases the dominance strategy rather than the expectation maximizing strategy is adopted and works very well. In this paper we first prove rigorously that minimization of the ERT is equivalent to the dominance criterion in the infinite period. Then we demonstrate by simulation that the ERT gives almost equal evaluation as the dominance criterion even for the finite multiplications, after showing that it is approximately proportional to the logarithm of the target value.     

THE LINEAR ARBORICITY OF COMPOSITION GRAPHS

The linear arboricity la(G) of a graph G is the minimum number of linear forests which partition the edges of G. Akiyama, Exoo and Harary conjectured that la(G) = [△(G) 1/2] for any regular graph G. In this paper, we prove the conjecture for some composition graphs, in particular, for complete multipartite graphs.     

STRONG EMBEDDING OF HP-GRAPHS ON SURFACE WITH HIGHER GENUS

In 1990, Bondy posed the small circuit double cover （SCDC） conjecture： Every 2-connected graph has a circuit double cover （CDC） with the number of circuits less than ｜v｜ （the order of the vertex set V）. The strong embedding conjecture states that every 2-connected graph has a strong embedding on some surface in which the boundary of each face is a circuit. In this paper, HP-graph is defined as the graph which has a strong embedding on the projective plane with one face of valence ｜V｜ and the other faces of valence 3. And it is proved that the HP-graph has a strong embedding with ｜V｜ - 1 or less faces on some surface, which confirms both the SCDC conjecture and the strong embedding conjecture.     

Distributed localization for anchor-free sensor networks

Geographic location of nodes is very useful in a sensor network. Previous localization algorithms assume that there exist some anchor nodes in this kind of network, and then other nodes are estimated to create their coordinates. Once there are not anchors to be deployed, those localization algorithms will be invalidated. Many papers in this field focus on anchor-based solutions. The use of anchors introduces many limitations, since anchors require external equipments such as global position system, cause additional power consumption. A novel positioning algorithm is proposed to use a virtual coordinate system based on a new concept--virtual anchor. It is executed in a distributed fashion according to the connectivity of a node and the measured distances to its neighbors. Both the adjacent member information and the ranging distance result are combined to generate the estimated position of a network, one of which is independently adopted for localization previously. At the position refinement stage the intermediate estimation of a node begins to be evaluated on its reliability for position mutation; thus the positioning optimization process of the whole network is avoided falling into a local optimal solution. Simulation results prove that the algorithm can resolve the distributed localization problem for anchor-free sensor networks, and is superior to previous methods in terms of its positioning capability under a variety of circumstances.     

SIMPLE COMPUTING OF THE CUSTOMER LIFETIME VALUE:A FIXED LOCAL-OPTIMAL POLICY APPROACH

In this paper,we present a new method for finding a fixed local-optimal policy for computing the customer lifetime value.The method is developed for a class of ergodic controllable finite Markov chains.We propose an approach based on a non-converging state-value function that fluctuates（increases and decreases） between states of the dynamic process.We prove that it is possible to represent that function in a recursive format using a one-step-ahead fixed-optimal policy.Then,we provide an analytical formula for the numerical realization of the fixed local-optimal strategy.We also present a second approach based on linear programming,to solve the same problem,that implement the c-variable method for making the problem computationally tractable.At the end,we show that these two approaches are related：after a finite number of iterations our proposed approach converges to same result as the linear programming method.We also present a non-traditional approach for ergodicity verification.The validity of the proposed methods is successfully demonstrated theoretically and,by simulated credit-card marketing experiments computing the customer lifetime value for both an optimization and a game theory approach.     

THE CONNECTIVITY OF MAXIMUM MATCHING GRAPHS

The maximum matching graph of a graph has a vertex for each maximummatching and an edge for each pair of maximum matchings which differ by exactly oneedge. In this paper, we prove that the connectivity of maximum matching graph of abipartite graph is equal to its minimum degree.     

PROBABILITY CRITERION IN INVENTORY SYSTEMS

In this paper, we develop a new probability criterion which is to minimize thesum of all probabilities that the inventory at the end of each stage exceeds a fixed level. Itis shown that the optimal order policy is simoly characterized by a certain critical numberwhen the demand density is a Polya frequency function. Finally, a similar result is givenin the case of λ periods lag in supply.     

A line search filter secant method for nonlinear equality constrained optimization

<正> This paper formulates and analyzes a line search method for general nonlinear equalityconstrained optimization based on filter methods for step acceptance and secant methods for searchdirection.The feature of the new algorithm is that the secant algorithm is used to produce a searchdirection,a backtracking line search procedure is used to generate step size,some filtered rules areused to determine step acceptance,second order correction technique is used to reduce infeasibility andovercome the Maratos effect.Global convergence properties of this method are analyzed:under mildassumptions it is showed that every limit point of the sequence of iterates generated by the algorithmis feasible,and that there exists at least one limit point that is a stationary point for the problem.Moreover,it is also established that the Maratos effect can be overcome in our new approach by addingsecond order correction steps so that fast local superlinear convergence to a second order sufficient localsolution is achieved.Finally,the results of numerical experiments are reported to show the effectivenessof the line search filter secant method.     

ASYMPTOTIC PROPERTY OF THE TIME-DEPENDENT SOLUTION OF A RELIABILITY MODEL

We discuss a transfer line consisting of a reliable machine, an unreliable machine and a storage buffer. This transfer line can be described by a group of partial differential equations with integral boundary conditions. First we show that the operator corresponding to these equations generates a positive contraction C0-semigroup T(t), and prove that T(t) is a quasi-compact operator. Next we verify that 0 is an eigenvalue of this operator and its adjoint operator with geometric multiplicity one. Last, by using the above results we obtain that the time-dependent solution of these equations converges strongly to their steady-state solution.     

Hilbert Problem 15 and Ritt-Wu Method(Ⅰ)

Hilbert problem 15 requires to understand Schubert's book. In this book, there is a theorem in §23, about the relation of the tangent lines from a point and the singular points of cubed curves with cusp near a 3-multiple straight line, which was obtained by the so called main trunk numbers, while for these numbers, Schubert said that he obtained them by experiences. So essentially Schubert even did not give any hint for the proof of this theorem. In this paper, by using the concept of generic point in the framework of Van der Waerden and Weil on algebraic geometry, and realizing Ritt-Wu method on computer, the authors prove that this theorem of Schubert is completely right.