ﻻ يوجد ملخص باللغة العربية
The stability method is very useful for obtaining exact solutions of many extremal graph problems. Its key step is to establish the stability property which, roughly speaking, states that any two almost optimal graphs of the same order $n$ can be made isomorphic by changing o(n^2) edges. Here we show how the recently developed theory of graph limits can be used to give an analytic approach to stability. As an application, we present a new proof of the Erdos-Simonovits Stability Theorem. Also, we investigate various properties of the edit distance. In particular, we show that the combinatorial and fraction
We present a method which provides a unified framework for most stability theorems that have been proved in graph and hypergraph theory. Our main result reduces stability for a large class of hypergraph problems to the simpler question of checking th
In this work we consider an equation for the Riemann zeta-function in the critical half-strip. With the help of this equation we prove that finding non-trivial zeros of the Riemann zeta-function outside the critical line would be equivalent to the ex
Let $d$ be a positive integer and $U subset mathbb{Z}^d$ finite. We study $$beta(U) : = inf_{substack{A , B eq emptyset text{finite}}} frac{|A+B+U|}{|A|^{1/2}{|B|^{1/2}}},$$ and other related quantities. We employ tensorization, which is not availa
Brief periods of non-slow-roll evolution during inflation can produce interesting observable consequences, as primordial black holes, or an inflationary gravitational wave spectrum enhanced at small scales. We develop a model independent, analytic ap
We investigate the stability of a one-parameter family of periodic solutions of the four-vortex problem known as `leapfrogging orbits. These solutions, which consist of two pairs of identical yet oppositely-signed vortices, were known to W. Grobli (1