Related papers: Algebraic osculation and factorization of sparse p…

We discuss existence of factorizations with linear factors for (left) polynomials over certain associative real involutive algebras, most notably over Clifford algebras. Because of their relevance to kinematics and mechanism science, we put…

Given any polynomial system with fixed monomial term structure, we give explicit formulae for the generic number of roots with specified coordinate vanishing restrictions. For the case of affine space minus an arbitrary union of coordinate…

We consider the scattering of two-bosons with negative parity and spin 0 or 1. Starting from helicity partial-wave scattering amplitudes we derive transformations that eliminate all kinematical constraints. Such amplitudes are expected to…

Using the action of the Galois group of a normal extension of number fields, we generalize and symmetrize various fundamental statements in algebra and algebraic number theory concerning splitting types of prime ideals, factorization types…

Polynomial system solving is a classical problem in mathematics with a wide range of applications. This makes its complexity a fundamental problem in computer science. Depending on the context, solving has different meanings. In order to…

The main result of the paper is an extension of the Dirichlet problem from (closures of) bounded open domains U to arbitrary compact subsets X of the complex plane, i.e. the closure of the corresponding space of functions which are harmonic…

We present the Polar framework for fully automating the analysis of classical and probabilistic loops using algebraic reasoning. The central theme in Polar comes with handling algebraic recurrences that precisely capture the loop semantics.…

In this paper we introduce techniques from complex harmonic analysis to prove a weaker version of the Geometric Arveson-Douglas Conjecture for complex analytic subsets that is smooth on the boundary of the unit ball and intersects…

By a theorem of Suslin, a Tor-unital (not necessarily unital) ring satisfies excision in algebraic K-theory. We give a new and direct proof of Suslin's result based on an exact sequence of categories of perfect modules. In fact, we prove a…

Computer algebra is widely used in various fields of mathematics, physics and other sciences. The simplification of tensor expressions is an important special case of computer algebra. In this paper, we consider the reduction of tensor…

We introduce twisted matrix factorizations for quantum complete intersections of codimension two. For such an algebra, we show that in a given dimension, almost all the indecomposable modules with bounded minimal projective resolutions…

Let $\mathrm{R}$ be a real closed field and $\mathrm{D} \subset \mathrm{R}$ an ordered domain. We consider the algorithmic problem of computing the generalized Euler-Poincar\'e characteristic of real algebraic as well as semi-algebraic…

We propose a new approximate factorization for solving linear systems with symmetric positive definite sparse matrices. In a nutshell the algorithm is to apply hierarchically block Gaussian elimination and additionally compress the fill-in.…

We show that the presentation of affine $\mathbb{T}$-varieties of complexity one in terms of polyhedral divisors holds over an arbitrary field. We also describe a class of multigraded algebras over Dedekind domains. We study how the algebra…

We present a sufficient condition for irreducibility of forcing algebras and study the (non)-reducedness phenomenon. Furthermore, we prove a criterion for normality for forcing algebras over a polynomial base ring with coefficients in a…

In this paper we investigate factorizations of polynomials over the ring of dual quaternions into linear factors. While earlier results assume that the norm polynomial is real ("motion polynomials"), we only require the absence of real…

We show that cluster algebras do not contain non-trivial units and that all cluster variables are irreducible elements. Both statements follow from Fomin and Zelevinsky's Laurent phenomenon. As an application we give a criterion for a…

Canonical Polyadic Decomposition (CPD) of a third-order tensor is decomposition in a minimal number of rank-$1$ tensors. We call an algorithm algebraic if it is guaranteed to find the decomposition when it is exact and if it only relies on…

We describe in this note a torsor structure arising on the affine scheme defined by a system of rationnal algebraic relations between polyzetas at roots of unity (values of hyperlogarithmic functions on a fixed finite group of complex roots…

We present a simple and fast algorithm for the computation of the coefficients of the expansion of a function f(cos u) in ultraspherical (Gegenbauer) polynomials. We prove that these coefficients coincide with the Fourier coefficients of an…