English
Related papers

Related papers: "A Handbook of Integer Sequences" Fifty Years Late…

200 papers

Stanley and Odlyzko proposed a method for greedily constructing sets with no 3-term arithmetic progressions. It is conjectured that there is a dichotomy between such sequences: those that have a periodic structure as the sequence satisfies…

Combinatorics · Mathematics 2020-04-07 Mehtaab Sawhney

The notion of an individual random sequence goes back to von Mises. We describe the evolution of this notion, especially the use of martingales (suggested by Ville), and the development of algorithmic information theory in 1960s and 1970s…

History and Overview · Mathematics 2025-08-27 Laurent Bienvenu , Alexander Shen

In an automatic search, we found conjectural recurrences for some sequences in the OEIS that were not previously recognized as being D-finite. In some cases, we are able to prove the conjectured recurrence. In some cases, we are not able to…

Symbolic Computation · Computer Science 2023-04-26 Manuel Kauers , Christoph Koutschan

We show how to enumerate words in $1^{m_1} \dots n^{m_n}$ that avoid the increasing consecutive pattern $12 \dots r$ for any $r \geq 2$. Our approach yields an $O(n^{s+1})$ algorithm to enumerate words in $1^s \dots n^s$, avoiding the…

Combinatorics · Mathematics 2018-05-23 Mingjia Yang , Doron Zeilberger

Although the popular MNIST dataset [LeCun et al., 1994] is derived from the NIST database [Grother and Hanaoka, 1995], the precise processing steps for this derivation have been lost to time. We propose a reconstruction that is accurate…

Machine Learning · Computer Science 2019-11-06 Chhavi Yadav , Léon Bottou

Sequence organizations are viewed from two points: one is from informational redundancy or informational correlation (IC) and another is from k-mer frequency statistics. Two problems are investigated. The first is how the ICs exceed the…

Genomics · Quantitative Biology 2010-04-23 Liaofu Luo , Yang Gao , Jun Lu

The discriminator of an integer sequence s = (s(i))_{i >=0}, introduced by Arnold, Benkoski, and McCabe in 1985, is the map D_s(n) that sends n >= 1 to the least positive integer m such that the n numbers s(0), s(1), ..., s(n-1) are…

Discrete Mathematics · Computer Science 2016-06-16 Sajed Haque , Jeffrey Shallit

Developers across the world use autonumber or auto sequences field of the backend databases for developing both the desktop and web based data centric applications which is easier to use at the development and deployment purpose but can…

Databases · Computer Science 2015-04-01 Kisor Ray

In-place associative integer sorting technique was proposed for integer lists which requires only constant amount of additional memory replacing bucket sort, distribution counting sort and address calculation sort family of algorithms. The…

Data Structures and Algorithms · Computer Science 2012-09-18 A. Emre Cetin

Researches have been done on Ethiopic scripts. However studies excluded the Geez numbers from the studies because of different reasons. This paper presents offline handwritten and machine printed Geez number recognition using feed forward…

Computer Vision and Pattern Recognition · Computer Science 2019-11-19 Eyob Gebretinsae Beyene

The absence of books and book chapters in the Web of Science Citation Indexes (SCI, SSCI and A&HCI) has always been considered an important flaw but the Thomson Reuters 'Book Citation Index' database was finally available in October of 2010…

Digital Libraries · Computer Science 2012-08-01 Daniel Torres-Salinas , Nicolas Robinson-Garcia , Emilio Delgado Lopez-Cozar

The classic string indexing problem is to preprocess a string $S$ into a compact data structure that supports efficient subsequent pattern matching queries, that is, given a pattern string $P$, report all occurrences of $P$ within $S$. In…

Data Structures and Algorithms · Computer Science 2024-02-15 Philip Bille , Inge Li Gørtz , Max Rishøj Pedersen , Eva Rotenberg , Teresa Anna Steiner

The discriminator of an integer sequence s = (s(i))_{i>=0}, introduced by Arnold, Benkoski, and McCabe in 1985, is the function D_s(n) that sends n to the least integer m such that the numbers s(0), s(1), ..., s(n-1) are pairwise…

Number Theory · Mathematics 2017-02-06 Sajed Haque , Jeffrey Shallit

The Fibonacci numbers are familiar to all of us. They appear unexpectedly often in mathematics, so much there is an entire journal and a sequence of conferences dedicated to their study. However, there is also another sequence of numbers…

History and Overview · Mathematics 2022-11-02 Trond Steihaug

Novel dynamic programming algorithms to count the set $D(n)$ of zero-free degree sequences of length $n$, the set $D_c(n)$ of degree sequences of connected graphs on $n$ vertices and the set $D_b(n)$ of degree sequences of biconnected…

Combinatorics · Mathematics 2017-02-15 Kai Wang

A large amount of information in today's world is now stored in knowledge bases. Named Entity Recognition (NER) is a process of extracting, disambiguation, and linking an entity from raw text to insightful and structured knowledge bases.…

Computation and Language · Computer Science 2024-11-11 Monica Munnangi

The Houma Alliance Book, one of history's earliest calligraphic examples, was unearthed in the 1970s. These artifacts were meticulously organized, reproduced, and copied by the Shanxi Provincial Institute of Cultural Relics. However,…

Computer Vision and Pattern Recognition · Computer Science 2024-08-27 Xiaoyu Yuan , Xiaohua Huang , Zibo Zhang , Yabo Sun

This paper synthesizes the actions performed in order to transform a classic scientific research journal - 'Annals. Computer Science Series' - available only in printed form until 2008, into a modern e-journal with free access to the full…

Digital Libraries · Computer Science 2009-05-29 Alexandra-Emilia Fortis

A large-scale experiment was conducted to find formulas relating to the base $e^\pi$. The numbers in this base are $$x = \sum_{n=0}^\infty {a(n)\over e^{\pi n}}$$ where $a(n)$ is taken from the OEIS catalog. These experiments were inspired…

Number Theory · Mathematics 2025-09-22 Simon Plouffe

The rapid advance of DNA sequencing technologies has yielded databases of thousands of genomes. To search and index these databases effectively, it is important that we take advantage of the similarity between those genomes. Several authors…

Data Structures and Algorithms · Computer Science 2014-12-05 Travis Gagie , Simon J. Puglisi