Related papers: Strong stability from vertex-extendability and app…
In this paper we prove homological stability for certain subgroups of surface braid groups. Alternatively, this is equivalent to proving homological stability for configurations of subsets of exactly $\xi$ points in a surface as we increase…
The regularity of systolically extremal surfaces is a notoriously difficult problem already discussed by M. Gromov in 1983, who proposed an argument toward the existence of $L^2$-extremizers exploiting the theory of $r$-regularity developed…
This paper provides sufficient conditions for global asymptotic stability and global exponential stability, which can be applied to nonlinear, large-scale, uncertain discrete-time systems. The conditions are derived by means of vector…
For the 2D incompressible Euler equations, we establish global-in-time ($t \in \mathbb{R}$) stability of vortex quadrupoles satisfying odd symmetry with respect to both axes. Specifically, if the vorticity restricted to a quadrant is…
In this paper, using the fixed point and direct methods, we prove the generalized Hyers-Ulam-Rassias stability of a Cauchy-Jensen additive functional equation in various normed spaces. The concept of Hyers-Ulam-Rassias stability originated…
P. Erd\H{o}s [On extremal problems of graphs and generalized graphs, Israel Journal of Mathematics 2 (1964), 183-190] characterised those hypergraphs $F$ that have to appear in any sufficiently large hypergraph $H$ of positive density. We…
Let $\mathcal{F}$ be a family of graphs. A graph is called $\mathcal{F}$-free if it does not contain any member of $\mathcal{F}$. Generalized Tur\'{a}n problems aim to maximize the number of copies of a graph $H$ in an $n$-vertex…
One of the central topics in extremal graph theory is the study of the function $ex(n,H)$, which represents the maximum number of edges a graph with $n$ vertices can have while avoiding a fixed graph $H$ as a subgraph. Tur{\'a}n provided a…
This paper introduces a unified model for thermo-poroelasticity and multiple-network poroelasticity, reformulated into a total-pressure-based system. We first establish the well-posedness of the problem via a Galerkin-based argument and…
An important theorem about the spectral Tur\'an problem of $K_{a,b}$ was largely developed in separate papers. Recently it was completely resolved by Zhai and Lin [J. Comb. Theory, Ser. B 157 (2022) 184-215], which also confirms a…
The aim of this note is to introduce a stable version of Terao conjecture, using the notion of infinitely stably extendability of vector bundles on $\mathbb P^n$, considered and characterized by I. Coanda in arXiv:0907.4040.
In this paper extremal problems for uniform hypergraphs are studied in the general setting of hereditary properties. It turns out that extremal problems about edges are particular cases of a general analyic problem about a recently…
We develop a theory of \emph{strongly quasiconvex subgroups} of an arbitrary finitely generated group. Strong quasiconvexity generalizes quasiconvexity in hyperbolic groups and is preserved under quasi-isometry. We show that strongly…
The Erd\H{o}s--Gallai Theorem states that for $k \geq 3$, any $n$-vertex graph with no cycle of length at least $k$ has at most $\frac{1}{2}(k-1)(n-1)$ edges. A stronger version of the Erd\H{o}s--Gallai Theorem was given by Kopylov: If $G$…
Classical questions in extremal graph theory concern the asymptotics of $\operatorname{ex}(G, \mathcal{H})$ where $\mathcal{H}$ is a fixed family of graphs and $G=G_n$ is taken from a `standard' increasing sequence of host graphs $(G_1,…
The vertex-cover problem is a prototypical hard combinatorial optimization problem. It was studied in recent years by physicists using the cavity method of statistical mechanics. In this paper, the stability of the finite-temperature…
Interconnected networks of rigid struts are critical for application in lightweight, load-bearing structures. However, accurately modeling stress distribution in these strut lattices poses significant computational challenges due to its…
In this paper we present a novel approach in extremal set theory which may be viewed as an asymmetric version of Katona's permutation method. We use it to find more Tur\'an numbers of hypergraphs in the Erd\H{o}s--Ko--Rado range. An…
In this paper, we extend and refine previous Tur\'an-type results on graphs with a given circumference. Let $W_{n,k,c}$ be the graph obtained from a clique $K_{c-k+1}$ by adding $n-(c-k+1)$ isolated vertices each joined to the same $k$…
The Tur\'an type extremal problem asks to maximize the number of edges over all graphs which do not contain fixed subgraphs. Similarly, the spectral Tur\'an type extremal problem asks to maximize spectral radius of all graphs which do not…