Related papers: On computing local monodromy and the numerical loc…
We give a construction which produces irreducible complex rigid local systems on $\Bbb{P}_{\Bbb{C}}^1-\{p_1,\dots,p_s\}$ via quantum Schubert calculus and strange duality. These local systems are unitary and arise from a study of vertices…
For any smooth projective variety with holomorphic locally homogeneous structure modelled on a homogeneous algebraic variety, we determine all the subvarieties of it which develop to the model.
We study local generalized additive decompositions (GADs) of homogeneous polynomials and their associated point schemes through their local inverse systems. We prove that their construction and algebraic properties are independent of the…
A $p$-divisible group over a field $K$ admits a slope decomposition; associated to each slope $\lambda$ is an integer $m$ and a representation $\gal(K) \ra \gl_m(D_\lambda)$, where $D_\lambda$ is the $\rat_p$-division algebra with Brauer…
An algorithm for irreducible decomposition of representations of finite groups over fields of characteristic zero is described. The algorithm uses the fact that the decomposition induces a partition of the invariant inner product into a…
In the paper we show that for a normal-crossings degeneration $Z$ over the ring of integers of a local field with $X$ as generic fibre, the local monodromy operator and its powers determine invariant cocycle classes under the decomposition…
Consider a finite-dimensional algebra $A$ and any of its moduli spaces $\mathcal{M}(A,\mathbf{d})^{ss}_{\theta}$ of representations. We prove a decomposition theorem which relates any irreducible component of…
The monodromy group is an invariant for parameterized systems of polynomial equations that encodes structure of the solutions over the parameter space. Since the structure of real solutions over real parameter spaces are of interest in many…
Given a skeletally small category $\mathcal{C}$, we show that any locally finite endo-length $\mathcal{C}$-module is the direct sum of indecomposable $\mathcal{C}$-modules, whose endomorphism algebra is local.
We propose a decentralised "local2global"' approach to graph representation learning, that one can a-priori use to scale any embedding technique. Our local2global approach proceeds by first dividing the input graph into overlapping…
We introduce a strategy to study irreducible representations of automorphism groups of finite modules over local rings. We prove that these automorphism groups fit in a hierarchy that facilitates a stratification of their irreducible…
In this article, we introduce the singular twin monoid and its corresponding group, constructed from both algebraic and topological perspectives. We then classify all complex homogeneous $2$-local representations of this constructed group.…
In this paper we develop a general method to prove independence of algebraic monodromy groups in compatible systems of representations, and we apply it to deduce independence results for compatible systems both in automorphic and in…
We investigate the problem of finding the local analogue of the ergotropy, that is the maximum work that can be extracted from a system if we can only apply local unitary transformation acting on a given subsystem. In particular, we provide…
The paper presents two algorithms for finding irreducible decomposition of monomial ideals. The first one is recursive, derived from staircase structures of monomial ideals. This algorithm has a good performance for highly non-generic…
The monodromy of torus bundles associated to completely integrable systems can be computed using geometric techniques (constructing homology cycles) or analytic arguments (computing discontinuities of abelian integrals). In this article we…
The paper introduces a general method to construct conformal measures for a local homeomorphism on a locally compact non-compact Hausdorff space, subject to mild irreducibility-like conditions. Among others the method is used to give…
Monads govern computational side-effects in programming semantics. They can be combined in a ''bottom-up'' way to handle several instances of such effects. Indexed monads and graded monads do this in a modular way. Here, instead, we equip…
A code over a finite alphabet is called locally recoverable (LRC code) if every symbol in the encoding is a function of a small number (at most $r$) other symbols of the codeword. In this paper we introduce a construction of LRC codes on…
The paper presents a new algorithmic construction of a finite generating set of rational invariants for the rational action of an algebraic group on the affine space. The construction provides an algebraic counterpart of the moving frame…