SearcharxivSearch

arXiv subjects

Srimathy Srinivasan

Publications and source records attributed to Srimathy Srinivasan.

4 recordsLinked to original sources

A finiteness theorem for special unitary groups of quaternionic skew-hermitian forms with good reduction

Given a field $K$ equipped with a set of discrete valuations $V$, we develop a general theory to relate reduction properties of skew-hermitian forms over a quaternion $K$-algebra $Q$ to quadratic forms over the function field $K(Q)$ obtained via Morita equivalence. Using this we show that if $(K,V)$ satisfies certain conditions, then the number of $K$-isomorphism classes of the universal coverings of the special unitary groups of quaternionic skew-hermitian forms that have good reduction at all valuations in $V$ is finite and bounded by a value that depends on size of a quotient of the Picard group of $V$ and the size of the kernel and cokernel of residue maps in Galois cohomology of $K$ with finite coefficients. As a corollary we prove a conjecture of Chernousov, Rapinchuk, Rapinchuk for groups of this type.

math.AG

Motivic Decomposition of Projective Pseudo-homogeneous Varieties

Let $G$ be a semi-simple algebraic group over a perfect field $k$. A lot of progress has been made recently in computing the Chow motives of projective $G$-homogenous varieties. When $k$ has positive characteristic, a broader class of $G$-homogeneous varieties appear. These are varieties over which $G$ acts transitively with possibly non-reduced isotropy subgroup. In this paper we study these varieties which we call ${\it \mbox{projective pseudo-homogeneous varieties}}$ for $G$ inner type over $k$ and prove that their motives satisfy Rost nilpotence. We also find their motivic decompositions and relate them to the motives of corresponding homogeneous varieties.

math.AG

Codes on Planar Graphs

Codes defined on graphs and their properties have been subjects of intense recent research. On the practical side, constructions for capacity-approaching codes are graphical. On the theoretical side, codes on graphs provide several intriguing problems in the intersection of coding theory and graph theory. In this paper, we study codes defined by planar Tanner graphs. We derive an upper bound on minimum distance $d$ of such codes as a function of the code rate $R$ for $R \ge 5/8$. The bound is given by $$d\le \lceil \frac{7-8R}{2(2R-1)} \rceil + 3\le 7.$$ Among the interesting conclusions of this result are the following: (1) planar graphs do not support asymptotically good codes, and (2) finite-length, high-rate codes on graphs with high minimum distance will necessarily be non-planar.

cs.IT