Pith. sign in

REVIEW 1 cited by

Counting occurrences of some subword patterns

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv math/0204320 v2 pith:MNILCX4T submitted 2002-04-26 math.CO

A. Burstein , T. Mansour This is my paper · ORCID
classification math.CO
keywords numberoccurrencessubwordcontainingfindfunctionsgeneratingpatterns
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We find generating functions the number of strings (words) containing a specified number of occurrences of certain types of order-isomorphic classes of substrings called subword patterns. In particular, we find generating functions for the number of strings containing a specified number of occurrences of a given 3-letter subword pattern.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. From Exponential to Polynomial Complexity: Efficient Permutation Counting with Subword Constraints

    cs.CR 2024-11 reject novelty 2.0 of 10

    The paper's headline multi-subword counting formula is invalid; a length-3 binary example returns 18 instead of 0.

Pith tools