Related papers: Kolmogorov variation: KAM with knobs (\`a la Kolmo…
We present numerical homotopy continuation algorithms for solving systems of equations on a variety in the presence of a finite Khovanskii basis. These take advantage of Anderson's flat degeneration to a toric variety. When Anderson's…
It has been a long standing problem to find good symbolic codings for translations on the $d$-dimensional torus that enjoy the beautiful properties of Sturmian sequences like low factor complexity and good local discrepancy properties.…
We analyze three different quantum search algorithms, the traditional Grover's algorithm, its continuous-time analogue by Hamiltonian evolution, and finally the quantum search by local adiabatic evolution. We show that they are closely…
Grover's quantum algorithm improves any classical search algorithm. We show how random Gaussian noise at each step of the algorithm can be modelled easily because of the exact recursion formulas available for computing the quantum amplitude…
Time-frequency analysis, such as the Gabor transform, plays an important role in many signal processing applications. The redundancy of such representations is often directly related to the computational load of any algorithm operating in…
We investigate what can be concluded about a quantum system when sequential quantum measurements of its observable -- a prominent example of the so-called quantum stochastic process -- fulfill the Kolmogorov consistency condition and thus…
Eliasson and Kuksin developed a KAM approach to study the persistence of the invariant tori for nonlinear Schr\"{o}dinger equation on $\mathbb{T}^{d}$. In this note, we improve Eliasson and Kuksin's KAM theorem by using Kolmogorov's…
We propose DropKAN (Dropout Kolmogorov-Arnold Networks) a regularization method that prevents co-adaptation of activation function weights in Kolmogorov-Arnold Networks (KANs). DropKAN functions by embedding the drop mask directly within…
In this paper, we prove a KAM theorem in a-posteriori format, using the parameterization method to look invariant tori in non-autonomous Hamiltonian systems with $n$ degrees of freedom that depend periodically or quasi-periodically (QP) on…
This work proposes a Momentum-Enabled Kronecker-Factor-Based Optimizer Using Rank-1 updates, called MKOR, that improves the training time and convergence properties of deep neural networks (DNNs). Second-order techniques, while enjoying…
In this paper we study the problem of the convergence in variation for the generalized sampling series based upon averaged-type kernels in the multidimensional setting. As a crucial tool, we introduce a family of operators of…
We introduce a diagrammatic approach to Rasmussen's $s$-invariant, based on Bar-Natan's reformulation of Khovanov homology for tangles and cobordisms. This method enables a local computation of $s$ from a tangle decomposition of a knot…
We present a KAM theorem for presymplectic dynamical systems. The theorem has a " a posteriori " format. We show that given a Diophantine frequency $\omega$ and a family of presymplectic mappings, if we find an embedded torus which is…
In this article, we consider the problem of estimating fractional processes based on noisy high-frequency data. Generalizing the idea of pre-averaging to a fractional setting, we exhibit a sequence of consistent estimators for the unknown…
We present a new continuation algorithm to find all nondegenerate real solutions to a system of polynomial equations. Unlike homotopy methods, it is not based on a deformation of the system; instead, it traces real curves connecting the…
In this note we give concise formulas, which lead to a simple and fast computer program that computes a powerful knot invariant. This invariant $\rho_1$ is not new, yet our formulas are by far the simplest and fastest: given a knot we write…
Grammar-based compression is a widely-accepted model of string compression that allows for efficient and direct manipulations on the compressed data. Most, if not all, such manipulations rely on the primitive \emph{random access} queries, a…
We summarize our recent findings, where we proposed a framework for learning a Kolmogorov model, for a collection of binary random variables. More specifically, we derive conditions that link outcomes of specific random variables, and…
In this paper, we extend the method proposed by Cochelin and Vergez [A high order purely frequency-based harmonic balance formulation for continuation of periodic solutions, Journal of Sound and Vibration, 324 (2009) 243-262] to the case of…
This article is about the proof of the celebrated KAM theorem as sketched out in \cite{KOL} Kolmogorov's original presentation to the ICM. The proof presented here has been detailed as an effort to clarify if Kolmogorov's argument can be…