We discuss a new implementation of, and new experiments with, Fajtlowiczâ€™s Dalmatian conjecture-making heuristic. Our program makes conjectures about relations of real number invariants ofâ€¦ (More)

Given a set S of points in the plane, the k-Gabriel graph of S is the geometric graph with vertex set S, where pi, pj âˆˆ S are connected by an edge if and only if the closed disk having segment pipjâ€¦ (More)

Discovery in mathematics is a prototypical intelligent behavior, and an early and continuing goal of artificial intelligence research. We present a heuristic for producing mathematical conjectures ofâ€¦ (More)

A reference catalogue of 1274 fully-resonant azulenoid tiling patterns with a symmetry group that operates transitively on the azulenes has been generated, and may be consulted atâ€¦ (More)

The GrInvIn framework provides the core functionality needed to implement an application for graph theory in general. It includes basic functionality to work with graphs, invariants, and conjectures.â€¦ (More)

Our Project began with the development of a program that can be used to generate invariant-relation and property-relation conjectures in many areas of mathematics. This program can produceâ€¦ (More)

Tuesday, September 2 12:30â€“1:20 4119 Harris Hall The question whether for a given graph a hamiltonian cycle exists is NPcomplete, even when restricted to the class of plane triangulations. However,â€¦ (More)

Nanocones are carbon networks situated in between graphite and the famous fullerene nanotubes. Graphite is a planar carbon network where each atom has three neighbours and the faces formed are allâ€¦ (More)