相关论文: On a factorization result of \c{S}tef\u{a}nescu

This paper describes an algorithm which computes the characteristic polynomial of a matrix over a field within the same asymptotic complexity, up to constant factors, as the multiplication of two square matrices. Previously, this was only…

This thesis deals with Partial Differential Equations in Several Complex Variables and especially focuses on a general estimate for the $\bar\partial$-Neumann problem on a domain which is $q$-pseudoconvex or $q$-pseudoconcave at a boundary…

We are presenting an algorithm capable of simplifying tensor polynomials with indices when the building tensors have index symmetry properties. These properties include simple symmetry, cyclicity and those due to the presence of partial and…

This paper discusses the extension of the Prototype Verification System (PVS) sub-theory for rings, part of the PVS algebra theory, with theorems related to the division algorithm for Euclidean rings and Unique Factorization Domains that…

We prove many factorization formulas for highest weight Macdonald polynomials indexed by particular partitions called quasistaircases. As a consequence we prove a conjecture of Bernevig and Haldane stated in the context of the fractional…

In this article, we consider polynomials of the form $f(x)=a_0+a_{n_1}x^{n_1}+a_{n_2}x^{n_2}+\dots+a_{n_r}x^{n_r}\in \mathbb{Z}[x],$ where $|a_0|\ge |a_{n_1}|+\dots+|a_{n_r}|,$ $|a_0|$ is a prime power and $|a_0|\nmid |a_{n_1}a_{n_r}|$. We…

In a recent paper, an algorithm has been presented for determining implications between a particular kind of category theoretic property represented by matrices -- the so called `matrix properties'. In this paper we extend this algorithm to…

As is well-known, a generalization of the classical concept of the factorial $n!$ for a real number $x\in {\mathbb R}$ is the value of Euler's gamma function $\Gamma(1+x)$. In this connection, the notion of a binomial coefficient naturally…

We prove a factorization formula for the Taylor series coefficients of a zero of a polynomial as a function of the polynomial's coefficients. This result extends to more general functions which we call "complex-exponent polynomials". To…

The first author introduced a sequence of polynomials (\cite{8}, sequence A174531) defined recursively. One of the main results of this study is proof of the integrality of its coefficients.

Fix a prime number $d$. The post-critically finite polynomials of the form $f_{d,c} = x^d+c\in \mathbb{C}[x]$ play a fundamental role in polynomial dynamics. While many results are known in the complex dynamical setting, much less is…

Let $D$ be a Dedekind domain with infinitely many maximal ideals, all of finite index, and $K$ its quotient field. Let $\operatorname{Int}(D) = \{f\in K[x] \mid f(D) \subseteq D\}$ be the ring of integer-valued polynomials on $D$. Given any…

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

We present a development of norms and discuss their relationship to factorization. In earlier work, the first named author introduced the notion of a normset, which is the image of the norm map. A normset is a monoid with its own…

We study divisibility properties of a set $\{f_1(\mathbf{U}_n^{(s)}),\ldots,f_m(\mathbf{U}_n^{(s)})\}$, where $f_1,\ldots,f_m$ are polynomials in $s$ variables over $\mathbb{Z}$ and $\mathbf{U}_n^{(s)}$ is a point picked uniformly at random…

We design a deterministic subexponential time algorithm that takes as input a multivariate polynomial $f$ computed by a constant-depth circuit over rational numbers, and outputs a list $L$ of circuits (of unbounded depth and possibly with…

We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…

Let $f(n)$ denote the number of distinct unordered factorisations of the natural number $n$ into factors larger than 1.In this paper, we address some aspects of the function $f(n)$.

Let $k$ be a locally compact complete field with respect to a discrete valuation $v$. Let $\oo$ be the valuation ring, $\m$ the maximal ideal and $F(x)\in\oo[x]$ a monic separable polynomial of degree $n$. Let $\delta=v(\dsc(F))$. The…

The main purpose of this paper is solve polynomial equations that are satisfied by (generalized) polynomials. More exactly, we deal with the following problem: let $\mathbb{F}$ be a field with $\mathrm{char}(\mathbb{F})=0$ and $P\in…