Exact Jones polynomial calculator, LaTeX exporter, and calibrated LCL-833 metrics (PRO)
Project description
lcl833-master
lcl833-master computes exact Jones polynomials from braid words using the Kauffman bracket state sum, evaluates them at the fifth root of unity $q = \exp(2\pi i/5)$, and derives calibrated LCL-833 / SATI-CODEX protection metrics ($\delta_{eff}, \alpha_{op}, G_{gap}, \epsilon_{eff}, \omega, T_{min}$) directly in your terminal or Python environment.
Features
- Exact Jones Polynomials: Uses
fractions.Fractionfor rational exponents to maintain exactness during intermediate steps. - Parallel Execution: Multiprocessing support for complex braids (>= 12 crossings) to significantly reduce computation time.
- LaTeX Export: Generate publication-ready TeX strings for any computed polynomial.
- Expanded Presets: Full support for standard knots from the Rolfsen table (3_1 through 7_1).
- LCL-833 Metrics: Calibrated against the trefoil knot anchor ($|J(3_1; q_5)| \approx 1.543$).
- CLI & API: Use it as a standalone tool or a Python library.
Installation
pip install lcl833-master
CLI Usage
Basic Commands
# Run a preset knot (3_1, 4_1, figure8, etc.)
lcl833 knot 3_1
# Run a custom braid word (Artin generators σ_i)
lcl833 braid 1 1 1
lcl833 braid 1 -2 1 -2
# Emit JSON output (includes LaTeX strings)
lcl833 knot 3_1 --json
Advanced Options
--table: Show a comparison table of all preset knots.--genus: Logical genus (default: 5).--gamma: Khovanov correction factor (default: 0.05).--max-crossings: Maximum allowed crossings (default: 18).--no-lcl: Skip calibrated metrics and only show Jones results.
lcl833 table
Python API Usage
from lcl833_master import compute_jones_result, compute_lcl833_metrics
# Compute Jones polynomial for the trefoil (σ₁³)
res = compute_jones_result((1, 1, 1))
print(f"Jones Polynomial: {res.normalized_jones_pretty}")
print(f"LaTeX: {res.normalized_jones_latex}")
print(f"Magnitude at q5: {res.magnitude_at_q5:.4f}")
# Compute LCL-833 metrics
metrics = compute_lcl833_metrics(v_j=res.magnitude_at_q5, genus=5)
print(f"Alpha_op: {metrics.alpha_op:.4f}")
print(f"T_min: {metrics.t_min}")
Performance Note
Kauffman bracket computation is $O(2^n)$. For braids with $n \ge 12$, the library automatically utilizes all available CPU cores via multiprocessing. Use --max-crossings to prevent accidental long-running processes on extremely large diagrams.
License
MIT License. See LICENSE for details.
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Filter files by name, interpreter, ABI, and platform.
If you're not sure about the file name format, learn more about wheel file names.
Copy a direct link to the current filters
File details
Details for the file lcl833_master-0.3.0.tar.gz.
File metadata
- Download URL: lcl833_master-0.3.0.tar.gz
- Upload date:
- Size: 16.7 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/6.2.0 CPython/3.11.0
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
0c695db4779005148f84e1465351ed8f5c5b74b9d29c8d58274d8fac05af10a8
|
|
| MD5 |
f6f4c4d1dd98b1b76b1b02451e3a7a18
|
|
| BLAKE2b-256 |
b5b03f275fd51a2d79a0b4f20ea97e926e7f1d8406714675366c593fb501da06
|
File details
Details for the file lcl833_master-0.3.0-py3-none-any.whl.
File metadata
- Download URL: lcl833_master-0.3.0-py3-none-any.whl
- Upload date:
- Size: 13.5 kB
- Tags: Python 3
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/6.2.0 CPython/3.11.0
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
c14afe85d5344a36df4121b703b2d78a67df8339d66258bb9983b24272c35d98
|
|
| MD5 |
065ca09877b2ec99e1a0f7432a8a57a7
|
|
| BLAKE2b-256 |
2d9b8c2de769436accd59e9d1fa439578d16c5a0cfa25166b1dc3e193271ab05
|