Related papers: A Linear Prelle-Singer method

A generate and test algorithm is described which parses a surface form into one or more lexical entries using linearly ordered phonological rules. This algorithm avoids the exponential expansion of search space which a naive parsing…

We carry out the generalized symmetry classification of polylinear autonomous discrete equations defined on the square, which belong to a twelve-parametric class. The direct result of this classification is a list of equations containing no…

We consider the problem of minimizing a convex, separable, nonsmooth function subject to linear constraints. The numerical method we propose is a block-coordinate extension of the Chambolle-Pock primal-dual algorithm. We prove convergence…

The paper concerns with novel first-order methods for monotone variational inequalities. They use a very simple linesearch procedure that takes into account a local information of the operator. Also the methods do not require…

In this work, we consider rational ordinary differential equations dy/dx = Q(x,y)/P(x,y), with Q(x,y) and P(x,y) coprime polynomials with real coefficients. We give a method to construct equations of this type for which a first integral can…

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…

Using bidifferential calculus, we derive a vectorial binary Darboux transformation for the first member of the "negative" part of the AKNS hierarchy. A reduction leads to the first "negative flow" of the NLS hierarchy, which in turn is a…

We adapt the arguments of Marcus, Spielman and Srivastava in their proof of the Kadison-Singer problem to prove improved paving estimates. Working with Anderson's paving formulation of Kadison-Singer instead of Weaver's vector balancing…

A kernel-based approach for the learning of the solution operator of general nonhomogeneous partial differential equations (PDEs) is proposed. The method incorporates physical priors, typically encoded through the PDE operator, into a…

Painleve analysis and the singular manifold method are the tools used in this paper to perform a complete study of an equation in 2+1 dimensions. This procedure has allowed us to obtain the Lax pair, Darboux transformation and tau functions…

In this paper we study the Darboux transformations of planar vector fields of Schr\"odinger type. Using the isogaloisian property of Darboux transformation we prove the "invariance" of the objects of the "Darboux theory of integrability".…

In this paper, we propose an Integer Linear Model whose solutions are the aperiodic rhythms tiling with a given rhythm A. We show how this model can be used to efficiently check the necessity of the Coven-Meyerowitz's $(T2)$ condition and…

We consider a family of nonlinear oscillators, which is the autonomous case of the two-dimensional projective connection. We construct several classes of these oscillators that are simultaneously integrable and metrisable. This leads to…

We classify, up to a natural equivalence relation, vector fields of the plane which belong to the kernel of a 1--form. This form can be closed, in which case the vector fields are integrable, or not, in which case the differential of the…

We present a series of Darboux integrable discrete equations on the square lattice. Equations of the series are numbered with natural numbers $M$. All the equations have a first integral of the first order in one of directions of the…

We propose a novel neural network model for music signal processing using vector product neurons and dimensionality transformations. Here, the inputs are first mapped from real values into three-dimensional vectors then fed into a…

We provide an algorithm which decides whether a polynomial foliation $\mathcal{F}^{\mathbb{C}^2}$ on the complex plane has a polynomial first integral of genus $g\neq 1$. Except in a specific case, an extension of the algorithm also decides…

We study the problem of detecting infeasibility of large-scale linear programming problems using the primal-dual hybrid gradient method (PDHG) of Chambolle and Pock (2011). The literature on PDHG has mostly focused on settings where the…

We introduce a first order method for solving very large convex cone programs. The method uses an operator splitting method, the alternating directions method of multipliers, to solve the homogeneous self-dual embedding, an equivalent…

In this paper, we consider a method of computing minimal models in circumscription using integer programming in propositional logic and first-order logic with domain closure axioms and unique name axioms. This kind of treatment is very…