Related papers: A version of Hilbert's 16th Problem for 3D polynom…

In this paper we derive aggregate separation bounds, named after Davenport-Mahler-Mignotte (\dmm), on the isolated roots of polynomial systems, specifically on the minimum distance between any two such roots. The bounds exploit the…

We extend the Eruguin result exposed in the paper "Construction of the whole set of ordinary differential equations with a given integral curve" published in 1952 and construct a differential system in $\Bbb{R}^N$ which admits a given set…

In this paper, we prove a KAM theorem in a-posteriori format, using the parameterization method to look invariant tori in non-autonomous Hamiltonian systems with $n$ degrees of freedom that depend periodically or quasi-periodically (QP) on…

In this paper, we tackle the parametric complete multiplicity problem for a univariate polynomial. Our approach to the parametric complete multiplicity problem has a significant difference from the classical method, which relies on repeated…

Several tools have been developed to enhance automation of theorem proving in the 2D plane. However, in 3D, only a few approaches have been studied, and to our knowledge, nothing has been done in higher dimensions. In this paper, we present…

In this investigation, we conduct a systematic computational search for potential singularities in 3D Navier-Stokes flows on a periodic domain $\Omega$ based on the Ladyzhenskaya-Prodi-Serrin conditions. They assert that for a solution…

The enumeration of combinatorial classes of the complex polynomial vector fields in C presented in [Dia13] is extended here to a closed form enumeration of combinatorial classes for degree d polynomial vector fields up to rotations of…

We construct new substantive examples of non-autonomous vector fields on 3-dimensional sphere having a simple dynamics but non-trivial topology. The construction is based on two ideas: the theory of diffeomorpisms with wild separatrix…

We show the existence and uniqueness of invariant foliations about invariant tori in analytic discrete-time dynamical systems. The parametrisation method is used prove the result. Our theory is a foundational block of data-driven model…

The subject of this work is a three-dimensional topological field theory with a non-semisimple group of gauge symmetry with observables consisting in the holonomies of connections around three closed loops. The connections are a linear…

Let $G$ be a 3-partite graph with $k$ vertices in each part and suppose that between any two parts, there is no cycle of length four. Fischer and Matou\u{s}ek asked for the maximum number of triangles in such a graph. A simple construction…

This paper, the last in a series of three, studies vector bundles on an elliptic surface whose determinant has odd intersection number with a general fiber and uses this study to calculate certain coefficients of Donaldson polynomials.

We develop the theory of resolvent degree, introduced by Brauer \cite{Br} in order to study the complexity of formulas for roots of polynomials and to give a precise formulation of Hilbert's 13th Problem. We extend the context of this…

This paper develops 'covariant tomography', a local framework for solving Inverse Boundary Value Problems (IBVP) for parallel transport equation on star-shaped domains. By integrating geometric decomposition with specific interior…

For the bi-orthogonal polynomials with the third degree polynomial potential functions, the 3 x 3 matrix Riemann-Hilbert problem is explicitly constructed. The developed approach admits an extension to the bi-orthogonal polynomials with…

Let $G$ be a complex classical group, and let $V$ be its defining representation (possibly plus a copy of the dual). A foundational problem in classical invariant theory is to write down generators and relations for the ring of…

For large $n$ we determine the maximum number of induced 6-cycles which can be contained in a planar graph on $n$ vertices, and we classify the graphs which achieve this maximum. In particular we show that the maximum is achieved by the…

The FitzHugh-Nagumo system is a $4$-parameter family of $3$D vector field used for modeling neural excitation and nerve impulse propagation. The origin represents a Hopf-zero equilibrium in the FitzHugh-Nagumo system for two classes of…

It is well known that many problems in interval computation are intractable, which restricts our attempts to solve large problems in reasonable time. This does not mean, however, that all problems are computationally hard. Identifying…

Constructing $r$-th nonresidue over a finite field is a fundamental computational problem. A related problem is to construct an irreducible polynomial of degree $r^e$ (where $r$ is a prime) over a given finite field $\mathbb{F}_q$ of…