arXiv subjects
Publications and source records attributed to Hong Liu.
We show that, in contrast to the integers setting, almost all even order abelian groups $G$ have exponentially fewer maximal sum-free sets than $2^{μ(G)/2}$, where $μ(G)$ denotes the size of a largest sum-free set in $G$. This confirms a conjecture of Balogh, Liu, Sharifzadeh and Treglown.
In various contexts in mathematical physics one needs to compute the logarithm of a positive unbounded operator. Examples include the von Neumann entropy of a density matrix and the flow of operators with the modular Hamiltonian in the Tomita-Takesaki theory. Often, one encounters the situation where the operator under consideration, that we denote by $Δ$, can be related by a perturbative series to another operator $Δ_0$, whose logarithm is known. We set up a perturbation theory for the logarithm $\log Δ$. It turns out that the terms in the series possess remarkable algebraic structure, which enable us to write them in the form of nested commutators plus some "contact terms."
High-accuracy and high-efficiency finite-time Lyapunov exponent (FTLE) calculation method has long been a research hot point, and adaptive refinement method is a kind of method in this field. The proposed objective-adaptive refinement (OAR) criterion can put adaptive particles at the vicinity of FTLE ridges. The FTLE ridge is extracted not simply by the magnitude of FTLE (would cause false negative refinement) and error (would cause false positive refinement) but by a modified gradient climbing method. Moreover, the refinement regions converge to some certain region because of the objectivity of the refinement region.
Recent studies of out-of-time ordered thermal correlation functions (OTOC) in holographic systems and in solvable models such as the Sachdev-Ye-Kitaev (SYK) model have yielded new insights into manifestations of many-body chaos. So far the chaotic behavior has been obtained through explicit calculations in specific models. In this paper we propose a unified description of the exponential growth and ballistic butterfly spreading of OTOCs across different systems using a newly formulated "quantum hydrodynamics," which is valid at finite $\hbar$ and to all orders in derivatives. The scrambling of a generic few-body operator in a chaotic system is described as building up a "hydrodynamic cloud," and the exponential growth of the cloud arises from a shift symmetry of the hydrodynamic action. The shift symmetry also shields correlation functions of the energy density and flux, and time ordered correlation functions of generic operators from exponential growth, while leads to chaotic behavior in OTOCs. The theory also predicts an interesting phenomenon of the skipping of a pole at special values of complex frequency and momentum in two-point functions of energy density and flux. This pole-skipping phenomenon may be considered as a "smoking gun" for the hydrodynamic origin of the chaotic mode. We also discuss the possibility that such a hydrodynamic description could be a hallmark of maximally chaotic systems.
Recent developments have indicated that in addition to out-of-time ordered correlation functions (OTOCs), quantum chaos also has a sharp manifestation in the thermal energy density two-point functions, at least for maximally chaotic systems. The manifestation, referred to as pole-skipping, concerns the analytic behaviour of energy density two-point functions around a special point $ω= i λ$, $k = i λ/v_B$ in the complex frequency and momentum plane. Here $λ$ and $v_B$ are the Lyapunov exponent and butterfly velocity characterising quantum chaos. In this paper we provide an argument that the phenomenon of pole-skipping is universal for general finite temperature systems dual to Einstein gravity coupled to matter. In doing so we uncover a surprising universal feature of the linearised Einstein equations around a static black hole geometry. We also study analytically a holographic axion model where all of the features of our general argument as well as the pole-skipping phenomenon can be verified in detail.
A recent result of Condon, Kim, Kühn and Osthus implies that for any $r\geq (\frac{1}{2}+o(1))n$, an $n$-vertex almost $r$-regular graph $G$ has an approximate decomposition into any collections of $n$-vertex bounded degree trees. In this paper, we prove that a similar result holds for an almost $αn$-regular graph $G$ with any $α>0$ and a collection of bounded degree trees on at most $(1-o(1))n$ vertices if $G$ does not contain large bipartite holes. This result is sharp in the sense that it is necessary to exclude large bipartite holes and we cannot hope for an approximate decomposition into $n$-vertex trees. Moreover, this implies that for any $α>0$ and an $n$-vertex almost $αn$-regular graph $G$, with high probability, the randomly perturbed graph $G\cup \mathbf{G}(n,O(\frac{1}{n}))$ has an approximate decomposition into all collections of bounded degree trees of size at most $(1-o(1))n$ simultaneously. This is the first result considering an approximate decomposition problem in the context of Ramsey-Turán theory and the randomly perturbed graph model.
A set $S$ of natural numbers is multiplicative Sidon if the products of all pairs in $S$ are distinct. Erdős in 1938 studied the maximum size of a multiplicative Sidon subset of $\{1,\ldots, n\}$, which was later determined up to the lower order term: $π(n)+Θ(\frac{n^{3/4}}{(\log n)^{3/2}})$. We show that the number of multiplicative Sidon subsets of $\{1,\ldots, n\}$ is $T(n)\cdot 2^{Θ(\frac{n^{3/4}}{(\log n)^{3/2}})}$ for a certain function $T(n)\approx 2^{1.815π(n)}$ which we specify. This is a rare example in which the order of magnitude of the lower order term in the exponent is determined. It resolves the enumeration problem for multiplicative Sidon sets initiated by Cameron and Erdős in the 80s. We also investigate its extension for generalised multiplicative Sidon sets. Denote by $S_k$, $k\ge 2$, the number of multiplicative $k$-Sidon subsets of $\{1,\ldots, n\}$. We show that $S_k(n)=(β_k+o(1))^{π(n)}$ for some $β_k$ we define explicitly. Our proof is elementary.
Rain streaks can severely degrade the visibility, which causes many current computer vision algorithms fail to work. So it is necessary to remove the rain from images. We propose a novel deep network architecture based on deep convolutional and recurrent neural networks for single image deraining. As contextual information is very important for rain removal, we first adopt the dilated convolutional neural network to acquire large receptive field. To better fit the rain removal task, we also modify the network. In heavy rain, rain streaks have various directions and shapes, which can be regarded as the accumulation of multiple rain streak layers. We assign different alpha-values to various rain streak layers according to the intensity and transparency by incorporating the squeeze-and-excitation block. Since rain streak layers overlap with each other, it is not easy to remove the rain in one stage. So we further decompose the rain removal into multiple stages. Recurrent neural network is incorporated to preserve the useful information in previous stages and benefit the rain removal in later stages. We conduct extensive experiments on both synthetic and real-world datasets. Our proposed method outperforms the state-of-the-art approaches under all evaluation metrics. Codes and supplementary material are available at our project webpage: https://xialipku.github.io/RESCAN .
For a sequence $(H_i)_{i=1}^k$ of graphs, let $\textrm{nim}(n;H_1,\ldots, H_k)$ denote the maximum number of edges not contained in any monochromatic copy of $H_i$ in colour $i$, for any colour $i$, over all $k$-edge-colourings of~$K_n$. When each $H_i$ is connected and non-bipartite, we introduce a variant of Ramsey number that determines the limit of $\textrm{nim}(n;H_1,\ldots, H_k)/{n\choose 2}$ as $n\to\infty$ and prove the corresponding stability result. Furthermore, if each $H_i$ is what we call \emph{homomorphism-critical} (in particular if each $H_i$ is a clique), then we determine $\textrm{nim}(n;H_1,\ldots, H_k)$ exactly for all sufficiently large~$n$. The special case $\textrm{nim}(n;K_3,K_3,K_3)$ of our result answers a question of Ma. For bipartite graphs, we mainly concentrate on the two-colour symmetric case (i.e., when $k=2$ and $H_1=H_2$). It is trivial to see that $\textrm{nim}(n;H,H)$ is at least $\textrm{ex}(n,H)$, the maximum size of an $H$-free graph on $n$ vertices. Keevash and Sudakov showed that equality holds if $H$ is the $4$-cycle and $n$ is large; recently Ma extended their result to an infinite family of bipartite graphs. We provide a larger family of bipartite graphs for which $\textrm{nim}(n;H,H)=\textrm{ex}(n,H)$. For a general bipartite graph $H$, we show that $\textrm{nim}(n;H,H)$ is always within a constant additive error from $\textrm{ex}(n,H)$, i.e.,~$\textrm{nim}(n;H,H)= \textrm{ex}(n,H)+O_H(1)$.
A set of integers is \emph{primitive} if it does not contain an element dividing another. Denote by $f(n)$ the number of maximum-size primitive subsets of $\{1,\ldots, 2n\}$. We prove that the limit $α=\lim_{n\rightarrow \infty}f(n)^{1/n}$ exists. Furthermore, we present an algorithm approximating $α$ with $(1+\varepsilon)$ multiplicative error in $N(\varepsilon)$ steps, showing in particular that $α\approx 1.318$. Our algorithm can be adapted to estimate also the number of all primitive sets in $\{1,\ldots, n\}$. We address another related problem of Cameron and Erdős. They showed that the number of sets containing pairwise coprime integers in $\{1,\ldots, n\}$ is between $2^{π(n)}\cdot e^{(\frac{1}{2}+o(1))\sqrt{n}}$ and $2^{π(n)}\cdot e^{(2+o(1))\sqrt{n}}$. We show that neither of these bounds is tight: there are in fact $2^{π(n)}\cdot e^{(1+o(1))\sqrt{n}}$ such sets.
We study the Eigenstate Thermalization Hypothesis (ETH) in chaotic conformal field theories (CFTs) of arbitrary dimensions. Assuming local ETH, we compute the reduced density matrix of a ball-shaped subsystem of finite size in the infinite volume limit when the full system is an energy eigenstate. This reduced density matrix is close in trace distance to a density matrix, to which we refer as the ETH density matrix, that is independent of all the details of an eigenstate except its energy and charges under global symmetries. In two dimensions, the ETH density matrix is universal for all theories with the same value of central charge. We argue that the ETH density matrix is close in trace distance to the reduced density matrix of the (micro)canonical ensemble. We support the argument in higher dimensions by comparing the Von Neumann entropy of the ETH density matrix with the entropy of a black hole in holographic systems in the low temperature limit. Finally, we generalize our analysis to the coherent states with energy density that varies slowly in space, and show that locally such states are well described by the ETH density matrix.
Metasurfaces with spatially varying subwavelength structures enable full control of electromagnetic waves over a wide spectrum. High-efficiency metasurfaces, especially in a transmission mode, are of practical significance in optical elements and systems, hitherto their operating frequencies have been expanded down to visible-wavelength ranges. Challenges of developing shorter-wavelength metasurfaces originate from electromagnetic loss caused by strong absorption for most high-refractive-index materials. Here we introduce a large-bandgap semiconductor material-niobium pentoxide (Nb2O5)-to engineer a ultraviolet meta-hologram with a total efficiency of 81% at 355nm wavelength. This meta-hologram modulates the geometric phase of transmitted circular-polarization light via orientation-varying high-aspect-ratio nano-bricks that are elaborately designed to excite antiferromagnetic resonances. We reveal that the induced antiferromagnetic modes maintain one component (e.g., Ex-component) of incident light through even-numbered antiparallel magnetic dipoles (AMDs) but reverse the other component (e.g., Ey-component) via odd-numbered AMDs, thus realizing high-efficiency polarization conversion. Our approach might open the door towards high-performance ultraviolet-light nanophotonics and meta-optics.
We review recent progress in developing effective field theories (EFTs) for non-equilibrium processes at finite temperature, including a new formulation of fluctuating hydrodynamics, and a new proof of the second law of thermodynamics. There are a number of new elements in formulating EFTs for such systems. Firstly, the nature of IR variables is very different from those of a system in equilibrium or near the vacuum. Secondly, while all static properties of an equilibrium system can in principle be extracted from the partition function, there appears no such quantity which can capture all non-equilibrium properties. Thirdly, non-equilibrium processes often involve dissipation, which is notoriously difficult to deal with using an action principle. The purpose of the review is to explain how to address these issues in a pedagogic manner, with fluctuating hydrodynamics as a main example.
Cameron and Erdős asked whether the number of \emph{maximal} sum-free sets in $\{1, \dots , n\}$ is much smaller than the number of sum-free sets. In the same paper they gave a lower bound of $2^{\lfloor n/4 \rfloor }$ for the number of maximal sum-free sets. Here, we prove the following: For each $1\leq i \leq 4$, there is a constant $C_i$ such that, given any $n\equiv i \mod 4$, $\{1, \dots , n\}$ contains $(C_i+o(1)) 2^{n/4}$ maximal sum-free sets. Our proof makes use of container and removal lemmas of Green, a structural result of Deshouillers, Freiman, Sós and Temkin and a recent bound on the number of subsets of integers with small sumset by Green and Morris. We also discuss related results and open problems on the number of maximal sum-free subsets of abelian groups.
In the detection of myeloproliferative, the number of cells in each type of bone marrow cells (BMC) is an important parameter for the evaluation. In this study, we propose a new counting method, which also consists of three modules including localization, segmentation and classification. The localization of BMC is achieved from a color transformation enhanced BMC sample image and stepwise averaging method (SAM). In the nucleus segmentation, both SAM and Otsu's method will be applied to obtain a weighted threshold for segmenting the patch into nucleus and non-nucleus. In the cytoplasm segmentation, a color weakening transformation, an improved region growing method and the K-Means algorithm are used. The connected cells with BMC will be separated by the marker-controlled watershed algorithm. The features will be extracted for the classification after the segmentation. In this study, the BMC are classified using the SVM, Random Forest, Artificial Neural Networks, Adaboost and Bayesian Networks into five classes including one outlier, namely, neutrophilic split granulocyte, neutrophilic stab granulocyte, metarubricyte, mature lymphocytes and the outlier (all other cells not listed). Our experimental results show that the best average recognition rate is 87.49% for the SVM.
Recent works have shown the benefit of integrating Conditional Random Fields (CRFs) models into deep architectures for improving pixel-level prediction tasks. Following this line of research, in this paper we introduce a novel approach for monocular depth estimation. Similarly to previous works, our method employs a continuous CRF to fuse multi-scale information derived from different layers of a front-end Convolutional Neural Network (CNN). Differently from past works, our approach benefits from a structured attention model which automatically regulates the amount of information transferred between corresponding features at different scales. Importantly, the proposed attention model is seamlessly integrated into the CRF, allowing end-to-end training of the entire architecture. Our extensive experimental evaluation demonstrates the effectiveness of the proposed method which is competitive with previous methods on the KITTI benchmark and outperforms the state of the art on the NYU Depth V2 dataset.
For a non-equilibrium physical system defined along a closed time path (CTP), a key constraint is the so-called largest time equation, which is a consequence of unitarity and implies causality. In this paper, we present a simple proof that if the propagators of a non-equilibrium effective action have the proper pole structure, the largest time equation is obeyed to all loop orders. Ghost fields and BRST symmetry are not needed. In particular, the arguments for the proof can also be used to show that if ghost fields are introduced, their contributions vanish.
Given graphs $H_1,\ldots, H_k$, a graph $G$ is $(H_1,\ldots, H_k)$-free if there is a $k$-edge-colouring $ϕ:E(G)\rightarrow [k]$ with no monochromatic copy of $H_i$ with edges of colour $i$ for each $i\in[k]$. Fix a function $f(n)$, the Ramsey-Turán function $\textrm{RT}(n,H_1,\ldots,H_k,f(n))$ is the maximum number of edges in an $n$-vertex $(H_1,\ldots,H_k)$-free graph with independence number at most $f(n)$. We determine $\textrm{RT}(n,K_3,K_s,δn)$ for $s\in\{3,4,5\}$ and sufficiently small $δ$, confirming a conjecture of Erdős and Sós from 1979. It is known that $\textrm{RT}(n,K_8,f(n))$ has a phase transition at $f(n)=Θ(\sqrt{n\log n})$. However, the values of $\textrm{RT}(n,K_8, o(\sqrt{n\log n}))$ was not known. We determined this value by proving $\textrm{RT}(n,K_8,o(\sqrt{n\log n}))=\frac{n^2}{4}+o(n^2)$, answering a question of Balogh, Hu and Simonovits. The proofs utilise, among others, dependent random choice and results from graph packings.