Related papers: Effective computation of degree bounded minimal mo…
We provide a numerical scheme to approximate as closely as desired the Gaussian or exponential measure $\mu(\om)$ of (not necessarily compact) basic semi-algebraic sets$\om\subset\R^n$. We obtain two monotone (non increasing and non…
We revisit the task of learning a Euclidean metric from data. We approach this problem from first principles and formulate it as a surprisingly simple optimization problem. Indeed, our formulation even admits a closed form solution. This…
Let $\Lambda$ be an artin algebra. We are going to consider full subcategories of $\mod\Lambda$ closed under finite direct sums and under submodules with infinitely many isomorphism classes of indecomposable modules. The main result asserts…
We present an extension of our GPGCD method, an iterative method for calculating approximate greatest common divisor (GCD) of univariate polynomials, to multiple polynomial inputs. For a given pair of polynomials and a degree, our algorithm…
A graded-division algebra is an algebra graded by a group such that all nonzero homogeneous elements are invertible. This includes division algebras equipped with an arbitrary group grading (including the trivial grading). We show that a…
This thesis is a study of various ways of measuring the size and complexity of finitely generated modules over a Noetherian local ring. The classical example is the multiplicity or degree. Here we investigate several variants of the degree…
We propose a parallel graph-based data clustering algorithm using CUDA GPU, based on exact clustering of the minimum spanning tree in terms of a minimum isoperimetric criteria. We also provide a comparative performance analysis of our…
We contribute to the program of extending computable structure theory to the realm of metric structures by investigating lowness for isometric isomorphism of metric structures. We show that lowness for isomorphism coincides with lowness for…
We define the completion of an associative algebra $A$ in a set $M=\{M_1,\dots,M_r\}$ of $r$ right $A$-modules in such a way that if $\mathfrak a\subseteq A$ is an ideal in a commutative ring $A$ the completion $A$ in the (right) module…
l-Conformal Galilei algebra, denoted by g{l}{d}, is a non-semisimple Lie algebra specified by a pair of parameters (d,l). The algebra is regarded as a nonrelativistic analogue of the conformal algebra. We derive hierarchies of partial…
We relate the geometry of the resonance varieties associated to a commutative differential graded algebra model of a space to the finiteness properties of the completions of its Alexander-type invariants. We also describe in simple…
We prove that for any finite-dimensional differential graded algebra with separable semisimple part the category of perfect modules is equivalent to a full subcategory of the category of perfect complexes on a smooth projective scheme with…
Consider a form $g(x_1,...,x_s)$ of degree $d$, having coefficients in the completion $F_q((1/t))$ of the field of fractions $F_q(t)$ associated to the finite field $F_q$. We establish that whenever $s>d^2$, then the form $g$ takes…
It is a classical problem to compute a minimal set of invariant polynomial generating the invariant ring of a finite group as an algebra. We present here an algorithm for the computation of minimal generating sets in the non-modular case.…
We define a numerical quasi-isometry invariant of a finitely generated group, whose values parametrize the difference between the group being uniformly embeddable in a Hilbert space and the reduced C*-algebra of the group being exact.
These course notes are about computing modular forms and some of their arithmetic properties. Their aim is to explain and prove the modular symbols algorithm in as elementary and as explicit terms as possible, and to enable the devoted…
This is the first of a series of papers studying real algebraic threefolds using the minimal model program. The main results are outlined in Part II. The present part I. contains the necessary preliminary work concerning terminal…
We classify, up to isomorphism and up to equivalence, division gradings (by abelian groups) on finite-dimensional simple real algebras. Gradings on finite-dimensional simple algebras are determined by division gradings, so our results give…
This short expository paper outlines applications of computer algebra to the implication problem of conditional independence for Gaussian random variables. We touch on certificates for validity and invalidity of inference rules from the…
Several deep learning methods have been proposed for completing partial data from shape acquisition setups, i.e., filling the regions that were missing in the shape. These methods, however, only complete the partial shape with a single…