English
Related papers

Related papers: Inductive Solution of the Tangential Center Proble…

200 papers

If all the zeros of $n$th degree polynomials $f(z)$ and $g(z) = \sum_{k=0}^{n}\lambda_k\binom{n}{k}z^k$ respectively lie in the cricular regions $|z|\leq r$ and $|z| \leq s|z-\sigma|$, $s>0$, then it was proved by Marden \cite[p. 86]{mm}…

Complex Variables · Mathematics 2024-12-03 N. A. Rather , Ishfaq Dar , Suhail Gulzar

The theory of orthogonal polynomials on the unit circle is developed for a general class of weights leading to systems of recurrence relations and derivatives of the polynomials and their associated functions, and to functional-difference…

Mathematical Physics · Physics 2007-05-23 P. J. Forrester , N. S. Witte

We consider integer recurrences of the form a_n = f(a_{n-1}), where f is a quadratic polynomial with integer coefficients. We show, for four infinite families of f, that the set of primes dividing at least one term of such a sequence must…

Number Theory · Mathematics 2014-02-26 Rafe Jones

A symmetric characteristic singular integral equation with two fixed singularities at the endpoints in the class of functions bounded at the ends is analyzed. It reduces to a vector Hilbert problem for a half-disc and then to a vector…

Complex Variables · Mathematics 2015-10-06 Y. A. Antipov

We prove that for all p>1/2 there exists a constant $\gamma_p>0$ such that, for any symmetric measurable set of positive measure $E\subset \TT$ and for any $\gamma<\gamma_p$, there is an idempotent trigonometrical polynomial f satisfying…

Classical Analysis and ODEs · Mathematics 2008-10-16 Aline Bonami , Szilárd Gy. Révész

Estimating camera geometry typically involves solving minimal problems formulated as systems of multivariate polynomial equations, which often pose computational challenges when using existing Gr\"obner-basis or resultant-based methods due…

Computer Vision and Pattern Recognition · Computer Science 2026-05-08 Haidong Wu , Snehal Bhayani , Janne Heikkilä

Let $f$ be a polynomial system consisting of $n$ polynomials $f_1,\cdots, f_n$ in $n$ variables $x_1,\cdots, x_n$, with coefficients in $\mathbb{Q}$ and let $\langle f\rangle$ be the ideal generated by $f$. Such a polynomial system, which…

Commutative Algebra · Mathematics 2018-07-31 Jean-Paul Cardinal

Given an integer $q$ and a polynomial $f\in \mathbb Z_{q}[X]$ of degree $d$ with coefficients in the residue ring $\mathbb Z_q=\mathbb Z/q\mathbb Z,$ we obtain new results concerning the number of solutions to congruences of the form…

Number Theory · Mathematics 2018-03-29 Bryce Kerr , Ali Mohammadi

We present a generalized circle theorem which includes the Lee-Yang theorem for symmetric transitions as a special case. It is found that zeros of the partition function can be written in terms of discontinuities in the derivatives of the…

Condensed Matter · Physics 2009-10-22 Koo-Chul Lee

A difficult classical problem in the qualitative theory of differential systems in the plane $\mathbb{R}^2$ is the center-focus problem, i.e. to distinguish between a focus and a center. Another difficult problem is to distinguish inside a…

Dynamical Systems · Mathematics 2023-10-12 Jaume Llibre , Gabriel Rondón

Derivations are linear operators which satisfy the Leibniz rule, while integrations are linear operators which satisfy the Rota-Baxter rule. In this paper, we introduce the notion of an FTC-pair, which consists of an algebra and module with…

Commutative Algebra · Mathematics 2025-01-13 Jean-Simon Pacaud Lemay

We prove that the number of limit cycles generated by a small non-conservative perturbation of a Hamiltonian polynomial vector field on the plane, is bounded by a double exponential of the degree of the fields. This solves the long-standing…

Dynamical Systems · Mathematics 2013-03-05 Gal Binyamini , Dmitry Novikov , Sergei Yakovenko

We consider fine G-gradings on M_n(C) (i.e. gradings of the matrix algebra over the complex numbers where each component is 1 dimensional). Groups which provide such a grading are known to be solvable. We consider the T-ideal of G-graded…

Rings and Algebras · Mathematics 2007-10-31 Eli Aljadeff , Darrell Haile , Michael Natapov

In previous work, the second author introduced a topology, for spaces of irreducible representations, that reduces to the classical Zariski topology over commutative rings but provides a proper refinement in various noncommutative settings.…

Rings and Algebras · Mathematics 2007-05-23 K. R. Goodearl , E. S. Letzter

We study the center-focus problem for planar polynomial vector fields, which can be viewed as a local version of Hilbert's 16th problem. Based on a Lyapunov function approach, we establish novel results regarding the center-focus…

Dynamical Systems · Mathematics 2026-02-27 Yovani Villanueva , Warwick Tucker

The Gromov-Wasserstein (GW) transport problem is a relaxation of classic optimal transport, which seeks a transport between two measures while preserving their internal geometry. Due to meeting this theoretical underpinning, it is a…

Numerical Analysis · Mathematics 2024-03-14 Florian Beier , Robert Beinert

This paper settles the computational complexity of the problem of integrating a polynomial function f over a rational simplex. We prove that the problem is NP-hard for arbitrary polynomials via a generalization of a theorem of Motzkin and…

Metric Geometry · Mathematics 2013-06-27 Velleda Baldoni , Nicole Berline , Jesus De Loera , Matthias Köppe , Michèle Vergne

We classify the pairs of polynomials $f,g \in \mathbb{C}[X]$ having orbits satisfying infinitely many multiplicative dependence relations, extending a result of Ghioca, Tucker and Zieve. Moreover, we show that given $f_1,\ldots, f_n$ from a…

Number Theory · Mathematics 2024-02-22 Marley Young

We present some results on the existence and nonexistence of centers for polynomial first order ordinary differential equations with complex coefficients. In particular, we show that binomial differential equations without linear terms do…

Classical Analysis and ODEs · Mathematics 2007-05-23 M. A. M. Alwash

We show that for any constant d, complex roots of degree d univariate rational (or Gaussian rational) polynomials---given by a list of coefficients in binary---can be computed to a given accuracy by a uniform TC^0 algorithm (a uniform…

Data Structures and Algorithms · Computer Science 2012-10-24 Emil Jeřábek
‹ Prev 1 4 5 6 7 8 10 Next ›