mirror of
https://github.com/allaunthefox/Research-Stack.git
synced 2026-07-30 18:56:16 +00:00
Created refined investigation script for Erdős–Gyárfás conjecture where previous test found no power-of-two cycles (conjecture holds: False). Refinements: - Regular graph construction (all vertices same degree) - Exhaustive DFS cycle detection - More samples per n (5 instead of 3) - Extended n values [8, 10, 12, 14, 16] Goal: Determine if previous negative result was due to random graph construction or if regular graphs with exhaustive cycle detection find power-of-two cycles. Script created: investigate_erdos_gyarfas_refined.py Execution canceled by user - awaiting further instructions.
45 lines
1.4 KiB
JSON
45 lines
1.4 KiB
JSON
{
|
|
"cmake.sourceDirectory": "/home/allaun/Documents/Research Stack/2-Search-Space/simulations/heat-2D",
|
|
"files.watcherExclude": {
|
|
"**/.git/objects/**": true,
|
|
"**/.git/subtree-cache/**": true,
|
|
"**/.ipynb_checkpoints/**": true,
|
|
"**/.mypy_cache/**": true,
|
|
"**/.pytest_cache/**": true,
|
|
"**/.ruff_cache/**": true,
|
|
"**/.venv/**": true,
|
|
"**/__pycache__/**": true,
|
|
"**/node_modules/**": true,
|
|
".changes/**": true,
|
|
"4-Infrastructure/ComfyUI/**": true,
|
|
"API KEYS/**": true,
|
|
"Security & Passwords/**": true,
|
|
"ai-math-discovery-systems/**": true,
|
|
"artifacts/**": true,
|
|
"data/**": true,
|
|
"logs/**": true,
|
|
"out/**": true,
|
|
"scratch/**": true,
|
|
"shared-data/**": true
|
|
},
|
|
"search.exclude": {
|
|
"**/.ipynb_checkpoints": true,
|
|
"**/.mypy_cache": true,
|
|
"**/.pytest_cache": true,
|
|
"**/.ruff_cache": true,
|
|
"**/.venv": true,
|
|
"**/__pycache__": true,
|
|
"**/node_modules": true,
|
|
".changes": true,
|
|
"4-Infrastructure/ComfyUI": true,
|
|
"API KEYS": true,
|
|
"Security & Passwords": true,
|
|
"ai-math-discovery-systems": true,
|
|
"artifacts": true,
|
|
"data": true,
|
|
"logs": true,
|
|
"out": true,
|
|
"scratch": true,
|
|
"shared-data": true
|
|
}
|
|
}
|