A short proof of a conjecture of Aougab–Huang

Geometriae Dedicata - In response to Sanki–Vadnere, we present a short proof of the following theorem: a pair of simple curves on a hyperbolic surface whose complementary regions are disks...     

Forward–backward systems for expected utility maximization

In this paper we deal with the utility maximization problem with general utility functions including power utility with liability. We derive a new approach in which we reduce the resulting control problem to the study of a system of fully-coupled Forward–Backward Stochastic Differential Equations (FBSDEs) that promise to be accessible to numerical treatment.     

On the Lang–Trotter conjecture for two elliptic curves

The Ramanujan Journal - We extend the author’s earlier computation and give coefficient formulas for the (quasimodular) Poincaré square series of weight 3 / 2 and...     

New generalization of the two-dimensional Bernfeld–Haddock conjecture and its proof

In this paper, we investigate a class of systems of delay differential equations. These systems have important practical applications and also are a two-dimensional generalization of the Bernfeld–Haddock conjecture. It is shown that each bounded solution of the systems tends to a constant vector under a desirable condition. Our results improve some corresponding ones already known and, in particular, give a proof of the Bernfeld–Haddock conjecture.     

Subword complexity of the Fibonacci–Thue–Morse sequence: The proof of Dekking’s conjecture

Recently F. M. Dekking conjectured the form of the subword complexity function for the Fibonacci–Thue–Morse sequence. In this note we prove his conjecture by purely computational means, using the free software Walnut.     

A simplified proof of the André-Oort conjecture for products of modular curves

In this paper we give a short proof of the André-Oort conjecture for products of modular curves under the Generalised Riemann Hypothesis using only simple Galois-theoretic and geometric arguments. We believe this method represents a strategy for proving the conjecture for a general Shimura variety under GRH without using ergodic theory. We also demonstrate a short proof of the Manin–Mumford conjecture for Abelian varieties using similar arguments.     

An unconditional proof of the Andr���COort conjecture for Hilbert modular surfaces

We give an unconditional proof of the André?COort conjecture for Hilbert modular surfaces asserting that an algebraic curve contained in such a surface and containing an infinite set of special points, is special. The proof relies on a combination of Galois-theoretic techniques and results from the theory of o-minimal structures.     

Computation of the solutions of the Fokker–Planck equation for one and two DOF systems

Uncertainty in structures may come from unknowns in the modelisation and in the properties of the materials, from variability with time, external noise, etc. This leads to uncertainty in the dynamic response. Moreover, the consequences are issues in safety, reliability, efficiency, etc. of the structure. So an issue is the gain of information on the response of the system taking into account the uncertainties [Mace BR, Worden K, Manson G. Uncertainty in structural dynamics. J Sound Vib 2005;288(3):423–9].If the forcing or the uncertainty can be modelled through a white noise, the Fokker–Planck (or Kolmogorov forward) equation exists. It is a partial differential linear equation with unknown p(X, t), where p(X, t) is the probability density function of the state X at time t.In this article, we solve this equation using the finite differences method, for one and two DOF systems. The numerical solutions obtained are proved to be nearly correct.     

Evolutionary trees and the Ising model on the Bethe lattice: a proof of Steel��s conjecture

A major task of evolutionary biology is the reconstruction of phylogenetic trees from molecular data. The evolutionary model is given by a Markov chain on a tree. Given samples from the leaves of the Markov chain, the goal is to reconstruct the leaf-labelled tree. It is well known that in order to reconstruct a tree on n leaves, sample sequences of length ??(log n) are needed. It was conjectured by Steel that for the CFN/Ising evolutionary model, if the mutation probability on all edges of the tree is less than ${p^{\ast} = (\sqrt{2}-1)/2^{3/2}}$ , then the tree can be recovered from sequences of length O(log n). The value p* is given by the transition point for the extremality of the free Gibbs measure for the Ising model on the binary tree. Steel??s conjecture was proven by the second author in the special case where the tree is ??balanced.?? The second author also proved that if all edges have mutation probability larger than p* then the length needed is n ^??(1). Here we show that Steel??s conjecture holds true for general trees by giving a reconstruction algorithm that recovers the tree from O(log n)-length sequences when the mutation probabilities are discretized and less than p*. Our proof and results demonstrate that extremality of the free Gibbs measure on the infinite binary tree, which has been studied before in probability, statistical physics and computer science, determines how distinguishable are Gibbs measures on finite binary trees.     

On the product of twists of rank two and a conjecture of Larsen

In this note we present examples of elliptic curves and infinite parametric families of pairs of integers (d,d′) such that, if we assume the parity conjecture, we can show that E ^d ,E ^d′ and E ^dd′ are all of positive even rank over ℚ. As an application, we show examples where a conjecture of M. Larsen holds.      

Some criteria for the global finite-time synchronization of two Lorenz–Stenflo systems coupled by a new controller

This paper investigates the global finite-time synchronization of two chaotic Lorenz–Stenflo systems coupled by a new controller called the generalized variable substitution controller. First of all, the generalized variable substitution controller is designed to establish the master–slave finite-time synchronization scheme for the Lorenz–Stenflo systems. And then, based on the finite-time stability theory, a sufficient criterion on the finite-time synchronization of this scheme is rigorously verified in the form of matrix and the corresponding estimation for the synchronization time is analytically given. Applying this criterion, some sufficient finite-time synchronization criteria under various generalized variable substitution controllers are further derived in the algebraic form. Finally, some numerical examples are introduced to compare the results proposed in this paper with those proposed in the existing literature, verifying the effectiveness of the criteria obtained.     

Polynomiality of Hurwitz numbers,Bouchard–Mariño conjecture,and a new proof of the ELSV formula

In this paper we give a new proof of the ELSV formula. First, we refine an argument of Okounkov and Pandharipande in order to prove (quasi-)polynomiality of Hurwitz numbers without using the ELSV formula (the only way to do that before used the ELSV formula). Then, using this polynomiality we give a new proof of the Bouchard–Mariño conjecture. After that, using the correspondence between the Givental group action and the topological recursion coming from matrix models, we prove the equivalence of the Bouchard–Mariño conjecture and the ELSV formula (it is a refinement of an argument by Eynard).     

Riemann-integration and a new proof of the Bichteler–Dellacherie theorem

We give a new proof of the celebrated Bichteler–Dellacherie theorem, which states that a process S$S$ is a good integrator if and only if it is the sum of a local martingale and a finite-variation process. As a corollary, we obtain a characterization of semimartingales along the lines of classical Riemann integrability.