# Fingerprint databases for theorems

@article{Billey2013FingerprintDF, title={Fingerprint databases for theorems}, author={Sara C. Billey and Bridget Eileen Tenner}, journal={ArXiv}, year={2013}, volume={abs/1304.3866} }

We discuss the advantages of searchable, collaborative, language-independent databases of mathematical results, indexed by "fingerprints" of small and canonical data. Our motivating example is Neil Sloane's massively influential On-Line Encyclopedia of Integer Sequences. We hope to encourage the greater mathematical community to search for the appropriate fingerprints within each discipline, and to compile fingerprint databases of results wherever possible. The benefits of these databases are…

## Topics from this paper

## 14 Citations

DiscreteZOO: Towards a Fingerprint Database of Discrete Objects

- Computer ScienceICMS
- 2018

The DiscreteZOO project is presented, a repository and a fingerprint database for discrete mathematical objects that aims to become a general platform to make collections of mathematical objects easier to publish and access.

DiscreteZOO: A Fingerprint Database of Discrete Objects

- Mathematics, Computer ScienceMath. Comput. Sci.
- 2020

DiscreteZOO is a project which illustrates some of the possibilities for computer-supported management of collections of finite combinatorial (discrete) objects, in particular graphs with a high degree of symmetry.

FindStat – a database and search engine for combinatorial statistics and maps

- 2019

FindStat is a collaborative online database of combinatorial statistics on combinatorial collections and of maps between such collections. A search engine allows users to identify statistics and maps…

Consequences of the Lakshmibai-Sandhya Theorem: the ubiquity of permutation patterns in Schubert calculus and related geometry

- Mathematics
- 2014

In 1990, Lakshmibai and Sandhya published a characterization of singular Schubert varieties in flag manifolds using the notion of pattern avoidance. This was the first time pattern avoidance was used…

Towards a Census of Relational Data in Mathematics

- Computer ScienceLWDA
- 2019

This work-in-progress census aims to shed light on what a large class of mathematical datasets looks like and to encourage authors and curators to contribute information about their datasets for future versions of this census.

Embedding Non-planar Graphs: Storage and Representation

- Proceedings of the 2021 7th Student Computer Science Research Conference (StuCoSReC)
- 2021

In this paper, we propose a convention for repre-senting non-planar graphs and their least-crossing embeddings in a canonical way. We achieve this by using state-of-the-art tools such as canonical…

The Heterogeneity of Mathematical Research

- Computer Science
- 2016

If the authors wish to construct formal-logical models of mathematical practices, taking into account the maximum of detail, then it is a wise strategy to see mathematics as a heterogeneous entity, according to the core thesis of this contribution.

it 1 / 15 ( Deep ) FAIR Mathematics

- 2019

In this article, we analyze the state of research data in mathematics. We find that while the mathematical community embraces the notion of open data, the FAIR principles are not yet sufficiently…

(Deep) FAIR mathematics

- Computer Science, Mathematicsit Inf. Technol.
- 2020

This article presents a novel classification of mathematical data and derive an extended set of FAIR requirements, which accomodate the special needs of math datasets and shows a prototypical system infrastructure, which can realize deep FAIRness for one category (tabular data) of mathematical datasets.

The Space of Mathematical Software Systems - A Survey of Paradigmatic Systems

- Computer ScienceArXiv
- 2020

A novel conceptualization of mathematical software that focuses on five aspects, each with their own communities, challenges, and successes is devised to give researchers a guide to this space of systems.

## References

SHOWING 1-10 OF 45 REFERENCES

Algorithms for discovering and proving theorems about permutation patterns

- Mathematics, Computer ScienceArXiv
- 2012

An algorithm, called BiSC, is presented that describes the patterns avoided by a given set of permutations and automatically conjectures the statements of known theorems such as the descriptions of stack-sortable, smooth, smooth and forest-like permutations.

House of Graphs: A database of interesting graphs

- Computer Science, MathematicsDiscret. Appl. Math.
- 2013

House of Graphs is a new database of graphs which is a searchable database and offer-next to complete lists of some graph classes-also a list of special graphs that have already turned out to be interesting and relevant in the study of graph theoretic problems or as counterexamples to conjectures.

The On-Line Encyclopedia of Integer Sequences

- Mathematics, Computer ScienceElectron. J. Comb.
- 1994

The On-Line Encyclopedia of Integer Sequences (or OEIS) is a database of some 130000 number sequences which serves as a dictionary, to tell the user what is known about a particular sequence and is widely used.

Modular Elliptic Curves and Fermat′s Last Theorem(抜粋) (フェルマ-予想がついに解けた!?)

- Mathematics
- 1995

When Andrew John Wiles was 10 years old, he read Eric Temple Bell’s The Last Problem and was so impressed by it that he decided that he would be the first person to prove Fermat’s Last Theorem. This…

The four color theorem

- Mathematics
- 1977

Can the countries of a planar map be colored using four colors in such a way that countries sharing a boundary segment (not just a point) receive different colors? This simply stated question,…

Graph Minors

- 2009

For a given graph G and integers b, f ≥ 0, let S be a subset of vertices of G of size b + 1 such that the subgraph of G induced by S is connected and S can be separated from other vertices of G by…

Formal Proof—The Four- Color Theorem

- Computer Science
- 2008

For some thirty years, computer science has been working out a solution to this problem: formal program proofs, to write code that describes not only what the machine should do, but also why it should be doing it—a formal proof of correctness.

Criterion for smoothness of Schubert varieties in Sl(n)/B

- Mathematics
- 1990

LetG=Sl(n) andB, the Borel subgroup ofG consisting of upper triangular matrices. Letw∈Sn andX(w)=BwB(modB), the associated Schubert variety inG/B. In this paper, we give a geometric criterion for the…

On Regular Polytopes

- Mathematics, Physics
- 2013

Regular polytopes, the generalization of the five Platonic solids in 3 space dimensions, exist in arbitrary dimension n ≥ −1; now in dim. 2, 3 and 4 there are extra polytopes, while in general…

Graph Minors. XX. Wagner's conjecture

- Computer Science, MathematicsJ. Comb. Theory, Ser. B
- 2004

We prove Wagner's conjecture, that for every infinite set of finite graphs, one of its members is isomorphic to a minor of another.