Related papers: Stability and exact Turan numbers for matroids
We first partly develop a mathematical notion of stable consistency intended to reflect the actual consistency property of human beings. Then we give a generalization of the first and second G\"odel incompleteness theorem to stably…
Combinatorial batch codes provide a tool for distributed data storage, with the feature of keeping privacy during information retrieval. Recently, Balachandran and Bhattacharya observed that the problem of constructing such uniform codes in…
The purpose of this paper is to exhibit a quantitative stability result for the class of M\"obius transformations of $\mathbb{S}^{n-1}$ when $n\geq 3$. The main estimate is of local nature and asserts that for a Lipschitz map that is…
Fix an integer $r\ge2$. For each $n$ we consider families $\mathcal F\subseteq 2^{[n]}$ that form an antichain and have the property that, for every $t$, if there exists $A\in\mathcal F$ with $|A|=t$ then there exist at least $r$ members of…
In a generalized Tur\'an problem, we are given graphs $H$ and $F$ and seek to maximize the number of copies of $H$ in an $F$-free graph of order $n$. We consider generalized Tur\'an problems where the host graph is planar. In particular we…
The Erd\H os Matching Conjecture states that the maximum size $f(n,k,s)$ of a family $\mathcal{F}\subseteq \binom{[n]}{k}$ that does not contain $s$ pairwise disjoint sets is $\max\{|\mathcal{A}_{k,s}|,|\mathcal{B}_{n,k,s}|\}$, where…
The Euclidean k-means problem is arguably the most widely-studied clustering problem in machine learning. While the k-means objective is NP-hard in the worst-case, practitioners have enjoyed remarkable success in applying heuristics like…
We consider the problem of stabilization of unstable periodic solutions to autonomous systems by the non-invasive delayed feedback control known as Pyragas control method. The Odd Number Theorem imposes an important restriction upon the…
We establish the stability of second-order linear dynamic equations on time scales in the sense of Hyers and Ulam. To wit, if an approximate solution of the second-order linear equation exists, then there exists an exact solution to the…
We show that a $k$-stable set in a finite group can be approximated, up to given error $\epsilon>0$, by left cosets of a subgroup of index $\epsilon^{\text{-}O_k(1)}$. This improves the bound in a similar result of Terry and Wolf on stable…
For a set of graphs $\mathcal{F}$, the extremal number $ex(n;\mathcal{F})$ is the maximum number of edges in a graph of order $n$ not containing any subgraph isomorphic to some graph in $\mathcal{F}$. If $\mathcal{F}$ contains a graph on…
In this paper, we focus on the problem of existence and computing of small and large stable models. We show that for every fixed integer k, there is a linear-time algorithm to decide the problem LSM (large stable models problem): does a…
We consider error estimates in weak parametrised norms for stabilized finite element approximations of the two-dimensional Navier-Stokes' equations. These weak norms can be related to the norms of certain filtered quantities, where the…
A Diophantine $m$-tuple is a set $A$ of $m$ positive integers such that $ab+1$ is a perfect square for every pair $a,b$ of distinct elements of $A$. We derive an asymptotic formula for the number of Diophantine quadruples whose elements are…
We consider the probabilistic Cauchy problem for the Benjamin-Bona-Mahony equation (BBM) on the one-dimensional torus $\mathbb{T}$ with initial data below $L^{2}(\mathbb{T})$. With respect to random initial data of strictly negative Sobolev…
An artificially designed Turing Machine algorithm $\mathbf{M}_{}^{o}$ generates the instances of the satisfiability problem, and check their satisfiability. Under the assumption $\mathcal{P}=\mathcal{NP}$, we show that $\mathbf{M}_{}^{o}$…
A classical conjecture of Erd\H{o}s and S\'os asks to determine the Tur\'an number of a tree. We consider variants of this problem in the settings of hypergraphs and multi-hypergraphs. In particular, for all $k$ and $r$, with $r \ge k…
In the research community, there exists the strong belief that a continuous Galerkin scheme is notoriously unstable and additional stabilization terms have to be added to guarantee stability. In the first part of the series [6], the…
The complexity class $NP$ can be logically characterized both through existential second order logic $SO\exists$, as proven by Fagin, and through simulating a Turing machine via the satisfiability problem of propositional logic SAT, as…
Stability and error analysis remain challenging for problems that lack regularity properties near solutions, are subject to large perturbations, and might be infinite dimensional. We consider nonconvex optimization and generalized equations…