On the pivot structure for the weighing matrix W(12,11)

In the present article we concentrate our study on the growth problem for the weighing matrix W(12,11) and show that the unique W(12,11) has three pivot structures. An improved algorithm for extending a k × k (0,+,-) matrix to a W(n,n-1), if possible, has been developed to simplify the proof. For the implementation of the algorithm special emphasis is given to the notions of data structures and parallel processing.     

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.     

Measures on minimally generated Boolean algebras

We investigate properties of minimally generated Boolean algebras. It is shown that all measures defined on such algebras are separable but not necessarily weakly uniformly regular. On the other hand, there exist Boolean algebras small in terms of measures which are not minimally generated. We prove that under CH a measure on a retractive Boolean algebra can be nonseparable. Some relevant examples are indicated. Also, we give two examples of spaces satisfying some kind of Efimov property.     

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 treatment of nonhomogeneous Dirichlet boundary conditions by thep-version of the finite element method

Summary The paper addresses the problem of the implementation of nonhomogeneous essential Dirichlet type boundary conditions in thep-version of the finite element method.Partially supported by the Office of Naval Research under Grant N-00014-85-K-0169Research partially supported by the Air Force Office of Scientific Research, Air Force Systems Command, USAF, under Grant Number AFOSR 85-0322     

Packing Non-Zero A-Paths In Group-Labelled Graphs

Let G=(V,E) be an oriented graph whose edges are labelled by the elements of a group Γ and let A⊂V. An A-path is a path whose ends are both in A. The weight of a path P in G is the sum of the group values on forward oriented arcs minus the sum of the backward oriented arcs in P. (If Γ is not abelian, we sum the labels in their order along the path.) We are interested in the maximum number of vertex-disjoint A-paths each of non-zero weight. When A = V this problem is equivalent to the maximum matching problem. The general case also includes Mader's S-paths problem. We prove that for any positive integer k, either there are k vertex-disjoint A-paths each of non-zero weight, or there is a set of at most 2k −2 vertices that meets each of the non-zero A-paths. This result is obtained as a consequence of an exact min-max theorem. These results were obtained at a workshop on Structural Graph Theory at the PIMS Institute in Vancouver, Canada. This research was partially conducted during the period the first author served as a Clay Mathematics Institute Long-Term Prize Fellow.     

Über die abstandsverträglichen Abbildungen auf dem Kreis und auf der reellen Geraden

Zusammenfassung. Eine Abbildung zwischen metrischen R?umen hei?t abstandsvertr?glich, wenn der Abstand der Bilder zweier Punkte nur vom Abstand der Punkte selbst abh?ngt. Wir zeigen, dass eine Abbildung genau dann abstandsvertr?glich ist, wenn der Cauchyschen Funktionalgleichung genügt, also ein Endomorphismus der Gruppe ist. Ein entsprechendes Resultat gilt auch für die abstandsvertr?glichen Abbildungen des Kreises (mit der Multiplikation komplexer Zahlen als Gruppenverknüpfung). Damit kann man sowohl alle messbaren abstandsvertr?glichen Abbildungen von bzw. in sich angeben, als auch einen Nachweis für die Existenz nichtmessbarer abstandsvertr?glicher Abbildungen auf und erbringen. Eingegangen am 20. Juni 2001 / Angenommen am 13. September 2001     

Threshold electrical switching in As45Te55-xInx and As50Te50-xInx glasses

The electrical switching behaviour of As₄₅Te_55-xIn_x (5≤x≤15) and As₅₀Te_50-xIn_x (2.5≤x≤11.5) has been studied over a wide range of compositions. These glasses are found to exhibit threshold switching. The composition dependence of switching voltage (V_t) has been found to exhibit a change in slope and a local minimum at compositions x=10 and 12.5 for As₄₅Te_55-xIn_x and x=7.5 and 10.8 for As₅₀Te_50-xIn_x, respectively. The slope change in V_t verses x and the local minimum have been identified using two network topological effects, namely the rigidity percolation threshold and the chemical threshold. Received: 23 August 2001 / Accepted: 27 August 2001 / Published online: 11 February 2002     

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.