New Difference Triangle Sets by an FPGA-Based Search Technique

Frank R. Kschischang; Mohannad Shehadeh; William Kingsford

New Difference Triangle Sets by an FPGA-Based Search Technique

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 2502.19517 v2 pith:TJVOTLAH submitted 2025-02-26 cs.IT math.IT

Mohannad Shehadeh , William Kingsford , Frank R. Kschischang This is my paper · ORCID

classification cs.ITmath.IT

keywords differencesetstrianglealgorithmsarraysbestcircuitsdigital

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original abstract

We provide some difference triangle sets with scopes that improve upon the best known values. These are found with purpose-built digital circuits realized with field-programmable gate arrays (FPGAs) rather than software algorithms running on general-purpose processors.

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

Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems
cs.AI 2025-05 conditional novelty 5.0 of 10

LLM-generated search heuristics run through the CPro1 protocol with the reasoning model o3-mini-high produced verified constructions resolving open instances in 7 Handbook design families and newer problems.

Pith tools