中文
相关论文

相关论文: Global index of real polynomials

200 篇论文

We express Wronskian Hermite polynomials in the Hermite basis and obtain an explicit formula for the coefficients. From this we deduce an upper bound for the modulus of the roots in the case of partitions of length 2. We also derive a…

经典分析与常微分方程 · 数学 2021-01-12 Codruţ Grosu , Corina Grosu

The multi-variable affine index polynomial was defined by the author in previous work. The aim of this short note is to update the definition so it is generalizable to virtual tangles and to show it is compatible with tangle decomposition.…

几何拓扑 · 数学 2022-07-26 Nicolas Petit

We give explicit MacPherson cycles for the Chern-MacPherson class of a closed affine algebraic variety $X$ and for any constructible function $\alpha$ with respect to a complex algebraic Whitney stratification of $X$. We define generalized…

代数几何 · 数学 2010-03-30 Joerg Schuermann , Mihai Tibar

In this paper, Lipschitz univariate constrained global optimization problems where both the objective function and constraints can be multiextremal are considered. The constrained problem is reduced to a discontinuous unconstrained problem…

最优化与控制 · 数学 2015-03-19 Yaroslav D. Sergeyev , Domenico Famularo , Paolo Pugliese

Following the author's previous works, we continue to consider the problem of counting the number of affine conjugacy classes of polynomials of one complex variable when its unordered collection of holomorphic fixed point indices is given.…

动力系统 · 数学 2020-09-25 Toshi Sugiyama

Following our earlier work, where doubly indexed and irreducible over Q two-variable Laguerre polynomials were introduced, we prove for such polynomials some recurrence formulas and obtain a generating function. In addition, we show how…

经典分析与常微分方程 · 数学 2020-08-18 Nikolai A. Krylov

We give upper bounds for the absolute value of the global coefficients appearing in the fine geometric expansion of Arthur's trace formula for GL(n).

表示论 · 数学 2013-10-23 Jasmin Matz

C. F. Gauss discovered a beautiful formula for the number of irreducible polynomials of a given degree over a finite field. Assuming just a few elementary facts in field theory and the exclusion-inclusion formula, we show how one see the…

历史与综述 · 数学 2011-03-17 Sunil K. Chebolu , Jan Minac

We propose and rigorously analyze two randomized algorithms to factor univariate polynomials over finite fields using rank $2$ Drinfeld modules. The first algorithm estimates the degree of an irreducible factor of a polynomial from…

计算复杂性 · 计算机科学 2016-07-12 Anand Kumar Narayanan

In 1954 it was proved if f is infinitely differentiable in the interval I and some derivative (of order depending on x) vanishes at each x, then f is a polynomial. Later it was generalized for multi-variable case. In this paper we give an…

偏微分方程分析 · 数学 2014-07-23 V. E. S. Szabo

For a polynomial $f$ in two complex variables, we prove that the multi-link at infinity of the 0-fiber $f^{-1}(0)$ is a fibred multi-link if and only if all the values different from 0 are regular at infinity.

代数几何 · 数学 2007-05-23 Arnaud Bodin

We compute the graded polynomial identities of the infinite dimensional upper triangular matrix algebra over an arbitrary field. If the grading group is finite, we prove that the set of graded polynomial identities admits a finite basis. We…

环与代数 · 数学 2024-02-19 Micael Said Garcia , Felipe Yukihide Yasumura

Modular polynomials are an important tool in many algorithms involving elliptic curves. In this article we investigate their generalization to the genus 2 case following pioneering work by Gaudry and Dupont. We prove various properties of…

数论 · 数学 2009-02-04 Reinier Broker , Kristin Lauter

We consider paths of steepest descent, in the complex plane, for the norm of a non-constant one variable polynomial $f$. We show that such paths, starting from a zero of the logarithmic derivative of $f$ and ending in a root of $f$, draw a…

复变函数 · 数学 2022-02-02 Damien Roy

Motivated by coding applications,two enumeration problems are considered: the number of distinct divisors of a degree-m polynomial over F = GF(q), and the number of ways a polynomial can be written as a product of two polynomials of degree…

离散数学 · 计算机科学 2021-04-10 Rachel N. Berman , Ron M. Roth

Here the polynomial interpolation approach is used to introduce the main results on multivariate normal algebraic systems. Next we bring a construction which shows that any standard algebraic system, with finite set of solutions, can be…

数值分析 · 数学 2025-10-20 H. Hakopian

Motivated by finding analogues of elliptic curve point counting techniques, we introduce one deterministic and two new Monte Carlo randomized algorithms to compute the characteristic polynomial of a finite rank-two Drinfeld module. We…

符号计算 · 计算机科学 2019-07-31 Yossef Musleh , Éric Schost

Let $\mathbf{f} = (f_1, \ldots, f_R)$ be a system of polynomials with integer coefficients in which the degrees need not all be the same. We provide sufficient conditions for which the system of equations $f_j (x_1, \ldots, x_n) = 0 \ (1…

数论 · 数学 2017-03-10 Shuntaro Yamagishi

The goal of this paper is the exact computation of the degrees $\text{deg}(f^n)$ of the iterates of birational maps $f: \mathbb{P}^N \dashrightarrow \mathbb{P}^N$. In the preceding companion paper, a new method has been proposed based on…

动力系统 · 数学 2023-07-25 Jaume Alonso , Yuri B. Suris , Kangning Wei

We compute the number of points over finite fields of some algebraic varieties related to cluster algebras of finite type. More precisely, these varieties are the fibers of the projection map from the cluster variety to the affine space of…

量子代数 · 数学 2009-12-14 Frédéric Chapoton