Cycle and circle tests of balance in gain graphs: Forbidden minors and their groups

We examine two criteria for balance of a gain graph, one based on binary cycles and one on circles. The graphs for which each criterion is valid depend on the set of allowed gain groups. The binary cycle test is invalid, except for forests, if any possible gain group has an element of odd order. Assuming all groups are allowed, or all abelian groups, or merely the cyclic group of order 3, we characterize, both constructively and by forbidden minors, the graphs for which the circle test is valid. It turns out that these three classes of groups have the same set of forbidden minors. The exact reason for the importance of the ternary cyclic group is not clear. © 2005 Wiley Periodicals, Inc. J Graph Theory     

A warehouse-based design model for reverse logistics

In this paper, an MILP formulation is proposed for the design of a reverse logistics network based on a warehouse location–allocation model, which optimizes, simultaneously, the forward and reverse networks. A single product model with unlimited capacity is first defined. Subsequently, the model is extended to a multi-product capacitated recovery network model, where capacity limitations and a multi-product system can be considered. The proposed model is compared to published work in the field, where different model assumptions have been proposed. Two cases are described so as to gain a better insight into the model and allow a comparative analysis.     

An Analogue of Distributivity for Ungraded Lattices

In this paper, we study lattices that posess both the properties of being extremal (in the sense of Markowsky) and of being left modular (in the sense of Blass and Sagan). We call such lattices trim and show that they posess some additional appealing properties, analogous to those of a distributive lattice. For example, trimness is preserved under taking intervals and suitable sublattices. Trim lattices satisfy a weakened form of modularity. The order complex of a trim lattice is contractible or homotopic to a sphere; the latter holds exactly if the maximum element of the lattice is a join of atoms. Any distributive lattice is trim, but trim lattices need not be graded. The main example of ungraded trim lattices are the Tamari lattices and generalizations of them. We show that the Cambrian lattices in types A and B defined by Reading are trim; we conjecture that all Cambrian lattices are trim.     

Stability of a Model of Relativistic Quantum Electrodynamics

The relativistic “no pair” model of quantum electrodynamics uses the Dirac operator, D(A) for the electron dynamics together with the usual self-energy of the quantized ultraviolet cutoff electromagnetic field A– in the Coulomb gauge. There are no positrons because the electron wave functions are constrained to lie in the positive spectral subspace of some Dirac operator, D, but the model is defined for any number, N, of electrons, and hence describes a true many-body system. In addition to the electrons there are a number, K, of fixed nuclei with charges ≤Z. If the fields are not quantized but are classical, it was shown earlier that such a model is always unstable (the ground state energy E=−∞) if one uses the customary D(0) to define the electron space, but is stable (E > − const.(N+K)) if one uses D(A) itself (provided the fine structure constant α and Z are not too large). This result is extended to quantized fields here, and stability is proved for α= 1/137 and Z≤ 42. This formulation of QED is somewhat unusual because it means that the electron Hilbert space is inextricably linked to the photon Fock space. But such a linkage appears to better describe the real world of photons and electrons. Received: 8 September 2001 / Accepted: 18 March 2002     

Absolutely indecomposable symmetric matrices

Let A be a symmetric matrix of size n×n with entries in some (commutative) field K. We study the possibility of decomposing A into two blocks by conjugation by an orthogonal matrix T∈Mat_n(K). We say that A is absolutely indecomposable if it is indecomposable over every extension of the base field. If K is formally real then every symmetric matrix A diagonalizes orthogonally over the real closure of K. Assume that K is a not formally real and of level s. We prove that in Mat_n(K) there exist symmetric, absolutely indecomposable matrices iff n is congruent to 0, 1 or −1 modulo 2s.     

The universality of equivariant complex bordism

We show that if A is an abelian compact Lie group, all A-equivariant complex vector bundles are orientable over a complex orientable equivariant cohomology theory. In the process, we calculate the complex orientable homology and cohomology of all complex Grassmannians. Received: 14 February 2000; in final form: 4 August 2000 / Published online: 19 October 2001     

Quadratic data envelopment analysis

Data Envelopment Analysis (DEA) offers a piece-wise linear approximation of the production frontier. The approximation tends to be poor if the true frontier is not concave, eg in case of economies of scale or of specialisation. To improve the flexibility of the DEA frontier and to gain in empirical fit, we propose to extend DEA towards a more general piece-wise quadratic approximation, called Quadratic Data Envelopment Analysis (QDEA). We show that QDEA gives statistically consistent estimates for all production frontiers with bounded Hessian eigenvalues. Our Monte-Carlo simulations suggest that QDEA can substantially improve efficiency estimation in finite samples relative to standard DEA models.     

Effective dimensionality approach to the RKKY interaction in multilayer systems

We consider RKKY interaction in a quasi 2D system with nonparabolic dispersion. In our paper we calculate the RKKY range function assuming the in-layer confinement via effective dimensionality approach. We show, that indirect magnetic exchange in our system can be modelled by the effective spectral dimension which equals one.