In this paper, we study the Cauchy problem for the Benjamin-Ono-Burgers equation \({\partial _t}u - \epsilon \partial _x^2u + {\cal H}\partial _x^2u + u{u_x} = 0\), where \({\cal H}\) denotes the Hilbert transform operator. We obtain that it is uniformly locally well-posed for small data in the refined Sobolev space \({\tilde H^\sigma }(\mathbb{R})\,\,(\sigma \geqslant 0)\), which is a subspace of L2(ℝ). It is worth noting that the low-frequency part of \({\tilde H^\sigma }(\mathbb{R})\) is scaling critical, and thus the small data is necessary. The high-frequency part of \({\tilde H^\sigma }(\mathbb{R})\) is equal to the Sobolev space Hσ (ℝ) (σ ⩾ 0) and reduces to L2(ℝ). Furthermore, we also obtain its inviscid limit behavior in \({\tilde H^\sigma }(\mathbb{R})\) (σ ⩾ 0).
Given an ‐vertex pseudorandom graph and an ‐vertex graph with maximum degree at most two, we wish to find a copy of in , that is, an embedding so that for all . Particular instances of this problem include finding a triangle‐factor and finding a Hamilton cycle in . Here, we provide a deterministic polynomial time algorithm that finds a given in any suitably pseudorandom graph . The pseudorandom graphs we consider are ‐bijumbled graphs of minimum degree which is a constant proportion of the average degree, that is, . A ‐bijumbled graph is characterised through the discrepancy property: for any two sets of vertices and . Our condition on bijumbledness is within a log factor from being tight and provides a positive answer to a recent question of Nenadov. We combine novel variants of the absorption‐reservoir method, a powerful tool from extremal graph theory and random graphs. Our approach builds on our previous work, incorporating the work of Nenadov, together with additional ideas and simplifications. 相似文献
The satisfiability (SAT) problem is a core problem in computer science. Existing studies have shown that most industrial SAT instances can be effectively solved by modern SAT solvers while random SAT instances cannot. It is believed that the structural characteristics of different SAT formula classes are the reasons behind this difference. In this paper, we study the structural properties of propositional formulas in conjunctive normal form (CNF) by the principle of structural entropy of formulas. First, we used structural entropy to measure the complex structure of a formula and found that the difficulty solving the formula is related to the structural entropy of the formula. The smaller the compressing information of a formula, the more difficult it is to solve the formula. Secondly, we proposed a -approximation strategy to approximate the structural entropy of large formulas. The experimental results showed that the proposed strategy can effectively approximate the structural entropy of the original formula and that the approximation ratio is more than 92%. Finally, we analyzed the structural properties of a formula in the solution process and found that a local search solver tends to select variables in different communities to perform the next round of searches during a search and that the structural entropy of a variable affects the probability of the variable being flipped. By using these conclusions, we also proposed an initial candidate solution generation strategy for a local search for SAT, and the experimental results showed that this strategy effectively improves the performance of the solvers CCAsat and Sparrow2011 when incorporated into these two solvers. 相似文献
Acta Mathematica Sinica, English Series - We are interested in the existence and asymptotic behavior for the least energy solutions of the following fractional eigenvalue problem $$\left({\rm{P}}... 相似文献
An oriented tetrahedron defined on four vertices is a set of four cyclic triples with the property that any ordered pair of vertices is contained in exactly one of the cyclic triples. A tetrahedral quadruple system of order with index , denoted by , is a pair , where is an ‐set and is a set of oriented tetrahedra (blocks) such that every cyclic triple on is contained in exactly members of . A is pure if there do not exist two blocks with the same vertex set. When , the spectrum of a pure TQS has been completely determined by Ji. In this paper, we show that there exists a pure if and only if and . A corollary is that a simple also exists if and only if and . 相似文献
We numerically solve the time-dependent Ginzburg–Landau equations for two-gap superconductors using the finite-element technique. The real-time simulation shows that at low magnetic field, the vortices in small-size samples tend to form clusters or other disorder structures. When the sample size is large, stripes appear in the pattern. These results are in good agreement with the previous experimental observations of the intriguing anomalous vortex pattern, providing a reliable theoretical basis for the future applications of multi-gap superconductors. 相似文献
Defects play a central role in controlling the electronic properties of two-dimensional (2D) materials and realizing the industrialization of 2D electronics. However, the evaluation of charged defects in 2D materials within first-principles calculation is very challenging and has triggered a recent development of the WLZ (Wang, Li, Zhang) extrapolation method. This method lays the foundation of the theoretical evaluation of energies of charged defects in 2D materials within the first-principles framework. Herein, the vital role of defects for advancing 2D electronics is discussed, followed by an introduction of the fundamentals of the WLZ extrapolation method. The ionization energies (IEs) obtained by this method for defects in various 2D semiconductors are then reviewed and summarized. Finally, the unique defect physics in 2D dimensions including the dielectric environment effects, defect ionization process, and carrier transport mechanism captured with the WLZ extrapolation method are presented. As an efficient and reasonable evaluation of charged defects in 2D materials for nanoelectronics and other emerging applications, this work can be of benefit to the community. 相似文献
Aequationes mathematicae - We discuss equivalence conditions for the non-existence of non-trivial meromorphic solutions to the Fermat Diophantine equation $$f^m(z)+g^n(z)=1$$ with integers $$m,n\ge... 相似文献