Related papers: A microlocal criterion for commuting nearby cycles

We study the local approximation properties in hierarchical spline spaces through multiscale quasi-interpolation operators. This construction suggests the analysis of a subspace of the classical hierarchical spline space (Vuong et al.,…

In this paper, we define locally matchable subsets of a group which is derived from the concept of matchings in groups and used as a tool to give alternative proofs for existing results in matching theory. We also give the linear analogue…

In the last decades the problem of metastability has been attacked on rigorous grounds via many different approaches and techniques which are briefly reviewed in this paper. It is then useful to understand connections between different…

We investigate the large intersection properties of the set of points that are approximated at a certain rate by a family of affine subspaces. We then apply our results to various sets arising in the metric theory of Diophantine…

Data coding as a building block of several image processing algorithms has been received great attention recently. Indeed, the importance of the locality assumption in coding approaches is studied in numerous works and several methods are…

We consider a class of nonlinear integer programming problems arising from re-allocation of dock-capacity in a bike sharing system. The main aim of this note is to derive an improved proximity bound for the problem and its scaled variant.…

We establish necessary and sufficient conditions for the realization of mapping schemata as post-critically finite polynomials, or more generally, as post-critically finite polynomial maps from a finite union of copies of the complex…

We prove that Misiurewicz parameters with prescribed combinatorics and hyperbolic parameters with (d - 1) distinct attracting cycles with given multipliers are equidistributed with respect to the bifurcation measure in the moduli space of…

Calculating and categorizing the similarity of curves is a fundamental problem which has generated much recent interest. However, to date there are no implementations of these algorithms for curves on surfaces with provable guarantees on…

Under a certain condition A we give a construction to calculate the intersection cohomology of a rank one local system on the complement to a hyperplane-like divisor

Recently, the influence of potentially present symmetries has begun to be studied in complex networks. A typical way of studying symmetries is via the automorphism group of the corresponding graph. Since complex networks are often subject…

We study continuous maps between differential manifolds from a microlocal point of view. In particular, we characterize the Lipschitz continuity of these maps in terms of the microsupport of the constant sheaf on their graph. Furthermore,…

We provide another approach to Friedland's result that the topological entropy $h$ of a symmetric nearest-neighbor subshift is computable. Instead of the previous algebraic technique, our approach is mostly combinatorial and involves only…

Many spatial models exhibit locality structures that effectively reduce their intrinsic dimensionality, enabling efficient approximation and sampling of high-dimensional distributions. However, existing approximation techniques primarily…

In this short paper, we consider discrete-time Markov chains on lattices as approximations to continuous-time diffusion processes. The approximations can be interpreted as finite difference schemes for the generator of the process. We…

In this paper we study a new metric for comparing Betti numbers functions in bidimensional persistent homology, based on coherent matchings, i.e. families of matchings that vary in a continuous way. We prove some new results about this…

Clustering is a fundamental analysis tool aiming at classifying data points into groups based on their similarity or distance. It has found successful applications in all natural and social sciences, including biology, physics, economics,…

In this paper, we present a method of higher-order analysis on bifurcation of small limit cycles around an elementary center of integrable systems under perturbations. This method is equivalent to higher-order Melinikov function approach…

In this paper, we introduce variants of formal nearby cycles for a locally noetherian formal scheme over a complete discrete valuation ring. If the formal scheme is locally algebraizable, then our nearby cycle gives a generalization of…

This work proposes a hierarchical clustering algorithm for high-dimensional datasets using the cyclic space of reversible finite cellular automata. In cellular automaton (CA) based clustering, if two objects belong to the same cycle, they…