Searcharxiv⌕ Search

arXiv subjects

Jun Hu

Publications and source records attributed to Jun Hu.

At least 163 records · Page 9Linked to original sources

On the center conjecture for the cyclotomic KLR algebras

The center conjecture for the cyclotomic KLR algebras $R_β^Λ$ asserts that the center of $R_β^Λ$ consists of symmetric elements in its KLR $x$ and $e(ν)$ generators. In this paper we show that this conjecture is equivalent to the injectivity of some natural map $\barι_β^{Λ,i}$ from the cocenter of $R_β^Λ$ to the cocenter of $R_β^{Λ+Λ_i}$ for all $i\in I$ and $Λ\in P^+$. We prove that the map $\barι_β^{Λ,i}$ is given by multiplication with a center element $z(i,β)\in R_β^{Λ+Λ_i}$ and we explicitly calculate the element $z(i,β)$ in terms of the KLR $x$ and $e(ν)$ generators. We present an explicit monomial basis for certain bi-weight spaces of the defining ideal of $R_β^Λ$ and of $R_β^Λ$. For $β=\sum_{j=1}^nα_{i_j}$ with $α_{i_1},\cdots, α_{i_n}$ pairwise distinct, we construct an explicit monomial basis of $R_β^Λ$, prove the map $\barι_β^{Λ,i}$ is injective and thus verify the center conjecture for these $R_β^Λ$.

math.RT↗

New conforming finite element divdiv complexes in three dimensions

In this paper, the first family of conforming finite element divdiv complexes on cuboid grids in three dimensions is constructed. Besides, a new family of conforming finite element divdiv complexes with enhanced smoothness on tetrahedral grids is presented. These complexes are exact in the sense that the range of each discrete map is the kernel space of the succeeding one.

math.NA↗

Theoretical analysis of the extended cyclic reduction algorithm

The extended cyclic reduction algorithm developed by Swarztrauber in 1974 was used to solve the block-tridiagonal linear system. The paper fills in the gap of theoretical results concerning the zeros of matrix polynomial $B_{i}^{(r)}$ with respect to a tridiagonal matrix which are computed by Newton's method in the extended cyclic reduction algorithm. Meanwhile, the forward error analysis of the extended cyclic reduction algorithm for solving the block-tridiagonal system is studied. To achieve the two aims, the critical point is to find out that the zeros of matrix polynomial $B_{i}^{(r)}$ are eigenvalues of a principal submatrix of the coefficient matrix.

math.NA↗

Non-neglectable entropy effect on sintering of supported nanoparticles

Sintering refers to particle coalescence by heat, which has been known as a thermal phenomenon involving all aspects of natural science for centuries. It is particularly important in heterogeneous catalysis because normally sintering results in deactivation of the catalysts. In previous studies, the enthalpy contribution was considered to be dominant in sintering and the entropy effect is generally considered neglectable. However, we unambiguously demonstrate in this work that entropy could prevail over the enthalpy contribution to dominate the sintering behavior of supported nanoparticles (NPs) by designed experiments and improved theoretical framework. Using in situ Cs-corrected environmental scanning transmission electron microscopy and synchrotron-based ambient pressure X-ray photoelectron spectroscopy, we observe the unprecedent entropy-driven phenomenon that supported NPs reversibly redisperse upon heating and sinter upon cooling in three systems (Pd-CeO2, Cu-TiO2, Ag-TiO2). We quantitatively show that the configurational entropy of highly dispersed ad-atoms is large enough to reverse their sintering tendency at the elevated temperature. This work reshapes the basic understanding of sintering at the nanoscale and opens the door for various de-novo designs of thermodynamically stable nanocatalysts.

cond-mat.mtrl-sci↗

Partially discontinuous nodal finite elements for $H(\mathrm{curl})$ and $H(\mathrm{div})$

We investigate discretization of $H(\mathrm{curl})$ and $H(\mathrm{div})$ in two and three space dimensions by partially discontinuous nodal finite elements, i.e., vector-valued Lagrange finite elements with discontinuity in certain directions. These spaces can be implemented as a combination of continuous and discontinuous Lagrange elements and fit in de~Rham complexes. We construct well-conditioned nodal bases.

math.NA↗

GRecX: An Efficient and Unified Benchmark for GNN-based Recommendation

In this paper, we present GRecX, an open-source TensorFlow framework for benchmarking GNN-based recommendation models in an efficient and unified way. GRecX consists of core libraries for building GNN-based recommendation benchmarks, as well as the implementations of popular GNN-based recommendation models. The core libraries provide essential components for building efficient and unified benchmarks, including FastMetrics (efficient metrics computation libraries), VectorSearch (efficient similarity search libraries for dense vectors), BatchEval (efficient mini-batch evaluation libraries), and DataManager (unified dataset management libraries). Especially, to provide a unified benchmark for the fair comparison of different complex GNN-based recommendation models, we design a new metric GRMF-X and integrate it into the FastMetrics component. Based on a TensorFlow GNN library tf_geometric, GRecX carefully implements a variety of popular GNN-based recommendation models. We carefully implement these baseline models to reproduce the performance reported in the literature, and our implementations are usually more efficient and friendly. In conclusion, GRecX enables uses to train and benchmark GNN-based recommendation baselines in an efficient and unified way. We conduct experiments with GRecX, and the experimental results show that GRecX allows us to train and benchmark GNN-based recommendation baselines in an efficient and unified way. The source code of GRecX is available at https://github.com/maenzhier/GRecX.

cs.IR↗

Guided Bug Crush: Assist Manual GUI Testing of Android Apps via Hint Moves

Mobile apps are indispensable for people's daily life. Complementing with automated GUI testing, manual testing is the last line of defence for app quality. However, the repeated actions and easily missing of functionalities make manual testing time-consuming and inefficient. Inspired by the game candy crush with flashy candies as hint moves for players, we propose an approach named NaviDroid for navigating testers via highlighted next operations for more effective and efficient testing. Within NaviDroid, we construct an enriched state transition graph with the triggering actions as the edges for two involved states. Based on it, we utilize the dynamic programming algorithm to plan the exploration path, and augment the GUI with visualized hints for testers to quickly explore untested activities and avoid duplicate explorations. The automated experiments demonstrate the high coverage and efficient path planning of NaviDroid and a user study further confirms its usefulness. The NaviDroid can help us develop more robust software that works in more mission-critical settings, not only by performing more thorough testing with the same effort that has been put in before, but also by integrating these techniques into different parts of development pipeline.

cs.SE↗

On the seminormal bases and dual seminormal bases of the cyclotomic Hecke algebras of type $G(\ell,1,n)$

This paper studies the seminormal bases $\{f_{\mathfrak{s}\mathfrak{t}}\}$ and the dual seminormal bases $\{g_{\mathfrak{s}\mathfrak{t}}\}$ of the non-degenerate and the degenerate cyclotomic Hecke algebras ${H}_{\ell,n}$ of type $G(\ell,1,n)$. We present some explicit formulae for the constants $α_{\mathfrak{s}\mathfrak{t}}:=g_{\mathfrak{s}\mathfrak{t}}/f_{\mathfrak{s}\mathfrak{t}}\in K^\times$ in terms of the $γ$-coefficients $\{γ_{\mathfrak{u}}, γ'_{\mathfrak{u}}\}$ of $H_{\ell,n}$. In particular, we answer a question of Mathas on the rationality of square roots of some quotients of products of $γ$-coefficients. We obtain some explicit formulae for the expansion of each seminormal bases of $H_{\ell,n-1}$ as a linear combination of the seminormal bases of $H_{\ell,n}$ under the natural inclusion $H_{\ell,n-1}\hookrightarrow H_{\ell,n}$.

math.RT↗

A unified theory to describe the transition of stable nanobubbles to unstable microbubbles on homogeneous surface

Experiments have not only revealed the remarkably long lifetime of nanobubbles, but also demonstrated the diffusive instability of bubbles above micrometers, thus a full-scale physical understanding on the stability of bubbles is in urgent need. Herein, we develop a model that captures the state transition from the stable nanobubbles to the unstable microbubbles on homogeneous surfaces. The transition explains the typical long lifetime, limited height and small contact angle of surface nanobubbles observed in experiments. The consequent phase diagram shows that the bubble size and gas dissolving saturation determine the dynamic behaviors of surface bubbles, namely growth, stability, shrinkage or dissolution.

cond-mat.soft↗

A Spurious-Free Characteristic Mode Formulation Based on Surface Integral Equation for Patch Antenna Structures

Conventional surface integral equation (SIE)-based characteristic mode formulation for the patch antenna structure with a finite substrate is susceptible to the spurious (nonphysical) modes due to the dielectric part. To avoid the contamination of spurious modes, we propose a novel generalized eigenvalue formulation based on the electric field integral equation coupled Poggio-Miller-Chang-Harrington-Wu-Tsai (EFIE-PMCHWT) equation. In this formulation, the real and imaginary parts of the exterior integral operators are chosen to construct the finalized weighting matrices, to connect radiated power of the characteristic current. Compared with other SIE-based methods, this equation doesn't need additional post-processing since it can effectively avoid spurious modes. Numerical results compared with the volume-surface integral equation (VSIE) are investigated to validate the accuracy.

physics.class-ph↗

Theoretical study on hot-carrier generation, transport and injection in TiN/TiO$_2$ junction

Promoting performance of generation, transport and injection of hot carriers in metal/semiconductor junctions is critical for harvesting energy of hot carriers. However, the injection efficiency of hot carriers in the commonly used noble metals such as Au is extremely low, which hinders the hot carrier-based applications. Here, we predict that the plasmonic material TiN might be promising for generating, transporting and injecting hot carriers, based on first-principles calculations and Monte Carlo simulations. We found that the hot-carrier generation rate in TiN is significantly large compared to Au. The transport property of hot carriers in TiN is excellent, due to the long lifetime and mean free path. The TiN/TiO2 junction possesses very low Schottky barrier, which results in much larger injection efficiency than that in the Au/TiO2 junction. Furthermore, it is revealed that the optimal injection efficiency could be achieved in a core/shell cylindrical TiN/TiO2 junction. Our findings provide an in-depth understanding of hot-carrier generation, transport and injection, and hence are helpful for the development of hot carrier-based devices.

cond-mat.mtrl-sci↗

Contrastive Adaptive Propagation Graph Neural Networks for Efficient Graph Learning

Graph Neural Networks (GNNs) have achieved great success in processing graph data by extracting and propagating structure-aware features. Existing GNN research designs various propagation schemes to guide the aggregation of neighbor information. Recently the field has advanced from local propagation schemes that focus on local neighbors towards extended propagation schemes that can directly deal with extended neighbors consisting of both local and high-order neighbors. Despite the impressive performance, existing approaches are still insufficient to build an efficient and learnable extended propagation scheme that can adaptively adjust the influence of local and high-order neighbors. This paper proposes an efficient yet effective end-to-end framework, namely Contrastive Adaptive Propagation Graph Neural Networks (CAPGNN), to address these issues by combining Personalized PageRank and attention techniques. CAPGNN models the learnable extended propagation scheme with a polynomial of a sparse local affinity matrix, where the polynomial relies on Personalized PageRank to provide superior initial coefficients. In order to adaptively adjust the influence of both local and high-order neighbors, a coefficient-attention model is introduced to learn to adjust the coefficients of the polynomial. In addition, we leverage self-supervised learning techniques and design a negative-free entropy-aware contrastive loss to explicitly take advantage of unlabeled data for training. We implement CAPGNN as two different versions named CAPGCN and CAPGAT, which use static and dynamic sparse local affinity matrices, respectively. Experiments on graph benchmark datasets suggest that CAPGNN can consistently outperform or match state-of-the-art baselines. The source code is publicly available at https://github.com/hujunxianligong/CAPGNN.

cs.LG↗

Ultrafast Active Water Pump Driven by Terahertz Electromagnetic Field

The highly efficient, easy-to-implement, long-ranged and non-destructive way to realize active pumping has been still a great challenge. Here, using molecular dynamics simulations, terahertz electromagnetic wave (TEW) is firstly employed to stimulate an active pump for water transportation by biasedly irradiated in a (6,6) single-walled carbon nanotube (SWCNT) under no external pressure gradient. It is found that an ultrafast conductivity (up to 9.5 /ns) through the pump around a characteristic frequency of 14 THz. The excellent pumping ability is attributed to the resonance coupling between the TEW and water molecules, in which water molecules can gain considerable energy continuously to break the binding of hydrogen bonds and the spatial symmetry. This proposed TEW-driven pump concept will offer a guide in polar molecule transport through artificial or biological nanochannels, particularly in a controllable, non-contact and large-scale process.

cond-mat.mes-hall↗

Graded dimensions and monomial bases for the cyclotomic quiver Hecke superalgebras

In this paper we derive a closed formula for the $(\mathbb{Z}\times\mathbb{Z}_2)$-graded dimension of the cyclotomic quiver Hecke superalgebra $R^Λ(β)$ associated to an {\it arbitrary} Cartan superdatum $(A,P,Π,Π^\vee)$, polynomials $(Q_{i,j}({\rm x}_1,{\rm x}_2))_{i,j\in I}$, $β\in Q_n^+$ and $Λ\in P^+$. As applications, we obtain a necessary and sufficient condition for which $e(ν)\neq 0$ in $R^Λ(β)$. We construct an explicit monomial basis for the bi-weight space $e(\widetildeν)R^Λ(β)e(\widetildeν)$, where $\widetildeν$ is a certain specific $n$-tuple defined in (1.4). In particular, this gives rise to a monomial basis for the cyclotomic odd nilHecke algebra. Finally, we consider the case when $β=α_{1}+α_{2}+\cdots+α_{n}$ with $α_1,\cdots,α_n$ distinct. We construct an explicit monomial basis of $R^Λ(β)$ and show that it is indecomposable in this case.

math.RT↗

BGG category $\mathcal{O}$ and $\mathbb{Z}$-graded representation theory

We give an introduction to the $\mathbb{Z}$-graded representation theory of the BGG category $\mathcal{O}$ of a complex semisimple Lie algebras, with an emphasis on Soergel's combinatorial $\mathbb{V}$ functor, definitions of $\mathbb{Z}$-graded duality functors and definitions of $\mathbb{Z}$-graded translation functors.

math.RT↗

New Discontinuous Galerkin Algorithms and Analysis for Linear Elasticity with Symmetric Stress Tensor

This paper presents a new and unified approach to the derivation and analysis of many existing, as well as new discontinuous Galerkin methods for linear elasticity problems. The analysis is based on a unified discrete formulation for the linear elasticity problem consisting of four discretization variables: strong symmetric stress tensor $\dsig$ and displacement $\du$ inside each element, and the modifications of these two variables $\hsig$ and $\hu$ on elementary boundaries of elements. Motivated by many relevant methods in the literature, this formulation can be used to derive most existing discontinuous, nonconforming and conforming Galerkin methods for linear elasticity problems and especially to develop a number of new discontinuous Galerkin methods. Many special cases of this four-field formulation are proved to be hybridizable and can be reduced to some known hybridizable discontinuous Galerkin, weak Galerkin and local discontinuous Galerkin methods by eliminating one or two of the four fields. As certain stabilization parameter tends to zero, this four-field formulation is proved to converge to some conforming and nonconforming mixed methods for linear elasticity problems. Two families of inf-sup conditions, one known as $H^1$-based and the other known as $H({\rm div})$-based, are proved to be uniformly valid with respect to different choices of discrete spaces and parameters. These inf-sup conditions guarantee the well-posedness of the new proposed methods and also offer a new and unified analysis for many existing methods in the literature as a by-product. Some numerical examples are provided to verify the theoretical analysis including the optimal convergence of the new proposed methods.

math.NA↗

Crystal of affine $\widehat{\mathfrak{sl}}_{\ell}$ and Hecke algebras at a primitive $2\ell$th root of unity

Let $\ell\in\mathbb{N}$ with $\ell>2$ and $I:=\mathbb{Z}/2\ell\mathbb{Z}$. In this paper we give a new realization of the crystal of affine $\widehat{\mathfrak{sl}}_{\ell}$ using the modular representation theory of the affine Hecke algebras $H_n$ of type $A$ and their level two cyclotomic quotients with Hecke parameter being a primitive $2\ell$th root of unity. We realized the Kashiwara operators for the crystal as the functors of taking socle of certain two-steps restriction and of taking head of certain two-steps induction. For any finite dimensional irreducible $H_n$-module $M$, we prove that the irreducible submodules of $\rm{res}_{H_{n-2}}^{H_n}M$ which belong to $\widehat{B}(\infty)$ (Definition 6.1) occur with multiplicity two. The main results generalize the earlier work of Grojnowski and Vazirani on the relations between the crystal of affine $\widehat{\mathfrak{sl}}_{\ell}$ and the affine Hecke algebras of type $A$ at a primitive $\ell$th root of unity.

math.RT↗

Kazhdan-Lusztig left cell preorder and dominance order

Let "$\leq_L$" be the Kazhdan-Lusztig left cell preorder on the symmetric group $S_n$. Let $w\mapsto (P(w),Q(w))$ be the Robinson-Schensted-Knuth correspondence between $S_n$ and the set of standard tableaux with the same shapes. We prove that for any $x,y\in S_n$, $x\leq_L y$ only if $Q(y)\unrhd Q(x)$, where "$\unrhd$" is the dominance (partial) order between standard tableaux. As a byproduct, we generalize an earlier result of Geck by showing that each Kazhdan-Lusztig basis element $C'_w$ can be expressed as a linear combination of some $m_{uv}$ which satisfies that $u\unrhd P(w)^*$, $v\unrhd Q(w)^*$, where $t^*$ denotes the conjugate of $t$ for each standard tableau $t$, $\{m_{st} \mid s,t\in Std(λ),λ\vdash n\}$ is the Murphy basis of the Iwahori-Hecke algebra $H_{v}(S_n)$ associated to $S_n$.

math.RT↗