{"id":40107736,"url":"https://github.com/alexpof/d_2n_homometry","last_synced_at":"2026-01-19T11:35:00.294Z","repository":{"id":190945296,"uuid":"111466142","full_name":"AlexPof/D_2n_Homometry","owner":"AlexPof","description":"C and Python code for brute-force enumeration of homometric subsets of dihedral groups","archived":false,"fork":false,"pushed_at":"2018-09-15T14:00:31.000Z","size":162,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-09-09T03:51:27.698Z","etag":null,"topics":["brute-force","c","enumeration","music-theory","python3"],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/AlexPof.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2017-11-20T21:45:00.000Z","updated_at":"2019-08-26T21:39:11.000Z","dependencies_parsed_at":null,"dependency_job_id":"7da78871-3da4-48e4-ab6e-e0b693fb34f4","html_url":"https://github.com/AlexPof/D_2n_Homometry","commit_stats":null,"previous_names":["alexpof/d_2n_homometry"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/AlexPof/D_2n_Homometry","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AlexPof%2FD_2n_Homometry","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AlexPof%2FD_2n_Homometry/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AlexPof%2FD_2n_Homometry/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AlexPof%2FD_2n_Homometry/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/AlexPof","download_url":"https://codeload.github.com/AlexPof/D_2n_Homometry/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AlexPof%2FD_2n_Homometry/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28566588,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-19T08:53:44.001Z","status":"ssl_error","status_checked_at":"2026-01-19T08:52:40.245Z","response_time":67,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["brute-force","c","enumeration","music-theory","python3"],"created_at":"2026-01-19T11:35:00.237Z","updated_at":"2026-01-19T11:35:00.289Z","avatar_url":"https://github.com/AlexPof.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# D_2n Homometry\n\nC algorithm for brute-force enumeration of homometric sets in the dihedral groups D_2n\n\nSee the paper *Genuys G., Popoff A. (2017) Homometry in the Dihedral Groups: Lifting Sets from  ℤn to  Dn. In: Agustín-Aquino O., Lluis-Puebla E., Montiel M. (eds) Mathematics and Computation in Music. MCM 2017. Lecture Notes in Computer Science, vol 10527. Springer, Cham* for more theoretical information.\n\n==========\n\nCompile the C program with gcc and start:\n\n    \u003e\u003e\u003e ./D2n_homomenumerate n p output_file\n\nwhere\n\n  * *n* is an integer defining the order of the D_2n dihedral group\n  * *p* is an integer defining the cardinality of the subsets of D_2n to be\n        examined.\n  * *output_file* is the name of the output file to be written\n\nFor example:\n\n    \u003e\u003e\u003e ./D2n_homomenumerate 12 5 output.txt\n\nUse the python script to count the unique homometric n-uples:\n\n    \u003e\u003e\u003e python D2n_homomcounts.py output.txt\n\nWith the above example:\n\n    \u003e\u003e\u003e python D2n_homomcounts.py\n    # of left homometric subsets\n    2-uples: 8\n    3-uples: 2\n    # of simultaneous left and right homometric subsets\n    2-uples: 8\n    3-uples: 2\n\nThe zip file *partial_results.zip* contains a partial enumeration of subsets of cardinality *p* in the dihedral groups D_2n, for *p=4,5,6,7* and n from 8 to 18.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Falexpof%2Fd_2n_homometry","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Falexpof%2Fd_2n_homometry","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Falexpof%2Fd_2n_homometry/lists"}