English
Related papers

Related papers: A Stability Version of the Gauss-Lucas Theorem and…

200 papers

In this work we consider a discontinuous Galerkin method for the discretization of the Stokes problem. We use $H(\textrm{div})$-conforming finite elements as they provide major benefits such as exact mass conservation and…

Numerical Analysis · Mathematics 2016-12-06 Philip L. Lederer , Joachim Schöberl

We prove a robust version of a graph embedding theorem of Sauer and Spencer. To state this sparser analogue, we define $G(p)$ to be a random subgraph of $G$ obtained by retaining each edge of $G$ independently with probability $p \in…

Combinatorics · Mathematics 2025-07-08 Peter Allen , Julia Böttcher , Yoshiharu Kohayakawa , Mihir Neve

We extend Theorem 1 of R. Reams, A Galois approach to m-th roots of matrices with rational entries, LAA 258 (1997), 187-194. Let $p(\lambda)$ be any polynomial over $\mathbb{Q}$ and let $A\in M_n(\mathbb{Q})$ have irreducible characteristic…

Number Theory · Mathematics 2023-07-13 G. J. Groenewald , G. Goosen , D. B. Janse van Rensburg , A. C. M. Ran , M. van Straaten

We develop a general stability theory for equilibrium points of Poisson dynamical systems and relative equilibria of Hamiltonian systems with symmetries, including several generalisations of the Energy-Casimir and Energy-Momentum methods.…

Dynamical Systems · Mathematics 2007-05-23 George W. Patrick , Mark Roberts , Claudia Wulff

Let p be any prime, and let a and n be nonnegative integers. Let $r\in Z$ and $f(x)\in Z[x]$. We establish the congruence $$p^{\deg f}\sum_{k=r(mod p^a)}\binom{n}{k}(-1)^k f((k-r)/p^a) =0 (mod p^{\sum_{i=a}^{\infty}[n/p^i]})$$ (motivated by…

Number Theory · Mathematics 2007-07-25 Zhi-Wei Sun , Donald M. Davis

In this paper we provide a short new proof for the integrality of Rothblum's linear description of the convex hull of incidence vectors of stable matchings in bipartite graphs. In the spirit of iterative rounding proofs, the key feature of…

Combinatorics · Mathematics 2016-09-26 Jochen Könemann , Kanstantsin Pashkovich , Justin Toth

For a finite point set $P \subset \mathbb{R}^d$, denote by $\text{diam}(P)$ the ratio of the largest to the smallest distances between pairs of points in $P$. Let $c_{d, \alpha}(n)$ be the largest integer $c$ such that any $n$-point set $P…

Combinatorics · Mathematics 2025-01-30 Boris Bukh , Zichao Dong

It has been shown by Ibragimov and Zaporozhets [In Prokhorov and Contemporary Probability Theory (2013) Springer] that the complex roots of a random polynomial $G_n(z)=\sum_{k=0}^n\xi_kz^k$ with i.i.d. coefficients $\xi_0,\ldots,\xi_n$…

Probability · Mathematics 2013-10-22 Zakhar Kabluchko , Dmitry Zaporozhets

We find that a wide variety of families of partition statistics stabilize in a fashion similar to $p_k(n)$, the number of partitions of n with k parts, which satisfies $p_k(n) = p_{k+1}(n + 1), k \geq n/2$. We bound the regions of…

Combinatorics · Mathematics 2013-07-05 Robert P. Boyer , William J. Keith

In this paper, we investigate the validity of a quantitative version of stability for the critical Hardy-H\'enon equation \begin{equation*} H(u):=\div(|x|^{-2a}\nabla u)+|x|^{-pb}|u|^{p-2}u=0,\quad u\in D_a^{1,2}(\R^n), \end{equation*}…

Analysis of PDEs · Mathematics 2026-01-23 Yuxuan Zhou , Wenming Zou

We define a natural notion of higher order stability and show that subsets of $\mathbb{F}_p^n$ that are tame in this sense can be approximately described by a union of low-complexity quadratic varieties, up to linear error. This generalizes…

Combinatorics · Mathematics 2025-10-17 C. Terry , J. Wolf

It is well known that, from the Newtonian point of view, the Lagrangian point $L_4$ in the circular restricted three body is stable if $\mu< \frac{1}{18}(9-\sqrt{19})\approx 0.03852$. In this paper we will provide a formula that allows us…

Earth and Planetary Astrophysics · Physics 2016-05-17 Oscar M. Perdomo

Steinitz's theorem states that if a point $a \in \mathrm{int\,conv\,} X$ for a set $X \subset \mathbb{R}^d$, then $X$ contains a subset $Y$ of size at most $2d$ such that $a \in \mathrm{int\,conv\,}Y$. The bound $2d$ is best possible here.…

Combinatorics · Mathematics 2026-03-13 Imre Bárány , Yun Qi

In this paper, we propose a new convex approach to stability analysis of nonlinear systems with polynomial vector fields. First, we consider an arbitrary convex polytope that contains the equilibrium in its interior. Then, we decompose the…

Optimization and Control · Mathematics 2014-11-24 Reza Kamyar , Chaitanya Murti , Matthew Peet

Extending the thoroughly studied theory of group stability, we study Ulam stability type problems for associative and Lie algebras; namely, we investigate obstacles to rank-approximation of almost solutions by exact solutions for systems of…

Rings and Algebras · Mathematics 2025-07-11 Tomer Bauer , Guy Blachar , Be'eri Greenfeld

We consider the set S(n,0) of monic complex polynomials of degree $n\ge 2$ having all their zeros in the closed unit disk and vanishing at 0. For $p\in S(n,0)$ we let $|p|_{0}$ denote the distance from the origin to the zero set of $p'$. We…

Complex Variables · Mathematics 2007-10-25 Julius Borcea

When the distribution of a random (N) sum of independent copies of a r.v X is of the same type as that of X we say that X is N-sum stable. In this paper we consider a generalization of stability of geometric sums by studying distributions…

Probability · Mathematics 2007-06-13 S. Satheesh , N. Unnikrishnan Nair , E. Sandhya

We study the branch of semi-stable and unstable solutions (i.e., those whose Morse index is at most one) of the Dirichlet boundary value problem $-\Delta u=\frac{\lambda f(x)}{(1-u)^2}$ on a bounded domain $\Omega \subset \R^N$, which…

Analysis of PDEs · Mathematics 2007-05-23 Pierpaolo Esposito , Nassif Ghoussoub , Yujin Guo

Let $P$ be a set of points in the plane and let $m$ be an integer. The goal of Max Cover by Unit Disks problem is to place $m$ unit disks whose union covers the maximum number of points from~$P$. We are interested in the dynamic version of…

Computational Geometry · Computer Science 2024-12-19 Mark de Berg , Arpan Sadhukhan

Many nonlinear dynamical systems can be written as Lure systems, which are described by a linear time-invariant system interconnected with a diagonal static sector-bounded nonlinearity. Sufficient conditions are derived for the global…

Systems and Control · Computer Science 2015-09-07 Kwang-Ki K. Kim , Richard D. Braatz