On the joint characterization of the distributions of the true income and the proportion of the reported income to the true income through a model of under-reported incomes

In this note, we assume that the reported income is related to the true income by the so-called ‘error-in-variables’ model, a model which assumes that the observed incomes are under-reported. In the context of this model, the distribution of the reported income suitably truncated below coincides with that of the true income, and suitable truncated above with that of the random proportion of the reported income to the true income if, and only if, the distribution of the true income is Pareto and that of the proportion is of the power function form.     

On the local semiconcavity of the solutions of the eikonal equation

We show that if the Hamiltonian is locally semiconvex with respect to the state variables and strictly convex with respect to the gradient then every viscosity solution of the eikonal equation is locally semiconcave. Furthermore, in the 1D case, we show that every viscosity solution of the eikonal equation is semiconcave if and only if the Hamiltonian is Lipschitz continuous with respect to the state variable.     

On the regularity of the solution of the biharmonic variational inequality

It is shown that the solution of the biharmonic variational inequality has bounded second derivatives provided that the obstacle and the data are smooth.During the preparation of a portion of the paper, the author was a guest of the Scuola Normale Superiore in Pisa, supported by the German Research Association (DFG).     

指数型一次Logistic迭代方程解的周期倍分岔现象

本文讨论了指数型一次Ｌｏｇｉｓｔｉｃ迭代方程解的周期倍分岔现象的存在性,给出了周期倍分合时的临界点参数应满足的方程,并证明了周期倍分岔的临界点参数序列的极限是存在的,进而证明了当参数越过这个极限时,指数型一次 Ｌｏｇｉｓｔｉｃ迭代方程存在混沌解．     

On the lack of null-controllability of the heat equation on the half-line

We consider the linear heat equation on the half-line with a Dirichlet boundary control. We analyze the null-controllability problem. More precisely, we study the class of initial data that may be driven to zero in finite time by means of an appropriate choice of the boundary control. We rewrite the system on the similarity variables that are a common tool when analyzing asymptotic problems. Next, the control problem is reduced to a moment problem which turns out to be critical since it concerns the family of real exponentials in which the usual summability condition on the inverses of the eigenvalues does not hold. Roughly speaking, we prove that controllable data have Fourier coefficients that grow exponentially for large frequencies. This result is in contrast with the existing ones for bounded domains that guarantee that every initial datum belonging to a Sobolev space of negative order may be driven to zero in an arbitrarily small time.

     

用模糊数学方法刻划公众对天气预报的感受度

气象部门将6小时的降雨按降雨量划分为无雨、小雨、中雨、大雨、暴雨、大暴雨及特大暴雨七个级别进行预报,这与公众感受认可这些降雨量级别的程度是有差异的.即使气象部门预报的很准,这种差异有可能使公众感受到降雨级别的程度和预报的级别不符,从而认为预报得不准确,用模糊数学的方法对公众的感受度进行了刻划,给出了计算预报数据与公众感受度差异的数值公式及方法.     

用常微分方程模型分析预防和隔离措施对SARS发病率的影响

通过建立常微分方程模型 ,分析了预防和隔离措施对 SARS发病率的影响 ,并把计算结果与实际统计数据进行了比较 ,结果表明 ,及时高效的预防和隔离措施能够有效地控制 SARS的传播 .     

Geometric demonstration of the fundamental theorems of the calculus

After the monumental discovery of the fundamental theorems of the calculus nearly 350 years ago, it became possible to answer extremely complex questions regarding the natural world. Here, a straightforward yet profound demonstration, employing geometrically symmetric functions, describes the validity of the general power rules for integration and differentiation. Differentiation and integration are readily seen to be reverse operations that compute slopes and under-areas of curves, without requiring tedious infinitesimal limits or infinite summation algebraic procedures. The areas under any two symmetric curves within a square combine to equal its square measure. Corresponding evaluated integrals of any symmetric pair were also found to add to that same area. The general power rules and the fundamental theorems are confirmed for an infinite number of functions containing exponents from the entire real number line, rational or irrational. Any particular equation represents the slope of its own under-area formula, as first discovered by Isaac Newton, where the rate that area accumulates at a point under a curve, traced at constant horizontal velocity, is the value of the curve at that point. Applications of the calculus in mathematics, physics and chemistry elucidated the orbital structure of the atom, vast scientific formula and secrets of the nature of light and gravity.     

Quantum walks and the size of the graph

A continuous-time quantum walk is modelled using a graph. In this short paper, we provide lower bounds on the size of a graph that would allow for some quantum phenomena to occur. Among other things, we show that, in the adjacency matrix quantum walk model, the number of edges is bounded below by a cubic function on the eccentricity of a periodic vertex. This gives some idea on the shape of a graph that would admit periodicity or perfect state transfer. We also raise some extremal type of questions in the end that could lead to future research.     

On the non-emptiness of the one-core and the bargaining set of committee games

We study the committee decision making process using game theory. Shenoy  [15] introduced two solution concepts: the one-core and the bargaining set, and showed that the one-core of a simple committee game is nonempty if there are at most four players. We extend this result by proving that whether the committee is simple or not, as far as there are less than five players, the one-core is nonempty. This result also holds for the bargaining set.     

On the determination of the control parameters of the optimal can-order policy

This paper considers the well-known class of can-order policies. This type of coordinated replenishment policies accounts for a joint set-up cost structure, where a major set-up cost is incurred for any order and an individual minor set-up cost is charged for each item in the replenishment. Recent comparative studies have pointed out that the performance of the optimal can-order policy is poor, compared to other coordinated replenishment strategies, when the major set-up cost is high. This paper shows that it is the approximate decomposition method to calculate the optimal canorder parameters which performs bad in such situations and not the policy itself. Attention is focused to a subclass of can-order policies, which is close to the optimal can-order policy for high major set-up costs. A solution procedure is developed to calculate the optimal control parameters of this policy. It is shown that a properly chosen combination of the solution procedures to calculate can-order parameters leads to a can-order strategy which performs as well as other coordinated replenishment policies.     

考虑废旧品质量的闭环供应链混合回收渠道选择研究

为确定最优的回收渠道,对由单个制造商、零售商和第三方组成的闭环供应链系统进行研究。在该系统中,可能存在制造商和零售商、制造商和第三方、零售商和第三方以及制造商、零售商和第三方同时回收的四种渠道,并根据质量差异对废旧品进行翻新或再制造。在分散决策下建立了四种回收渠道模型。比较发现:站在制造商和系统收益最大化及社会效益角度,三渠道是最佳选择,此时得到的废旧品最多;制造商不进行回收时获利最低,且不利于提高废旧品的获取量。最后,通过算例剖析了废旧品再制造率对四种混合回收渠道下成员及系统利润的影响。结果表明:制造商应尽量将废旧品用于再制造。     

On the Natanzon-Turaev compactification of the Hurwitz space

Natanzon and Turaev have constructed by topological methods a compactification of the Hurwitz space, that is, the space of simple branched covers of the two-sphere. Here we show that this compactification is homeomorphic to a compactification mentioned by Diaz and Edidin (in 1996) that was constructed by algebraic methods. Using this we are able to show by example that the Natanzon-Turaev compactification can be singular, that is, not a manifold.

     

The ratio of the length of the unit circle to the area of the unit disc in Minkowski planes

In their paper ``An Introduction to Finsler Geometry,' J. C. Alvarez and C. Duran asked if there are other Minkowski planes besides the Euclidean for which the ratio of the Minkowski length of the unit ``circle' to the Holmes-Thompson area of the unit disc equals 2. In this paper we show that this ratio is greater than 2, and that the ratio 2 is achieved only for Minkowski planes that are affine equivalent to the Euclidean plane. In other words, the ratio is 2 only when the unit ``circle' is an ellipse.

     

A note on the approximability of the toughness of graphs

We show that, if NP≠ZPP, for any >0, the toughness of a graph with n vertices is not approximable in polynomial time within a factor of . We give a 4-approximation for graphs with toughness bounded by and we show that this result cannot be generalized to graphs with a bounded toughness. More exactly we prove that there is no constant approximation for graphs with bounded toughness, unless P=NP.     

On the kernel of the Magnus representation of the Torelli group

From our previous paper, it is known that the Magnus representation of the Torelli group is not faithful. In this paper, we characterize the kernel of its representation for a certain kind of elements.

     

On the Volume of the Union of Balls

We prove that if some balls in the Euclidean space move continuously in such a way that the distances between their centers decrease, then the volume of their union cannot increase. The proof is based on a formula expressing the derivative of the volume of the union as a linear combination of the derivatives of the distances between the centers with nonnegative coefficients. Received September 6, 1996, and in revised form March 26, 1997.     

On the zero-dimensionality of the limit of the sequence of generalized quasiconformal mappings

Mathematical Notes - The paper is devoted to the study of the properties of a class of space mappings that is more general than that of bounded distortion mappings (aka quasiregular mappings). It...     

Time-convexity of the entropy in the multiphasic formulation of the incompressible Euler equation

We study the multiphasic formulation of the incompressible Euler equation introduced by Brenier: infinitely many phases evolve according to the compressible Euler equation and are coupled through a global incompressibility constraint. In a convex domain, we are able to prove that the entropy, when averaged over all phases, is a convex function of time, a result that was conjectured by Brenier. The novelty in our approach consists in introducing a time-discretization that allows us to import a flow interchange inequality previously used by Matthes, McCann and Savaré to study first order in time PDE, namely the JKO scheme associated with non-linear parabolic equations.