Related papers: Generalized ODE reduction algorithm with bounded d…
We consider the Rosenfeld-Groebner algorithm for computing a regular decomposition of a radical differential ideal generated by a set of ordinary differential polynomials in n indeterminates. For a set of ordinary differential polynomials…
Inspired by quantum information theory, we look for representations of the braid groups $B_n$ on $V^{\otimes (n+m-2)}$ for some fixed vector space $V$ such that each braid generator $\sigma_i, i=1,...,n-1,$ acts on $m$ consecutive tensor…
In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on…
Depth estimation is an essential component in understanding the 3D geometry of a scene, with numerous applications in urban and indoor settings. These scenes are characterized by a prevalence of human made structures, which in most of the…
We present a new approach to solving polynomial ordinary differential equations by transforming them to linear functional equations and then solving the linear functional equations. We will focus most of our attention upon the first-order…
We present a novel numerical method for solving ODEs while preserving polynomial first integrals. The method is based on introducing multiple quadratic auxiliary variables to reformulate the ODE as an equivalent but higher-dimensional ODE…
We shall investigate randomized algorithms for solving large-scale linear inverse problems with general regularizations. We first present some techniques to transform inverse problems of general form into the ones of standard form, then…
In this article we mainly consider the positively Z-graded polynomial ring R=F[X,Y] over an arbitrary field F and Hilbert series of finitely generated graded R-modules. The central result is an arithmetic criterion for such a series to be…
We introduce a new degree reduction method for homogeneous symmetric polynomials on binary variables that generalizes the conventional degree reduction methods on monomials introduced by Freedman and Ishikawa. We also design an degree…
We study structured optimization problems with polynomial objective function and polynomial equality constraints. The structure comes from a multi-grading on the polynomial ring in several variables. For fixed multi-degrees we determine the…
In this paper, we present a modular strategy which describes key properties of the absolute primary decomposition of an equidimensional polynomial ideal defined by polynomials with rational coefficients. The algorithm we design is based on…
This paper is concerned with exact real solving of well-constrained, bivariate polynomial systems. The main problem is to isolate all common real roots in rational rectangles, and to determine their intersection multiplicities. We present…
We consider the boundary value problems (BVPs) for linear secondorder ODEs with a strongly positive operator coefficient in a Banach space. The solutions are given in the form of the infinite series by means of the Cayley transform of the…
In this article, we study model-theoretic properties of algebraic differential equations of order $2$, defined over constant differential fields. In particular, we show that the set of solutions of a general differential equation of order…
Electromagnetic phenomena are mathematically described by solutions of boundary value problems. For exploiting symmetries of these boundary value problems in a way that is offered by techniques of dimensional reduction, it needs to be…
We recall the concept of Baxterisation of an R-matrix, or of a monodromy matrix, which corresponds to build, from one point in the $ R$-matrix parameter space, the algebraic variety where the spectral parameter(s) live. We show that the…
We give a necessary condition for Morita equivalence of simple Generalized Weyl algebras of classical type. We propose a reformulation of Hodges' result, which describes Morita equivalences in case the polynomial defining the Generalized…
We discuss the problem of constructing differential operators for the generalized IBP reduction algorithms at the 2-loop level. A deeply optimized software allows one to efficiently construct such operators for the first non-degenerate…
Let $K$ be a field of characteristic zero. We deal with the algebraic closure of the field of fractions of the ring of formal power series $K[[x_1,\ldots,x_r]]$, $r\geq 2$. More precisely, we view the latter as a subfield of an iterated…
Border bases can be considered to be the natural extension of Gr\"obner bases that have several advantages. Unfortunately, to date the classical border basis algorithm relies on (degree-compatible) term orderings and implicitly on reduced…