Related papers: On enumerative problems for maps and quasimaps: fr…
We present a novel extension of the concept of scars for the wave functions of classically chaotic few-body systems of identical particles with rotation and permutation symmetry. Generically there exist manifolds in classical phase space…
Let $\mathcal{T}$ be a set of $n$ flat (planar) semi-algebraic regions in $\mathbb{R}^3$ of constant complexity (e.g., triangles, disks), which we call plates. We wish to preprocess $\mathcal{T}$ into a data structure so that for a query…
Certain wave functions of non-interacting quantum chaotic systems can exhibit "scars" in the fabric of their real-space density profile. Quantum scarred wave functions concentrate in the vicinity of unstable periodic classical trajectories.…
We examine implicit representations of parametric or point cloud models, based on interpolation matrices, which are not sensitive to base points. We show how interpolation matrices can be used for ray shooting of a parametric ray with a…
Quantum many-body scars (QMBS) are exotic many-body states that exhibit anomalous non-thermal behavior in an otherwise ergodic system. In this work, we demonstrate a simple, scalable and intuitive construction of QMBS in a kinetically…
To what extent are two images picturing the same 3D surfaces? Even when this is a known scene, the answer typically requires an expensive search across scale space, with matching and geometric verification of large sets of local features.…
Due to data compression or low resolution, nearby vertices and edges of a graph drawing may be bundled to a common node or arc. We model such a `compromised' drawing by a piecewise linear map $\varphi:G\rightarrow \mathbb{R}^2$. We wish to…
This work studies certain aspects of graphs embedded on surfaces. Initially, a colored graph model for a map of a graph on a surface is developed. Then, a concept analogous to (and extending) planar graph is introduced in the same spirit as…
Counting the number of clusters, when these clusters overlap significantly is a challenging problem in machine learning. We argue that a purely mathematical quantum theory, formulated using the path integral technique, when applied to…
We study the complexity of computing the projection of an arbitrary $d$-polytope along $k$ orthogonal vectors for various input and output forms. We show that if $d$ and $k$ are part of the input (i.e. not a constant) and we are interested…
The theory of scarring of eigenfunctions of classically chaotic systems by short periodic orbits is extended in several ways. The influence of short-time linear recurrences on correlations and fluctuations at long times is emphasized. We…
We present a novel sparse modeling approach to non-rigid shape matching using only the ability to detect repeatable regions. As the input to our algorithm, we are given only two sets of regions in two shapes; no descriptors are provided so…
Amoebas are projections of complex algebraic varieties in the algebraic torus under a Log-absolute value map, which have connections to various mathematical subjects. While amoebas of hypersurfaces have been intensively studied in recent…
This paper attacks the following problem. We are given a large number $N$ of rectangles in the plane, each with horizontal and vertical sides, and also a number $r<N$. The given list of $N$ rectangles may contain duplicates. The problem is…
The detection of cracks is a crucial task in monitoring structural health and ensuring structural safety. The manual process of crack detection is time-consuming and subjective to the inspectors. Several researchers have tried tackling this…
Using a Quot scheme compactification, we calculate the virtual count of maps of degree $d$ from a smooth projective curve of genus $g$ to a hypersurface in a Grassmannian, sending specified points of the curve to special Schubert…
Hyperspectral images provide much more information than conventional imaging techniques, allowing a precise identification of the materials in the observed scene, but because of the limited spatial resolution, the observations are usually…
We enumerate graph homomorphisms to quasi-complete graphs, i.e., graphs obtained from complete graphs by removing one edge. The source graphs are complete graphs, quasi-complete graphs, cycles, paths, wheels and broken wheels. These…
We prove an integral formula for continuous paths of rectangles inscribed in a piecewise smooth loop. We then use this integral formula to show that (with a very mild genericity hypothesis) the number of rectangle coincidences, informally…
The problem of finding a point in the intersection of closed sets can be solved by the method of alternating projections and its variants. It was shown in earlier papers that for convex sets, the strategy of using quadratic programming (QP)…