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

In this paper we generalize and study a notion of (unipotent) nearby cycles over a higher dimensional base based on Be\u{i}linson's description of unipotent nearby cycles, following an idea of Gaitsgory. This generalization, in the setting…

In this paper we study Holder continuous linear cocycles over transitive Anosov diffeomorphisms. Under various conditions of relative pinching we establish properties including existence and continuity of measurable invariant sub-bundles…

Kottwitz conjectured a formula for the (semi-simple) trace of Frobenius on the nearby cycles for the local model of a Shimura variety with Iwahori-type level structure. In this paper, we prove his conjecture in the linear and symplectic…

A new approach to bound the minimum distance of $q$-ary cyclic codes is presented. The connection to the BCH and the Hartmann--Tzeng bound is formulated and it is shown that for several cases an improvement is achieved. We associate a…

A new bound on the minimum distance of q-ary cyclic codes is proposed. It is based on the description by another cyclic code with small minimum distance. The connection to the BCH bound and the Hartmann--Tzeng (HT) bound is formulated…

In this article, we give a simple proof of the comparison of nearby and vanishing cycles in the sense of Riemann-Hilbert correspondence following the idea of Beilinson and Bernstein, without using the Kashiwara-Malgrange $V$-filtrations.

Quasiperiodic systems serve as fertile ground for studying localisation, due to their propensity already in one dimension to exhibit rich phase diagrams with mobility edges. The deterministic and strongly-correlated nature of the…

We study families of algebraic spaces with a fiberwise $\mathbb{G}_m$-action and prove Braden's theorem on hyperbolic localization for arbitrary base schemes. As an application, we obtain that hyperbolic localization commutes with nearby…

A new lower bound on the minimum Hamming distance of linear quasi-cyclic codes over finite fields is proposed. It is based on spectral analysis and generalizes the Semenov- Trifonov bound in a similar way as the Hartmann-Tzeng bound extends…

A new lower bound on the minimum distance of q-ary cyclic codes is proposed. This bound improves upon the Bose-Chaudhuri-Hocquenghem (BCH) bound and, for some codes, upon the Hartmann-Tzeng (HT) bound. Several Boston bounds are special…

We propose a decentralized subspace algorithm for identification of large-scale, interconnected systems that are described by sparse (multi) banded state-space matrices. First, we prove that the state of a local subsystem can be…

This paper studies the sliced nearby cycle functor and its commutation with duality. Over a Henselian discrete valuation ring, we show that this commutation holds, confirming a prediction of Deligne. As an application we give a new proof of…

We first study hyperplane sections of some singular schemes over a field. We prove a Bertini theorem for the log smoothness of generic hyperplane sections of a large class of log smooth schemes over a log point. We also give an abstract…

We address the problem of computing distances between rankings that take into account similarities between candidates. The need for evaluating such distances is governed by applications as diverse as rank aggregation, bioinformatics, social…

The essential minimum and equidistribution of small points are two well-established interrelated subjects in arithmetic geometry. However, there is lack of an analogue of essential minimum dealing with higher dimensional subvarieties, and…

The shortest distance between the first $n$ iterates of a typical point can be quantified with a log rule for some dynamical systems admitting Gibbs measures. We show this in two settings. For topologically mixing Markov shifts with at most…

We show that under some conditions, two constructions of nearby cycles over general bases coincide. More specifically, we show that under the assumption of $\Psi$-factorizability, the constructions of unipotent nearby cycles over an affine…

In this paper, we introduce the notions of matching matrices in groups and vector spaces, which lead to some necessary conditions for existence of acyclic matching in abelian groups and its linear analogue. We also study the linear local…

We introduce a "hyperbicycle" ansatz for quantum codes which gives the hypergraph-product (generalized toric) codes by Tillich and Z\'emor and generalized bicycle codes by MacKay et al. as limiting cases. The construction allows for both…

Finite strips, composed of a periodic stacking of infinite quasiperiodic Fibonacci chains, have been investigated in terms of their electronic properties. The system is described by a tight binding Hamiltonian. The eigenvalue spectrum of…