On Tutte polynomial expansion formulas in perspectives of matroids and oriented matroids

We introduce the active partition of the ground set of an oriented matroid perspective (or morphism, or quotient, or strong map) on a linearly ordered ground set. The reorientations obtained by arbitrarily reorienting parts of the active partition share the same active partition. This yields an equivalence relation for the set of reorientations of an oriented matroid perspective, whose classes are enumerated by coefficients of the Tutte polynomial, and a remarkable partition of the set of reorientations into Boolean lattices, from which we get a short direct proof of a 4-variable expansion formula for the Tutte polynomial in terms of orientation activities. This formula was given in the last unpublished preprint by Michel Las Vergnas; the above equivalence relation and notion of active partition generalize a former construction in oriented matroids by Michel Las Vergnas and the author; and the possibility of such a proof technique in perspectives was announced in the aforementioned preprint. We also briefly highlight how the 5-variable expansion of the Tutte polynomial in terms of subset activities in matroid perspectives comes in a similar way from the known partition of the power set of the ground set into Boolean lattices related to subset activities (and we complete the proof with a property which was missing in the literature). In particular, the paper applies to matroids and oriented matroids on a linearly ordered ground set, and applies to graph and directed graph homomorphisms on a linearly ordered edge-set.     

一些稀疏图的强边染色（英文）

图G的强边染色是指对图G进行正常边染色使得任意长度为3的路的三条边染不同的颜色.图G的强边色数,记为χ’_s(G),是使得图G是强k边着色的最小正整数kk.2015年,Zang [arXiv:1510.00785]证明了:最大度△(G)=5的图G,χ’_s(G)≤37.本文证明了:最大度△(G)=5且最大平均度小于8/3(或者14/5)的图G,χ’_s(G)≤13 (或者14).另外,本文证明了:最大度△(G)≥3的不含K_2,3-图子式的图G,χ’_s(G)≤4△(G)-6,这个界是紧的.     

On stability concepts in nonlinear programming

Kojima's strong stability of stationary solutions can be characterized by means of first and second order terms. We treat the problem whether there is a characterization of the stability concept allowing perturbations of the objective function only, keeping the feasible set unchanged. If the feasible set is a convex polyhedron, then there exists a characterization which is in fact weaker than that one of strong stability. However, in general it appears that data of first and second order do not characterize that kind of stability. As an interpretation we have that the strong stability is the only concept of stability which both admits a characterization and works for large problem classes.Supported by the Deutsche Forschungsgemeinschaft, Graduiertenkolleg Analyse und Konstruktion in der Mathematik.Partial support under Support Center for Advanced Telecommunications Technology Research.     

Dynamic complexity of optimal paths and discount factors for strongly concave problems

We study the relationship between the dynamical complexity of optimal paths and the discount factor in general infinite-horizon discrete-time concave problems. Given a dynamic systemx _t+1=h(x _t ), defined on the state space, we find two discount factors 0 < ^{* **} < 1 having the following properties. For any fixed discount factor 0 < < ^*, the dynamic system is the solution to some concave problem. For any discount factor ^** < < 1, the dynamic system is not the solution to any strongly concave problem. We prove that the upper bound ^** is a decreasing function of the topological entropy of the dynamic system. Different upper bounds are also discussed.This research was partially supported by MURST, National Group on Nonlinear dynamics in Economics and Social Sciences. The author would like to thank two anonymous referees for helpful comments and suggestions.     

Retrieval and chaos in extremely dilutedQ-Ising neural networks

Using a probabilistic approach, the deterministic and the stochastic parallel dynamics of aQ-Ising neural network are studied at finiteQ and in the limitQ. Exact evolution equations are presented for the first time-step. These formulas constitute recursion relations for the parallel dynamics of the extremely diluted asymmetric versions of these networks. An explicit analysis of the retrieval properties is carried out in terms of the gain parameter, the loading capacity, and the temperature. The results for theQ network are compared with those for theQ=3 andQ=4 models. Possible chaotic microscopic behavior is studied using the time evolution of the distance between two network configurations. For arbitrary finiteQ the retrieval regime is always chaotic. In the limitQ the network exhibits a dynamical transition toward chaos.     

The strong coupling constant: Its theoretical derivation from a geometric approach to hadron structure

Since more than a decade, abi-scale, unified approach to strong and gravitational interactions has been proposed, that uses the geometrical methods of general relativity, and yielded results similar to strong gravity theory's. We fix our attention, in this note, on hadron structure, and show that also the strong interaction strength _S, ordinarily called the (perturbative) coupling-constant square, can be evaluated within our theory, and found to decrease (increase) as the distancer decreases (increases). This yields both the confinement of the hadron constituents (for large values ofr) and their asymptotic freedom (for small values ofr inside the hadron): in qualitative agreement with the experimental evidence. In other words, our approach leads us, on a purely theoretical ground, to a dependence of _S onr which had been previously found only on phenomenological and heuristic grounds. We expect the above agreement to be also quantitative, on the basis of a few checks performed in this paper, and of further work of ours on calculating meson mass spectra.     

A strong limit theorem for generalized Cantor-like random sequences

ＡＳＴＲＯＮＧＬＩＭＩＴＴＨＥＯＲＥＭＦＯＲＧＥＮＥＲＡＬＩＺＥＤＣＡＮＴＯＲ－ＬＩＫＥ　ＲＡＮＤＯＭ　ＳＥＱＵＥＮＣＥＳＬＩＵＷＥＮ（刘文）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓａｎｄＰｈｙｓｉｃｓ,ＨｅｂｅｉＵｎｉｖｅｒｓｉｔｙｏｆＴｅ...     

Chapter 15 DEA/AR analysis of the 1988–1989 performance of the Nanjing textiles corporation

This article employs new data envelopment analysis/assurance region (DEA/AR) methods to evaluate the efficiency of the 35 textile factories of the Nanjing Textiles Corporation (NTC), Nanjing, China. The returns to scale (RTS) of these factories were studied without assuming that the optimal DEA solutions were unique. All DMUs are identified with pointsE (Extreme Efficient),E (Efficient but not an extreme point) andF (Frontier but not efficient). We then further identify the nonfrontier DMUs with pointsNE, NE andNF according to whether they are projected onto a point inE, E, orF en route to evaluating their performances. All of the inefficient factories were in classNF and had unique optimal primal-dual solution pairs. Consequently, the solution pairs satisfy the strong complementary slackness condition (SCSC). Application of cone-ratio (CR) ARs reduced significantly the number of factories in classE, and showed that some AR-efficient factories were more flexible in adopting the mixture of central planning and market economies that China currently is trying to use. Also, linked-cone (LC) ARs were applied to measure maximum and minimum profit ratios. The SCSC multiplier space approach was utilized to analyze the sensitivity of the efficiency results to potential errors in the data with and without ARs. The results in this article suggest that collective units had a better performance than state-owned units in the two consecutive years analyzed.This paper was written while the author was at the School of Economics and Management, Southeast University, Nanjing 210018, P.R. China.     

The law of the solution to a nonlinear hyperbolicSPDE

Let { _s,t ,(s,t ₊ ² } be a white noise on ₊ ² . We consider the hyperbolic stochastic partial differential equation {ie863-3} The purpose of this paper is to study the law of the solution to this equation. We analyze the existence and smoothness of the density using the tools of Malliavin Calculus. Finally we prove a large deviation principle on the space of continuous functions, for the family of probabilities obtained by perturbation of the noise in the equation.This work has been partially supported by the grant of the DGICYT No. PB 930052 and the EU Science project CT 910459.     

Chains of strongly non-reflexive dual groups of integer-valued continuous functions

Answering a question of Eklof-Mekler (Almost free modules, set-theoretic methods, North-Holland, Amsterdam, 1990), we prove: (1) If there exists a non-reflecting stationary set of consisting of ordinals of cofinality for each , then there exist abelian groups such that and for each . (2) There exist abelian groups such that for each and for each . The groups are the groups of -valued continuous functions on a topological space and their dual groups.