GCD Reconstruction from Subset LCMs: Elementary Identities, Ambiguity and Counting
Year: 2026
Type: preprint
Abstract: For a tuple of positive integers, taking the greatest common divisor of all least common multiples of a fixed subset size extracts an order statistic of each prime-exponent list. Starting from this classical observation, we study what can be recovered when the tuple is hidden but its product and labelled subset LCMs are given. We present a pairwise reconstruction identity and a matching worst-case query bound, characterize all possible GCDs for complete fixed-size observations, and count compatible ordered tuples for arbitrary covering query families through a hypergraph independence polynomial. A reduction from independent set shows that a restricted GCD-existence problem remains NP-complete even when a feasible tuple is supplied. The arguments are elementary consequences of valuations, inclusion-exclusion and standard combinatorial constructions. This note makes no claim of priority for these deductions. A companion Python program (verify.py) reproduces finite exhaustive checks.
Author: Mishra, Arsh
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7234784992
