An identity on the 2m2m-th power mean value of the generalized Gauss sums

In this paper, using combinatorial and analytic methods, we prove an exact calculating formula on the $2m$-th power mean value of the generalized quadratic Gauss sums for $m\geq 2$. This solves a conjecture of He and Zhang [`On the $2k$-th power mean value of the generalized quadratic Gauss sums', Bull. Korean Math. Soc. 48 (2011), No.1, 9-15].Comment: 12page

On groups all of whose Haar graphs are Cayley graphs

A Cayley graph of a group $H$ is a finite simple graph $\Gamma$ such that ${\rm Aut}(\Gamma)$ contains a subgroup isomorphic to $H$ acting regularly on $V(\Gamma)$, while a Haar graph of $H$ is a finite simple bipartite graph $\Sigma$ such that ${\rm Aut}(\Sigma)$ contains a subgroup isomorphic to $H$ acting semiregularly on $V(\Sigma)$ and the $H$-orbits are equal to the bipartite sets of $\Sigma$. A Cayley graph is a Haar graph exactly when it is bipartite, but no simple condition is known for a Haar graph to be a Cayley graph. In this paper, we show that the groups $D_6, \, D_8, \, D_{10}$ and $Q_8$ are the only finite inner abelian groups all of whose Haar graphs are Cayley graphs (a group is called inner abelian if it is non-abelian, but all of its proper subgroups are abelian). As an application, it is also shown that every non-solvable group has a Haar graph which is not a Cayley graph.Comment: 17 page

A nonlinear tracking algorithm with range-rate measurements based on unbiased measurement conversion

The three-dimensional CMKF-U with only position measurements is extended to solve the nonlinear tracking problem with range-rate measurements in this paper. A pseudo measurement is constructed by the product of range and range-rate measurements to reduce the high nonlinearity of the range-rate measurements with respect to the target state; then the mean and covariance of the converted measurement errors are derived by the measurement conditioned method, showing better consistency than the transitional nested conditioning method; finally, the sequential filter was used to process the converted position and range-rate measurements sequentially to reduce the approximation error in the second-order EKF. Monte Carlo simulations show that the performance of the new tracking algorithm is better than the traditional one based on CMKF-D

Arc-transitive cyclic and dihedral covers of pentavalent symmetric graphs of order twice a prime

A regular cover of a connected graph is called {\em cyclic} or {\em dihedral} if its transformation group is cyclic or dihedral respectively, and {\em arc-transitive} (or {\em symmetric}) if the fibre-preserving automorphism subgroup acts arc-transitively on the regular cover. In this paper, we give a classification of arc-transitive cyclic and dihedral covers of a connected pentavalent symmetric graph of order twice a prime. All those covers are explicitly constructed as Cayley graphs on some groups, and their full automorphism groups are determined

On cubic symmetric non-Cayley graphs with solvable automorphism groups

It was proved in [Y.-Q. Feng, C. H. Li and J.-X. Zhou, Symmetric cubic graphs with solvable automorphism groups, {\em European J. Combin.} {\bf 45} (2015), 1-11] that a cubic symmetric graph with a solvable automorphism group is either a Cayley graph or a $2$-regular graph of type $2^2$, that is, a graph with no automorphism of order $2$ interchanging two adjacent vertices. In this paper an infinite family of non-Cayley cubic $2$-regular graphs of type $2^2$ with a solvable automorphism group is constructed. The smallest graph in this family has order 6174.Comment: 8 page

On basic graphs of symmetric graphs of valency five

A graph \G is {\em symmetric} or {\em arc-transitive} if its automorphism group \Aut(\G) is transitive on the arc set of the graph, and \G is {\em basic} if \Aut(\G) has no non-trivial normal subgroup $N$ such that the quotient graph \G_N has the same valency with \G. In this paper, we classify symmetric basic graphs of order $2qp^n$ and valency 5, where $q<p$ are two primes and $n$ is a positive integer. It is shown that such a graph is isomorphic to a family of Cayley graphs on dihedral groups of order $2q$ with 5\di (q-1), the complete graph $K_6$ of order $6$, the complete bipartite graph $K_{5,5}$ of order 10, or one of the nine sporadic coset graphs associated with non-abelian simple groups. As an application, connected pentavalent symmetric graphs of order $kp^n$ for some small integers $k$ and $n$ are classified

Solitons and vortices in an evolving Bose-Einstein condensate

Spatiotemporal evolution of a confined Bose-Einstein condensate is studied by numerically integrating the time-dependent Gross-Pitaevskii equation. Self-interference between the successively expanding and reflecting nonlinear matter waves results in spiral atomic density profile, which subsequently degenerates into an embedding structure: The inner part preserves memory of the initial states while the outer part forms a sequence of necklacelike rings. The phase plot reveals a series of discrete concentric belts. The large gradients between adjacent belts indicate that the ring density notches are dark solitons. In the dynamical process, a scenario of vortex-antivortex pairs are spontaneously created and annihilated, whereas the total vorticity keeps invariant.Comment: 4 pages, 4 figure

Exact 3D seismic data reconstruction using Tubal-Alt-Min algorithm

Data missing is an common issue in seismic data, and many methods have been proposed to solve it. In this paper, we present the low-tubal-rank tensor model and a novel tensor completion algorithm to recover 3D seismic data. This is a fast iterative algorithm, called Tubal-Alt-Min which completes our 3D seismic data by exploiting the low-tubal-rank property expressed as the product of two much smaller tensors. TubalAlt-Min alternates between estimating those two tensor using least squares minimization. We evaluate its reconstruction performance both on synthetic seismic data and land data survey. The experimental results show that compared with the tensor nuclear norm minimization algorithm, Tubal-Alt-Min improves the reconstruction error by orders of magnitude

Study of Full Parallel RS(31,27) Encoder for a 3.2 Gbps Serial Transmitter in 0.18 um CMOS Technology

This work presents the design of an RS(31,27) Reed Solomon encoder for a 3.2 Gbps serial transmitter in 0.18 um CMOS technology. The proposed encoder is designed with a novel full parallel structure optimized for high speed and high stability. One data frame contains 2 interleaved RS(31,27) codes and thus it can correct at most 20 bits of consecutive errors. A corresponding decoder is implemented on Xilinx Kintex-7 FPGA

Realization of reliable solid-state quantum memory for photonic polarization-qubit

Faithfully storing an unknown quantum light state is essential to advanced quantum communication and distributed quantum computation applications. The required quantum memory must have high fidelity to improve the performance of a quantum network. Here we report the reversible transfer of photonic polarization states into collective atomic excitation in a compact solid-state device. The quantum memory is based on an atomic frequency comb (AFC) in rare-earth ion doped crystals. We obtain up to 0.998 process fidelity for the storage and retrieval process of single-photon-level coherent pulse. This reliable quantum memory is a crucial step toward quantum networks based on solid-state devices.Comment: Updated version of PRL paper, Bandwidth:100MHz, Efficiency: 20%@50n