中文
相关论文

相关论文: The Beauty of Roots

200 篇论文

We study an infinite class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. This generalizes a sequence of sparse polynomials which arises in a natural way as graph theoretic…

经典分析与常微分方程 · 数学 2020-08-05 Karl Dilcher , Maciej Ulas

We consider random polynomials whose coefficients are independent and identically distributed on the integers. We prove that if the coefficient distribution has bounded support and its probability to take any particular value is at most…

概率论 · 数学 2017-02-07 Ohad N. Feldheim , Arnab Sen

In this paper we propose a novel efficient algorithm for calculating winding numbers, aiming at counting the number of roots of a given polynomial in a convex region on the complex plane. This algorithm can be used for counting and…

数值分析 · 数学 2019-08-20 Vitaly Zaderman , Liang Zhao

We study the roots of a random polynomial over the field of $p$-adic numbers. For a random monic polynomial with i.i.d. coefficients in $\mathbb{Z}_p$, we obtain an estimate for the expected number of roots of this polynomial. In…

数论 · 数学 2021-12-22 Roy Shmueli

The polynomials with quaternion coefficients have two kind of roots: isolated and spherical. A spherical root generates a class of roots which contains only one complex number $z$ and its conjugate $\bar{z}$, and this class can be…

环与代数 · 数学 2015-01-14 Petroula Dospra , Dimitrios Poulakis

With a main tool is signed graphs, we give a full description of the characteristic quasi-polynomials of ideals of classical root systems ($ABCD$) with respect to the integer and root lattices. As a result, we obtain a full description of…

组合数学 · 数学 2019-12-30 Tan Nhat Tran

Graph polynomials are graph parameters invariant under graph isomorphisms which take values in a polynomial ring with a fixed finite number of indeterminates. We study graph polynomials from a model theoretic point of view. In this paper we…

逻辑 · 数学 2018-05-24 J. A. Makowsky , E. V. Ravve , T. Kotek

Given a matroid or flag of matroids we introduce several broad classes of polynomials satisfying Deletion-Contraction identities, and study their singularities. There are three main families of polynomials captured by our approach:…

代数几何 · 数学 2024-04-12 Daniel Bath , Uli Walther

It is well known that Clifford (geometric) algebra offers a geometric interpretation for square roots of -1 in the form of blades that square to minus 1. This extends to a geometric interpretation of quaternions as the side face bivectors…

环与代数 · 数学 2012-04-24 Eckhard Hitzer , Jacques Helmstetter , Rafal Ablamowicz

We discuss asymptotics of the zeros of orthogonal polynomials on the real line and on the unit circle when the recursion coefficients are periodic. The zeros on or near the absolutely continuous spectrum have a clock structure with spacings…

谱理论 · 数学 2007-05-23 Barry Simon

We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph $H$ to $n$-vertex graphs. These polynomials have received a lot of attention recently for their crucial role in several new…

计算复杂性 · 计算机科学 2020-11-17 Balagopal Komarath , Anurag Pandey , C. S. Rahul

An observation on Hall-Littlewood polynomials.

组合数学 · 数学 2013-09-13 R. Virk

Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…

经典分析与常微分方程 · 数学 2009-04-20 M. A. M. Alwash

A Littlewood polynomial is a polynomial of the form \[ f_n(x)=\sum_{k=0}^n \varepsilon_k x^k \] with $\varepsilon_k\in\{-1, 1\}$. Let $(\varepsilon_k)_{k \ge 0}$ be i.i.d. Rademacher coefficients. We show that the lower envelope of…

概率论 · 数学 2026-05-12 Brayden Letwin , Mehtaab Sawhney

A sequence of nonzero integers $f = (f_1, f_2, \dots)$ is ``binomid'' if every $f$-binomid coefficient $\left[\! \begin{array}{c} n \\ k \end{array}\! \right]_f$ is an integer. Those terms are the generalized binomial coefficients: \[…

数论 · 数学 2023-02-07 Daniel B. Shapiro

The (extended) Linial arrangement $\mathcal{L}_{\Phi}^m$ is a certain finite truncation of the affine Weyl arrangement of a root system $\Phi$ with a parameter $m$. Postnikov and Stanley conjectured that all roots of the characteristic…

组合数学 · 数学 2019-02-19 Masahiko Yoshinaga

The well-known mathematical instrument for detection common roots for pairs of polynomials and multiple roots of polynomials are resultants and discriminants. For a pair of polynomials $f$ and $g$ their resultant $R(f,g)$ is a function of…

经典分析与常微分方程 · 数学 2024-04-15 Mikhail Chernyavsky , Andrei Lebedev , Yurii Trubnikov

Any nonsingular function of spin j matrices always reduces to a matrix polynomial of order 2j. The challenge is to find a convenient form for the coefficients of the matrix polynomial. The theory of biorthogonal systems is a useful…

数学物理 · 物理学 2015-09-30 Thomas L. Curtright

We generalize a theorem of Littlewood concerning the factorization of Schur polynomials when their variables are twisted by roots of unity. We show that a certain family of flagged skew Schur polynomials admit a similar factorization. These…

组合数学 · 数学 2023-06-21 V. Sathish Kumar

We show that smooth curves of monic complex polynomials $P_a (Z)=Z^n+\sum_{j=1}^n a_j Z^{n-j}$, $a_j : I \to \mathbb C$ with $I \subset \mathbb R$ a compact interval, have absolutely continuous roots in a uniform way. More precisely, there…

经典分析与常微分方程 · 数学 2016-08-01 Adam Parusinski , Armin Rainer