More Like this

1. Variation of canonical height for\break Fatou points on ℙ ¹

   https://doi.org/10.1515/crelle-2022-0078  

   DeMarco, Laura; Mavraki, Niki Myrto (December 2022, Journal für die reine und angewandte Mathematik (Crelles Journal))

   Abstract Let f : ℙ 1 → ℙ 1 {f:\mathbb{P}^{1}\to\mathbb{P}^{1}} be a map of degree > 1 {>1} defined over a function field k = K ⁢ ( X ) {k=K(X)} , where K is a number field and X is a projective curve over K . For each point a ∈ ℙ 1 ⁢ ( k ) {a\in\mathbb{P}^{1}(k)} satisfying a dynamical stability condition, we prove that the Call–Silverman canonical height for specialization f t {f_{t}} at point a t {a_{t}} , for t ∈ X ⁢ ( ℚ ¯ ) {t\in X(\overline{\mathbb{Q}})} outside a finite set, induces a Weil height on the curve X ; i.e., we prove the existence of a ℚ {\mathbb{Q}} -divisor D = D f , a {D=D_{f,a}} on X so that the function t ↦ h ^ f t ⁢ ( a t ) - h D ⁢ ( t ) {t\mapsto\hat{h}_{f_{t}}(a_{t})-h_{D}(t)} is bounded on X ⁢ ( ℚ ¯ ) {X(\overline{\mathbb{Q}})} for any choice of Weil height associated to D . We also prove a local version, that the local canonical heights t ↦ λ ^ f t , v ⁢ ( a t ) {t\mapsto\hat{\lambda}_{f_{t},v}(a_{t})} differ from a Weil function for D by a continuous function on X ⁢ ( ℂ v ) {X(\mathbb{C}_{v})} , at each place v of the number field K . These results were known for polynomial maps f and all points a ∈ ℙ 1 ⁢ ( k ) {a\in\mathbb{P}^{1}(k)} without the stability hypothesis,[21, 14],and for maps f that are quotients of endomorphisms of elliptic curves E over k and all points a ∈ ℙ 1 ⁢ ( k ) {a\in\mathbb{P}^{1}(k)} . [32, 29].Finally, we characterize our stability condition in terms of the geometry of the induced map f ~ : X × ℙ 1 ⇢ X × ℙ 1 {\tilde{f}:X\times\mathbb{P}^{1}\dashrightarrow X\times\mathbb{P}^{1}} over K ; and we prove the existence of relative Néron models for the pair ( f , a ) {(f,a)} , when a is a Fatou point at a place γ of k , where the local canonical height λ ^ f , γ ⁢ ( a ) {\hat{\lambda}_{f,\gamma}(a)} can be computed as an intersection number. 

   more » « less
2. Heuristic bounds on superconductivity and how to exceed them

   https://doi.org/10.1038/s41535-022-00491-1  

   Hofmann, Johannes S.; Chowdhury, Debanjan; Kivelson, Steven A.; Berg, Erez (December 2022, npj Quantum Materials)

   Abstract What limits the value of the superconducting transition temperature ( T c ) is a question of great fundamental and practical importance. Various heuristic upper bounds on T c have been proposed, expressed as fractions of the Fermi temperature, T F , the zero-temperature superfluid stiffness, ρ s (0), or a characteristic Debye frequency, ω 0 . We show that while these bounds are physically motivated and are certainly useful in many relevant situations, none of them serve as a fundamental bound on T c . To demonstrate this, we provide explicit models where T c / T F (with an appropriately defined T F ), T c / ρ s (0), and T c / ω 0 are unbounded. 

   more » « less
3. Sparse Polynomial Hermite Interpolation

   https://doi.org/10.1145/3476446.3535501  

   Kaltofen, Erich L. (July 2022, ISSAC '22 Proc. 2022 ACM Internat. Symp. Symbolic Algebraic Comput.)

   Amir Hashemi (Ed.)

   We present Hermite polynomial interpolation algorithms that for a sparse univariate polynomial f with coefficients from a field compute the polynomial from fewer points than the classical algorithms. If the interpolating polynomial f has t terms, our algorithms, require argument/value triples (w^i, f(w^i), f'(w^i)) for i=0,...,t + ceiling( (t+1)/2 ) - 1, where w is randomly sampled and the probability of a correct output is determined from a degree bound for f. With f' we denote the derivative of f. Our algorithms generalize to multivariate polynomials, higher derivatives and sparsity with respect to Chebyshev polynomial bases. We have algorithms that can correct errors in the points by oversampling at a limited number of good values. If an upper bound B >= t for the number of terms is given, our algorithms use a randomly selected w and, with high probability, ceiling( t/2 ) + B triples, but then never return an incorrect output. The algorithms are based on Prony's sparse interpolation algorithm. While Prony's algorithm and its variants use fewer values, namely, 2t+1 and t+B values f(w^i), respectively, they need more arguments w^i. The situation mirrors that in algebraic error correcting codes, where the Reed-Solomon code requires fewer values than the multiplicity code, which is based on Hermite interpolation, but the Reed-Solomon code requires more distinct arguments. Our sparse Hermite interpolation algorithms can interpolate polynomials over finite fields and over the complex numbers, and from floating point data. Our Prony-based approach does not encounter the Birkhoff phenomenon of Hermite interpolation, when a gap in the derivative values causes multiple interpolants. We can interpolate from t+1 values of f and 2t-1 values of f'. 

   more » « less
4. Large-time behavior of solutions of parabolic equations on the real line with convergent initial data III: unstable limit at infinity

   Pauthier, Antoine; Poláčik, Peter (August 2022, Partial Differential Equations and Applications)

   Abstract This is a continuation, and conclusion, of our study of bounded solutions u of the semilinear parabolic equation $$u_t=u_{xx}+f(u)$$ u t = u xx + f ( u ) on the real line whose initial data $$u_0=u(\cdot ,0)$$ u 0 = u ( · , 0 ) have finite limits $$\theta ^\pm $$ θ ± as $$x\rightarrow \pm \infty $$ x → ± ∞ . We assume that f is a locally Lipschitz function on $$\mathbb {R}$$ R satisfying minor nondegeneracy conditions. Our goal is to describe the asymptotic behavior of u ( x ,  t ) as $$t\rightarrow \infty $$ t → ∞ . In the first two parts of this series we mainly considered the cases where either $$\theta ^-\ne \theta ^+$$ θ - ≠ θ + ; or $$\theta ^\pm =\theta _0$$ θ ± = θ 0 and $$f(\theta _0)\ne 0$$ f ( θ 0 ) ≠ 0 ; or else $$\theta ^\pm =\theta _0$$ θ ± = θ 0 , $$f(\theta _0)=0$$ f ( θ 0 ) = 0 , and $$\theta _0$$ θ 0 is a stable equilibrium of the equation $${{\dot{\xi }}}=f(\xi )$$ ξ ˙ = f ( ξ ) . In all these cases we proved that the corresponding solution u is quasiconvergent—if bounded—which is to say that all limit profiles of $$u(\cdot ,t)$$ u ( · , t ) as $$t\rightarrow \infty $$ t → ∞ are steady states. The limit profiles, or accumulation points, are taken in $$L^\infty _{loc}(\mathbb {R})$$ L loc ∞ ( R ) . In the present paper, we take on the case that $$\theta ^\pm =\theta _0$$ θ ± = θ 0 , $$f(\theta _0)=0$$ f ( θ 0 ) = 0 , and $$\theta _0$$ θ 0 is an unstable equilibrium of the equation $${{\dot{\xi }}}=f(\xi )$$ ξ ˙ = f ( ξ ) . Our earlier quasiconvergence theorem in this case involved some restrictive technical conditions on the solution, which we now remove. Our sole condition on $$u(\cdot ,t)$$ u ( · , t ) is that it is nonoscillatory (has only finitely many critical points) at some $$t\ge 0$$ t ≥ 0 . Since it is known that oscillatory bounded solutions are not always quasiconvergent, our result is nearly optimal. 

   more » « less
5. Odoni’s conjecture on arboreal Galois representations is false

   https://doi.org/10.1090/proc/15920  

   Dittmann, Philip; Kadets, Borys (August 2022, Proceedings of the American Mathematical Society)

   Suppose f ∈ K [ x ] f \in K[x] is a polynomial. The absolute Galois group of K K acts on the preimage tree T \mathrm {T} of 0 0 under f f . The resulting homomorphism ϕ f : Gal K → Aut ⁡ T \phi _f\colon \operatorname {Gal}_K \to \operatorname {Aut} \mathrm {T} is called the arboreal Galois representation. Odoni conjectured that for all Hilbertian fields K K there exists a polynomial f f for which ϕ f \phi _f is surjective. We show that this conjecture is false. 

   more » « less