A constructive characterization of the split closure of a mixed integer linear program

Two independent proofs of the polyhedrality of the split closure of mixed integer linear program have been previously presented. Unfortunately neither of these proofs is constructive. In this paper, we present a constructive version of this proof. We also show that split cuts dominate a family of inequalities introduced by Köppe and Weismantel.     

三种群食物链交错扩散模型的整体

本文应用能量估计方法和Gagliardo-Nirenberg型不等式证明了一类强耦合反应扩散系统整体解的存在性和一致有界性，该系统是带自扩散和交错扩散项的三种群Lotka-Volterra食物链模型．通过构造Lyapunov函数给出了该模型正平衡点全局渐近稳定的充分条件．     

Optimal Investment in a Levy Market

In this paper we consider the optimal investment problem in a market where the stock price process is modeled by a geometric Levy process (taking into account jumps). Except for the geometric Brownian model and the geometric Poissonian model, the resulting models are incomplete and there are many equivalent martingale measures. However, the model can be completed by the so-called power-jump assets. By doing this we allow investment in these new assets and we can try to maximize the expected utility of these portfolios. As particular cases we obtain the optimal portfolios based in stocks and bonds, showing that the new assets are superfluous for certain martingale measures that depend on the utility function we use.     

空气比热容比实验的非绝热问题

通过一系列的实验数据分析，发现空气比热容比实验中非绝热现象不可以忽略．     

Hydrodynamical limit for a drift-diffusion system modeling large-population dynamics

In this paper we study the stability of the following nonlinear drift-diffusion system modeling large population dynamics ∂_tρ+div(ρU−ε∇ρ)=0, divU=±ρ, with respect to the viscosity parameter ε. The sign in the second equation depends on the attractive or repulsive character of the field U. A proof of the compactness and convergence properties in the vanishing viscosity regime is given. The lack of compactness in the attractive case is caused by the blow-up of the solution which depends on the mass and on the space dimension. Our stability result is connected, depending of the character of the potentials, with models in semiconductor theory or in biological population.     

Vassiliev invariants for braids on surfaces

We show that Vassiliev invariants separate braids on a closed oriented surface, and we exhibit a universal Vassiliev invariant for these braids in terms of chord diagrams labeled by elements of the fundamental group of the surface.

     

Upper and lower bounds for the energy of bipartite graphs

Using Lagrange's multiplier rule, we find upper and lower bounds of the energy of a bipartite graph G, in terms of the number of vertices, edges and the spectral moment of fourth order. Moreover, the upper bound is attained in a graph G if and only if G is the graph of a symmetric balanced incomplete block design (BIBD). Also, we determine the graphs for which the lower bound is sharp.     

The Computational Complexity of the Chow Form

We present a bounded probability algorithm for the computation of the Chowforms of the equidimensional components of an algebraic variety. In particular, this gives an alternative procedure for the effective equidimensional decomposition of the variety, since each equidimensional component is characterized by its Chow form. The expected complexity of the algorithm is polynomial in the size and the geometric degree of the input equation system defining the variety. Hence it improves (or meets in some special cases) the complexity of all previous algorithms for computing Chow forms. In addition to this, we clarify the probability and uniformity aspects, which constitutes a further contribution of the paper. The algorithm is based on elimination theory techniques, in line with the geometric resolution algorithm due to M. Giusti, J. Heintz, L. M. Pardo, and their collaborators. In fact, ours can be considered as an extension of their algorithm for zero-dimensional systems to the case of positive-dimensional varieties. The key element for dealing with positive-dimensional varieties is a new Poisson-type product formula. This formula allows us to compute the Chow form of an equidimensional variety from a suitable zero-dimensional fiber. As an application, we obtain an algorithm to compute a subclass of sparse resultants, whose complexity is polynomial in the dimension and the volume of the input set of exponents. As another application, we derive an algorithm for the computation of the (unique) solution of a generic overdetermined polynomial equation system.     

Heuristic Algorithms and Scatter Search for the Cardinality Constrained P||Cmax Problem

We consider the generalization of the classical P||C_max problem (assign n jobs to m identical parallel processors by minimizing the makespan) arising when the number of jobs that can be assigned to each processor cannot exceed a given integer k. The problem is strongly NP-hard for any fixed k > 2. We briefly survey lower and upper bounds from the literature. We introduce greedy heuristics, local search and a scatter search approach. The effectiveness of these approaches is evaluated through extensive computational comparison with a depth-first branch-and-bound algorithm that includes new lower bounds and dominance criteria.     

Letter: Models of Relativistic Particle with Curvature and Torsion Revisited

Models, describing relativistic particles, where Lagrangian densities depend linearly on both the curvature and the torsion of the trajectories, are revisited in D=3 space forms. The moduli spaces of trajectories are completely and explicitly determined using the Lancret program. The moduli subspaces of closed solitons in the three sphere are also determined.