Related papers: On the Complexity of Noncommutative Polynomial Fac…
We study the computational complexity of constrained nonnegative Gram feasibility. Given a partially specified symmetric matrix together with affine relations among selected entries, the problem asks whether there exists a nonnegative…
Rational transformations of polynomials are extensively studied in the context of finite fields, especially for the construction of irreducible polynomials. In this paper, we consider the factorization of rational transformations with…
The paper discusses the construction of high dimensional spatial discretizations for arbitrary multivariate trigonometric polynomials, where the frequency support of the trigonometric polynomial is known. We suggest a construction based on…
Although in general there is no meaningful concept of factorization in fields, that in free associative algebras (over a commutative field) can be extended to their respective free field (universal field of fractions) on the level of…
We give deterministic polynomial-time algorithms that, given an order, compute the primitive idempotents and determine a set of generators for the group of roots of unity in the order. Also, we show that the discrete logarithm problem in…
Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…
This paper is devoted to the factorization of multivariate polynomials into products of linear forms, a problem which has applications to differential algebra, to the resolution of systems of polynomial equations and to Waring decomposition…
The problem "A general characterization of uniqueness polynomial for non-critically injective polynomials" has been remained open since the last two decades. In this paper, we explore this open problem. To this end, we initiate a new…
We present a randomized quantum algorithm for polynomial factorization over finite fields. For polynomials of degree $n$ over a finite field $\F_q$, the average-case complexity of our algorithm is an expected $O(n^{1 + o(1)} \log^{2 +…
The determinantal complexity of a polynomial $P \in \mathbb{F}[x_1, \ldots, x_n]$ over a field $\mathbb{F}$ is the dimension of the smallest matrix $M$ whose entries are affine functions in $\mathbb{F}[x_1, \ldots, x_n]$ such that $P =…
In a sequence of seminal results in the 80's, Kaltofen showed that the complexity class VP is closed under taking factors. A natural question in this context is to understand if other natural classes of multivariate polynomials, for…
We study the problem of finding elements in the intersection of an arbitrary conic variety in $\mathbb{F}^n$ with a given linear subspace (where $\mathbb{F}$ can be the real or complex field). This problem captures a rich family of…
We study for each $n$ a one-parameter family of complex-valued measures on the symmetric group $S_n$, which interpolate the probability of a monic, degree $n$, square-free polynomial in $\mathbb{F}_q[x]$ having a given factorization type.…
We discuss the problem of factorisation of the symmetric Macdonald polynomials and present the obtained results for the cases of 2 and 3 variables.
It is shown how to compute quotients efficiently in non-commutative univariate polynomial rings. This extends earlier work where efficient generic quotients were studied with a primary focus on commutative domains. Fast algorithms are given…
We consider properties of the box polynomials, a one variable polynomial defined over all integer partitions $\lambda$ whose Young diagrams fit in an $m$ by $n$ box. We show that these polynomials can be expressed by the finite difference…
Polynomials whose coefficients, roots, and critical points lie in the ring of rational integers are called nice polynomials. In this paper, we present a general method for investigating such polynomials. We extend our results from the ring…
Cox rings of normal varieties are factorially graded, i.e. homogeneous elements allow a unique decomposition into homogeneous factors. We study this property from an algebraic point of view and give a criterion which in a sense reduces it…
Motion polynomials (polynomials over the dual quaternions with nonzero real norm) describe rational motions. We present a necessary and sufficient condition for reduced bounded motion polynomials to admit factorizations into monic linear…
Factorization of matrices where the rank of the two factors diverges linearly with their sizes has many applications in diverse areas such as unsupervised representation learning, dictionary learning or sparse coding. We consider a setting…