相关论文: A microlocal criterion for commuting nearby cycles

Many problems in science and engineering fields require the solution of shifted linear systems. To solve such systems efficiently, the recycling BiCG (RBiCG) algorithm in [SIAM J. SCI. COMPUT, 34 (2012) 1925-1949] is extended in this paper.…

In this paper we give necessary and sufficient conditions for a connection in a plane bundle above a surface to be locally metric. These conditions are easy to be verified in any local chart. Also as a global result we give a necessary…

We classify the prelocalizing subcategories of the category of quasi-coherent sheaves on a locally noetherian scheme. In order to give the classification, we introduce the notion of a local filter of subobjects of the structure sheaf. The…

Motivation: Clustering is a frequently used concept in variety of bioinformatical applications. We present a new method for hierarchical clustering of data called mutual information clustering (MIC) algorithm. It uses mutual information…

Suitable reachability conditions can make two different fixed point semantics of a transition system coincide. For instance, the total and partial expected reward semantics on Markov chains (MCs) coincide whenever the MC at hand is almost…

The purpose of this paper is to establish the foundations of multi-microlocalization, in particular, to give the fiber formula for the multi-microlocalization functor and estimate of microsupport of a multi-microlocalized object. We also…

The stability of heteroclinic cycles may be obtained from the value of the local stability index along each connection of the cycle. We establish a way of calculating the local stability index for quasi-simple cycles: cycles whose…

This paper over-approximates the reachable sets of a continuous-time uncertain system using the sensitivity of its trajectories with respect to initial conditions and uncertain parameters. We first prove the equivalence between an existing…

We study some properties of the local time of the asymmetric Bernoulli walk on the line. These properties are very similar to the corresponding ones of the simple symmetric random walks in higher ($d\geq3$) dimension, which we established…

Breakpoint graphs are ubiquitous structures in the field of genome rearrangements. Their cycle decomposition has proved useful in computing and bounding many measures of (dis)similarity between genomes, and studying the distribution of…

In this paper we study the family of cyclic codes such that its minimum distance reaches the maximum of its BCH bounds. We also show a way to construct cyclic codes with that property by means of computations of some divisors of a…

This article is a survey on recent contributions to an effective version of Bautin's theory about the bifurcation of periodic orbits (limit cycles). The analysis of Hopf bifurcations of higher order is possible by use of the return mapping.…

This paper presents two general criteria to determine spaceability results in the complements of unions of subspaces. The first criterion applies to countable unions of subspaces under specific conditions and is closely related to the…

Macroscopic observables in a quantum spin system are given by sequences of spatial means of local elements $\frac{1}{2n+1}\sum_{j=-n}^n\gamma_j(A_{i}), \; n\in{\mathbb N},\; i=1,...,m$ in a UHF algebra. One of their properties is that they…

Geometric Langlands predicts an isomorphism between Whittaker coefficients of Eisenstein series and functions on the moduli space of $\check{N}$-local systems. We prove this formula by interpreting Whittaker coefficients of Eisenstein…

Friction, the resistive force between two surfaces sliding past each other, is at the core of a wide diversity of locomotion schemes. While such schemes are somewhat understood for homogeneous environments, locomotion based on friction in…

Hierarchies permeate the structure of real networks, whose nodes can be ranked according to different features. However, networks are far from tree-like structures and the detection of hierarchical ordering remains a challenge, hindered by…

Identifying and comparing topological features, particularly cycles, across different topological objects remains a fundamental challenge in persistent homology and topological data analysis. This work introduces a novel framework for…

We show that many graphs naturally associated to a connected, compact, orientable surface are hierarchically hyperbolic spaces in the sense of Behrstock, Hagen and Sisto. They also automatically have the coarse median property defined by…

We study the spectral location of strongly pattern equivariant Hamiltonians arising through configurations on a colored lattice. Roughly speaking, two configurations are "close to each other" if, up to a translation, they "almost coincide"…