中文
相关论文

相关论文: An explicit univariate and radical parametrization…

200 篇论文

For square-free $N\equiv3$ mod 8 and $N$ coprime to 3, I show how to reduce the singular value $k_N$ to radicals, using a novel pair $[f,g]$ of real numbers that are algebraic integers of the Hilbert class field of $Q(\sqrt{-N})$. One is a…

数学物理 · 物理学 2008-07-31 David Broadhurst

Newton iteration (NI) is an almost 350 years old recursive formula that approximates a simple root of a polynomial quite rapidly. We generalize it to a matrix recurrence (allRootsNI) that approximates all the roots simultaneously. In this…

计算复杂性 · 计算机科学 2017-10-10 Pranjal Dutta , Nitin Saxena , Amit Sinhababu

We investigate necessary and sufficient conditions for an arbitrary polynomial of degree $n$ to be trivial, i.e. to have the form $a(z-b)^n$. These results are related to an open problem, conjectured in 2001 by E. Casas- Alvero. It says,…

经典分析与常微分方程 · 数学 2015-08-17 Semyon Yakubovich

A Pythagorean n-tuple is an integer solution of x_1^2+...+x_{n-1}^2=x_n^2. For n=4 and n=6, the Pythagorean n-tuples admit a parametrization by a single n-tuple of polynomials with integer coefficients (which is impossible for n=3). For…

数论 · 数学 2012-01-04 Sophie Frisch , Leonid Vaserstein

A novel method with two variations is proposed with which the number of positive and negative zeros of a polynomial with real coefficients and degree $n$ can be restricted with significantly better determinacy than that provided by the…

综合数学 · 数学 2021-06-11 Emil M. Prodanov

Cantor gave in his fundamental article an elegant proof of the countability of real algebraic numbers based on a positive integer height, denoted by him as N, of integer and irreducible polynomials of given degree (denoted by him as n) with…

数论 · 数学 2023-07-21 Wolfdieter Lang

We present the following result: consider the space of complex polynomials of degree n>2 with n-1 distinct marked periodic orbits of given periods. Then this space is irreducible and the multipliers of the marked periodic orbits considered…

动力系统 · 数学 2013-10-28 Igors Gorbovickis

Tavenas has recently proved that any n^{O(1)}-variate and degree n polynomial in VP can be computed by a depth-4 circuit of size 2^{O(\sqrt{n}\log n)}. So to prove VP not equal to VNP, it is sufficient to show that an explicit polynomial in…

计算复杂性 · 计算机科学 2013-11-18 Suryajith Chillara , Partha Mukhopadhyay

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…

数论 · 数学 2024-02-09 Anna-Maurin Graner

We analyze the problem of determining Waring decompositions of the powers of any quadratic form over the field of complex numbers. Our main goal is to provide information about their rank and also to obtain decompositions whose size is as…

代数几何 · 数学 2025-04-22 Cosimo Flavi

Extending earlier work of Guralnick and of Cai and Zhang, we classify the almost simple groups which have transitive permutation representations of prime power degree $p^k$, and those which have $p$-complements (stabilisers of order coprime…

群论 · 数学 2024-03-19 Gareth A. Jones , Sezgin Sezer

The solution to the general univariate polynomial equation has been sought for centuries. It is well known there is no general solution in radicals for degrees five and above. The hyper-Catalan numbers $C[m_2,m_3,m_4,\ldots]$ count the ways…

组合数学 · 数学 2025-07-29 Pratham Mukewar

We introduce a family of univariate polynomials indexed by integer partitions. At prime powers, they count the number of subspaces in a finite vector space that transform under a regular diagonal matrix in a specified manner. This…

组合数学 · 数学 2024-09-17 Amritanshu Prasad , Samrith Ram

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

符号计算 · 计算机科学 2017-04-14 Victor Y. Pan , Liang Zhao

The problem of finding the sum of a polynomial's values is considered. In particular, for any $n\geq 3$, the explicit formula for the sum of the $n$th powers of natural numbers $S_n=\sum_{x=1}^{m}x^{n}$ is proved:…

综合数学 · 数学 2024-11-20 Eteri Samsonadze

Feynman integral computations in theoretical high energy particle physics frequently involve square roots in the kinematic variables. Physicists often want to solve Feynman integrals in terms of multiple polylogarithms. One way to obtain a…

代数几何 · 数学 2021-01-01 Marco Besier , Dino Festi

In this paper we derive an explicit formula for the number of representations of an integer by the sextenary form x^2+y^2+z^2+ 7s^2+7t^2+ 7u^2. We establish the following intriguing inequalities 2b(n)>=a_7(n)>=b(n) for n not equal to…

数论 · 数学 2008-04-15 Alexander Berkovich , Hamza Yesilyurt

In this article, we extend our recent work on a Bombieri-Vinogradov-type theorem for sparse sets of prime powers $p^N\le x^{1/4-\varepsilon}$ with $p\le (\log x)^C$ to sparse sets of moduli $s\le x^{1/3-\varepsilon}$ with radical rad$(s)\le…

数论 · 数学 2024-01-09 Stephan Baier , Sudhir Pujahari

We consider Mahler measures of two well-studied families of bivariate polynomials, namely $P_t=x+x^{-1}+y+y^{-1}+\sqrt{t}$ and $Q_t=x^3+y^3+1-\sqrt[3]{t}xy$, where $t$ is a complex parameter. In the cases when the zero loci of these…

数论 · 数学 2025-05-27 Detchat Samart , Zhengyu Tao

We show that the A-polynomial $A_n$ of the 1-parameter family of pretzel knots $K_n=(-2,3,3+2n)$ satisfies a linear recursion relation of order 4 with explicit constant coefficients and initial conditions. Our proof combines results of…

几何拓扑 · 数学 2011-04-11 Stavros Garoufalidis , Thomas W. Mattman