Every smooth compact submanifold of R^n is isotopically approximable by real loci of nonsingular real algebraic subsets of C^n, settling a version of Nash's conjecture with uniformity for codim >=2.
Canonical reference
Klingbeil,Grundlagen der elektromagnetischen Feldtheorie
Canonical reference. 80% of citing Pith papers cite this work as background.
23
Pith papers citing it
Background
80% of classified citations
citation-role summary
background 4
method 1
citation-polarity summary
representative citing papers
Introduces bPk# as a delegatable pseudonym system with a formal framework, generic construction with security proofs, concrete instantiation, and reference implementation for eID applications.
New invariants extracted from the topology of complexifications of real algebraic sets classify algebraic vector bundles over sphere products and obstruct weak algebraic approximation, disproving Kucharz-Kurdyka conjecture.
A no-go theorem excludes Gamma in [0,d] for typical non-topological non-relativistic spherically symmetric solitons, with the same exclusion for barotropic fluid compact objects, ruling out natural soliton explanations for observed dark matter halo cores with Gamma ~1.7.
A clustering system C is the hardwired clustering system of a rooted level-k network if and only if μ(B) ≤ k for every non-trivial block B in the Hasse diagram H[C].
Empirical measures from Kac's particle system converge to the Boltzmann equation solution for very soft potentials, proving propagation of chaos for all kernel classes.
A categorical framework characterizes robustness in program analysis as functors and gives recipes for lifting sound robust analyses from restricted models to general programs.
A Monte Carlo estimator converts stateless optimal DPOR into an unbiased poly-time estimator for the number of Mazurkiewicz traces by sampling paths in the exploration tree and using stochastic enumeration to control variance.
A Lean library called Palamedes uses synthesis rules from generator semantics and catamorphism-anamorphism rewriting to automatically produce correct constrained random generators.
Derives sharp condition for positive subcritical annulus-crossing intensity in general continuum percolation by linking crossings to long-edge occurrence, with multiscale argument showing decay rates.
Extends logical relations to recursive session types for PSNI, proves soundness/completeness via biorthogonality with observation-index stratification, and gives an IFC refinement type system with secrecy polymorphism.
Presents and verifies a surface contact approximation derived from the thin shell approximation for efficient magneto-thermal FEA of no-insulation HTS coils, showing robustness advantages over thickness-dependent TSA in pancake coil simulations.
Drift analysis on a mixed-integer benchmark shows (1+1)-LB-ES risks premature convergence with large numbers of integer variables while (1+1)-LUB-ES achieves linear convergence after integers are fixed under suitable bounds.
Mediated triangle transport yields graded interaction polynomials I_Σ^gr from conifold state data, extending binary support structures for BPS and stability theory.
Mixed-precision SSA with stochastic rounding preserves ensemble statistics across five biological models while cutting memory use by 2-4x and delivering up to 1.5x CPU speedup.
PCA is used to orthogonalize correlated auxiliary variables for constructing a more efficient estimator of the finite population mean under simple random sampling, with derived bias and MSE showing improved performance in simulations.
Quantum f-divergence equals classical f-divergence of Nussbaum-Szkoła distributions for normal states on semifinite von Neumann algebras.
A fixed-point neural operator framework models stochastic Fredholm integral equations as stochastic deep neural networks and applies them to financial equations including Black-Scholes, contagion dynamics, and Merton jump diffusion, with results reported to agree well.
Families of abelian varieties over curves in char p with small l-adic local systems have non-nef Hodge bundles and are non-liftable to W_2(k).
eFLINT is a normative specification language combining declarative and procedural elements to support automated compliance reasoning before, during, and after software execution.
Presents a hierarchy of private delegated quantum computation protocols separating state privacy, transcript ambiguity, and output privacy under stated leakage and collusion assumptions.
Development of a cryogenic liquid hydrogen target system optimized for rapid cool-down and high-luminosity quasi-free scattering measurements in inverse kinematics.
The authors propose Decentralized Consensus Technology (DCT) as an umbrella term for systems with decentralization, trustlessness and eventual consensus, positioning blockchain as one implementation of decentralized ledger technology.
citing papers explorer
-
Propagation of chaos for the Boltzmann equation with very soft potentials
Empirical measures from Kac's particle system converge to the Boltzmann equation solution for very soft potentials, proving propagation of chaos for all kernel classes.
-
Reduced-Precision Stochastic Simulation for Mathematical Biology
Mixed-precision SSA with stochastic rounding preserves ensemble statistics across five biological models while cutting memory use by 2-4x and delivering up to 1.5x CPU speedup.
-
Quantum $f$-divergences via Nussbaum-Szko{\l}a Distributions in Semifinite von Neumann Algebras
Quantum f-divergence equals classical f-divergence of Nussbaum-Szkoła distributions for normal states on semifinite von Neumann algebras.
-
Properties of Decentralized Consensus Technology -- Why not every Blockchain is a Blockchain
The authors propose Decentralized Consensus Technology (DCT) as an umbrella term for systems with decentralization, trustlessness and eventual consensus, positioning blockchain as one implementation of decentralized ledger technology.