English
Related papers

Related papers: Generalized Loose Edge Factorization Theorems

200 papers

In a seminal work, Bessis gave a geometric interpretation of the noncrossing lattice $NC(W)$ associated to a well-generated complex reflection group $W$. Chief component of this was the trivialization theorem, a fundamental correspondence…

Combinatorics · Mathematics 2024-09-16 Theo Douvropoulos

For a regular normal element in an arbitrary ring, we study the category of its module factorizations. The cokernel functor relates module factorizations with Gorenstein projective components to Gorenstein projective modules over the…

Rings and Algebras · Mathematics 2025-08-28 Xiao-Wu Chen

We prove Bergman's theorem on centralizers by using generic matrices and Kontsevich's quantization method. For any field $\textbf{k} $ of positive characteristics, set $A=\textbf{k} \langle x_1,\dots,x_s\rangle$ be a free associative…

Quantum Algebra · Mathematics 2018-07-24 Alexei Kanel Belov , Farrokh Razavinia , Wenchao Zhang

A numerical semigroup $S$ is an additively-closed set of non-negative integers, and a factorization of an element $n$ of $S$ is an expression of $n$ as a sum of generators of $S$. It is known that for a given numerical semigroup $S$, the…

Combinatorics · Mathematics 2025-11-19 Mariah Moschetti , Christopher O'Neill

The factorizations of the polynomial $X^n-1$ and the cyclotomic polynomial $\Phi_n$ over a finite field $\mathbb F_q$ have been studied for a very long time. Explicit factorizations have been given for the case that $\mathrm{rad}(n)\mid…

Number Theory · Mathematics 2024-02-09 Anna-Maurin Graner

We studies the Newton polygon for the L-function of toric exponential sums attached to a family of two variable generalized hyperkloosterman sum,$f_{t}(x,y)=x^{n}+y+\frac{t}{xy}$ with $t$ the parameter. The explicit Newton polygon is…

Number Theory · Mathematics 2024-11-18 Bolun Wei

The classical Noether Normalization Lemma states that if $S$ is a finitely generated algebra over a field $k$, then there exist elements $x_1,\dots,x_n$ which are algebraically independent over $k$ such that $S$ is a finite module over…

Rings and Algebras · Mathematics 2026-04-17 Dinh Van Hoang , Phan Thanh Toan

The van der Waerden's Conjecture states that the set $\mathscr{P}_{n,N}^0(\mathbb{Q})$ of monic integer polynomials $f(X)$ of degree $n$, with height $\le N$ such that the Galois group $G_{K_f/\mathbb{Q}}$ of the splitting field…

Number Theory · Mathematics 2022-12-23 Ilaria Viglino

The aim of the article is an extension of the Monodromy Conjecture of Denef and Loeser in dimension two, incorporating zeta functions with differential forms and targeting all monodromy eigenvalues, and also considering singular ambient…

Algebraic Geometry · Mathematics 2014-11-11 András Némethi , Willem Veys

Already for bivariate tropical polynomials, factorization is an NP-Complete problem. In this paper, we give an efficient algorithm for factorization and rational factorization of a rich class of tropical polynomials in $n$ variables.…

Combinatorics · Mathematics 2019-12-10 Bo Lin , Ngoc Mai Tran

We extend the recently much-studied Hardy factorization theorems to the weight case. The key point of this paper is to establish the factorization theorems without individual condition on the weight functions. As a direct application, we…

Functional Analysis · Mathematics 2021-12-14 Dinghuai Wang , Rongxiang Zhu , Lisheng Shu

Let $R = k[x_1,\ldots, x_d]$ denote a standard graded polynomial ring over an algebraically closed field $k$, and let $I \subset R$ be a perfect ideal of codimension $2$ with an $n\times (n-1)$ linear presentation matrix $\phi$. We prove an…

Commutative Algebra · Mathematics 2025-09-10 Thiago Fiel , Zaqueu Ramos , Aron Simis

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.…

Rings and Algebras · Mathematics 2023-11-14 Zijia Li , Hans-Peter Schröcker , Johannes Siegele

The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…

Computational Complexity · Computer Science 2019-02-20 Manuel Arora , Gábor Ivanyos , Marek Karpinski , Nitin Saxena

Let $(R,\fm,k)$ be a commutative noetherian local ring with dualizing complex $\dua R$, normalized by $\Ext^{\depth(R)}_R(k,\dua R)\cong k$. Partly motivated by a long standing conjecture of Tachikawa on (not necessarily commutative)…

Commutative Algebra · Mathematics 2007-05-23 L. L. Avramov , R. -O. Buchweitz , L. M. Sega

In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…

Number Theory · Mathematics 2024-01-17 Jitender Singh , Rishu Garg

We present algorithms to factorize weighted homogeneous elements in the first polynomial Weyl algebra and $q$-Weyl algebra, which are both viewed as a $\mathbb{Z}$-graded rings. We show, that factorization of homogeneous polynomials can be…

Symbolic Computation · Computer Science 2016-02-19 Albert Heinle , Viktor Levandovskyy

Many theorems in complex analysis propagate analyticity, such as the Forelli theorem, edge-of-the-wedge theorem and so on. We give a germination theorem which allows for general analytic propagation in complete normed fields. In turn, we…

Complex Variables · Mathematics 2022-10-27 J. E. Pascoe

Fix an odd prime $p$. If $r$ is a positive integer and $f$ a polynomial with coefficients in $\mathbb{F}_{p^r}$, let $P_{p,r}(f)$ be the proportion of $\mathbb{P}^1(\mathbb{F}_{p^r})$ that is periodic with respect to $f$. We show that as…

Number Theory · Mathematics 2022-08-26 Derek Garton

Simon's factorization theorem is a celebrated tool in algebraic automata theory, providing bounded-depth decompositions of words with respect to morphisms into finite semigroups. We develop an analogue of Simon's theorem for \emph{forests}…

Formal Languages and Automata Theory · Computer Science 2026-05-12 Shaull Almagor , Michaël Cadilhac , Asaf Shoham