English
Related papers

Related papers: Sturm's Theorem with Endpoints

200 papers

Given a function f: [a,b] -> R, if f(a) < 0 and f(b)> 0 and f is continuous, the Intermediate Value Theorem implies that f has a root in [a,b]. Moreover, given a value-oracle for f, an approximate root of f can be computed using the…

Computer Science and Game Theory · Computer Science 2024-03-01 Alexandros Hollender , Chester Lawrence , Erel Segal-Halevi

The relationship between nonnegative polynomials and sums of squares is a classical topic in real algebraic geometry. We study \emph{stubborn polynomials} $f$ on a real variety $X$, which are polynomials nonnegative on $X$, such that no odd…

Algebraic Geometry · Mathematics 2026-02-03 Lorenzo Baldi , Grigoriy Blekherman , Khazhgali Kozhasov , Daniel Plaumann , Bruce Reznick , Rainer Sinn

In this paper we use the Vandermonde matrices and their properties to give a new proof of the classical result of Karl Weierstrass about the approximation of continuous functions $f$ on closed intervals, using a sequence of polynomials. The…

Classical Analysis and ODEs · Mathematics 2025-07-02 José M. González Barrios , Alberto Contreras-Cristán , Patricia I. Romero-Mares

Given a fixed graph H, we say that a graph G is H-free if G does not contain H as a subgraph. The Tur\'an number ex(n, H) of H is the maximum number of edges in an n-vertex H-free graph. The study of Tur\'an number of graphs is a central…

Combinatorics · Mathematics 2025-10-02 Stefan Gobej

Feferman proved in 1962 that any arithmetical theorem is a consequence of a suitable transfinite iteration of full uniform reflection of $\mathsf{PA}$. This result is commonly known as Feferman's completeness theorem. The purpose of this…

Logic · Mathematics 2024-09-24 Fedor Pakhomov , Michael Rathjen , Dino Rossegger

Regular Sturm-Liouville problems with indefinite weight functions may possess finitely many non-real eigenvalues. In this note we prove explicit bounds on the real and imaginary parts of these eigenvalues in terms of the coefficients of the…

Spectral Theory · Mathematics 2013-06-04 Jussi Behrndt , Shaozhu Chen , Friedrich Philipp , Jiangang Qi

We establish Sturm bounds for degree g Siegel modular forms modulo a prime p, which are vital for explicit computations. Our inductive proof exploits Fourier-Jacobi expansions of Siegel modular forms and properties of specializations of…

Number Theory · Mathematics 2015-02-02 Olav K. Richter , Martin Westerholt-Raum

For integers $m \geq 2$, we study divergent continued fractions whose numerators and denominators in each of the $m$ arithmetic progressions modulo $m$ converge. Special cases give, among other things, an infinite sequence of divergence…

Number Theory · Mathematics 2019-01-01 Douglas Bowman , James Mc Laughlin

We study the Stokes phenomenon for the solutions of general homogeneous linear moment partial differential equations with constant coefficients in two complex variables under condition that the Cauchy data are holomorphic on the complex…

Analysis of PDEs · Mathematics 2019-11-28 Sławomir Michalik , Bożena Tkacz

We construct families of explicit polynomials f with rational coefficients that are sums of squares of polynomials over the real numbers, but not over the rational numbers. Whether or not such examples exist was an open question originally…

Algebraic Geometry · Mathematics 2013-06-17 Claus Scheiderer

This is an inaugural study of the Dirichlet problem associated with a regular non-definite Sturm-Liouville equation in the case of two turning points. We give a priori lower bounds on the Richardson numbers associated with this problem…

Classical Analysis and ODEs · Mathematics 2013-03-06 Mervis Kikonko , Angelo B. Mingarelli

A theorem of Thompson provides a non-self-adjoint variant of the classical Schur-Horn theorem by characterizing the possible diagonal values of a matrix with given singular values. We prove an analogue of Thompson's theorem for II_1…

Operator Algebras · Mathematics 2017-05-09 Matthew Kennedy , Paul Skoufranis

In the context of the stream calculus, we present an Implicit Function Theorem (IFT) for polynomial systems, and discuss its relations with the classical IFT from calculus. In particular, we demonstrate the advantages of the stream IFT from…

Logic in Computer Science · Computer Science 2024-08-07 Michele Boreale , Luisa Collodi , Daniele Gorla

Pellet's theorem determines when the zeros of a polynomial can be separated into two regions, based on the presence or absence of positive roots of an auxiliary polynomial, but does not provide a method to verify its conditions or to…

Numerical Analysis · Mathematics 2012-10-09 Aaron Melman

This note addresses the continuum problem, taking advantage of the breakthrough mentioned in the subtitle, and relating it to many recent advances occurring in set theory.

Logic · Mathematics 2023-05-18 Matteo Viale

For most purposes, one can replace the use of Rolle's theorem and the mean value theorem, which are not constructively valid, by the law of bounded change. The proof of two basic results in numerical analysis, the error term for Lagrange…

Numerical Analysis · Mathematics 2012-12-07 Thierry Coquand , Bas Spitters

Classical results from Sturm-Liouville theory state that the number of unstable eigenvalues of a scalar, second-order linear operator is equal to the number of associated conjugate points. Recent work has extended these results to a much…

Dynamical Systems · Mathematics 2021-05-25 Margaret Beck , Jonathan Jaquette

Let $p:\mathbb{C} \rightarrow \mathbb{C}$ be a polynomial. The Gauss-Lucas theorem states that its critical points, $p'(z) = 0$, are contained in the convex hull of its roots. We prove a stability version whose simplest form is as follows:…

Complex Variables · Mathematics 2018-12-18 Stefan Steinerberger

We prove a conjecture by Shannon Starr regarding the asymptotics for the number of tuples of commuting permutations with given number of joint orbits. These numbers generalize unsigned Stirling numbers of the first kind which count how many…

Combinatorics · Mathematics 2025-06-10 Abdelmalek Abdesselam

We give a new graph-theoretic proof of Cobham's Theorem which says that the support of an automatic sequence is either sparse or grows at least like $N^\alpha$ for some $\alpha > 0$. The proof uses the notions of tied vertices and cycle…

Combinatorics · Mathematics 2024-05-21 Mieke Wessel
‹ Prev 1 8 9 10 Next ›