On Discovering Interesting Combinatorial Integer Sequences

We study the problem of generating interesting integer sequences with a combinatorial interpretation. For this we introduce a two-step approach. In the first step, we generate first-order logic sentences which define some combinatorial objects, e.g., undirected graphs, permutations, matchings etc. In the second step, we use algorithms for lifted first-order model counting to generate integer sequences that count the objects encoded by the first-order logic formulas generated in the first step. For instance, if the first-order sentence defines permutations then the generated integer sequence is the sequence of factorial numbers n!. We demonstrate that our approach is able to generate interesting new sequences by showing that a non-negligible fraction of the automatically generated sequences can actually be found in the Online Encyclopaedia of Integer Sequences (OEIS) while generating many other similar sequences which are not present in OEIS and which are potentially interesting. A key technical contribution of our work is the method for generation of first-order logic sentences which is able to drastically prune the space of sentences by discarding large fraction of sentences which would lead to redundant integer sequences.

• 2 publications
• 39 publications
• 2 publications
• 41 publications
• 26 publications
research
03/19/2021

Frobenius Numbers and Automatic Sequences

The Frobenius number g(S) of a set S of non-negative integers with 1 is ...
research
05/23/2018

Rectangular Young tableaux with local decreases and the density method for uniform random generation (short version)

In this article, we consider a generalization of Young tableaux in which...
research
05/07/2017

Generating Memorable Mnemonic Encodings of Numbers

The major system is a mnemonic system that can be used to memorize seque...
research
12/14/2017

One-Pass Graphic Approximation of Integer Sequences

A variety of network modeling problems begin by generating a degree sequ...
research
02/24/2022

Learning Program Synthesis for Integer Sequences from Scratch

We present a self-learning approach for synthesizing programs from integ...
research
07/31/2018

Computing Integer Sequences: Filtering vs Generation (Functional Pearl)

As a report of a teaching experience, we analyse Haskell programs comput...
research
06/23/2020

Discrete correlations of order 2 of generalised Rudin-Shapiro sequences: a combinatorial approach

We introduce a family of block-additive automatic sequences, that are ob...