Chromatic polynomial, q-binomial counting and colored Jones function

We define a q-chromatic function and q-dichromate on graphs and compare it with existing graph functions. Then we study in more detail the class of general chordal graphs. This is partly motivated by the graph isomorphism problem. Finally we relate the q-chromatic function to the colored Jones function of knots. This leads to a curious expression of the colored Jones function of a knot diagram K as a chromatic operator applied to a power series whose coefficients are linear combinations of long chord diagrams. Chromatic operators are directly related to weight systems by the work of Chmutov, Duzhin, Lando and Noble, Welsh.     

The problem of Dirichlet for anisotropic quasilinear degenerate elliptic equations

We consider the Dirichlet problem for a class of anisotropic degenerate elliptic equations. New a priori estimates for solutions and for the gradient of solutions are established. Based on these estimates sufficient conditions guaranteeing the solvability of the problem are formulated. The results are new even in the semilinear case when the principal part is the Laplace operator.     

A complete global solution to the pressure gradient equation

We study the domain of existence of a solution to a Riemann problem for the pressure gradient equation in two space dimensions. The Riemann problem is the expansion of a quadrant of gas of constant state into the other three vacuum quadrants. The global existence of a smooth solution was established in Dai and Zhang [Z. Dai, T. Zhang, Existence of a global smooth solution for a degenerate Goursat problem of gas dynamics, Arch. Ration. Mech. Anal. 155 (2000) 277-298] up to the free boundary of vacuum. We prove that the vacuum boundary is the coordinate axes.     

Predicting automobile claims bodily injury severity with sequential ordered logit models

Despite the large cost of bodily injury (BI) claims in motor insurance, relatively little research has been done in this area. Many companies estimate (and therefore reserve) bodily injury compensation directly from initial medical reports. This practice may underestimate the final cost, because the severity is often assessed during the recovery period. Since the evaluation of this severity is often only qualitative, in this paper we apply an ordered multiple choice model at different moments in the life of a claim reported to an insurance company. We assume that the information available to the insurer does not flow continuously, because it is obtained at different stages. Using a real data set, we show that the application of sequential ordered logit models leads to a significant improvement in the prediction of the BI severity level, compared to the subjective classification that is used in practice. We also show that these results could improve the insurer’s reserves notably.     

The time recovery of the spectroscopic properties of heavily irradiated CdZnTe and CdTe detectors

The time recovery of the spectroscopic capabilities of CdZnTe and CdTe detectors, irradiated with increasing doses of high- and low-energy neutrons, as well as electrons, has been investigated by studying their spectroscopic behavior at different photon energies using leakage current measurements and PICTS (photo-induced current transient spectroscopy) analysis. The detectors were stored at room temperature for up to one year to study the time evolution of their spectroscopic performance and to correlate it with the presence of defective states in the material. We have observed a clear improvement in the material’s detection properties with time, though only in those detectors which have not been severely degraded by the irradiation. The recovery can be associated with a decrease in the concentration of some defective states, thus allowing the assessment of the crucial role these play in determining the charge collection processes in the material and its spectroscopic capabilities. Received: 1 August 2001 / Accepted: 3 August 2001 / Published online: 20 December 2001     

类氢类氦类锂镁离子双电子复合的旁观电子角动量研究

类氢类氦类锂镁离子经中间双激发态进行的双电子复合过程在研究惯性约束聚变电子温度中占有很重要的地位.用准相对论方法计算了双电子复合经不同Rydberg态跃迁通道的复合速率系数,并给出不同离化度离子的双电子复合速率系数随电子温度的变化规律.显示出离子的相关能对峰值的电子温度有很大影响,当类氢离子跃迁通道的旁观电子角动量为1时双电子复合系数最大,而类锂离子是旁观电子角动量为3时最大. 关键词： 双电子复合 镁离子 角动量     

A nondifferentiable extension of a theorem of Pucci and Serrin and applications

We study the multiplicity of critical points for functionals which are only differentiable along some directions. We extend to this class of functionals the three critical point theorem of Pucci and Serrin and we apply it to a one-parameter family of functionals Jλ, λ∈I⊂R. Under suitable assumptions, we locate an open subinterval of values λ in I for which Jλ possesses at least three critical points. Applications to quasilinear boundary value problems are also given.     

On the maximum cardinality search lower bound for treewidth

The Maximum Cardinality Search (MCS) algorithm visits the vertices of a graph in some order, such that at each step, an unvisited vertex that has the largest number of visited neighbours becomes visited. A maximum cardinality search ordering (MCS-ordering) of a graph is an ordering of the vertices that can be generated by the MCS algorithm. The visited degree of a vertex v in an MCS-ordering is the number of neighbours of v that are before v in the ordering. The visited degree of an MCS-ordering ψ of G is the maximum visited degree over all vertices v in ψ. The maximum visited degree over all MCS-orderings of graph G is called its maximum visited degree. Lucena [A new lower bound for tree-width using maximum cardinality search, SIAM J. Discrete Math. 16 (2003) 345-353] showed that the treewidth of a graph G is at least its maximum visited degree.We show that the maximum visited degree is of size O(logn) for planar graphs, and give examples of planar graphs G with maximum visited degree k with O(k!) vertices, for all k∈N. Given a graph G, it is NP-complete to determine if its maximum visited degree is at least k, for any fixed k?7. Also, this problem does not have a polynomial time approximation algorithm with constant ratio, unless P=NP. Variants of the problem are also shown to be NP-complete.In this paper, we also propose some heuristics for the problem, and report on an experimental analysis of them. Several tiebreakers for the MCS algorithm are proposed and evaluated. We also give heuristics that give upper bounds on the value of the maximum visited degree of a graph, which appear to give results close to optimal on many graphs from real life applications.     

An Enumerative Geometry for Magic and Magilatin Labellings

A magic labelling of a set system is a labelling of its points by distinct positive integers so that every set of the system has the same sum, the magic sum. Examples are magic squares (the sets are the rows, columns, and diagonals) and semimagic squares (the same, but without the diagonals). A magilatin labelling is like a magic labelling but the values need be distinct only within each set. We show that the number of n × n magic or magilatin labellings is a quasipolynomial function of the magic sum, and also of an upper bound on the entries in the square. Our results differ from previous ones because we require that the entries in the square all be different from each other, and because we derive our results not by ad hoc reasoning but from a general theory of counting lattice points in rational inside-out polytopes. We also generalize from set systems to rational linear forms. Dedicated to the memory of Claudia Zaslavsky, 1917–2006 Received August 10, 2005     

On the structure of finite coverings of compact connected groups

Finite-sheeted covering mappings onto compact connected groups are studied. We show that for a covering mapping from a connected Hausdorff topological space onto a compact (in general, non-abelian) group there exists a topological group structure on the covering space such that the mapping becomes a homomorphism of groups. To prove this fact we construct an inverse system of covering mappings onto Lie groups which approximates the given covering mapping. As an application, it is shown that a covering mapping onto a compact connected abelian group G must be a homeomorphism provided that the character group of G admits division by degree of the mapping. We also get a criterion for triviality of coverings in terms of means and prove that each finite covering of G is equivalent to a polynomial covering.