{"paper":{"title":"Bounds on the Number of Modes of a Gaussian Mixture Density","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Gaussian mixture densities with k components have at most floor of (min of two algebraic bounds plus one) divided by two modes when the modal set is finite.","cross_cats":["math.CO","stat.TH"],"primary_cat":"math.ST","authors_text":"Hien Duy Nguyen","submitted_at":"2026-05-15T02:02:36Z","abstract_excerpt":"We derive explicit upper bounds for the number of nondegenerate critical points of a $k$-component Gaussian mixture density in $\\mathbb{R}^d$, and the number of modes when the modal set is finite, together with lower bounds. By normalizing the critical-point equations by a reference component, for $k\\ge2$ we get the direct Pfaffian bound \\[ U_{\\mathrm{het}}(d,k)=2^{\\,d+\\binom{k-1}{2}}\\left(d+2\\min(d,k-1)+1\\right)^{k-1}. \\] For the same parameter range, an exact elimination augmented by an algebraic reciprocal variable gives the alternative bound \\[ U_{\\mathrm{aug}}(d,k)= 2^{\\binom{k-1}{2}}(d+1"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"For k≥2, the direct Pfaffian bound is U_het(d,k)=2^{d+binom(k-1,2)}(d+2 min(d,k-1)+1)^{k-1}, with the best critical-point bound being the minimum of this and the augmented bound, and the finite-mode bound improved by Morse theory to floor((min{U_het,U_aug}+1)/2).","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The critical-point equations can be normalized by a reference component without loss of generality for k≥2, and the Morse-theoretic argument applies directly to improve the finite-mode upper bound when the modal set is finite.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Explicit upper bounds on nondegenerate critical points of k-component Gaussian mixture densities are given via Pfaffian and algebraic elimination methods, with homoscedastic simplifications and combinatorial lower bounds.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Gaussian mixture densities with k components have at most floor of (min of two algebraic bounds plus one) divided by two modes when the modal set is finite.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"1409fc5e8807f531f6214cd1e37d0dbdcb22f813852cddf7a2e417149c3caa71"},"source":{"id":"2605.15531","kind":"arxiv","version":1},"verdict":{"id":"06f58249-98d3-4191-b4e7-04975a0fac47","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T14:31:00.102044Z","strongest_claim":"For k≥2, the direct Pfaffian bound is U_het(d,k)=2^{d+binom(k-1,2)}(d+2 min(d,k-1)+1)^{k-1}, with the best critical-point bound being the minimum of this and the augmented bound, and the finite-mode bound improved by Morse theory to floor((min{U_het,U_aug}+1)/2).","one_line_summary":"Explicit upper bounds on nondegenerate critical points of k-component Gaussian mixture densities are given via Pfaffian and algebraic elimination methods, with homoscedastic simplifications and combinatorial lower bounds.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The critical-point equations can be normalized by a reference component without loss of generality for k≥2, and the Morse-theoretic argument applies directly to improve the finite-mode upper bound when the modal set is finite.","pith_extraction_headline":"Gaussian mixture densities with k components have at most floor of (min of two algebraic bounds plus one) divided by two modes when the modal set is finite."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15531/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T15:01:17.515281Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T14:37:38.259771Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"cited_work_retraction","ran_at":"2026-05-19T14:22:02.108831Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.036918Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"shingle_duplication","ran_at":"2026-05-19T13:49:41.834966Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"citation_quote_validity","ran_at":"2026-05-19T13:49:41.372461Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.620502Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"940780743753b995de266d386cd58cfd1a5238aa8d0325c4825607549af19d57"},"references":{"count":17,"sample":[{"doi":"10.1093/imaiai/iaz013","year":2013,"title":"Alexandrovich, G., Holzmann, H., and Ray, S. (2013). On the number of modes of finite mixtures of elliptical distributions. In B. Lausen, D. van den Poel, and A. Ultsch (Eds.),Algorithms from and for ","work_id":"ad6717be-0795-437b-a810-cc76802101d2","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1995,"title":"Cheng, Y.(1995).Meanshift, modeseeking, andclustering.IEEE Transactions on Pattern Analysis and Machine Intelligence, 17(8), 790–799. 34","work_id":"8b2c711e-5cf4-475e-babd-f0b045b9f3d8","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1996,"title":"Ester, M., Kriegel, H.-P., Sander, J., and Xu, X. (1996). A density-based algorithm for discov- ering clusters in large spatial databases with noise. InProceedings of the Second International Conferen","work_id":"8d5425b3-ccc2-4d21-81c6-010572a6b2c6","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2004,"title":"Gabrielov, A., and Vorobjov, N. (2004). Complexity of computations with Pfaffian and Noetherian functions. InNormal Forms, Bifurcations and Finiteness Problems in Differential Equations (pp. 211–250).","work_id":"e9263ee7-2412-4d7a-8268-9487722393e9","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Kabata, Y., Matsumoto, H., Uchida, S., and Ueki, M. (2025). Singularities in bivariate normal mixtures.Information Geometry, 8, 343–357","work_id":"cc2fa01a-b997-4c1b-8ac6-f4030b4096f9","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":17,"snapshot_sha256":"b0bfa2899e3d9c9e0d8379c55651382760fdf4e6883de3d2c651c7e78e66996a","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}