Related papers: The sharp bound for the number of real solutions t…
A realisation of a graph in the plane as a bar-joint framework is rigid if there are finitely many other realisations, up to isometries, with the same edge lengths. Each of these finitely-many realisations can be seen as a solution to a…
By a numerical continuation method called a diagonal homotopy we can compute the intersection of two positive dimensional solution sets of polynomial systems. This paper proposes to use this diagonal homotopy as the key step in a procedure…
We establish new, and surprisingly tight, connections between propositional proof complexity and finite model theory. Specifically, we show that the power of several propositional proof systems, such as Horn resolution, bounded-width…
D. Khavinson and G. Swiatek proved that harmonic polynomials p(z)+q(z), where p is holomorphic, q is antiholomorphic, and deg p = n > 1 = deg q, can have at most 3n-2 complex zeros. We show that this bound is sharp for all n by proving a…
We present a new probabilistic algorithm to find a finite set of points intersecting the closure of each connected component of the realization of every sign condition over a family of real polynomials defining regular hypersurfaces that…
This article sets forth results on the existence, a priori estimates and boundedness of positive solutions of a singular quasilinear systems of elliptic equations involving variable exponents. The approach is based on Schauder's fixed point…
Multi-homogeneous polynomial systems arise in many applications. We provide bit complexity estimates for solving them which, up to a few extra other factors, are quadratic in the number of solutions and linear in the height of the input…
The classical Descartes' rule of signs limits the number of positive roots of a real polynomial in one variable by the number of sign changes in the sequence of its coefficients. One can ask the question which pairs of nonnegative integers…
In this paper, we give the existence and uniqueness of the strong solution of one dimensional linear parabolic equation with mixed boundary conditions. The boundary conditions can be any kind of mixed Dirichlet, Neumann and Robin boundary…
In this paper, we develop a new deflation technique for refining or verifying the isolated singular zeros of polynomial systems. Starting from a polynomial system with an isolated singular zero, by computing the derivatives of the input…
Solving polynomial equations is a subtask of polynomial optimization. This article introduces systems of such equations and the main approaches for solving them. We discuss critical point equations, algebraic varieties, and solution counts.…
This work resolves the open problem of strong singularity ($\alpha(z)> 1$) in nonlocal Kirchhoff-type equations with variable exponents through five original theorems that collectively establish a comprehensive theory. Beginning with…
We prove lower bounds of order $n\log n$ for both the problem to multiply polynomials of degree $n$, and to divide polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbers. These lower…
In this paper, we determine the bifurcation set of a real polynomial function of two variables for non-degenerate case in the sense of Newton polygons by using a toric compactification. We also count the number of singular phenomena at…
In this short paper we identify special systems of (an arbitrary number) N of first-order Difference Equations with nonlinear homogeneous polynomials of arbitrary degree M in their right-hand sides, which feature very simple explicit…
We study self-adjoint matrix polynomial equations in a single variable and prove existence of self-adjoint solutions under some assumptions on the leading form. Our main result is that any self-adjoint matrix polynomial equation of odd…
In this paper, we consider the problem of deciding the existence of real solutions to a system of polynomial equations having real coefficients, and which are invariant under the action of the symmetric group. We construct and analyze a…
We give partial generalizations of the classical Descartes' rule of signs to multivariate polynomials (with real exponents), in the sense that we provide upper bounds on the number of connected components of the complement of a hypersurface…
The existence of a pivot rule for the simplex method that guarantees a strongly polynomial run-time is a longstanding, fundamental open problem in the theory of linear programming. The leading pivot rule in theory is the shadow pivot rule,…
We give sufficient conditions under which a polyanalytic polynomial of degree $n$ has (i) at least one zero, and (ii) finitely many zeros. In the latter case, we prove that the number of zeros is bounded by $n^2$. We then show that for all…