Related papers: Computing localizations iteratively

In this paper we consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore…

Local reconstruction analysis (LRA) is a powerful and flexible technique to study images reconstructed from discrete generalized Radon transform (GRT) data, $g=\mathcal R f$. The main idea of LRA is to obtain a simple formula to accurately…

We present a robust algorithm that computes (maximally localized) Wannier functions (WFs) without the need of providing an initial guess. Instead, a suitable starting point is constructed automatically from so-called local orbitals which…

We give an incremental polynomial time algorithm for enumerating the vertices of any polyhedron $\mathcal{P}(A,\mathbf{1})=\{x\in\RR^n \mid Ax\geq \b1,~x\geq \b0\}$, when $A$ is a totally unimodular matrix. Our algorithm is based on…

A generalization of canonical quantization which maps a dynamical operator to a dynamical superoperator is suggested. Weyl quantization of dynamical operator, which cannot be represented as Poisson bracket with some function, is considered.…

We study finite-dimensional representations of hyper loop algebras, i.e., the hyperalgebras over an algebraically closed field of positive characteristic associated to the loop algebra over a complex finite-dimensional simple Lie algebra.…

We study the iterated blow-up X of projective space along an arbitrary collection of linear subspaces. By replacing the universal torsor with an $\mathbb{A}^1$-homotopy equivalent model, built from $\mathbb{A}^1$-fiber bundles not just…

We give an algorithm for constructing the algebraic hull of a given matrix Lie algebra in characteristic zero. It is based on an algorithm for finding integral linear dependencies of the roots of a polynomial, that is probably of…

We construct a normal form for the walled Brauer algebra, together with the reduction algorithm. We apply normal form to calculate the numbers of monomials in generators with minimal length. We further utilize normal form to give explicit…

For every linear binary code $C$, we construct a geometric triangular configuration $\Delta$ so that the weight enumerator of $C$ is obtained by a simple formula from the weight enumerator of the cycle space of $\Delta$. The triangular…

We introduce a new type of Wannier functions (WFs) obtained by minimizing the conventional spread functional with a penalty term proportional to the variance of the spread distribution. This modified Wannierisation scheme is less prone to…

We use former results on geometric local $\varepsilon$-factors over curves in order to prove a factorization result for the determinant of the cohomology of an $\ell$-adic sheaf over an arbitrary proper scheme over a perfect field of…

When geometric quantization is applied to a manifold using a real polarization which is "nice enough", a result of Sniatycki says that the quantization can be found by counting certain objects, called Bohr-Sommerfeld leaves. Subsequently,…

An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…

Sequential hypothesis testing is a desirable decision making strategy in any time sensitive scenario. Compared with fixed sample-size testing, sequential testing is capable of achieving identical probability of error requirements using less…

We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decomposition of the plane induced by a finite number of algebraic…

Given a polynomial $f\in\mathbb{C}[x_1,\ldots,x_n]$ and an integer $\ell\in\mathbb{Z}$, we study some properties of the b-function with respect to weights of the annihilating ideal Ann$(f^\ell)$. In some particular cases the expression of…

We present a novel algorithm for constructing differential operators with respect to external variables that annihilate Feynman-like integrals and give rise to the associated $\mathcal{D}$-modules, based on Griffiths-Dwork reduction. By…

Let $G$ denote a reductive algebraic group over $\mathbb{C}$ and $x$ a nilpotent element of its Lie algebra $\mathfrak{g}$. The Springer variety $\mathcal{B}_x$ is the closed subvariety of the flag variety $\mathcal{B}$ of $G$…

Building on recent progress in constructing derivations on Fourier algebras, we provide the first examples of locally compact groups whose Fourier algebras support non-zero, alternating 2-cocycles; this is the first step in a larger…