Related papers: Stability and exact Turan numbers for matroids
We consider the problem of closeness of solutions of an exact and an averaged difference equations on an infinite interval. Appropriate assertions are derived from one special theorem on the stability under constantly acting perturbations.
This paper examines the stability of the \`a trous algorithm under arbitrary iteration in the context of a more general study of shift-invariant filter banks. The main results describe sufficient conditions on the associated filters under…
We prove that the solutions of H\"older-differentiable Hamiltonian systems, associated to initial conditions in a small ball of radius $\rho>0$ around a Lagrangian, $(\gamma,\tau)-$Diophantine, quasi-periodic torus, are stable over a time…
We consider a Moran model with two allelic types, mutation and selection. In this work, we study the behaviour of the proportion of fit individuals when the size of the population tends to infinity, without any rescaling of parameters or…
The Stable Marriage problem (SM), solved by the famous deferred acceptance algorithm of Gale and Shapley (GS), has many natural generalizations. If we allow ties in preferences, then the problem of finding a maximum stable matching becomes…
The trivial proof of the ergodic theorem for a finite set $Y$ and a permutation $T:Y\to Y$ shows that for an arbitrary function $f:Y\to{\mathbb R}$ the sequence of ergodic means $A_n(f,T)$ stabilizes for $n \gg |T|$. We show that if $|Y|$…
Pattern formation is ubiquitous in nature and the mechanism widely-accepted to underlay them is based on the Turing instability, predicted by Alan Turing decades ago. This is a non-trivial mechanism that involves nonlinear interaction terms…
To predict allowable time-step size for the fully discretized nonlinear differential equations, a stability theory is developed using exact determination of an infinite perturbation series. Mathematical induction is used to determine the…
This paper derives two stabilizability theorems for a basic class of discrete-time nonlinear systems with multiple unknown parameters. First, we claim that a discrete-time multi-parameter system is stabilizable if its nonlinear growth rate…
Generalized Tur\'an problem with given size, denoted as $\mathrm{mex}(m,K_r,F)$, determines the maximum number of $K_r$-copies in an $F$-free graph with $m$ edges. We prove that for $r\ge 3$ and $\alpha\in(\frac 2 r,1]$, any graph $G$ with…
Given a positive integer $n$ and an $r$-uniform hypergraph (or $r$-graph for short) $F$, the Turan number $ex(n,F)$ of $F$ is the maximum number of edges in an $r$-graph on $n$ vertices that does not contain $F$ as a subgraph. The extension…
We study the stability of explicit Runge-Kutta methods for high order Lagrangian finite element approximation of linear parabolic equations and establish bounds on the largest eigenvalue of the system matrix which determines the largest…
The thermodynamic uncertainty relation (TUR) provides a universal entropic bound for the precision of the fluctuation of the charge transfer for example for a class of continuous time stochastic processes. However, its extension to general…
The Fibonacci index of a graph is the number of its stable sets. This parameter is widely studied and has applications in chemical graph theory. In this paper, we establish tight upper bounds for the Fibonacci index in terms of the…
One of the most classical results in extremal set theory is Sperner's theorem, which says that the largest antichain in the Boolean lattice $2^{[n]}$ has size $\Theta\big(\frac{2^n}{\sqrt{n}}\big)$. Motivated by an old problem of Erd\H{o}s…
Confirming a conjecture of Vera T. S\'os in a very strong sense, we give a complete solution to Tur\'an's hypergraph problem for the Fano plane. That is we prove for $n\ge 8$ that among all $3$-uniform hypergraphs on $n$ vertices not…
The fundamental theorem of Tur\'{a}n from Extremal Graph Theory determines the exact bound on the number of edges $t_r(n)$ in an $n$-vertex graph that does not contain a clique of size $r+1$. We establish an interesting link between…
Fix graphs $F$ and $H$. Let $\mathrm{ex}(n,H,F)$ denote the maximum number of copies of a graph $H$ in an $n$-vertex $F$-free graph. In this note we will give a new general supersaturation result for $\mathrm{ex}(n,H,F)$ in the case when…
Let \( \mathcal{F} \) be a family of graphs. The generalized Tur\'an number \( \operatorname{ex}(n, K_r, \mathcal{F}) \) is the maximum number of $K_r$ in an \( n \)-vertex graph that does not contain any member of \( \mathcal{F} \) as a…
Discrete time evolution of one-dimensional maps is embedded in continuous time by truncating the Taylor series expansion of the time evolution operator to a finite order N. Truncations with N > 4 leads to unconditional instability.…