Related papers: Time-Reversibility in 2-Dim Systems
We introduce an abstract KAM (Kolmogorov-Arnold-Moser) theorem for infinite dimensional reversible Schr\"odinger systems. Using this KAM theorem together with partial Birkhoff normal form method, we find the existence of quasi-periodic…
In this paper, the Boiti Leon Pempinelli system in (2+1)-dimensions is revisited for Lie symmetries and invariant solutions. An infinite-dimensional Lie algebra is obtained using the Lie invariance criterion and is further classified into…
Right-reversing is an algorithm used to compute least common multiples in monoids that admit a right-complemented presentation. The algorithm can either terminate and find a result, fail, or run indefinitely. The correctness of the…
This letter is focused on the design and analysis of computational wideband time-reversal imaging algorithms, designed to be adaptive with respect to the noise levels pertaining to the frequencies being employed for scene probing. These…
We explicitly determine the values of reduced cyclotomic periods of order $2^m$, $m\ge 4$, for finite fields of characteristic $p\equiv 3$ or $5\pmod{8}$. These evaluations are applied to obtain explicit factorizations of the corresponding…
In this paper, we study the following problem of reconstructing a simple polygon: Given a cyclically ordered vertex sequence of an unknown simple polygon P of n vertices and, for each vertex v of P, the sequence of angles defined by all the…
We describe all possible bimodal over-twist patterns. In particular, we give an algorithm allowing one to determine what the left endpoint of the over-rotation interval of a given bimodal map is. We then define a new class of polymodal…
In this paper we show how to recover a spectral approximations to broad classes of structured matrices using only a polylogarithmic number of adaptive linear measurements to either the matrix or its inverse. Leveraging this result we obtain…
We propose a neural network-based algorithm for solving forward and inverse problems for partial differential equations in unsupervised fashion. The solution is approximated by a deep neural network which is the minimizer of a cost…
We introduce a new 2N--parametric family of maximally superintegrable systems in N dimensions, obtained as a reduction of an anisotropic harmonic oscillator in a 2N--dimensional configuration space. These systems possess closed bounded…
This document contains notes based on lectures given by Hendrik Lenstra at the PCMI summer school 2022. There are many problems in algebraic number theory which one would like to solve algorithmically, for example computation of the maximal…
An element of a group is \emph{reversible} if it is conjugate to its own inverse, and it is \emph{strongly reversible} if it is conjugate to its inverse by an involution. A group element is strongly reversible if and only if it can be…
We show that any submodular minimization (SM) problem defined on a linear constraint set with constraints having up to two variables per inequality, are 2-approximable in polynomial time. If the constraints are monotone (the two variables…
We describe a simple scheme for constructing finitely generated monoids in which left-divisibility is a linear ordering and for practically investigating these monoids. The approach is based on subword reversing, a general method of…
We determine the dual modules of all irreducible modules of alternating groups over fields of characteristic 2.
In this study, an algorithm for computing the inverse of periodic k banded matrices, which are needed for solving the differential equations by using the finite differences, the solution of partial differential equations and the solution of…
We study dynamics and bifurcations of two-dimensional reversible maps having non-transversal heteroclinic cycles containing symmetric saddle periodic points. We consider one-parameter families of reversible maps unfolding generally the…
We consider the problem of computing the maximal invariant set of discrete-time linear systems subject to a class of non-convex constraints that admit quadratic relaxations. These non-convex constraints include semialgebraic sets and other…
An exact invariant is derived for $n$-degree-of-freedom Hamiltonian systems with general time-dependent potentials. The invariant is worked out in two equivalent ways. In the first approach, we define a special {\it Ansatz\/} for the…
In this paper we consider the well-studied problem of finding a perfect matching in a d-regular bipartite graph on 2n nodes with m=nd edges. The best-known algorithm for general bipartite graphs (due to Hopcroft and Karp) takes time…