Related papers: Solution of Hypergraph Turan problem
We demonstrate that a quantum annealer can be used to solve the NP-complete problem of graph partitioning into subgraphs containing Hamiltonian cycles of constrained length. We present a method to find a partition of a given directed graph…
We introduce the following simpler variant of the Tur\'an problem: Given integers $n>k>r\geq 2$ and $m\geq 1$, what is the smallest integer $t$ for which there exists an $r$-uniform hypergraph with $n$ vertices, $t$ edges and $m$ connected…
In this work we develop and analyze a semi-smooth Newton method for the general nonlinear conic programming problem. In particular, we study the problem with a generalized simplicial cone, i.e., the image of a symmetric cone under a linear…
A circular arc graph is the intersection graph of a collection of connected arcs on the circle. We solve a Tur'an-type problem for circular arc graphs: for n arcs, if m and M are the minimum and maximum number of arcs that contain a common…
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph into pieces of small tree-width, and applying dynamic…
We introduce a novel formulation for curvature regularization by penalizing normal curvatures from multiple directions. This total normal curvature regularization is capable of producing solutions with sharp edges and precise isotropic…
In recent years, hypergraph learning has attracted great attention due to its capacity in representing complex and high-order relationships. However, current neural network approaches designed for hypergraphs are mostly shallow, thus…
In this paper we study the the Gauss image problem, which is a generalization of the Aleksandrov problem in convex geometry. By considering a geometric flow involving Gauss curvature and functions of normal vectors and radial vectors, we…
We use the tridiagonal representation approach to solve the radial Schr\"odinger equation for the continuum scattering states of the Coulomb problem in a complete basis set of discrete Bessel functions. Consequently, we obtain a new…
The Tur\'an number $\ex(n,H)$ is the maximum number of edges that an $n$-vertex $H$-free graph can have. The suspension $\widehat{H}$ is obtained from $H$ by adding a new vertex which is adjacent to all vertices of $H$ and a tree is…
We prove a complexity dichotomy theorem for Holant Problems on 3-regular graphs with an arbitrary complex-valued edge function. Three new techniques are introduced: (1) higher dimensional iterations in interpolation; (2) Eigenvalue Shifted…
We show how to construct a non-smooth solution to Hessian fully nonlinear second-order uniformly elliptic equation using the Cartan isoparametric cubic in 5 dimensions.
Dewetting of liquid films on solid surfaces in the presence of evaporation is a common phenomenon and has been studied by many researchers. The previous numerical approach has revealed that evaporation accelerates the dewetting speed of the…
The classical spectral Tur\'{a}n problem is to determine the maximum spectral radius of an $\mathcal{F}$-free graph of order $n$. Zhai and Wang [Linear Algebra Appl, 437 (2012) 1641-1647] determined the maximum spectral radius of…
We propose a new approach to the numerical solution of ergodic problems arising in the homogenization of Hamilton-Jacobi (HJ) equations. It is based on a Newton-like method for solving inconsistent systems of nonlinear equations, coming…
For the discounted Hamilton-Jacobi equation,$$\lambda u+H(x,d_x u)=0, \ x \in M, $$we construct $C^{1,1}$ subsolutions which are indeed solutions on the projected Aubry set. The smoothness of such subsolutions can be improved under…
In this paper, we bring a complete solution to the Ovals problem, as formulated in [3] and [24].
We consider a strongly heterogeneous medium saturated by an incompressible viscous fluid as it appears in geomechanical modeling. This poroelasticity problem suffers from rapidly oscillating material parameters, which calls for a thorough…
Given a $k$-graph $H$ a complete blow-up of $H$ is a $k$-graph $\hat{H}$ formed by replacing each $v\in V(H)$ by a non-empty vertex class $A_v$ and then inserting all edges between any $k$ vertex classes corresponding to an edge of $H$.…
We investigate natural Tur\'an problems for mixed graphs, generalizations of graphs where edges can be either directed or undirected. We study a natural \textit{Tur\'an density coefficient} that measures how large a fraction of directed…