相关论文: The rational generalized integrating factors for f…

We show that the effective factorization of Ore polynomials over $\mathbb{F}_q(t)$ is still an open problem. This is so because the known algorithm in [1] presents two gaps, and therefore it does not cover all the examples. We amend one of…

We continue to investigate which polynomials can possibly occur as factors in the denominators of rational solutions of a given partial linear difference equation. In an earlier article we had introduced the distinction between periodic and…

This work reports and classifies the most general construction of rational quantum potentials in terms of the generalized Hermite polynomials. This is achieved by exploiting the intrinsic relation between third-order shape-invariant…

We provide upper bounds on the total number of irreducible factors, and in particular irreducibility criteria for some classes of bivariate polynomials $f(x,y)$ over an arbitrary field $\mathbb{K}$. Our results rely on information on the…

We present in this paper a general algorithm for solving first-order formulas in particular theories called "decomposable theories". First of all, using special quantifiers, we give a formal characterization of decomposable theories and…

Endowing the set of functional graphs (FGs) with the sum (disjoint union of graphs) and product (standard direct product on graphs) operations induces on FGs a structure of a commutative semiring R. The operations on R can be naturally…

Selection of 25 examples from extensive nontrivial families for different types of nonlinear PDEs and their formal general solutions are given. The main goal here is to show on examples the types of solvable PDEs and what their general…

A method of finding general solutions of second-order nonlinear ordinary differential equations by extending the Prelle-Singer (PS) method is briefly discussed. We explore integrating factors, integrals of motion and the general solution…

Inferring the parameters of ordinary differential equations (ODEs) from noisy observations is an important problem in many scientific fields. Currently, most parameter estimation methods that bypass numerical integration tend to rely on…

We develop an operator algebraic framework for generalized Cardano polynomials and show how their structure naturally leads to an operator formulation of Cardano method that is compatible with tools and concepts from quantum information…

This paper studies the polynomial optimization problem whose feasible set is a union of several basic closed semialgebraic sets. We propose a unified hierarchy of Moment-SOS relaxations to solve it globally. Under some assumptions, we prove…

We study the problem of computing the isolated regular solutions of a system \((f_1,\ldots,f_n)\) of \(n\) polynomial equations in \(n\) variables \((X_1, \dots, X_n)\) over a field of characteristic zero \(k\). We focus on systems with a…

We study orbit-finite systems of linear equations, in the setting of sets with atoms. Our principal contribution is a decision procedure for solvability of such systems. The procedure works for every field (and even commutative ring) under…

We describe a method for solving linear systems over the localization of a commutative ring $R$ at a multiplicatively closed subset $S$ that works under the following hypotheses: the ring $R$ is coherent, i.e., we can compute finite…

This paper deals with the solution of large classes of systems of nonlinear partial differential equations (PDEs) in spaces of generalized functions that are constructed as the completion of uniform convergence spaces. The existence result…

We study equidistribution of solutions of word equations of the form w(x,y)=g in the family of finite groups SL(2,q). We provide criteria for equidistribution in terms of the trace polynomial of w. This allows us to get an explicit…

We study the theory of equations in one variable over polyhedral semirings. The article revolves around a notion of solution to a polynomial equation over a polyhedral semiring. Our main results are a characterisation of local solutions in…

The systems of complex analytic second order ordinary differential equations whose solutions close up to become rational curves (after analytic continuation) are characterized by the vanishing of an explicit differential invariant, and turn…

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…

Let ${\cal P}=\{h_1, ..., h_s\}\subset \Z[Y_1, ..., Y_k]$, $D\geq \deg(h_i)$ for $1\leq i \leq s$, $\sigma$ bounding the bit length of the coefficients of the $h_i$'s, and $\Phi$ be a quantifier-free ${\cal P}$-formula defining a convex…