Related papers: On computing local monodromy and the numerical loc…
A locally recoverable code is an error-correcting code such that any erasure in a single coordinate of a codeword can be recovered from a small subset of other coordinates. In this article we develop an algorithm that computes a recovery…
Grothendieck local residue is considered in the context of symbolic computation. Based on the theory of holonomic D-modules, an effective method is proposed for computing Grothendieck local residues. The key is the notion of Noether…
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 subgraphs…
A method of local approximation of holomorphic solutions of algebraic equations is discussed
Given a family $X$ of complex varieties degenerating over a punctured disc, one is interested in computing related invariants called the motivic nearby fiber and the refined limit mixed Hodge numbers, both of which contain information about…
Localization is a topological technique that allows us to make global equivariant computations in terms of local data at the fixed points. For example, we may compute a global integral by summing integrals at each of the fixed points. Or,…
We enhance the approximation capabilities of algebraic polynomials by composing them with homeomorphisms. This composition yields families of functions that remain dense in the space of continuous functions, while enabling more accurate…
It is proved that certain types of modular cusp forms generate irreducible automorphic representation of the underlying algebraic group. Analogous archimedean and non-archimedean local statements are also given.
We describe the local structure of an irreducible algebraic monoid $M$ at an idempotent element $e$. When $e$ is minimal, we show that $M$ is an induced variety over the kernel $MeM$ (a homogeneous space) with fibre the two-sided stabilizer…
We prove that every 2-local automorphism of the unitary group or the general linear group on a complex infinite-dimensional separable Hilbert space is an automorphism. Thus these types of transformations are completely determined by their…
It is a key to construct a similarity graph in graph-oriented subspace learning and clustering. In a similarity graph, each vertex denotes a data point and the edge weight represents the similarity between two points. There are two popular…
As distributed systems increase in size, the need for scalable algorithms becomes more and more important. We argue that in the context of system identification, an essential building block of any scalable algorithm is the ability to…
A local projection model is defined by a set of linear regressions that account for the associations between exogenous variables and an endogenous variable observed at different time points. While it is standard practice to separately…
We present a conjectural description of the space of local operators on a stack of finitely many fivebranes in $M$ theory at the level of the holomorphic twist. Our approach is through the lens of twisted holography and utilizes a…
The simplex algorithm for linear programming is based on the fact that any local optimum with respect to the polyhedral neighborhood is also a global optimum. We show that a similar result carries over to submodular maximization. In…
We describe a recursive algorithm that decomposes an algebraic set into locally closed equidimensional sets, i.e. sets which each have irreducible components of the same dimension. At the core of this algorithm, we combine ideas from the…
We investigate the ability of a local bi-orthogonal decomposition to build texture segmentation of images. Using the structures associated to the local decomposition of the image independent row and columns we perform a segmentation, where…
Manifolds with exceptional holonomy play an important role in string theory, supergravity and M-theory. It is explained how one can find the holonomy algebra of an arbitrary Riemannian or Lorentzian manifold. Using the de~Rham and Wu…
For input $x$, let $F(x)$ denote the set of outputs that are the "legal" answers for a computational problem $F$. Suppose $x$ and members of $F(x)$ are so large that there is not time to read them in their entirety. We propose a model of…
A code is locally recoverable when each symbol in one of its code words can be reconstructed as a function of $r$ other symbols. We use bundles of projective spaces over a line to construct locally recoverable codes with availability; that…