Algebraicity of critical values of adjoint L-functions for $$\mathrm{GSp}_4$$

The Ramanujan Journal - We prove an algebraicity result for certain critical value of adjoint L-functions for $$\mathrm{GSp}_4$$ over a totally real number field in terms of the Petersson norm of...     

Exterior square gamma factors for cuspidal representations of $$\mathrm {GL}_n$$ GL n : simple supercuspidal representations

We compute the local twisted exterior square gamma factors for simple supercuspidal representations, using which we prove a local converse theorem for simple supercuspidal representations.

     

Gamma factors of certain supercuspidal representations

A -factor defined by the doubling method is calculated for certain supercuspidal representations. The result is a sum over a finite group of Lie type, which may be called a non-abelian Gauss sum. It is the sum of the product of a cuspidal character and an Igusa zeta integral. In some cases, we show that our result agrees with what is expected by the local Langlands conjecture. Received: 11 July 1999 / Accepted: 29 December 1999 / Published online: 28 June 2000     

Maximum distance separable codes over {\mathbb{Z}_4} and {\mathbb{Z}_2 \times \mathbb{Z}_4}

Known upper bounds on the minimum distance of codes over rings are applied to the case of ${\mathbb Z_{2}\mathbb Z_{4}}$ -additive codes, that is subgroups of ${\mathbb Z_{2}^{\alpha}\mathbb Z_{4}^{\beta}}$ . Two kinds of maximum distance separable codes are studied. We determine all possible parameters of these codes and characterize the codes in certain cases. The main results are also valid when ?? = 0, namely for quaternary linear codes.     

Local theta correspondences between epipelagic supercuspidal representations

In this paper we study the local theta correspondences between epipelagic supercupsidal representations of a type I classical dual pair \((G,G')\) over p-adic fields. We show that, besides an exceptional case, an epipelagic supercupsidal representation \(\pi \) of \({\widetilde{G}}\) lifts to an epipelagic supercupsidal representation \(\pi '\) of \({\widetilde{G}}'\) if and only if the epipelagic data of \(\pi \) and \(\pi '\) are related by the moment maps.     

Some results on linear codes over the ring $$\mathbb {Z}_4+u\mathbb {Z}_4+v\mathbb {Z}_4+uv\mathbb {Z}_4$$

In this paper, we mainly study the theory of linear codes over the ring \(R =\mathbb {Z}_4+u\mathbb {Z}_4+v\mathbb {Z}_4+uv\mathbb {Z}_4\). By using the Chinese Remainder Theorem, we prove that R is isomorphic to a direct sum of four rings. We define a Gray map \(\Phi \) from \(R^{n}\) to \(\mathbb {Z}_4^{4n}\), which is a distance preserving map. The Gray image of a cyclic code over R is a linear code over \(\mathbb {Z}_4\). We also discuss some properties of MDS codes over R. Furthermore, we study the MacWilliams identities of linear codes over R and give the generator polynomials of cyclic codes over R.     

\mathbb{Z }_2\mathbb{Z }_4-Additive formally self-dual codes

We study odd and even \(\mathbb{Z }_2\mathbb{Z }_4\) formally self-dual codes. The images of these codes are binary codes whose weight enumerators are that of a formally self-dual code but may not be linear. Three constructions are given for formally self-dual codes and existence theorems are given for codes of each type defined in the paper.     

Isometric embeddings of \mathbb{Z}_{p^k} in the Hamming space \mathbb{F}_{p}^{N} and \mathbb{Z}_{p^k}-linear codes

Isometric embeddings of $\mathbb{Z}_{p^n+1}$ into the Hamming space ( $\mathbb{F}_{p}^{p^n},w$ ) have played a fundamental role in recent constructions of non-linear codes. The codes thus obtained are very good codes, but their rate is limited by the rate of the first-order generalized Reed–Muller code—hence, when n is not very small, these embeddings lead to the construction of low-rate codes. A natural question is whether there are embeddings with higher rates than the known ones. In this paper, we provide a partial answer to this question by establishing a lower bound on the order of a symmetry of ( $\mathbb{F}_{p}^{N},w$ ).     

$$ H^{p}_{w} - L^{p}_{w} $$ Boundedness of Marcinkiewicz Integral

The Marcinkiewicz integral is essentially a Littlewood-Paley g-function, which plays a very important role in harmonic analysis. In this paper we give weaker smoothness conditions assumed on Ω to imply the boundedness of the Marcinkiewicz integral operator μ_Ω, where w belongs to the Muckenhoupt weight class.     

Cyclic Codes Over\mathbb{Z}_{4} of Even Length

We determine the structure of cyclic codes over for arbitrary even length giving the generator polynomial for these codes. We determine the number of cyclic codes for a given length. We describe the duals of the cyclic codes, describe the form of cyclic codes that are self-dual and give the number of these codes. We end by examining specific cases of cyclic codes, giving all cyclic self-dual codes of length less than or equal to 14. San Ling - The research of the second named author is partially supported by research Grants MOE-ARF R-146-000-029-112 and DSTA R-394-000-011-422.     

$${\mathbb{Z}_2\mathbb{Z}_4}$$-linear codes: rank and kernel

A code C{{\mathcal C}} is \mathbbZ₂\mathbbZ₄{{\mathbb{Z}_2\mathbb{Z}_4}}-additive if the set of coordinates can be partitioned into two subsets X and Y such that the punctured code of C{{\mathcal C}} by deleting the coordinates outside X (respectively, Y) is a binary linear code (respectively, a quaternary linear code). The corresponding binary codes of \mathbbZ₂\mathbbZ₄{{\mathbb{Z}_2\mathbb{Z}_4}}-additive codes under an extended Gray map are called \mathbbZ₂\mathbbZ₄{{\mathbb{Z}_2\mathbb{Z}_4}}-linear codes. In this paper, the invariants for \mathbbZ₂\mathbbZ₄{{\mathbb{Z}_2\mathbb{Z}_4}}-linear codes, the rank and dimension of the kernel, are studied. Specifically, given the algebraic parameters of \mathbbZ₂\mathbbZ₄{{\mathbb{Z}_2\mathbb{Z}_4}}-linear codes, the possible values of these two invariants, giving lower and upper bounds, are established. For each possible rank r between these bounds, the construction of a \mathbbZ₂\mathbbZ₄{{\mathbb{Z}_2\mathbb{Z}_4}}-linear code with rank r is given. Equivalently, for each possible dimension of the kernel k, the construction of a \mathbbZ₂\mathbbZ₄{{\mathbb{Z}_2\mathbb{Z}_4}}-linear code with dimension of the kernel k is given. Finally, the bounds on the rank, once the kernel dimension is fixed, are established and the construction of a \mathbbZ₂\mathbbZ₄{{\mathbb{Z}_2\mathbb{Z}_4}}-linear code for each possible pair (r, k) is given.     

On Projective Modules in Category \mathcal{O}_{int} of Quantum \mathfrak{sl}_{2}

The restriction of a Verma module of ${\bf U}(\mathfrak{sl}_3)$ to ${\bf U}(\mathfrak{sl}_2)$ is isomorphic to a Verma module tensoring with all the finite dimensional simple modules of ${\bf U}(\mathfrak{sl}_2)$ . The canonical basis of the Verma module is compatible with such a decomposition. An explicit decomposition of the tensor product of the Verma module of highest weight 0 with a finite dimensional simple module into indecomposable projective modules in the category $\mathcal O_{\rm{int}}$ of quantum $\mathfrak{sl}_2$ is given.     

Local solvability on {\mathbb{H}_1}: non-homogeneous operators

Local solvability and non-solvability are classified for left-invariant differential operators on the Heisenberg group ${\mathbb{H}_1}$ of the form L?=?P _n (X, Y)?+?Q(X, Y) where the P _n are certain homogeneous polynomials of order n?≥ 2 and Q is of lower order with ${X=\partial_x,\,Y=\partial_y+x\partial_w}$ on ${\mathbb{R}^3}$ . We extend previous studies of operators of the form P _n (X, Y) via representations involving ordinary differential operators with a parameter.     

On codes over $$\mathbb {F}_{q}+v\mathbb {F}_{q}+v^{2}\mathbb {F}_{q}$$

In this paper we investigate linear codes with complementary dual (LCD) codes and formally self-dual codes over the ring \(R=\mathbb {F}_{q}+v\mathbb {F}_{q}+v^{2}\mathbb {F}_{q}\), where \(v^{3}=v\), for q odd. We give conditions on the existence of LCD codes and present construction of formally self-dual codes over R. Further, we give bounds on the minimum distance of LCD codes over \(\mathbb {F}_q\) and extend these to codes over R.     

Conservative fragments of {{S}^{1}_{2}} and {{R}^{1}_{2}}

Conservative subtheories of ${{R}^{1}_{2}}$ and ${{S}^{1}_{2}}$ are presented. For ${{S}^{1}_{2}}$ , a slight tightening of Je?ábek??s result (Math Logic Q 52(6):613?C624, 2006) that ${T^{0}_{2} \preceq_{\forall \Sigma^{b}_{1}}S^{1}_{2}}$ is presented: It is shown that ${T^{0}_{2}}$ can be axiomatised as BASIC together with induction on sharply bounded formulas of one alternation. Within this ${\forall\Sigma^{b}_{1}}$ -theory, we define a ${\forall\Sigma^{b}_{0}}$ -theory, ${T^{-1}_{2}}$ , for the ${\forall\Sigma^{b}_{0}}$ -consequences of ${S^{1}_{2}}$ . We show ${T^{-1}_{2}}$ is weak by showing it cannot ${\Sigma^{b}_{0}}$ -define division by 3. We then consider what would be the analogous ${\forall\hat\Sigma^{b}_{1}}$ -conservative subtheory of ${R^{1}_{2}}$ based on Pollett (Ann Pure Appl Logic 100:189?C245, 1999. It is shown that this theory, ${{T}^{0,\left\{2^{(||\dot{id}||)}\right\}}_{2}}$ , also cannot ${\Sigma^{b}_{0}}$ -define division by 3. On the other hand, we show that ${{S}^{0}_{2}+open_{\{||id||\}}}$ -COMP is a ${\forall\hat\Sigma^{b}_{1}}$ -conservative subtheory of ${R^{1}_{2}}$ . Finally, we give a refinement of Johannsen and Pollett (Logic Colloquium?? 98, 262?C279, 2000) and show that ${\hat{C}^{0}_{2}}$ is ${\forall\hat\Sigma^{b}_{1}}$ -conservative over a theory based on open _cl-comprehension.