Massively parallel computation of large-scale spatial price equilibrium models with discriminatory ad valorem tariffs

In this paper, we develop a perfectly competitive spatial equilibrium model in price and quantity variables in the presence of discriminatory ad valorem tariffs, a widely used trade policy instrument. We derive the equilibrium conditions and formulate them as a variational inequality problem. An algorithm is then proposed for the computation of the equilibrium pattern and convergence results established. The algorithm resolves the problem into very simple subproblems, each of which can be solved simultaneously and in closed form. Finally, the algorithm is implemented on the massively parallel Thinking Machines CM-2 and CM-5 architectures, known as the Connection Machines, and numerical results presented.     

The visibility of models: using technology as a bridge between mathematics and engineering

Engineering mathematics is traditionally conceived as a set of unambiguous mathematical tools applied to solving engineering problems, and it would seem that modern mathematical software is making the toolbox metaphor ever more appropriate. The validity of this metaphor is questioned and the case is made that engineers do in fact use mathematics as more than a set of passive tools— that mathematical models for phenomena depend critically on the settings in which they are used and the tools with which they are expressed. The perennial debate over whether mathematics should be taught by mathematicians or by engineers looks increasingly anachronistic in the light of technological change, and the authors suggest that it is more instructive to examine the potential of technology for changing the relationships between mathematicians and engineers, and for connecting their respective knowledge domains in new ways.     

Chermak–Delgado Lattice Extension Theorems

If G is a finite group with subgroup H, then the Chermak–Delgado measure of H (in G) is defined as |H||C _G (H)|. The Chermak–Delgado lattice of G, denoted 𝒞𝒟(G), is the set of all subgroups with maximal Chermak–Delgado measure; this set is a moduar sublattice within the subgroup lattice of G. In this paper we provide an example of a p-group P, for any prime p, where 𝒞𝒟(P) is lattice isomorphic to 2 copies of ?₂ (a quasiantichain of width 2) that are adjoined maximum-to-minimum. We introduce terminology to describe this structure, called a 2-string of 2-diamonds, and we also give two constructions for generalizing the example. The first generalization results in a p-group with Chermak–Delgado lattice that, for any positive integers n and l, is a 2l-string of n-dimensional cubes adjoined maximum-to-minimum and the second generalization gives a construction for a p-group with Chermak–Delgado lattice that is a 2l-string of ? _p+1 (quasiantichains, each of width p + 1) adjoined maximum-to-minimum.