Related papers: Experimenting with symplectic hypergeometric monod…

A computation shows that there are 77 (up to scalar shifts) possible pairs of integer coefficient polynomials of degree five, having roots of unity as their roots, and satisfying the conditions of Beukers and Heckman [1], so that the…

We describe an algorithm for determining the algebraic subgroup of GL(n,C) that is defined as the closure of the group generated by a finite number of elements of GL(n,C). The algorithm avoids the use of Groebner bases and can be used on…

The polynomial method has been used recently to obtain many striking results in combinatorial geometry. In this paper, we use affine Hilbert functions to obtain an estimation theorem in finite field geometry. The most natural way to state…

We compute the first two symplectic quadratic K-theory groups of the integers, or equivalently, the first two stable homology groups of the group of symplectic integral matrices preserving the standard quadratic refinement. The main novelty…

The variations of Hodge structures of weight one associated to square-tiled surfaces naturally generate interesting subgroups of integral symplectic matrices called Kontsevich--Zorich monodromies. In this paper, we show that arithmetic…

We compute the Zariski closure of the Kontsevich-Zorich monodromy groups arising from certain square tiled surfaces that are geometrically motivated. Specifically we consider three surfaces that emerge as translation covers of platonic…

We investigate for which linear-algebraic groups (over the complex numbers or any local field) there exists subgroups which are dense in the Zariski topology, but discrete in the Hausdorff topology. For instance, such subgroups exist for…

We introduce the first provably efficient algorithm to check if a finitely generated subgroup of an almost simple semi-simple group over the rationals is Zariski-dense. We reduce this question to one of computing Galois groups, and to this…

This document is an expanded version of a lecture presented at a conference on "Thin Groups and Superstrong Approximation" held at the Mathematical Sciences Research Institute in February 2012. Superstrong approximation is a criterion on a…

Using generating functions, we enumerate regular semisimple conjugacy classes in the finite classical groups. For the general linear, unitary, and symplectic groups this gives a different approach to known results; for the special…

We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group $G$ is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of $G$. We also provide a…

We prove arithmeticity for two degree-six symplectic hypergeometric monodromy groups, called C-47, and C-55 in the paper \cite{BajpaiDonaNitsche2025Thin} by Bajpai-Dona-Nitsche. This settles two of the three remaining cases, whose…

We announce results about the structure and arithmeticity of all possible lattice embeddings of a class of countable groups which encompasses all linear groups with simple Zariski closure, all groups with non-vanishing first l2-Betti…

We find a recursive algorithm for computing the precise centralizers of the complex orthogonal and symplectic groups, and hence the isotropy groups, with respect to the similarity transformation on the spaces of skew-symmetric and…

Let $\mathrm{R}$ be a real closed field and $\mathrm{C}$ the algebraic closure of $\mathrm{R}$. We give an algorithm for computing a semi-algebraic basis for the first homology group, $\mathrm{H}_1(S,\mathbb{F})$, with coefficients in a…

The mapping class group of a closed surface of genus $g$ is an extension of the Torelli group by the symplectic group. This leads to two natural problems: (a) compute (stably) the symplectic decomposition of the lower central series of the…

In this paper, the complete algebraic structure of finite semisimple group algebra of a normally monomial group is described. The main result is illustrated by computing the explicit Wedderburn decomposition of finite semisimple group…

We give conditions under which the monodromy group of an $A$-hypergeometric system is invariant under modifications of the collection of characters $A$. The key ingredient is a Zariski--Lefschetz type theorem for principal $A$-determinants.

We present recursive formulas which compute the recently defined "higher symplectic capacities" for all convex toric domains. In the special case of four-dimensional ellipsoids, we apply homological perturbation theory to the associated…

In this article, we study geometric aspects of semi-arithmetic Riemann surfaces by means of number theory and hyperbolic geometry. First, we show the existence of infinitely many semi-arithmetic Riemann surfaces of various shapes and prove…