中文
相关论文

相关论文: Theorem of three circles in Coq

200 篇论文

We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…

数论 · 数学 2012-10-03 Ayah Almousa , Melanie Matchett Wood

In this paper, by the generalized Bell umbra and Rolle's theorem, we give some results on the real rootedness of polynomials. Some applications on partition polynomials and the sigma polynomials of graphs are given.

数论 · 数学 2017-12-08 Abdelkader Benyattou , Miloud Mihoubi

This paper derives numerical bounds for and implements the splitting circle method for finding roots of a univariate polynomial in the presence of fixed precision.

数值分析 · 数学 2022-09-13 Michael Nisenzon

The concept of a skew root of a skew polynomial is used to introduce notions of algebraic closedness for $\sigma$-fields, that is, a field equipped with an endomorphism. It is shown that every $\sigma$-field can be embedded in algebraically…

环与代数 · 数学 2025-11-11 Masood Aryapoor

The action of ring automorphisms of the polynomial ring in two variables over the real numbers on real plane curves is considered. The orbits containing degree-three polynomials are computed, with one representative per orbit being…

代数几何 · 数学 2020-02-28 Mark Bly

An invaluable feature of computer algebra systems is their ability to plot the graph of functions. Unfortunately, when one is trying to design a library of mathematical functions, this feature often falls short, producing incorrect and…

软件工程 · 计算机科学 2021-08-10 Guillaume Melquiond

Let $R$ be a real closed field. We consider basic semi-algebraic sets defined by $n$-variate equations/inequalities of $s$ symmetric polynomials and an equivariant family of polynomials, all of them of degree bounded by $2d < n$. Such a…

符号计算 · 计算机科学 2018-06-22 Cordian Riener , Mohab Safey El Din

John Conway's Circle Theorem is a gem of plane geometry. The six points formed by continuing the sides of a triangle beyond every vertex by the length of its opposite side, are concyclic. The theorem has attracted several proofs. We present…

综合数学 · 数学 2021-11-04 Eric Braude

Counterparts of several classical results of number theory are proven for the ring of polynomials with coefficients in a number field. A theorem of Milnor that determines the Witt ring of a function field is applied to prove an analogue of…

数论 · 数学 2024-07-09 William Duke

The main goal of this article is to provide a proof of the Pederson-Roy-Szpirglas theorem about counting common real zeros of real polynomial equations by using basic results from Linear algebra and Commutative algebra. The main tools are…

交换代数 · 数学 2020-09-08 Dilip P. Patil , Jugal Verma

We establish an analogue of the fundamental theorem of algebra for polynomial matrix equations, in which the matrices-coefficients and unknown matrix are assumed to be circulant matrices.

交换代数 · 数学 2024-12-06 Vyacheslav M. Abramov

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

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

We study the root distribution of some univariate polynomials satisfying a recurrence of order two with linear and quadratic polynomial coefficients. We show that the set of non-isolated limits of zeros of the polynomials is the closure of…

经典分析与常微分方程 · 数学 2020-03-02 David G. L. Wang , Jerry J. R. Zhang

We seek complex roots of a univariate polynomial $P$ with real or complex coefficients. We address this problem based on recent algorithms that use subdivision and have a nearly optimal complexity. They are particularly efficient when only…

符号计算 · 计算机科学 2019-11-18 Rémi Imbach , Victor Y. Pan

Section 10.4 of the 1998 Springer-Verlag book {\em Complexity and Real Computation}, by Blum, Cucker, Shub, and Smale, contains a particularly elegant proof of the Fundamental Theorem of Algebra: The central idea of the proof naturally…

代数几何 · 数学 2024-06-21 J. Maurice Rojas

Let C be some class of objects equipped with a set of simplifying moves. When we apply these to a given object M in C as long as possible, we get a root of M. Our main result is that under certain conditions the root of any object exists…

几何拓扑 · 数学 2009-04-10 Cynthia Hog-Angeloni , Sergei Matveev

An approach is shown that proves various theorems of plane geometry in an algorithmic manner. The approach affords transparent proofs of a generalization of the Theorem of Morley and other well known results by casting them in terms of…

计算几何 · 计算机科学 2016-03-14 Eric J. Braude

In previous work, the authors introduced the notion of Q-Koszul algebras, as a tool to "model" module categories for semisimple algebraic groups over fields of large characteristics. Here we suggest the model extends to small…

表示论 · 数学 2014-06-24 Brian Parshall , Leonard Scott

We show that there is a query expressible in first-order logic over the reals that returns, on any given semi-algebraic set A, for every point a radius around which A is conical. We obtain this result by combining famous results from…

数据库 · 计算机科学 2007-05-23 Floris Geerts