Related papers: Reducing Rouquier Complexes
Probabilistic graphical models (PGMs) are powerful tools for representing statistical dependencies through graphs in high-dimensional systems. However, they are limited to pairwise interactions. In this work, we propose the simplicial…
This paper is concerned with the derivation and properties of differential complexes arising from a variety of problems in differential equations, with applications in continuum mechanics, relativity, and other fields. We present a…
We consider a collection of weighted Euclidian random balls in R^d distributed according a determinantal point process. We perform a zoom-out procedure by shrinking the radii while increasing the number of balls. We observe that the…
Reduction is a process that uses symmetry to lower the order of a Hamiltonian system. The new variables in the reduced picture are often not canonical: there are no clear variables representing positions and momenta, and the Poisson bracket…
We discuss progress towards the classification of irreducible admissible representations of reductive groups over non-archimedean local fields and the local Langlands correspondence. We also state some (partly conjectural) compatibility…
We obtain closed formulas, in terms of Littlewood-Richardson coefficients, for the canonical basis elements of the Fock space representation of $U_v(\hat{\mathfrak{sl}}_e)$ which are labelled by partitions having 'locally small'…
For singular perturbation problems in dynamical systems, various appropriate singular perturbation methods have been proposed to eliminate secular terms appearing in the naive expansion. For example, the method of multiple time scales, the…
We study the summands of the decomposition theorem for the Hitchin system for $\mathrm{GL}_n$, in arbitrary degree, over the locus of reduced spectral curves. A key ingredient is a new correspondence between these summands and the topology…
We extend the lifting methods of our previous paper to lift reducible odd representations $\bar{\rho}:\mathrm{Gal}(\overline{F}/F) \to G(k)$ of Galois groups of global fields $F$ valued in Chevalley groups $G(k)$. Lifting results, when…
We consider estimation procedures which are recursive in the sense that each successive estimator is obtained from the previous one by a simple adjustment. We propose a wide class of recursive estimation procedures for the general…
The reduction algorithm is used to compute reduced ideals of a number field. However, there are reduced ideals that can never be obtained from this algorithm. In this paper, we will show that these ideals have inverses of larger norms among…
We consider the problem of efficiently computing a discrete Morse complex on simplicial complexes of arbitrary dimension and very large size. Based on a common graph-based formalism, we analyze existing data structures for simplicial…
We introduce and analyze parallelizable algorithms to compress and accurately reconstruct finite simplicial complexes that have non-trivial automorphisms. The compressed data -- called a complex of groups -- amounts to a functor from (the…
We describe an algorithm to compute the reduction modulo $p$ of a crystalline Galois representation of dimension $2$ of $\text{Gal}(\overline{\mathbf{Q}}_p/\mathbf{Q}_p)$ with distinct Hodge-Tate weights via the semi-simple modulo $p$…
A novel method of summation for power series is developed. The method is based on the self-similar approximation theory. The trick employed is in transforming, first, a series expansion into a product expansion and in applying the…
Parahoric group schemes are certain possibly non-reductive, smooth, affine integral models of reductive group schemes defined over a henselian discretely valued field $K$ whose residue field is perfect. We show that any such group scheme…
We give a general method to reduce Hurewicz-type selection hypotheses into standard ones. The method covers the known results of this kind and gives some new ones. Building on that, we show how to derive Ramsey theoretic characterizations…
We present a method to compute integral cohomology of posets. This toolbox is applicable as soon as the sub-posets under each object possess certain structure. This is the case for simplicial complexes and simplex-like posets. The method is…
In real world everything is an object which represents particular classes. Every object can be fully described by its attributes. Any real world dataset contains large number of attributes and objects. Classifiers give poor performance when…
A Gaussian elimination form of inverse iteration within the complex coordinate approach is shown to produce a simple uniform method of finding both real bound state energies and complex resonant state energies for several problems which…