# A Computational Method for Large Scale Searching of Counterexamples to   the Strong Coincidence Conjecture

**Authors:** Scott Balchin

arXiv: 1706.05277 · 2017-06-19

## TL;DR

This paper presents a computational approach to search for counterexamples to the strong coincidence conjecture, aiming to advance understanding of this mathematical hypothesis.

## Contribution

It introduces a specific computational method enabling large-scale searches for counterexamples to the strong coincidence conjecture.

## Key findings

- Initial searches did not find counterexamples.
- The method facilitates systematic exploration of the conjecture.
- Provides a framework for future computational investigations.

## Abstract

In this short note we report on results on a computational search for a counterexample to the strong coincidence conjecture. In particular, we discuss the method used so that further searches can be conducted.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1706.05277/full.md

## References

4 references — full list in the complete paper: https://tomesphere.com/paper/1706.05277/full.md

---
Source: https://tomesphere.com/paper/1706.05277