中文
相关论文

相关论文: Topology and Factorization of Polynomials

200 篇论文

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

数论 · 数学 2026-05-19 Jitender Singh

We investigate which polynomials can possibly occur as factors in the denominators of rational solutions of a given partial linear difference equation (PLDE). Two kinds of polynomials are to be distinguished, we call them /periodic/ and…

符号计算 · 计算机科学 2010-05-05 Manuel Kauers , Carsten Schneider

Based on the concepts of $\mathbb{R}$-factorizable topological groups and $\mathcal{M}$-factorizable topological groups, we introduce four classes of factorizabilities on topological groups, named $P\mathcal{M}$-factorizabilities,…

一般拓扑 · 数学 2022-05-17 Meng Bao , Xiaoquan Xu

We give an overview of combinatoric properties of the number of ordered $k$-factorizations $f_k(n,l)$ of an integer, where every factor is greater or equal to $l$. We show that for a large number $k$ of factors, the value of the cumulative…

组合数学 · 数学 2016-10-18 Jacob Sprittulla

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…

交换代数 · 数学 2023-07-18 Moritz Hiebler , Sarah Nakato , Roswitha Rissner

In continuation to our recent work on noncommutative polynomial factorization, we consider the factorization problem for matrices of polynomials and show the following results. (1) Given as input a full rank $d\times d$ matrix $M$ whose…

计算复杂性 · 计算机科学 2022-04-01 V. Arvind , Pushkar S. Joglekar

We present a new algorithm to decompose generic spinor polynomials into linear factors. Spinor polynomials are certain polynomials with coefficients in the geometric algebra of dimension three that parametrize rational conformal motions.…

环与代数 · 数学 2023-11-14 Zijia Li , Hans-Peter Schröcker , Johannes Siegele

Using the cyclotomic identity we compute sums over d-tuples of monic polynomials in F_q[x] weighted by the multiplicity of their irreducible factors. As consequences we determine explicit expressions for the number of d-tuples of…

数论 · 数学 2025-09-03 Richard Ehrenborg

For any finite field $\mathbb{F}$ and any positive integer $n$ we count the number of monic polynomials of degree $n$ over $\mathbb{F}$ with nonzero constant coefficient and a self-reciprocal factor of any specified degree. An application…

数论 · 数学 2022-10-31 Geoffrey Price , Katherine Thompson

The free singularity locus of a noncommutative polynomial f is defined to be the sequence $Z_n(f)=\{X\in M_n^g : \det f(X)=0\}$ of hypersurfaces. The main theorem of this article shows that f is irreducible if and only if $Z_n(f)$ is…

环与代数 · 数学 2018-06-11 J. William Helton , Igor Klep , Jurij Volčič

A topological invariant of a polynomial map $p:X\to B$ from a complex surface containing a curve $C\subset X$ to a one-dimensional base is given by a rational second homology class in the compactification of the moduli space of genus $g$…

代数几何 · 数学 2007-05-23 Paul Norbury

A higher order difference equation may be generally defined in an arbitrary nonempty set S as: \[ f_{n}(x_{n},x_{n-1},...,x_{n-k})=g_{n}(x_{n},x_{n-1},...,x_{n-k}) \] where $f_{n},g_{n} :S^{k+1}\rightarrow S$ are given functions for…

可精确求解与可积系统 · 物理学 2010-12-27 Hassan Sedaghat

For a d-dimensional polyhedral complex P, the dimension of the space of piecewise polynomial functions (splines) on P of smoothness r and degree k is given, for k sufficiently large, by a polynomial f(P,r,k) of degree d. When d=2 and P is…

交换代数 · 数学 2015-02-03 T. McDonald , H. Schenck

In this text, we study factorizations of polynomials over the tropical hyperfield and the sign hyperfield, which we call `tropical polynomials' and `sign polynomials', respectively. We classify all irreducible polynomials in either case. We…

数论 · 数学 2020-05-27 Alexander Agudelo , Oliver Lorscheid

We establish a correspondence between consistent comprehension schemes and complete orthogonal factorisation systems. The comprehensive factorisation of a functor between small categories arises in this way. Similar factorisation systems…

范畴论 · 数学 2018-01-08 Clemens Berger , Ralph M. Kaufmann

We obtain explicit upper bounds for the number of irreducible factors for a class of compositions of polynomials in several variables over a given field. In particular, some irreducibility criteria are given for this class of compositions…

数论 · 数学 2007-05-23 Anca Iuliana Bonciocat , Alexandru Zaharescu

It has been recently discovered by Bell, Heinle and Levandovskyy that a large class of algebras, including the ubiquitous $G$-algebras, are finite factorization domains (FFD for short). Utilizing this result, we contribute an algorithm to…

环与代数 · 数学 2017-12-06 Albert Heinle , Viktor Levandovskyy

In this paper we consider linear combinations of two trivariate homogeneous polynomials of second degree. We formulate and solve two problems: i) Characterization of polynomials for which all linear combinations are factorizable. ii) How…

交换代数 · 数学 2019-12-16 Anna Gharibyan

Let $f(x)\in \mathbb{F}_q[x]$ be an irreducible polynomial of degree $m$ and exponent $e$, and $n$ be a positive integer such that $\nu_p(q-1)\ge \nu_{p}(e)+\nu_p(n)$ for all $p$ prime divisor of $n$. We show a fast algorithm to determine…

数论 · 数学 2015-12-01 F. E. Brochero Martínez , Lucas Reis

In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their…

数论 · 数学 2025-12-24 Rishu Garg , Jitender Singh