Related papers: A microlocal criterion for commuting nearby cycles
Local thresholding algorithms were first presented more than a decade ago and have since been applied to a variety of data mining tasks in peer-to-peer systems, wireless sensor networks, and in grid systems. One critical assumption made by…
We consider posterior sampling in the very common Bayesian hierarchical model in which observed data depends on high-dimensional latent variables that, in turn, depend on relatively few hyperparameters. When the full conditional over the…
Local unitary invariants allow one to test whether multipartite states are equivalent up to local basis changes. Equivalently, they specify the geometry of the "orbit space" obtained by factoring out local unitary action from the state…
In this survey, we explain how to compute both the quadratic Euler characteristic of nearby cycles, and the motivic monodromy, at a quasi-homogeneous singularity. This gives, for such singularity, a quadratic refinement to the…
The introduced notion of locally-periodic two-scale convergence allows to average a wider range of microstructures, compared to the periodic one. The compactness theorem for the locally-periodic two-scale convergence and the…
In this paper we show the usability of the Gray code with constant weight words for computing linear combinations of codewords. This can lead to a big improvement of the computation time for finding the minimum distance of a code. We have…
Heterodimensional cycles are heteroclinic cycles that connect periodic orbits whose unstable manifolds have different dimensions. This is a source of nonhyperbolic dynamics and unstable dimension variability. For smooth invertible maps…
We consider H\"older continuous cocycles over an accessible partially hyperbolic system with values in the group of diffeomorphisms of a compact manifold $M$. We obtain several results for this setting. If a cocycle is bounded in…
The most common decision criteria for decoding are maximum likelihood decoding and nearest neighbor decoding. It is well-known that maximum likelihood decoding coincides with nearest neighbor decoding with respect to the Hamming metric on…
Many seemingly disparate Markov chains are unified when viewed as random walks on the set of chambers of a hyperplane arrangement. These include the Tsetlin library of theoretical computer science and various shuffling schemes. If only…
The homological scaffold leverages persistent homology to construct a topologically sound summary of a weighted network. However, its crucial dependency on the choice of representative cycles hinders the ability to trace back global…
We prove a general criterion for a metric space to have conformal dimension one. The conditions are stated in terms of the existence of enough local cut points in the space. We then apply this criterion to the boundaries of hyperbolic…
The first author recently introduced a "nearby cycles formalism" in the framework of chain complexes of parity sheaves. In this paper, we compute this functor in two related settings: (i) affine space, stratified by the action of a torus,…
Local complement is a graph operation formalized by Bouchet which replaces the neighborhood of a chosen vertex with its edge-complement. This operation induces an equivalence relation on graphs; determining the size of the resulting…
We study the existence and approximate controllability of a class of fractional nonlocal delay semilinear differential systems in a Hilbert space. The results are obtained by using semigroup theory, fractional calculus, and Schauder's fixed…
Several problems in machine learning, statistics, and other fields rely on computing eigenvectors. For large scale problems, the computation of these eigenvectors is typically performed via iterative schemes such as subspace iteration or…
A neighborliness property of marginal polytopes of hierarchical models, depending on the cardinality of the smallest non-face of the underlying simplicial complex, is shown. The case of binary variables is studied explicitly, then the…
Dihedral codes, particular cases of quasi-cyclic codes, have a nice algebraic structure which allows to store them efficiently. In this paper, we investigate it and prove some lower bounds on their dimension and minimum distance, in analogy…
We study the local unitary equivalence of arbitrary dimensional multipartite quantum mixed states. We present a necessary and sufficient criterion of the local unitary equivalence for general multipartite states based on matrix realignment.…
We associate to every irreducible representation of a reductive group over a local field of equal characteristics a local Langlands parameter up to semisimplification and prove the compatibility with the global parameterization constructed…