Related papers: Quotient polynomials with positive coefficients
We generalize the differential dimension polynomial from prime differential ideals to characterizable differential ideals. Its computation is algorithmic, its degree and leading coefficient remain differential birational invariants, and it…
In this paper we give a polynomial-time quantum algorithm for computing orders of solvable groups. Several other problems, such as testing membership in solvable groups, testing equality of subgroups in a given solvable group, and testing…
Coherence, the superposition of orthogonal quantum states, is indispensable in various quantum processes. Inspired by the polynomial invariant for classifying and quantifying entanglement, we first define polynomial coherence measure and…
We say a polynomial f having integer coefficients is strongly coefficient convex if the set of coefficients of f consists of consecutive integers only. We establish various results suggesting that the divisors of x^n-1 with integer…
Seeking the largest solution to an expression of the form A x <= B is a common task in several domains of engineering and computer science. This largest solution is commonly called quotient. Across domains, the meanings of the binary…
It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their power series expansions. We show that the linear differential…
We prove that a random bivariate polynomial with plus minus 1 coefficients is irreducible with high probability.
The first part of the paper is a survey of some of the results previously obtained by the authors concerning the $L^p$-dissipativity of scalar and matrix partial differential operators. In the second part we give new necessary and,…
We develop a theory of arithmetic Newton polygons of higher order, that provides the factorization of a separable polynomial over a $p$-adic field, together with relevant arithmetic information about the fields generated by the irreducible…
Given a positive linear combination of five (respectively seven) cosines, where the angles are positive and sum to pi, the aim of this article is to express the sharp bound of the combination as a Positive Real Fraction in the coefficients…
We refine and extend quantitative bounds, on the fraction of nonnegative polynomials that are sums of squares, to the multihomogenous case.
The Hilbert function of a module over a positively graded algebra is of quasi-polynomial type (Hilbert--Serre). We derive an upper bound for its grade, i.e. the index from which on its coefficients are constant. As an application, we give a…
We develop algorithms to turn quotients of rings of rings of integers into effective Euclidean rings by giving polynomial algorithms for all fundamental ring operations. In addition, we study normal forms for modules over such rings and…
Let $\mathcal F=(F, +. \cdot, <, 0, 1, \dots)$ be a definably complete locally o-minimal expansion of an ordered field. We demonstrate the existence of definable quotients of definable sets by definable equivalence relations when several…
We study the complexity of computation in finitely generated free left, right and two-sided adequate semigroups and monoids. We present polynomial time (quadratic in the RAM model of computation) algorithms to solve the word problem and…
This paper introduces the notion of an excellent quotient, which is stronger than a universal geometric quotient. The main result is that for an action of a connected solvable group $G$ on an affine scheme Spec$(R)$ there exists a…
We present a generic partition refinement algorithm that quotients coalgebraic systems by behavioural equivalence, an important task in system analysis and verification. Coalgebraic generality allows us to cover not only classical…
We classify the discriminantly separable polynomials of degree two in each of three variables, defined by a property that all the discriminants as polynomials of two variables are factorized as products of two polynomials of one variable…
We extend the close interplay between continued fractions, orthogonal polynomials, and Gaussian quadrature rules to several variables in a special but natural setting which we characterize in terms of moment sequences. The crucial condition…
In this paper we give a new and simple algorithm to put any multivariate polynomial into a normal determinant form in which each entry has the form , and in each column the same variable appears. We also apply the algorithm to obtain a…