Related papers: Solution of Hypergraph Turan problem
We consider the initial-value problem for the ``good'' Boussinesq equation on the line. Using inverse scattering techniques, the solution can be expressed in terms of the solution of a $3 \times 3$-matrix Riemann-Hilbert problem. We…
In this paper we introduce a unifying approach to the generalized Tur\'an problem and supersaturation results in graph theory. The supersaturation-extremal function $satex(n, F : m, G)$ is the least number of copies of a subgraph $G$ an…
In the 3-path vertex cover problem, the input is an undirected graph $G$ and an integer $k$. The goal is to decide whether there is a set of vertices $S$ of size at most $k$ such that every path with 3 vertices in $G$ contains at least one…
We provide an algorithm to solve the word problem in all fundamental groups of closed 3-manifolds; in particular, we show that these groups are autostackable. This provides a common framework for a solution to the word problem in any closed…
We establish sharp weighted smoothing estimates for limit solutions to the Cauchy-Dirichlet problem for the fast diffusion equation on smooth bounded domains. We demonstrate that the critical exponent governing these estimates coincides…
We present a new approach for gluing tours over certain tight, 3-edge cuts. Gluing over 3-edge cuts has been used in algorithms for finding Hamilton cycles in special graph classes and in proving bounds for 2-edge-connected subgraph…
In this note, we prove several Tur\'an-type results on geometric hypergraphs. The two main theorems are 1) Every $n$-vertex geometric 3-hypergraph in 2-space with no three strongly crossing edges has at most $O(n^2)$ edges, 2) Every…
In this paper we initiate a systematic study of the Tur\'an problem for edge-ordered graphs. A simple graph is called $\textit{edge-ordered}$, if its edges are linearly ordered. An isomorphism between edge-ordered graphs must respect the…
In this work it is shown that there are symmetries beyond the Euclidean group $E\left(3\right)$ in 3-body problem, and by extension in many-body problem, with inverse squared distance inter particle force. The symmetries in 3-body problem…
We present an algorithm for solving inverse problems on graphs analogous to those arising in diffuse optical tomography for continuous media. In particular, we formulate and analyze a discrete version of the inverse Born series, proving…
In this paper we discuss novel numerical schemes for the computation of the curve shortening and mean curvature flows that are based on special reparametrizations. The main idea is to use special solutions to the harmonic map heat flow in…
We propose a new algorithm for Dehn surgery problem, finding exceptional Dehn filling slopes for a given hyperbolic 3-manifold with a torus boundary, using a quantum invariant called "3D index". The invariant is defined using an ideal…
A fundamental barrier in extremal hypergraph theory is the presence of many near-extremal constructions with very different structures. Indeed, the classical constructions due to Kostochka imply that the notorious extremal problem for the…
A novel methodology to efficiently approximate the Hessian for numerical shape optimization is considered. The method enhances operator symbol approximations by including body fitted coordinates and spatially changing symbols in a semi…
In this paper we consider the problem of approximating Euclidean distances by the infinite integer grid graph. Although the topology of the graph is fixed, we have control over the edge-weight assignment $w:E\to \mathbb{R}_{\ge 0}$, and…
We define a new notion of translations in the hyperbolic plane and explicitly solve the equation of the curve shortening flow. Next, we consider the class of ancient convex solutions and solve the equation of the curve shortening flow when…
A non-uniform hypergraph $H=(V,E)$ consists of a vertex set $V$ and an edge set $E\subseteq 2^V$; the edges in $E$ are not required to all have the same cardinality. The set of all cardinalities of edges in $H$ is denoted by $R(H)$, the set…
The paper presents the solutions for the zonal electrophoresis equations are obtained by analytical and numerical methods. The method proposed by the authors is used. This method allows to reduce the Cauchy problem for two hyperbolic…
We prove the first polynomial bound on the number of monotonic homotopy moves required to tighten a collection of closed curves on any compact orientable surface, where the number of crossings in the curve is not allowed to increase at any…
The invariant subspace problem is solved correcting my earlier attempts [6]-[12].