Polynomiality of certain average weights for oscillating tableaux

We prove that a family of average weights for oscillating tableaux are polynomials in two variables, namely, the length of the oscillating tableau and the size of the ending partition, which generalizes a result of Hopkins and Zhang. Several explicit and asymptotic formulas for the average weights are also derived.Comment: 12 page

Holographic Van der Waals phase transition for a hairy black hole

The Van der Waals(VdW) phase transition in a hairy black hole is investigated by analogizing its charge, temperature, and entropy as the temperature, pressure, and volume in the fluid respectively. The two point correlation function(TCF), which is dual to the geodesic length, is employed to probe this phase transition. We find the phase structure in the temperature$-$geodesic length plane resembles as that in the temperature$-$thermal entropy plane besides the scale of the horizontal coordinate. In addition, we find the equal area law(EAL) for the first order phase transition and critical exponent of the heat capacity for the second order phase transition in the temperature$-$geodesic length plane are consistent with that in temperature$-$thermal entropy plane, which implies that the TCF is a good probe to probe the phase structure of the back hole.Comment: Accepted by Advances in High Energy Physics(The special issue: Applications of the Holographic Duality to Strongly Coupled Quantum Systems

Difference operators for partitions under the Littlewood decomposition

The concept of $t$-difference operator for functions of partitions is introduced to prove a generalization of Stanley's theorem on polynomiality of Plancherel averages of symmetric functions related to contents and hook lengths. Our extension uses a generalization of the notion of Plancherel measure, based on walks in the Young lattice with steps given by the addition of $t$-hooks. It is well-known that the hook lengths of multiples of $t$ can be characterized by the Littlewood decomposition. Our study gives some further information on the contents and hook lengths of other congruence classes modulo $t$.Comment: 24 page

Navigation in a small world with local information

It is commonly known that there exist short paths between vertices in a network showing the small-world effect. Yet vertices, for example, the individuals living in society, usually are not able to find the shortest paths, due to the very serious limit of information. To theoretically study this issue, here the navigation process of launching messages toward designated targets is investigated on a variant of the one-dimensional small-world network (SWN). In the network structure considered, the probability of a shortcut falling between a pair of nodes is proportional to $r^{-\alpha}$, where $r$ is the lattice distance between the nodes. When $\alpha =0$, it reduces to the SWN model with random shortcuts. The system shows the dynamic small-world (SW) effect, which is different from the well-studied static SW effect. We study the effective network diameter, the path length as a function of the lattice distance, and the dynamics. They are controlled by multiple parameters, and we use data collapse to show that the parameters are correlated. The central finding is that, in the one-dimensional network studied, the dynamic SW effect exists for $0\leq \alpha \leq 2$. For each given value of $\alpha$ in this region, the point that the dynamic SW effect arises is $ML^{\prime}\sim 1$, where $M$ is the number of useful shortcuts and $L^{\prime}$ is the average reduced (effective) length of them.Comment: 10 pages, 5 figures, accepted for publication in Physical Review