Related papers: Pseudofinite proofs of the stable graph regularity…
We use algorithmic methods from online learning to explore some important objects at the intersection of model theory and combinatorics, and find natural ways that algorithmic methods can detect and explain (and improve our understanding…
In graph theory, the Szemer\'edi regularity lemma gives a decomposition of the indicator function for any graph $G$ into a structured component, a uniform part, and a small error. This result, in conjunction with a counting lemma that…
In the problem of structured prediction with graph representation learning (GRL for short), the hypothesis returned by the algorithm maps the set of features in the \emph{receptive field} of the targeted vertex to its label. To understand…
We consider a functional semilinear Rayleigh-Stokes equation involving fractional derivative. Our aim is to analyze some circumstances, in those the global solvability and some results on asymptotic behavior of solutions take place. By…
Ioffe's criterion and various reformulations of it have become a~standard tool in proving theorems guaranteeing metric regularity of a (set-valued) mapping. First, we demonstrate that one should always use directly the so-called general…
We prove that an interesting result concerning generalized Hyers-Ulam-Rassias stability of a linear functional equation obtained in 2014 by S.M. Jung, D. Popa and M.T. Rassias in Journal of Global Optimization is a particular case of a…
This paper introduces and investigates a regularity condition in the asymptotic sense for optimization problems whose objective functions are polynomial. Under this regularity condition, the normalization argument in asymptotic analysis…
The well-known regularity lemma of E. Szemer\'edi for graphs (i.e. 2-uniform hypergraphs) claims that for any graph there exists a vertex partition with the property of quasi-randomness. We give a simple construction of such a partition. It…
In a recent paper, Chernikov and Starchenko prove that graphs defined in distal theories have strong regularity properties, generalizing previous results about graphs defined by semi-algebraic relations. We give a shorter, purely…
Using the stratifications of Deligne-Mumford moduli spaces $\overline{\mathcal M}_{g,n}$ indexed by stable graphs, we introduce a partially ordered set of stable graphs by defining a partial ordering on the set of connected stable graphs of…
We propose a new approach to constructing semistable integral models of hypersurfaces over a discretely valued complete field K. For each stable hypersurface X over K we define a continuous stability function on the Bruhat-Tits building of…
Given a split classical group of symplectic type and a split general linear group over a local field $F$, we use Langlands-Shahidi method to construct their Rankin-Selberg local $\gamma$-factors and prove the corresponding analytic…
It is confirmed in this work that the graph isomorphism can be tested in polynomial time, which resolves a longstanding problem in the theory of computation. The contributions are in three phases as follows. 1. A description graph…
In my PhD thesis a version of Shelah's Presentation Theorem in the setting of Metric Abstract Elementary Classes was proved, where we claimed that the new function symbols are not necessarily uniformly continuous. In this paper we provide a…
We streamline Malliaris and Shelah's proof that $\mathfrak{p} = \mathfrak{t}$. In particular, we replace cofinality spectrum problems with models of $ZFC^-$, and we eliminate the use of peculiar cuts.
We introduce a regularity method for sparse graphs, with new regularity and counting lemmas which use the Schatten-von-Neumann norms to measure uniformity. This leads to $k$-cycle removal lemmas in subgraphs of mildly-pseudorandom graphs,…
In this work, a convergence lemma for function $f$ being finite compositions of analytic mappings and the maximum operator is proved. The lemma shows that the set of $\delta$-stationary points near an isolated local minimum point $x^*$ is…
The main purpose of this work is to characterize the almost sure local structure stability of solutions to a class of linear stochastic partial functional differential equations (SPFDEs) by investigating the Lyapunov exponents and invariant…
The first author together with Jenssen, Perkins and Roberts (2017) recently showed how local properties of the hard-core model on triangle-free graphs guarantee the existence of large independent sets, of size matching the best-known…
We investigate a hierarchy of semidefinite bounds $\vartheta^{(r)}(G)$ for the stability number $\alpha(G)$ of a graph $G$, based on its copositive programming formulation and introduced by de Klerk and Pasechnik [{\em SIAM J. Optim.} 12…