Related papers: "`Painleve 34"' equation: equivalence test

We relate the graph isomorphism problem to the solvability of certain systems of linear equations with nonnegative variables. This version replaces the two previous versions of this paper.

We present a deterministic polynomial-time algorithm that solves the 3-satisfiability problem.

Starting with a rational solution to Painleve' VI, coming from a Riccati equation, using Okamoto's theory a four-parametric rational solution is obtained.

We formalise the well-known rules of partial differentiation in a version of equational logic with function variables and binding constructs. We prove the resulting theory is complete with respect to polynomial interpretations. The proof…

Particular solutions of the Benney equations are constructed. Their properties are discussed.

We consider a class of homogeneous self-similar sets with complete overlaps and give a sufficient condition for the Lipschitz equivalence between members in this class.

The solution of one Zamfiresku's problem was obtained. We discuss the unsolved questions related to the Mizel's problem.

The article presents the proof of Casas-Alvero conjecture.

We present some further results on Liouville type theorems for some conformally invariant fully nonlinear equations.

We use E. Cartan's method to solve the problem of equivalence of the second order ordinary differential equations with respect to the pseudogroup of point transformations.

In this paper, we consider a generalized strong vector quasi-equilibrium problem and we prove the existence of its solutions by using some suxiliary results. One of the established theorems is proved by using an approximation method.

Novel hybrid Ermakov-Painlev\'{e} IV systems are introduced and an associated Ermakov invariant is used in establishing their integrability. B\"{a}cklund transformations are then employed to generate classes of exact solutions via the…

We propose an algorithm for solving of the graph isomorphism problem. Also, we introduce the new class of graphs for which the graph isomorphism problem can be solved polynomially using the algorithm.

We prove an epiperimetric inequality for the thin obstacle problem, extending the pioneering results by Weiss on the classical obstacle problem (Invent. Math. 138 (1999), no. 1, 23-50). This inequality provides the means to study the rate…

We show NP-completeness for the recognition problem of 2-line-bend graphs.

In this short note, we prove the existence of solutions to a Monge-Amp\`ere equation of entire type derived by a weighted version of the classical Minkowski problem.

We verify a confluence result for the rewriting calculus of the linear category introduced in our previous paper. Together with the termination result proved therein, the generalized coherence theorem for linear category is established.…

We prove Burkholder inequality using Bregman divergence.

We consider adjustable robust linear complementarity problems and extend the results of Biefel et al. (2022) towards convex and compact uncertainty sets. Moreover, for the case of polyhedral uncertainty sets, we prove that computing an…

We present a subdivision method to solve systems of congruence equations. This method is inspired in a subdivision method, based on Bernstein forms, to solve systems of polynomial inequalities in several variables and arbitrary degrees. The…