Combining Hertzian contact mechanics with Ginzburg-Landau theory yields a nucleation criterion for tip-induced superconductivity that explains observed critical temperatures in topological semimetals parameter-free and predicts TISC in Sb and Y.
Canonical reference
Soille,Morphological Image Analysis: Principles and Applications, 2nd ed
Canonical reference. 80% of citing Pith papers cite this work as background.
29
Pith papers citing it
Background
80% of classified citations
citation-role summary
background 4
method 1
citation-polarity summary
representative citing papers
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.
Gradient estimation of probabilistic programs reduces soundly to probabilistic inference after programmable coupling and factorization, enabling new low-variance estimators that beat baselines.
Labelled sequent calculi are developed and shown sound and complete for four team-semantics logics, with admissible structural rules and terminating search procedures.
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.
The minimum level of a rooted network with hardwired clusters exactly C equals the maximum, over Hasse blocks B, of the size of a minimum generating set for overlap-intersections in B.
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 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.
fog composes LLM-generated motion functions (verbs/adverbs/gestures/emotions) so people recognize intended semantics in Heider-Simmel animations at 68% accuracy and iterate faster than pure prompting.
DOCKING uses ordinary kriging on sparse RSRP/SINR data to reconstruct REMs, approximates dominant attenuation as cuboids, and optimizes MIAB placement via genetic algorithm in smart-port settings.
InqAL extends inquisitive neighborhood logic to concurrent game structures, proves expressive equivalence to part of coalition logic, and supplies a complete axiomatization with decidability via finite model property plus a representation theorem for effectivity functions.
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.
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).
Presents a hierarchy of private delegated quantum computation protocols separating state privacy, transcript ambiguity, and output privacy under stated leakage and collusion assumptions.
citing papers explorer
-
Nucleation and Enhancement of Superconductivity under Tip-Induced Strain Fields
Combining Hertzian contact mechanics with Ginzburg-Landau theory yields a nucleation criterion for tip-induced superconductivity that explains observed critical temperatures in topological semimetals parameter-free and predicts TISC in Sb and Y.
-
Optimal embedding dimension in the Nash--Tognoli theorem
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.
-
GradInf: Gradient Estimation as Probabilistic Inference
Gradient estimation of probabilistic programs reduces soundly to probabilistic inference after programmable coupling and factorization, enabling new low-variance estimators that beat baselines.
-
Labelled Sequent Calculi for Propositional Team Logics
Labelled sequent calculi are developed and shown sound and complete for four team-semantics logics, with admissible structural rules and terminating search procedures.
-
bpK#: Delegatable Pseudonyms And Their Applications to National eID Systems
Introduces bPk# as a delegatable pseudonym system with a formal framework, generic construction with security proofs, concrete instantiation, and reference implementation for eID applications.
-
Invariants of real affine varieties based on their complexifications
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 for the Mass-Radius Relation of Solitons
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.
-
Minimum Network Level Forced by Hardwired Cluster Data
The minimum level of a rooted network with hardwired clusters exactly C equals the maximum, over Hasse blocks B, of the size of a minimum generating set for overlap-intersections in B.
-
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.
-
A Categorical Basis for Robust Program Analysis
A categorical framework characterizes robustness in program analysis as functors and gives recipes for lifting sound robust analyses from restricted models to general programs.
-
The Search for Constrained Random Generators
A Lean library called Palamedes uses synthesis rules from generator semantics and catamorphism-anamorphism rewriting to automatically produce correct constrained random generators.
-
Subcritical annulus crossing in spatial random graphs
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.
-
Logical Relations for Session-Typed Concurrency
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.
-
fog: Expressing Motion and Emotion through Function Composition of AI-Generated Code
fog composes LLM-generated motion functions (verbs/adverbs/gestures/emotions) so people recognize intended semantics in Heider-Simmel animations at 68% accuracy and iterate faster than pure prompting.
-
Mobile Base Station Positioning in Smart Ports Based on Kriged Sparse Measurements and Obstacle Inference
DOCKING uses ordinary kriging on sparse RSRP/SINR data to reconstruct REMs, approximates dominant attenuation as cuboids, and optimizes MIAB placement via genetic algorithm in smart-port settings.
-
Inquisitive Action Logic
InqAL extends inquisitive neighborhood logic to concurrent game structures, proves expressive equivalence to part of coalition logic, and supplies a complete axiomatization with decidability via finite model property plus a representation theorem for effectivity functions.
-
Surface Contact Approximation for Magneto-Thermal Finite Element Analysis of No-Insulation HTS Coils
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.
-
Convergence Analysis of Evolution Strategies for Mixed-Integer Optimization
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.
-
From Finite-Node Conifold Geometry to BPS Structures III: Mediated Triangle Transport and Graded Interaction Data
Mediated triangle transport yields graded interaction polynomials I_Σ^gr from conifold state data, extending binary support structures for BPS and stability theory.
-
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.
-
Principal Component Based Estimation of Finite Population Mean under Multicollinearity
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.
-
Explainable Artificial Intelligence for Financial Integral Equations: A Fixed-Point Neural Operator Approach
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.
-
Non-liftability of Families of Abelian Varieties with Small $l$-adic Local System
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).
-
Private Delegated Quantum Computing for User-Level and Industry-Level Settings
Presents a hierarchy of private delegated quantum computation protocols separating state privacy, transcript ambiguity, and output privacy under stated leakage and collusion assumptions.
-
The STRASSE liquid hydrogen target system
Development of a cryogenic liquid hydrogen target system optimized for rapid cool-down and high-luminosity quasi-free scattering measurements in inverse kinematics.
-
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.
- Quantum $f$-divergences via Nussbaum-Szko{\l}a Distributions in Semifinite von Neumann Algebras
- State Space Estimation for DPOR-based Model Checkers(Extended Version)
- Reflections on the design, applications and implementations of the normative specification language eFLINT