中文
相关论文

相关论文: All roots of unity are detected by the A-polynomia…

200 篇论文

The roots of any polynomial of degree m with integer coefficients, can be computed by manipulation of sequences made from 2m distinct symbols and counting the different symbols in the sequences. This method requires only 'primitive'…

综合数学 · 数学 2007-05-23 Ashok Kumar Mittal , Ashok Kumar Gupta

Working over the split octonions over an algebraically closed field, we solve all polynomial equations in which all the coefficients but the constant term are scalar. As a consequence, we calculate the n-th roots of an octonion.

环与代数 · 数学 2025-04-02 Artem Lopatin , Alexander N. Rybalov

We derive eight identities of symmetry in three variables related to generalized twisted Bernoulli polynomials and generalized twisted power sums, both of which are twisted by ramified roots of unity. All of these are new, since there have…

数论 · 数学 2010-03-18 Dae San Kim

Suppose $k$ is a positive integer and $\mathcal{X}$ is a $k$-fold packing of the plane by infinitely many arc-connected compact sets, which means that every point of the plane belongs to at most $k$ sets. Suppose there is a function…

度量几何 · 数学 2016-01-13 János Pach , Bartosz Walczak

In this brief note, we consider p-adic unit roots or poles of L-functions of exponential sums defined over finite fields. In particular, we look at the number of unit roots or poles, and a congruence relation on the units. This raises a…

数论 · 数学 2015-01-16 C. Douglas Haessig

We establish asymptotic upper bounds on the number of zeros modulo $p$ of certain polynomials with integer coefficients, with $p$ prime numbers arbitrarily large. The polynomials we consider have degree of size $p$ and are obtained by…

数论 · 数学 2022-01-19 Amit Ghosh , Kenneth Ward

We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…

代数几何 · 数学 2009-10-12 Arnaud Bodin

We show that the Schur polynomials in all primitive $n$th roots of unity are $1$, $0$, or $-1$, if $n$ has at most two distinct odd prime factors. This result can be regarded as a generalization of properties of the coefficients of the…

组合数学 · 数学 2025-09-16 Masaki Hidaka , Minoru Itoh

We evaluate multiple polylogarithm values at sixth roots of unity up to weight six, i.e. of the form $G(a_1,\ldots,a_w;1)$ where the indices $a_i$ are equal to zero or a sixth root of unity, with $a_1\neq 1$. For $w\leq 6$, we present bases…

高能物理 - 理论 · 物理学 2017-03-28 Johannes M. Henn , Alexander V. Smirnov , Vladimir A. Smirnov

Let $f \in \mathbb{Z}[y]$ be a polynomial such that $f(\mathbb{N}) \subseteq \mathbb{N}$, and let $p_{\mathcal{A}_{f}}(n)$ denote number of partitions of $n$ whose parts lie in the set $\mathcal{A}_f:=\{f(n):n \in \mathbb{N}\}$. Under…

数论 · 数学 2018-04-20 Alexander Dunn , Nicolas Robles

We analyze the resolvent and define the scattering matrix for asymptotically hyperbolic manifolds with metrics which have a polyhomogeneous expansion near the boundary, and also prove that there is always an essential singularity of the…

偏微分方程分析 · 数学 2015-10-14 Leonardo Marazzi

We present six Theorems on the univariate real Polynomial, using which we develop a new algorithm for deciding the existence of atleast one real root for univariate integer Polynomials. Our algorithm outputs that no positive real root…

数值分析 · 计算机科学 2008-09-05 Deepak Ponvel Chermakani

We provide a method for solving the roots of the general polynomial equation a[n]*x^n+a[n-1]*x^(n-1)+..+a1*x+a0=0. To do so, we express x as a powerseries of s, and calculate the first n-2 coefficients. We turn the polynomial equation into…

经典分析与常微分方程 · 数学 2007-05-23 Geert-Jan Uytdewilligen

An observation by J-P. Serre implies that cubic polynomials are unique among generic monic polynomials of degree 2 or higher in that they have a root that is a power series in the discriminant of the polynomial. We provide formulas for this…

环与代数 · 数学 2026-05-26 Jason Bland , Skip Garibaldi , Joel Rosenberg

Cannon, Swenson, and others have proved numerous theorems about subdivision rules associated to hyperbolic groups with a 2-sphere at infinity. However, few explicit examples are known. We construct an explicit subdivision rule for many…

几何拓扑 · 数学 2014-10-01 Brian Rushton

Polynomials whose coefficients, roots, and critical points lie in the ring of rational integers are called nice polynomials. In this paper, we present a general method for investigating such polynomials. We extend our results from the ring…

数论 · 数学 2007-05-23 Jean-Claude Evard

In this paper, we study the root distribution of some univariate polynomials $W_n(z)$ satisfying a recurrence of order two with linear polynomial coefficients over positive numbers. We discover a sufficient and necessary condition for the…

组合数学 · 数学 2017-12-19 David G. L. Wang , Jiarui Zhang

We prove that the cardinality of the torsion subgroups in homology of a closed hyperbolic manifold of any dimension can be bounded by a doubly exponential function of its diameter. It would follow from a conjecture by Bergeron and Venkatesh…

几何拓扑 · 数学 2017-09-07 Bram Petri

Suppose X is the complex zero set of a finite collection of polynomials in Z[x_1,...,x_n]. We show that deciding whether X contains a point all of whose coordinates are d_th roots of unity can be done within NP^NP (relative to the sparse…

代数几何 · 数学 2011-11-10 J. Maurice Rojas

We investigate Newton's method as a root finder for complex polynomials of arbitrary degree. While polynomial root finding continues to be one of the fundamental tasks of computing, with essential use in all areas of theoretical…

动力系统 · 数学 2016-10-11 Dierk Schleicher