Related papers: Seismic Solvability Problems
Any homogeneous polynomial $P(x, y, z)$ of degree $d$, being restricted to a unit sphere $S^2$, admits essentially a unique representation of the form $\lambda_0 + \sum_{k = 1}^d \lambda_k [\prod_{j = 1}^k L_{kj}]$, where $L_{kj}$'s are…
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…
Sextic polynomial oscillator is probably the best known quantum system which is partially exactly {\it alias} quasi-exactly solvable (QES), i.e., which possesses closed-form, elementary-function bound states $\psi(x)$ at certain couplings…
A class of non-linear eigenvalue problems defined in the form of operator polynomials is investigated. The problems are related to wave equations which appear in a relativistic quantum field theory. Spectral asymptotics for this class are…
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…
The complexity of computing the solutions of a system of multivariate polynomial equations by means of Groebner bases computations is upper bounded by a function of the solving degree. In this paper, we discuss how to rigorously estimate…
In this article, first we give two formulae for the delta invariant of a complex curve singularity that can be embedded as a ${\mathbb Q}$-Cartier divisor in a normal surface singularity with rational homology sphere link. Next, we consider…
We consider the semiring of abstract finite dynamical systems up to isomorphism, with the operations of alternative and synchronous execution. We continue searching for efficient algorithms for solving polynomial equations of the form $P(X)…
The study of the complexity of the equation satisfiability problem in finite groups had been initiated by Goldmann and Russell (2002) where they showed that this problem is in polynomial time for nilpotent groups while it is NP-complete for…
This paper is interested in semilinear stochastic equations having unbounded nonlinear perturbations in the deterministic part and/or in the random part. Moreover, the linear part of these equations is governed by a not necessarily analytic…
Today's propositional satisfiability (SAT) solvers are extremely powerful and can be used as an efficient back-end for solving NP-complete problems. However, many fundamental problems in knowledge representation and reasoning are located at…
Solvable structures, likewise solvable algebras of local symmetries, can be used to integrate scalar ODEs by quadratures. Solvable structures, however, are particularly suitable for the integration of ODEs with a lack of local symmetries.…
Over the split-octonion algebra defined over an arbitrary field, we solve all polynomial equations whose coefficients are scalar except for the constant term. As an application, we determine the square and cubic roots of an octonion.
Partition functions of certain classes of "spin glass" models in statistical physics show strong connections to combinatorial graph invariants. Also known as homomorphism functions they allow for the representation of many such invariants,…
Simple semitoric systems were classified about ten years ago in terms of a collection of invariants, essentially given by a convex polygon with some marked points corresponding to focus-focus singularities. Each marked point is endowed with…
We present a new algorithm for determining the satisfiability of conjunctions of non-linear polynomial constraints over the reals, which can be used as a theory solver for satisfiability modulo theory (SMT) solving for non-linear real…
We show how the separability problem is dual to that of decomposing any given matrix into a conic combination of rank-one partial isometries, thus offering a duality approach different to the positive maps characterization problem. Several…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
The field of numerical algebraic geometry consists of algorithms for numerically solving systems of polynomial equations. When the system is exact, such as having rational coefficients, the solution set is well-defined. However, for a…
Logics with team semantics provide alternative means for logical characterization of complexity classes. Both dependence and independence logic are known to capture non-deterministic polynomial time, and the frontiers of tractability in…