Equivalent combinatorial expansion formulas for generalized cluster algebras on punctured orbifolds are derived using snake graphs, labelled posets, matrices, and T-walks, generalizing prior results for surfaces and unpunctured orbifolds.
Classes of recursively enumerable sets and their decision problems.Trans- actions of the American Mathematical Society, 74(2):358–366
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
years
2026 5verdicts
UNVERDICTED 5representative citing papers
RESTestBench shows that LLM-generated REST API test effectiveness drops when interacting with faulty or mutated code, especially for vague requirements, indicating that high-detail requirements make direct SUT interaction unnecessary.
QRSI spans degenerate quantum eigenspaces almost surely by conjugating the Hamiltonian with random unitaries on g parallel branches and using subspace estimation, while exactly preserving the spectral gap.
Orbit gaps prevent exact classification of tractable problems by closure-invariant structural predicates on the full binary pairwise domain, blocking universal exact-certification characterizations.
Turing's work relies on Cantor's contributions; a new undecidability measure and U-complete, D-complete, H-complete classes are defined, with a negative answer to a P-vs-NP analog for undecidable problems.
citing papers explorer
-
Cluster Expansions from Punctured Orbifolds
Equivalent combinatorial expansion formulas for generalized cluster algebras on punctured orbifolds are derived using snake graphs, labelled posets, matrices, and T-walks, generalizing prior results for surfaces and unpunctured orbifolds.
-
RESTestBench: A Benchmark for Evaluating the Effectiveness of LLM-Generated REST API Test Cases from NL Requirements
RESTestBench shows that LLM-generated REST API test effectiveness drops when interacting with faulty or mutated code, especially for vague requirements, indicating that high-detail requirements make direct SUT interaction unnecessary.
-
Quantum Randomized Subspace Iteration
QRSI spans degenerate quantum eigenspaces almost surely by conjugating the Hamiltonian with random unitaries on g parallel branches and using subspace estimation, while exactly preserving the spectral gap.
-
Exact Structural Abstraction and Tractability Limits
Orbit gaps prevent exact classification of tractable problems by closure-invariant structural predicates on the full binary pairwise domain, blocking universal exact-certification characterizations.
-
Turing or Cantor: That is the Question
Turing's work relies on Cantor's contributions; a new undecidability measure and U-complete, D-complete, H-complete classes are defined, with a negative answer to a P-vs-NP analog for undecidable problems.