English
Related papers

Related papers: Determinant Factorization for Left Multiplication …

200 papers

We show that the quotient C^4/G admits a symplectic resolution for G = (Q_8 x D_8)/(Z/2) < Sp(4,C). Here Q_8 is the quaternionic group of order eight and D_8 is the dihedral group of order eight, and G is the quotient of their direct…

Symplectic Geometry · Mathematics 2011-09-15 Gwyn Bellamy , Travis Schedler

Rings of integer-valued polynomials are known to be atomic, non-factorial rings furnishing examples for both irreducible elements for which all powers factor uniquely (\emph{absolutely irreducibles}) and irreducible elements where some…

Commutative Algebra · Mathematics 2023-07-18 Moritz Hiebler , Sarah Nakato , Roswitha Rissner

For every bivariate polynomial $p(z_1, z_2)$ of bidegree $(n_1, n_2)$, with $p(0,0)=1$, which has no zeros in the open unit bidisk, we construct a determinantal representation of the form $$p(z_1,z_2)=\det (I - K Z),$$ where $Z$ is an…

Functional Analysis · Mathematics 2013-07-01 Anatolii Grinshpan , Dmitry S. Kaliuzhnyi-Verbovetskyi , Victor Vinnikov , Hugo J. Woerdeman

Motion polynomials are a specific type of polynomial over a Clifford algebra that can conveniently describe rational motions. There exists an algorithm for the factorization of motion polynomials that works in generic cases. It hinges on…

Rings and Algebras · Mathematics 2025-08-29 Daren A. Thimm , Zijia Li , Hans-Peter Schröcker , Johannes Siegele

We study two important operations on polynomials defined over complete discrete valuation fields: Euclidean division and factorization. In particular, we design a simple and efficient algorithm for computing slope factorizations, based on…

Number Theory · Mathematics 2016-02-04 Xavier Caruso , David Roe , Tristan Vaccon

We define the $\textit{Divisor Divisibility Sequence}$ associated to a Laurent polynomial $f\in\mathbb{Z}[X_1^{\pm1},\ldots,X_N^{\pm1}]$ to be the sequence $W_n(f)=\prod f(\zeta_1,\ldots,\zeta_N)$, where $\zeta_1,\ldots,\zeta_N$ range over…

Number Theory · Mathematics 2018-07-03 Joseph H. Silverman

We introduce a new method for showing that the roots of the characteristic polynomial of certain finite lattices are all nonnegative integers. This method is based on the notion of a quotient of a poset which will be developed to explain…

Combinatorics · Mathematics 2015-06-25 Joshua Hallam , Bruce E. Sagan

Let $K[x]$ be a polynomial algebra in a variable $x$ over a commutative $\Q$-algebra $K$, and $\G'$ be the monoid of $K$-algebra monomorphisms of $K[x]$ of the type $\s : x\mapsto x+\l_2x^2+... +\l_nx^n$, $\l_i\in K$, $\l_n$ is a unit of…

Rings and Algebras · Mathematics 2007-05-23 V. V. Bavula

Let $F$ be a non-degenerate quadratic form on an $n$-dimensional vector space $V$ over the rational numbers. One is interested in counting the number of zeros of the quadratic form whose coordinates are restricted in a smoothed box of size…

Number Theory · Mathematics 2019-11-01 Thomas Huong Tran

Let X be a smooth projective variety over an algebraically closed field of positive characteristic. We prove that if D is a pseudo-effective R-divisor on X which is not numerically equivalent to the negative part in its divisorial Zariski…

Algebraic Geometry · Mathematics 2013-06-13 Paolo Cascini , Christopher Hacon , Mircea Mustata , Karl Schwede

We prove that a Schur function of rectangular shape $(M^n)$ whose variables are specialized to $x_1,x_1^{-1},...,x_n,x_n^{-1}$ factorizes into a product of two odd orthogonal characters of rectangular shape, one of which is evaluated at…

Combinatorics · Mathematics 2010-01-18 Mihai Ciucu , Christian Krattenthaler

In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on…

General Mathematics · Mathematics 2019-12-30 Duggirala Meher Krishna , Duggirala Ravi

We consider the problem of factorizing a structured 3-way tensor into its constituent Canonical Polyadic (CP) factors. This decomposition, which can be viewed as a generalization of singular value decomposition (SVD) for tensors, reveals…

Machine Learning · Computer Science 2020-07-01 Sirisha Rambhatla , Xingguo Li , Jarvis Haupt

Consider a semi-algebraic set A in R^d constructed from the sets which are determined by inequalities p_i(x)>0, p_i(x)\ge 0, or p_i(x)=0 for a given list of polynomials p_1,...,p_m. We prove several statements that fit into the following…

Algebraic Geometry · Mathematics 2008-05-06 Gennadiy Averkov

In this short note, we consider the conjecture that the log canonical divisor (resp. the anti-log canonical divisor) $K_X + \Delta$ (resp. $-(K_X + \Delta)$) on a pair $(X, \Delta)$ consisting of a complex projective manifold $X$ and a…

Algebraic Geometry · Mathematics 2007-05-23 Shigetaka Fukuda

We identify and analyse obstructions to factorisation of integer matrices into products $N^T N$ or $N^2$ of matrices with rational or integer entries. The obstructions arise as quadratic forms with integer coefficients and raise the…

Number Theory · Mathematics 2021-03-09 Nicholas J. Higham , Matthew C. Lettington , Karl Michael Schmidt

Based on a theorem of Bergman we show that multivariate noncommutative polynomial factorization is deterministic polynomial-time reducible to the factorization of bivariate noncommutative polynomials. More precisely, we show the following:…

Computational Complexity · Computer Science 2023-03-13 V. Arvind , Pushkar S. Joglekar

We study the structure of the commutative multiplicative monoid $\mathbb N_0[x]^*$ of all the non-zero polynomials in $\mathbb Z[x]$ with non-negative coefficients. We show that $\mathbb N_0[x]^*$ is not a half-factorial monoid and is not a…

Commutative Algebra · Mathematics 2025-04-17 Federico Campanini , Alberto Facchini

New families of eight-dimensional real division algebras with large derivation algebra are presented: We generalize the classical Cayley-Dickson doubling process starting with a unital algebra with involution over a field F by allowing the…

Rings and Algebras · Mathematics 2021-04-13 Susanne Pumpluen

In this paper we consider the even monic degree-8 cuboid polynomial $P_{a,u}(t)$ with coprime integers $a\neq u>0$. We prove irreducibility over $\mathbb{Z}$ by excluding all degree-8 splittings. First, any putative $4{+}4$ factorization is…

General Mathematics · Mathematics 2025-10-14 Valery Asiryan