相关论文: Stability for large forbidden subgraphs

We prove homological stability for standard unitary groups over R, C and H and for general linear groups over skew-fields with infinite centre. We focus on the similarities and differences of these proofs. Both proofs are due to Chih-Han…

In Part 1 of this paper, we have estimated the Fr\'echet coderivative and the Mordukhovich coderivative of the stationary point set map of a smooth parametric optimization problem with one smooth functional constraint under total…

We study the extremal problem that relates the spectral radius $\lambda (G)$ of an $F$-free graph $G$ with its number of edges. Firstly, we prove that for any graph $F$ with chromatic number $\chi (F)=r+1\ge 3$, if $G$ is an $F$-free graph…

We consider polynomial differential equations and make a number of contributions to the questions of (i) complexity of deciding stability, (ii) existence of polynomial Lyapunov functions, and (iii) existence of sum of squares (sos) Lyapunov…

We define bigraded persistent homology modules and bigraded barcodes of a finite pseudo-metric space X using the ordinary and double homology of the moment-angle complex associated with the Vietoris-Rips filtration of X. We prove a…

An old problem of Erd\H{o}s, Fajtlowicz and Staton asks for the order of a largest induced regular subgraph that can be found in every graph on n vertices. Motivated by this problem, we consider the order of such a subgraph in a typical…

We study almost sure limiting behavior of extreme and intermediate order statistics arising from strictly stationary sequences. First, we provide sufficient dependence conditions under which these order statistics converges almost surely to…

In this article, we consider solutions starting close to some linearly stable invariant tori in an analytic Hamiltonian system and we prove results of stability for a super-exponentially long interval of time, under generic conditions. The…

We prove that some ergodic linear automorphisms of $\T^N$ are stably ergodic, i.e. any small perturbation remains ergodic. The class of linear automorphisms we deal with includes all non-Anosov ergodic automorphisms when N=4 and so, as a…

In this paper, new conditions for the stability of V-geometrically ergodic Markov chains are introduced. The results are based on an extension of the standard perturbation theory formulated by Keller and Liverani. The continuity and higher…

The stable rank of Leavitt path algebras of row-finite graphs was computed by Ara and Pardo. In this paper we extend this for an arbitrary directed graph. In some parts, we proceed our computation as the row-finite case while in some parts…

In this paper, we develop a modified proof strategy for homological stability of linear groups, with the general linear groups serving as a primary example. Our arguments are more direct than those in the classical works of Quillen and…

In this short note we prove Hilbert--Schmidt stability for graph products of abelian groups and $C^*$-algebras on chordal graphs. In particular, this shows that right-angled Artin groups on chordal graphs are Hilbert--Schmidt stable.

Linear systems governed by continuous-time difference equations cover a wide class of linear systems. From the Lyapunov-Krasovskii approach, we investigate stability for such a class of systems. Sufficient conditions, and in some particular…

This paper presents an alternative proof of the celebrated friendship theorem, originally established by Erd\H{o}s, R\'{e}nyi, and S\'{o}s (1966). The proof relies on a closed-form expression for the Lov\'{a}sz $\vartheta$-function of…

We prove that the space of complex irreducible polynomials of degree $d$ in $n$ variables satisfies two forms of homological stability: first, its cohomology stabilizes as $d$ increases, and second, its compactly supported cohomology…

A theorem is proved to verify incremental stability of a feedback system via a homotopy from a known incrementally stable system. A first corollary of that result is that incremental stability may be verified by separation of Scaled…

The well-known Erd\H{o}s-Hajnal conjecture states that for any graph $F$, there exists $\epsilon>0$ such that every $n$-vertex graph $G$ that contains no induced copy of $F$ has a homogeneous set of size at least $n^{\epsilon}$. We consider…

The stability number of a graph G, denoted by alpha(G), is the cardinality of a maximum stable set, and mu(G) is the cardinality of a maximum matching in G. If alpha(G) + mu(G) equals its order, then G is a Koenig-Egervary graph. We call G…

We apply model theoretic methods to the problem of existence of countable universal graphs with finitely many forbidden connected subgraphs. We show that to a large extent the question reduces to one of local finiteness of an…