Associate Professor, Computer Science
University of Memphis, Memphis, TN 38152
(Retired as of June2001)
Send email to: edward@ordman.net
Contact
Information
U of Memphis CS
Program Dept.
of
Math Sciences
Contents:
A few of my publications
Some Places I've been
Contact Information
Current Projects
Biographical Information
Some Other Interests
Something my mother noticed\
(with H. Fell and M. Newman) Tables of genera
of groups of linear fractional
transformations, J. Research Nat. Bur. Standards Sec. B, 67(1963),
61-68.
Subgroups
of amalgamated free products,
Bull. Amer. Math. Soc. 76(1970), 358-360.
On subgroups of amalgamated free products,
Proc. Cambridge Phil. Soc. 69(1971), 13-23.
Algebraic characterization of some classical combinatorial problems,
Amer. Math. Monthly 78(1971), 961-970.
Factoring a group as an amalgamated free product,
J. Australian Math. Soc. 15(1973), 222-227.
(with John Mack and S.A. Morris) Free topological groups and the
projective
dimension of a locally compact topological group,
Proc. Amer. Math. Soc. 40(1973), 303-308.
One and one is nothing: liberating mathematics (essay),
Soundings 56(1973), 164-181.
Free products of topological groups which are k-omega spaces,
Trans. Amer. Math. Soc. 191(1974), 61-73.
Make up your own mazes, Arithmetic Teacher 22(1975), 650-652.
Meteor: an arcade game using character graphics,
Creative Computing 8(Aug. 1982),
178-80-82-84-85.
Writing transportable basic,
COMPUTE! (Jan. 1983), 36-42, and (Feb.
1983), 56-62.
(with L. Cacceta, P. Erdos, N.J. Pullman) The difference between the
clique
numbers of a graph, Proc. 12th Australasian Conf. on Graph Theory and
Combinatorics,
Ars Combinatoria 19A(1985), 97-106.
Paul Erdos, Ralph Faudree, and Edward T. Ordman,
Clique coverings and clique partitions,
Discrete Mathematics 72(1988), 93-101
Distributed graph recognition with malicious faults, in Graph Theory
and
its Applications: East and West, Annals N.Y. Acad. Sci. 576(1989),
417-431.
P. Erdos, A. Gyarfas, E.T. Ordman, and Y. Zalcstein, The size of
chordal,
interval, and threshold subgraphs, Combinatorica 9(1989), 245-254.
![]()
I've lectured alphabetically from Aalborg (Denmark) to Zomba (Malawi) and north - south from Torshavn (Faeroe Islands) to Hobart (Tasmania) as well as in London, Paris, Amsterdam; Budapest, Shanghai, Xi'an, Jinan, Hakone; Toronto, Sydney, Auckland, etc. I've visited departments or companies in Kiev and Odessa, Ukraine, and Delhi, India.
My wife and I are active in Servas, a peace organization encouraging international home-to-home visits. Among other organizations, we have traveled with Elderhostel and Global Volunteers, the Foundation for International Community Assistance and the American Indian College Fund. We've been camp counselors (English tutors) at a children's camp in rural Eastern Poland and visited small colleges on Indian reservations.
We are happy to provide some of our charity-related travel pictures (seeking a good web home for them since the Zing site died).
![]()
I migrate between Tennessee and New Hampshire
E-mail: etordman@memphis.edu
(works
at both homes)
(Secretary at Dept. of Math Sciences, U of Memphis, 901-678-2482,
generally knows where I am.)
![]()
![]()
Programming interests: Geneology, Pictorial data bases,
Computer Games
Rapid Prototyping
A few experiences / interests:
Starting new / isolated Computer
Science Programs (e.g. Faroe Islands)
Applied econometrics. Economic
forecasting.
(worked for Kentucky Council of Economic Advisors)
Rapid prototying /
feasibility
of industrial applications
(Group insurance, factory floor quality control, etc.)
Theology: Lectured at a divinity
school in East Jerusalem, some others.
![]()
The University of Memphis does a very good job with students who have handicaps. I very much like advising students. In late 1997 Ann Landers included a letter about my work with handicapped students. While no one has ever called my mother to mention seeing any of my 40 or 50 professional papers, 15 people called my mother that morning before breakfast. Since then, in my mother's eyes, I am a success. For more about this, click here.
![]()
Last Revised: June 2005