arXiv subjects
Publications and source records attributed to Lei Zhao.
We initiate and develop the theory of finite $W$-superalgebras $\mathcal{W}_χ$ associated to the queer Lie superalgebra $\g=\q(N)$ and a nilpotent linear functional $χ\in \ev\g^*$. We show that the definition of the $W$-superalgebra is independent of various choices. We also establish a Skryabin type equivalence between the category of $\mathcal{W}_χ$-modules and a category of certain $\g$-modules.
We consider the setting where actions can be used to modify a state sequence before compression. The minimum rate needed to losslessly describe the optimal modified sequence is characterized when the state sequence is either non-causally or causally available at the action encoder. The achievability is closely related to the optimal channel coding strategy for channel with states. We also extend the analysis to the the lossy case.
We explore a basic noise-free signaling scenario where coordination and communication are naturally merged. A random signal X_1,...,X_n is processed to produce a control signal or action sequence A_1,...,A_n, which is observed and further processed (without access to X_1,...,X_n) to produce a third sequence B_1,...,B_n. The object of interest is the set of empirical joint distributions p(x,a,b) that can be achieved in this setting. We show that H(A) >= I(X;A,B) is the necessary and sufficient condition for achieving p(x,a,b) when no causality constraints are enforced on the encoders. We also give results for various causality constraints. This setting sheds light on the embedding of digital information in analog signals, a concept that is exploited in digital watermarking, steganography, cooperative communication, and strategic play in team games such as bridge.
The modular representation theory of the queer Lie superalgebra q(n) over characteristic p>2 is developed. We obtain a criterion for the irreducibility of baby Verma modules with semisimple p-characters and a criterion for the semisimplicity of the corresponding reduced enveloping algebras. A (2p)-power divisibility of dimensions of q(n)-modules with nilpotent p-characters is established. The representation theory of q(2) is treated in detail. We formulate a Morita super-equivalence conjecture for q(n) with general p-characters which is verified for n=2.
In this exposition, we show that a Hamiltonian is always constant on a compact invariant connected subset which lies in a Lagrangian graph provided that the Hamiltonian and the graph are smooth enough. We also provide some counterexamples for the case that the Hamiltonians are not smooth enough.
For a restricted Lie superalgebra g over an algebraically closed field of characteristic p > 2, we generalize the deformation method of Premet and Skryabin to obtain results on the p-power and 2-power divisibility of dimensions of g-modules. In particular, we give a new proof of the Super Kac-Weisfeiler conjecture for basic classical Lie superalgebras. The new proof allows us to improve optimally the assumption on p. We also establish a semisimplicity criterion for the reduced enveloping superalgebras associated with semisimple p-characters for all basic classical Lie superalgebras using the technique of odd reflections.
We establish a random variable substitution lemma and use it to investigate the role of refinement layer in multiple description coding, which clarifies the relationship among several existing achievable multiple description rate-distortion regions. Specifically, it is shown that the El Gamal-Cover (EGC) region is equivalent to the EGC* region (an antecedent version of the EGC region) while the Venkataramani-Kramer-Goyal (VKG) region (when specialized to the 2-description case) is equivalent to the Zhang-Berger (ZB) region. Moreover, we prove that for multiple description coding with individual and hierarchical distortion constraints, the number of layers in the VKG scheme can be significantly reduced when only certain weighted sum rates are concerned. The role of refinement layer in scalable coding (a special case of multiple description coding) is also studied.
In this paper, we study the zero-error capacity for finite state channels with feedback when channel state information is known to both the transmitter and the receiver. We prove that the zero-error capacity in this case can be obtained through the solution of a dynamic programming problem. Each iteration of the dynamic programming provides lower and upper bounds on the zero-error capacity, and in the limit, the lower bound coincides with the zero-error feedback capacity. Furthermore, a sufficient condition for solving the dynamic programming problem is provided through a fixed-point equation. Analytical solutions for several examples are provided.
For a type I basic classical Lie superalgebra $\mathfrak{g}=\mathfrak{g}_{\bar{0}} \oplus \mathfrak{g}_{\bar{1}}$, we establish an equivalence between typical blocks of categories of $U_χ(\mathfrak{g})$-modules and $U_χ(mathfrak{g}_{\bar{0})$-modules. We then deduce various consequences from the equivalence.
We initiate the representation theory of restricted Lie superalgebras over an algebraically closed field of characteristic p>2. A superalgebra generalization of the celebrated Kac-Weisfeiler Conjecture is formulated, which exhibits a mixture of p-power and 2-power divisibilities of dimensions of modules. We establish the Conjecture for basic classical Lie superalgebras.