English
Related papers

Related papers: A Condition for Multiplicity Structure of Univaria…

200 papers

We compute the exact value of the squared condition number for the polynomial eigenvalue problem, when the input matrices have entries coming from the standard complex Gaussian distribution, showing that in general this problem is quite…

Numerical Analysis · Mathematics 2017-06-20 Carlos Beltrán , Diego Armentano

We investigate monogenicity and prime splitting in extensions generated by roots of iterated quadratic polynomials. Let $f(x)\in\mathbb{Z}[x]$ be an irreducible, monic, quadratic polynomial, and write $f^n(x)$ for the $n^{\text{th}}$…

Number Theory · Mathematics 2024-06-07 Hanson Smith , Zack Wolske

We prove that any pair of bivariate trinomials has at most 5 isolated roots in the positive quadrant. The best previous upper bounds independent of the polynomial degrees counted only non-degenerate roots and even then gave much larger…

Combinatorics · Mathematics 2007-05-23 Tien-Yien Li , J. Maurice Rojas , Xiaoshen Wang

The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…

Discrete Mathematics · Computer Science 2026-04-10 Antonio E. Porreca , Marius Rolland

We propose some new method of constructing configurations, which consists in consecutive inscribing copies of one underlying configuration. A uniform characterization of the obtained class and the one introduced in our paper untitled…

Combinatorics · Mathematics 2012-03-13 Krzysztof Petelczyc , Krzysztof Prażmowski

We show that if a real trigonometric polynomial has few real roots, then the trigonometric polynomial obtained by writing the coefficients in reverse order must have many real roots. This is used to show that a class of random trigonometric…

Probability · Mathematics 2008-12-10 J. Brian Conrey , David W. Farmer , Özlem Imamoglu

Polynomials which afford nonnegative, real-rooted symmetric decompositions have been investigated recently in algebraic, enumerative and geometric combinatorics. Br\"and\'en and Solus have given sufficient conditions under which the image…

Combinatorics · Mathematics 2021-03-08 Christos A. Athanasiadis , Eleni Tzanaki

The general position problem in graphs seeks the largest set of vertices such that no three vertices lie on a common geodesic. Its counting refinement, the general position polynomial $\psi(G)$, asks for all such possible sets. In this…

Combinatorics · Mathematics 2026-03-26 Bilal Ahmad Rather

We present a necessary and sufficient condition for a root greater than unity of a monic reciprocal polynomial of an even degree at least four, with integer coefficients, to be a Salem number. We determine the probability of fulfillment the…

Number Theory · Mathematics 2019-09-24 Dragan Stankov

We show that the GCD of two univariate polynomials can be computed by (piece-wise) algebraic circuits of constant depth and polynomial size over any sufficiently large field, regardless of the characteristic. This extends a recent result of…

Computational Complexity · Computer Science 2025-07-01 Somnath Bhattacharjee , Mrinal Kumar , Shanthanu Rai , Varun Ramanathan , Ramprasad Saptharishi , Shubhangi Saraf

From the configuration of a matroid (which records the size and rank of the cyclic flats and the containments among them, but not the sets), one can compute several much-studied matroid invariants, including the Tutte polynomial and a…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin

In this paper, we study polynomial norms, i.e. norms that are the $d^{\text{th}}$ root of a degree-$d$ homogeneous polynomial $f$. We first show that a necessary and sufficient condition for $f^{1/d}$ to be a norm is for $f$ to be strictly…

Optimization and Control · Mathematics 2018-07-18 Amir Ali Ahmadi , Etienne de Klerk , Georgina Hall

Cubic and quartic non-autonomous differential equations with continuous piecewise linear coefficients are considered. The main concern is to find the maximum possible multiplicity of periodic solutions. For many classes, we show that the…

Classical Analysis and ODEs · Mathematics 2010-10-01 Mohamad Ali Alwash

For real polynomials with (sparse) exponents in some fixed set, \[ \Psi(t)=x+y_1t^{k_1}+\ldots +y_L t^{k_L}, \] we analyse the types of root structures that might occur as the coefficients vary. We first establish a stratification of roots…

Classical Analysis and ODEs · Mathematics 2022-04-12 Reuben Wheeler

This paper puts forward a new generalized polynomial dimensional decomposition (PDD), referred to as GPDD, comprising hierarchically ordered measure-consistent multivariate orthogonal polynomials in dependent random variables. Unlike the…

Numerical Analysis · Mathematics 2018-10-30 Sharif Rahman

For dispersive Hamiltonian partial differential equations of order 2N+1, N integer, there are two criteria to analyse to examine the stability of small-amplitude, periodic travelling wave solutions to high-frequency perturbations. The first…

Analysis of PDEs · Mathematics 2019-06-12 Olga Trichtchenko

In this paper, we consider the different eigenvalue condition numbers for matrix polynomials used in the literature and we compare them. One of these condition numbers is a generalization of the Wilkinson condition number for the standard…

Numerical Analysis · Mathematics 2018-04-27 Luis Miguel Anguas , María Isabel Bueno , Froilán M. Dopico

Suppose that we are given a formal power series of many variables with coefficients in $\mathbb{R}$ (or $\mathbb{C}$) and we want to compute its $n$-th (multiplicative) root. As can be expected coefficients of the root have to satisfy a…

Commutative Algebra · Mathematics 2025-02-11 Piotr Maćkowiak , Motaz Mokatren

Let $\mathcal{R} = \mathbb{K}[x_1, \dots, x_n]$ be a multivariate polynomial ring over a field $\mathbb{K}$ of characteristic 0. Consider $n$ algebraically independent elements $g_1, \dots, g_n$ in $\mathcal{R}$. Let $\mathcal{S}$ denote…

Symbolic Computation · Computer Science 2025-05-01 Thi Xuan Vu

The paper concerns a new method to obtain a direct proof of the openness at linear rate/metric regularity of composite set-valued maps on metric spaces by the unification and refinement of several methods developed somehow separately in…

Functional Analysis · Mathematics 2012-10-16 Marius Durea , Van Ngai Huynh , Huu Tron Nguyen , Radu Strugariu