Related papers: Zariski Density and Computing in Arithmetic Groups

We show that for a typical high rank arithmetic lattice $\Gamma$, there exist finite index subgroups $\Gamma_{1}$ and $\Gamma_{2}$ such that $\Gamma_{1} \not\simeq \Gamma_{2}$ while $\widehat{\Gamma_{1}} \simeq \widehat{\Gamma_{2}}$. But…

Let $N>1$ be an integer, and let $\Gamma = \Gamma_0 (N) \subset \SL_4 (\Z)$ be the subgroup of matrices with bottom row congruent to $(0,0,0,*)\mod N$. We compute $H^5 (\Gamma; \C) $ for a range of $N$, and compute the action of some Hecke…

We initiate a new, computational approach to a classical problem: certifying non-freeness of ($2$-generator, parabolic) M\"{o}bius subgroups of $\mathrm{SL}(2,\mathbb{Q})$. The main tools used are algorithms for Zariski dense groups and…

Feature selection remains a major challenge in medical prediction, where existing approaches such as LASSO often lack robustness and interpretability. We introduce GRASP, a novel framework that couples Shapley value driven attribution with…

Let $\Gamma$ be a Schottky subgroup of $\mathrm{SL} (2,\mathbb{Z})$. We establish a uniform and explicit lower bound of the second eigenvalue of the Laplace-Beltrami operator of congruence coverings of the hyperbolic surface $\Gamma…

The hidden subgroup problem ($\mathsf{HSP}$) has been attracting much attention in quantum computing, since several well-known quantum algorithms including Shor algorithm can be described in a uniform framework as quantum methods to address…

Given a Zariski-dense, discrete group, $\Gamma$, of isometries acting on $(n + 1)$-dimensional hyperbolic space, we use spectral methods to obtain a sharp asymptotic formula for the growth rate of certain $\Gamma$-orbits. In particular,…

Computing the real solutions to a system of polynomial equations is a challenging problem, particularly verifying that all solutions have been computed. We describe an approach that combines numerical algebraic geometry and sums of squares…

Dense subgraph discovery methods are routinely used in a variety of applications including the identification of a team of skilled individuals for collaboration from a social network. However, when the network's node set is associated with…

The Zariski closure of the central path which interior point algorithms track in convex optimization problems such as linear, quadratic, and semidefinite programs is an algebraic curve. The degree of this curve has been studied in relation…

The problem of finding the densest subgraph in a given graph has several applications in graph mining, particularly in areas like social network analysis, protein and gene analyses etc. Depending on the application, finding dense subgraphs…

Let ${{\bf H}_{\mathbb H}}^n$ denote the $n$-dimensional quaternionic hyperbolic space. The linear group ${\rm{Sp}}(n,1)$ acts by the isometries of ${{\bf H}_{\mathbb H}}^n$. A subgroup $G$ of ${\rm {Sp}}(n,1)$ is called \emph{Zariski…

We announce a database of rigorously computed Maass forms on congruence subgroups $\Gamma_0(N)$ and briefly describe the methods of computation.

We address the problem of classifying complete $\mathbb{C}$-subalgebras of $\mathbb{C}[[t]]$. A discrete invariant for this classification problem is the semigroup of orders of the elements in a given $\mathbb{C}$-subalgebra. Hence we can…

For $\textrm{SL}(n,\mathbb{R})$ ($n\geq3$), $\textrm{SO}(n+1,n)$ ($n\geq2$), $\textrm{Sp}(2n,\mathbb{R})$ ($n\geq2$) and for the adjoint real split form of the exceptional group $\textrm{G}_2$, we exhibit non-uniform lattices in which we…

Let $G$ be a simple algebraic group of exceptional type over an algebraically closed field of characteristic $p \geqslant 0$ which is not algebraic over a finite field. Let $\mathcal{C}_1, \ldots, \mathcal{C}_t$ be non-central conjugacy…

Let $X$ be a scheme of finite type over $\mathbf{Z}$. For $p \in \mathcal{P}$ the set of prime numbers, let $N_{X}(p)$ be the number of $\mathbf{F}_{p}$-points of $X/\mathbf{F}_{p}$. For fixed $n\geq 1$ and $a_{1}, \ldots, a_{n} \in…

The article contains a survey of our results on weakly commensurable arithmetic and general Zariski-dense subgroups, length-commensurable and isospectral locally symmetric spaces and of related problems in the theory of semi-simple agebraic…

We extend classical density theorems of Borel and Dani--Shalom on lattices in semisimple, respectively solvable algebraic groups over local fields to approximate lattices. Our proofs are based on the observation that Zariski closures of…

Let $\Gamma$ be a subgroup of $PSL(2,R)$ generated by three parabolic transformations. The main goal of this paper is to present an algorithm to determine whether or not $\Gamma$ is discrete. Historically discreteness algorithms have been…