Related papers: Stability and exact Turan numbers for matroids
The problem of late time instability in time domain integral equations for electromagnetics is longstanding. While several techniques have been suggested for addressing this problem, they either require impractically high degrees of freedom…
Motivated by work in graph theory, we define the fixing number for a matroid. We give upper and lower bounds for fixing numbers for a general matroid in terms of the size and maximum orbit size (under the action of the matroid automorphism…
The strong coupling in the effective quark mass was usually taken as a constant in a quasiparticle model while it is, in fact, running with an energy scale. With a running coupling, however, the thermodynamic inconsistency problem appears…
We prove new optimality results for adaptive mesh refinement algorithms for non-symmetric, indefinite, and time-dependent problems by proposing a generalization of quasi-orthogonality which follows directly from the inf-sup stability of the…
While decomposition of one-parameter persistence modules behaves nicely, as demonstrated by the algebraic stability theorem, decomposition of multiparameter modules is known to be unstable in a certain precise sense. Until now, it has not…
Motivated by a Gan-Loh-Sudakov-type problem, we introduce the regular Tur\'an numbers, a natural variation on the classical Tur\'an numbers for which the host graph is required to be regular. Among other results, we prove a striking…
Fix a matroid N. A matroid M is N-fragile if, for each element e of M, at least one of M\e and M/e has no N-minor. The Bounded Canopy Conjecture is that all GF(q)-representable matroids M that have an N-minor and are N-fragile have branch…
Extending the work of Liu--Mubayi--Reiher~\cite{LMR23unif} on hypergraph Tur\'{a}n problems, we introduce the notion of vertex-extendability for general extremal problems on hypergraphs and develop an axiomatized framework for proving…
Let $S \subset \mathbb{R}^n$ have size $|S| > \ell^{2^n-1}$. We show that there are distinct points $\{x^1,..., x^{\ell+1}\} \subset S$ such that for each $i \in [n]$, the coordinate sequence $(x^j_i)_{j=1}^{\ell+1}$ is strictly increasing,…
We study the numerical stability of the Sherman-Morrison-Woodbury (SMW) identity. Let $B = A + UV^T$ and assume $U$ and $V$ both have full-column rank. We explore error bounds for the SMW identity when we are only able to compute…
Long-period circumbinary planets appear to be as common as those orbiting single stars and have been found to frequently have orbital radii just beyond the critical distance for dynamical stability. Assessing the stability is typically done…
We prove two results concerning an Ulam-type stability problem for homomorphisms between lattices. One of them involves estimates by quite general error functions; the other deals with approximate (join) homomorphisms in terms of certain…
We consider the problem of computing the closest stable/unstable non-negative matrix to a given real matrix. This problem is important in the study of linear dynamical systems, numerical methods, etc. The distance between matrices is…
We introduce a new technique to bound the fluctuations exhibited by a physical system, based on the Euclidean geometry of the space of observables. Through a simple unifying argument, we derive a sweeping generalization of so-called…
This paper presents stability and accuracy analysis of a high-order explicit time stepping scheme introduced by \cite[Section 2.2]{Buvoli2019}, which exhibits superior stability compared to classical Adams-Bashforth. A conjecture that is…
The oriented Tur\'{a}n number of a given oriented graph $\overrightarrow{F}$, denoted by $\exo(n,\overrightarrow{F})$, is the largest number of arcs in $n$-vertex $\overrightarrow{F}$-free oriented graphs. This concept could be seen as an…
We establich quantitative stability estimates for the Trudinger-Moser inequality on smooth, bounded domains in the Euclidean plane. More specifically, we prove that the deficit in the Trudinger-Moser inequality quadratically controls the…
We give a self-contained modern linear stability analysis of a system of n equal mass bodies in circular orbit about a single more massive body. Starting with the mathematical description of the dynamics of the system, we form the linear…
Let $\{a_1, . . . , a_n\}$ be a set of positive integers with $a_1 < \dots < a_n$ such that all $2^n$ subset sums are distinct. A famous conjecture by Erd\H{o}s states that $a_n>c\cdot 2^n$ for some constant $c$, while the best result known…
Answering questions of Y. Rabinovich, we prove "stability" versions of upper bounds on maximal independent set counts in graphs under various restrictions. Roughly these say that being close to the maximum implies existence of a large…