Related papers: Absorbing sets of homogeneous subtractive algorith…
We prove that a jointly conservative family of geometric functors between rigidly-compactly generated tensor triangulated categories induces a surjective map on Balmer spectra. From this we deduce a fiberwise criterion for Balmer's…
We examine a pair of dynamical systems on the plane induced by a pair of spanning trees in the Cayley graph of the Super-Apollonian group of Graham, Lagarias, Mallows, Wilks and Yan. The dynamical systems compute Gaussian rational…
In this manuscript a unified framework for conducting inference on complex aggregated data in high dimensional settings is proposed. The data are assumed to be a collection of multiple non-Gaussian realizations with underlying undirected…
Motivated by recent best case analyses for some sorting algorithms and based on the type of complexity we partition the algorithms into two classes: homogeneous and non homogeneous algorithms. Although both classes contain algorithms with…
We present algorithms to work with iterated Eisenstein integrals that have recently appeared in the computation of multi-loop Feynman integrals. These algorithms allow one to analytically continue these integrals to all regions of the…
We revisit Haagerup's enigmatic reduction theorem \cite[Theorems 2.1 \& 3.1]{HJX} showing how that theorem may be extended to general von Neumann algebras $\M$ equipped with an arbitrary faithful normal semifinite weight in a manner which…
We describe a new algorithm for computing Whitney stratifications of complex projective varieties. The main ingredients are (a) an algebraic criterion, due to L\^e and Teissier, which reformulates Whitney regularity in terms of conormal…
While routinely used in other areas of dynamics, image sets are ill-defined objects in general non-invertible measurable dynamics. We propose a way of consistently working with image sets of null-preserving (and hence, in particular, of…
This paper studies averaging algebras, say, associative algebras endowed with averaging operators. We develop a cohomology theory for averaging algebras and justify it by interpreting lower degree cohomology groups as formal deformations…
This paper revisits the notion of classical orthogonal polynomials from a broader functional-analytic point of view. It is intended neither as a survey of known results nor as a review of the literature, but rather as a conceptual…
A new framework for analyzing Fejer convergent algorithms is presented. Using this framework we define a very general class of Fejer convergent algorithms and establish its convergence properties. We also introduce a new definition of…
The multigraded Hilbert scheme parametrizes all homogeneous ideals in a polynomial ring graded by an abelian group with a fixed Hilbert function. We prove that any multigraded Hilbert scheme is smooth and irreducible when the polynomial…
Matrix factorization techniques, especially Nonnegative Matrix Factorization (NMF), have been widely used for dimensionality reduction and interpretable data representation. However, existing NMF-based methods are inherently single-scale…
Given a graph $G$, the maximal induced subgraphs problem asks to enumerate all maximal induced subgraphs of $G$ that belong to a certain hereditary graph class. While its optimization version, known as the minimum vertex deletion problem in…
Randomized iterative algorithms have attracted much attention in recent years because they can approximately solve large-scale linear systems of equations without accessing the entire coefficient matrix. In this paper, we propose two novel…
In a previous paper {GN2} an effective solution of the lattice point counting problem in general domains in semisimple S-algebraic groups and affine symmetric varieties was established. The method relies on the mean ergodic theorem for the…
Our objective in this article is to show a possibly interesting structure of homotopic nature appearing in persistent (co)homology. Assuming that the filtration of the (say) simplicial set embedded in a finite dimensional vector space…
We present a new algorithm for isolating the real roots of a system of multivariate polynomials, given in the monomial basis. It is inspired by existing subdivision methods in the Bernstein basis; it can be seen as generalization of the…
We study methods for finding the solution set of a generic system in a family of polynomial systems with parametric coefficients. We present a framework for describing monodromy based solvers in terms of decorated graphs. Under the…
Triangle partition maps form a family that includes many, if not most, well-known multidimensional continued fraction algorithms. This paper begins the exploration of the functional analysis behind the transfer operator of each of these…