SearcharxivSearch

arXiv subjects

Ramya Nair

Publications and source records attributed to Ramya Nair.

4 recordsLinked to original sources

On fixed points and stabilizers in solvable Baumslag--Solitar groups

In this article, we study the fixed-point subgroups of the solvable Baumslag-Solitar groups $\BS(1,n)= \langle a, t \mid t a t^{-1} = a^{n} \rangle$, $n>1$ of automorphisms and endomorphisms. We also investigate the stabilizers of subgroups of $\BS(1,n)$, considered as subgroups of the group of automorphisms and submonoids of the monoid of endomorphisms of $\BS(1,n)$. We show that the fixed-point subgroups of automorphisms are either infinite cyclic (in which case, a generator is computable), or they are equal to $\mathbb{Z}\left[\tfrac{1}{n}\right]$, an infinitely generated abelian group. We further prove that the stabilizer subgroup of an element in $\BS(1,n)$ is either a finitely generated abelian group whose rank equals the number of distinct prime divisors of $n$ (and in this case, a finite generating set is computable), or it is $\mathbb{Z}\left[\tfrac{1}{n}\right]$. As a corollary, we show that for all $k \in \mathbb{N}$, every element of $\BS(1,n)$ has a unique $k$-th root. We then proceed to examine the behaviour of fixed-point subgroups and stabilizers under endomorphisms and find similar results. We prove that the fixed point subgroups of endomorphisms are again infinite cyclic or $\mathbb{Z}\left[\tfrac{1}{n}\right]$, but the stabilizer submonoids are always infinitely generated.

math.GR

Essential surfaces in Seifert fiber spaces with singular surfaces

Two-sided incompressible surfaces in Seifert fiber spaces with isolated singular fibers are well-understood. Frohman and Rannard have shown that one-sided incompressible surfaces in Seifert fiber spaces which have isolated singular fibers are either pseudo-horizontal or psuedo-vertical. We extend their result to characterise essential surfaces in Seifert fiber spaces which may have singular surfaces, i.e., in $S^1$-foliated $3$-manifolds which have fibered model neighbourhoods that are isomorphic to either a fibered solid torus or a fibered solid Klein bottle.

math.GT

Prism complexes

A prism is the product space $Δ\times I$ where $Δ$ is a 2-simplex and $I$ is a closed interval. As an analogue of simplicial complexes, we introduce prism complexes and show that every compact $3$-manifold has a prism complex structure. We call a prism complex special if each interior horizontal edge lies in four prisms, each boundary horizontal edge lies in two prisms and no horizontal face lies on the boundary. We give a criteria for existence of horizontal surfaces in (possibly non-orientable) Seifert fiber spaces. Using this we show that a compact 3-manifold admits a special prism complex structure if and only if it is a Seifert fiber space with non-empty boundary, a Seifert fiber space with a non-empty collection of surfaces in its exceptional set or a closed Seifert fiber space with Euler number zero. So in particular, a compact $3$-manifold with boundary is a Seifert fiber space if and only if it has a special prism complex structure.

math.GT

Lighthouse: A User-Centered Web Service for Linear Algebra Software

Various fields of science and engineering rely on linear algebra for large scale data analysis, modeling and simulation, machine learning, and other applied problems. Linear algebra computations often dominate the execution time of such applications. Meanwhile, experts in these domains typically lack the training or time required to develop efficient, high-performance implementations of linear algebra algorithms. In the Lighthouse project, we enable developers with varied backgrounds to readily discover and effectively apply the best available numerical software for their problems. We have developed a search-based expert system that combines expert knowledge, machine learningbased classification of existing numerical software collections, and automated code generation and optimization. Lighthouse provides a novel software engineering environment aimed at maximizing both developer productivity and application performance for dense and sparse linear algebra computations.

cs.MS