A specific class of subsets of R^3 containing all algebraic sets admits minimum adapted CADs, giving the first positive existence theorem for such decompositions in dimension three.
hub Canonical reference
Thegreatestcommondivisor:acasestudy for program extraction from classical proofs
Canonical reference. 100% of citing Pith papers cite this work as background.
19
Pith papers citing it
Background
100% of classified citations
hub tools
citation-role summary
background 8
citation-polarity summary
roles
background 8polarities
background 8representative citing papers
2G2T enables constant-size, statistically sound outsourcing of MSM with verification up to 300x faster than local computation and error probability at most 1/q.
A simple deterministic algorithm sorts n items with m given comparisons in O(m + log T) time using O(log T) comparisons by combining topological sort, heapsort, and binary search.
Small 7B reasoning models were fine-tuned on synthetic and curated QFT problems using RL and SFT, yielding performance gains, error analysis, and public release of data and traces.
Empirical integral operators with discontinuous non-negative symmetric kernels converge spectrally to their population versions with explicit rates as sample size grows to infinity.
New algorithm computes holonomic submodule of partial Weyl closure via non-commutative Rabinowitsch trick, implemented in Julia with reported speedups over Singular and Macaulay2.
Waiting nets extend time Petri nets by decoupling time measurement from control, admit finite state class graphs for bounded instances, and are strictly more expressive than TPNs under timed language equivalence.
A prox-based semi-smooth Newton method for TV-minimization that is globally well-posed and locally superlinearly convergent under finite element discretization, extending to broader convex problems.
None of the four properties in the refined A-translation admits a recursive characterization; the framework is extended with conjunction and a Rust prover is presented as a case study.
New isotopic data from presolar SiC grains are best reproduced by hydrodynamic models of CO novae, establishing them as the primary source for 1-2% of such grains.
k-contact geometry supplies explicit Hamiltonian descriptions for multiple dissipative PDEs including damped Klein-Gordon, Allen-Cahn, Fisher-KPP, and complex Ginzburg-Landau equations.
Bulk-edge correspondence for fractional quantum Hall systems is realized as relative higher gauge theory from the complex Hopf fibration, geometrically engineered via M2/M5-branes and TED Cohomotopy flux quantization.
WARM-VR provides a new public dataset of wristband and ECG signals from 31 people in VR stress-relaxation experiences with olfactory cues, plus baseline ML classification results for valence and arousal.
A template-based lemma generation method integrated into bounded rewriting induction for higher-order LCSTRSs enables proving program equivalences previously out of reach.
Simulations show Ridge, Lasso, and ElasticNet perform similarly for prediction at high sample-to-feature ratios, but Lasso feature selection recall drops to 0.18 under high multicollinearity and low SNR while ElasticNet holds at 0.93.
A review that contrasts common assumptions about the Lindblad equation with refined expectations drawn from examples, culminating in a checklist for assessing its breakdown.
Lecture notes on quantum thermodynamics showing emergence of thermodynamic laws from quantum theory via Markovian master equations for small systems.
A survey of string covering techniques including covers and seeds, with proposals for future research directions in combinatorial string algorithms.
citing papers explorer
-
On the Limits of Recursive Characterizations in the Refined $A$-Translation
None of the four properties in the refined A-translation admits a recursive characterization; the framework is extended with conjunction and a Rust prover is presented as a case study.