Related papers: Determinant Factorization for Left Multiplication …

We study the non-uniqueness of factorizations of non zero-divisors into atoms (irreducibles) in noncommutative rings. To do so, we extend concepts from the commutative theory of non-unique factorizations to a noncommutative setting. Several…

We construct a quartic threefold with L-rational singularities which has torsion in its middle homology group. This answers a question of Brown and Schnetz for all fields of characteristic zero.

In this paper, we consider the existence of a factorization of a monic, bounded motion polynomial. We prove existence of factorizations, possibly after multiplication with a real polynomial and provide algorithms for computing polynomial…

Let $V$ be a two-dimensional vector space over a field $\mathbb F$ of characteristic not $2$ or $3$. We show there is a canonical surjection $\nu$ from the set of suitably generic commutative algebra structures on $V$ modulo the action of…

We describe a simple approach to factorize non-commutative (nc) polynomials, that is, elements in free associative algebras (over a commutative field), into atoms (irreducible elements) based on (a special form of) their minimal linear…

A partition polynomial is a refinement of the partition number p(n) whose coefficients count some special partition statistic. Just as partition numbers have useful asymptotics so do partition polynomials. In fact, their asymptotics…

We formulate and prove a criterion for reducibility of a quadratic polynomial over the integers. The main theorem was suggested by the teaching experience with the concrete material called "the polynomial box". Through the corollaries we…

A subset $S$ of an integral domain $R$ is called a semidomain provided that the pairs $(S,+)$ and $(S, \cdot)$ are semigroups with identities. The study of factorizations in integral domains was initiated by Anderson, Anderson, and…

Computer algebra systems are really good at factoring polynomials, i.e. writing f as a product of irreducible factors. It is relatively easy to verify that we have a factorisation, but verifying that these factors are irreducible is a much…

The hyperdeterminant of a polynomial (interpreted as a symmetric tensor) factors into several irreducible factors with multiplicities. Using geometric techniques these factors are identified along with their degrees and their…

For any real division algebra A of finite dimension greater than one, the signs of the determinants of left multiplication and right multiplication by a non-zero element are shown to form an invariant of A, called its double sign. The…

We obtain some criteria for a symmetric square-central element of a totally decomposable algebra with orthogonal involution in characteristic two, to be contained in an invariant quaternion subalgebra.

Let $T$ be a bounded quaternionic normal operator on a right quaternionic Hilbert space $\mathcal{H}$. We show that $T$ can be factorized in a strongly irreducible sense, that is, for any $\delta >0$ there exist a compact operator $K$ with…

The problem of finding a nonzero solution of a linear recurrence $Ly = 0$ with polynomial coefficients where $y$ has the form of a definite hypergeometric sum, related to the Inverse Creative Telescoping Problem of [14][Sec. 8], has now…

Let R be a complete discrete valuation ring with maximal ideal generated by pi. Let f(X) in R[X] be a monic polynomial with nonzero discriminant Delta(f). Let s >= v_pi(Delta(f)) + 1. Suppose given a factorisation of f(X) in (R/pi^s R)[X]…

We study divisors in a complex manifold in view of the property that the algebra of logarithmic differential operators along the divisor is generated by logarithmic vector fields. We give a sufficient criterion for the property, a simple…

Building on the work of the fourth author in math.AG/9904074, we prove the weak factorization conjecture for birational maps in characteristic zero: a birational map between complete nonsingular varieties over an algebraically closed field…

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…

Factorization of polynomials is one of the foundations of symbolic computation. Its applications arise in numerous branches of mathematics and other sciences. However, the present advanced programming languages such as C++ and J++, do not…

This paper presents the concept of digit polynomials, which leads to a deterministic and unconditional integer factorization algorithm with the runtime complexity $\mathcal{O}(N^{1/4+\epsilon})$. Strassen's well known factoring approach is…