Related papers: Excursion Processes Associated with Elliptic Combi…

In order to find analytically the travelling waves of partially integrable autonomous nonlinear partial differential equations, many methods have been proposed over the ages: "projective Riccati method", "tanh-method", "exponential method",…

For a symmetric random walk in $Z^2$ which does not necessarily have bounded jumps we study those points which are visited an unusually large number of times. We prove the analogue of the Erd\H{o}s-Taylor conjecture and obtain the…

We define elliptic sequences over a commutative ring as sequences indexed by the (positive) integers satisfying a 4-parameter, highly symmetric family of homogeneous quartic relations among terms which we call elliptic relations. We…

This survey is devoted to the asymptotic behavior of solutions of evolution equations generated by maximal monotone operators in Hilbert spaces. The emphasis is in the comparison of the continuous time trajectories to sequences generated by…

Let $E_\lambda$ be the Legendre elliptic curve of equation $Y^2=X(X-1)(X-\lambda)$. We recently proved that, given $n$ linearly independent points $P_1(\lambda), \dots,P_n(\lambda)$ on $E_\lambda$ with coordinates in…

Schanuel Conjecture contains all ``reasonable" statements that can be made on the values of the exponential function. In particular it implies the Lindemann-Weierstrass Theorem. In my Ph.D. I showed that Schanuel Conjecture has a…

We consider a discrete-time random walk on a line starting at $x_0\geq 0$ where a cost is incurred at each jump. We obtain an exact analytical formula for the distribution of the total cost of a trajectory until the process crosses the…

Transportation and distribution networks are a class of spatial networks that have been of interest in recent years. These networks are often characterized by the presence of complex structures such as central loops paired with peripheral…

We prove the existence of a family of travelling wave solutions in a variant of the $\textit{Zeldovich-Frank-Kamenetskii (ZFK) equation}$, a reaction-diffusion equation which models the propagation of planar laminar premixed flames in…

We propose a new approach for solving combinatorial optimization problem by utilizing the mechanism of chases and escapes, which has a long history in mathematics. In addition to the well-used steepest descent and neighboring search, we…

Random walks are the simplest way to explore or search a graph, and have revealed a very useful tool to investigate and characterize the structural properties of complex networks from the real world, e.g. they have been used to identify the…

We introduce new notions in elliptic Schubert calculus: the (twisted) Borisov-Libgober classes of Schubert varieties in general homogeneous spaces G/P. While these classes do not depend on any choice, they depend on a set of new variables.…

Electronic transport through chaotic quantum dots exhibits universal behaviour which can be understood through the semiclassical approximation. Within the approximation, transport moments reduce to codifying classical correlations between…

We evaluate the configuration exponents of various ensembles of Hamiltonian paths drawn on random planar bicubic maps. These exponents are estimated from the extrapolations of exact enumeration results for finite sizes and compared with…

In this paper, we consider the problem of minimizing the sum of two convex functions subject to linear linking constraints. The classical alternating direction type methods usually assume that the two convex functions have relatively easy…

We consider the problem of estimating the average tour length of the asymmetric TSP arising from the disk scheduling problem with a linear seek function and a probability distribution on the location of I/O requests. The optimal disk…

We investigate a class of composite nonconvex functions, where the outer function is the sum of univariate extended-real-valued convex functions and the inner function is the limit of difference-of-convex functions. A notable feature of…

The classical fuel-optimal two-impulse rendezvous problem between Keplerian orbits is revisited from a family-based perspective. Conventional approaches often yield isolated optimal solutions whose mutual relationships remain unclear; yet,…

The Levenberg-Marquardt algorithm is a flexible iterative procedure used to solve non-linear least squares problems. In this work we study how a class of possible adaptations of this procedure can be used to solve maximum likelihood…

We introduce and study a family of random processes on trees we call hipster random walks, special instances of which we heuristically connect to the min-plus binary trees introduced by Robin Pemantle and studied by Auffinger and Cable…