相关论文: Algorithms for experimenting with Zariski dense ma…

A generalization of recent group-theoretic matrix multiplication algorithms to an analogue of the theory of partial matrix multiplication is presented. We demonstrate that the added flexibility of this approach can in some cases improve…

We consider the problem of finding a dense submatrix of a matrix with i.i.d. Gaussian entries, where density is measured by average value. This problem arose from practical applications in biology and social sciences…

We study the general problem of extremality for metric Diophantine approximation on submanifolds of matrices. We formulate a criterion for extremality in terms of a certain family of algebraic obstructions and show that it is sharp. In…

We obtain new uniform bounds for the symmetric tensor rank of multiplication in finite extensions of any finite field Fp or Fp2 where p denotes a prime number greater or equal than 5. In this aim, we use the symmetric Chudnovsky-type…

Let $K$ be a number field, and let $G\subset K^\times$ be a finitely generated subgroup. Fix some prime number $\ell$, and consider the set of primes $\mathfrak{p}$ of $K$ satisfying the following property: the reduction of $G$ modulo…

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…

We show that real semi-simple Lie groups of higher rank contain (infinitely generated) discrete subgroups with full limit sets in the corresponding Furstenberg boundaries. Additionally, we provide criteria under which discrete subgroups of…

We develop methods for computing with matrix groups defined over a range of infinite domains, and apply those methods to the design of algorithms for nilpotent groups. In particular, we provide a practical algorithm to test nilpotency of…

We consider three families of groups: the Bianchi groups SL(2,O) where O is the ring of integers of an imaginary, quadratic field; the groups SL*(2,O) where O is a *-order of a definite, rational quaternion algebra with an orthogonal…

For odd $n$ we construct a path $\rho_t\colon \pi_1(S) \to SL(n,\mathbb{R})$ of discrete, faithful and Zariski dense representations of a surface group such that $\rho_t(\pi_1(S)) \subset SL(n,\mathbb{Q})$ for every $t\in \mathbb{Q}$.

Preface (A.Vershik) - about these texts (3.); I.Interpolation between inductive and projective limits of finite groups with applicatons to linear groups over finite fields; II.The characters of the groups of almost triangle matrices over…

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…

Let $G$ be a simple algebraic group over an algebraically closed field of characteristic $p>0$ and suppose that $p$ is a very good prime for $G$. We prove that any maximal Lie subalgebra $M$ of $\mathfrak{g} = {\rm Lie}(G)$ with ${\rm…

This note provides new criteria on a unimodular group $G$ and a discrete series representation $(\pi, \mathcal{H}_{\pi})$ of formal degree $d_{\pi} > 0$ under which any lattice $\Gamma \leq G$ with $\text{vol}(G/\Gamma) d_{\pi} \leq 1$…

We give an overview of the Hidden Subgroup Problem (HSP) as of July 2010, including new results discovered since the survey of arXiv:quant-ph/0411037v1. We recall how the problem provides a framework for efficient quantum algorithms and…

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…

We develop a probabilistic algorithm of Kronecker type for computing a Kronecker representation of a zero-dimensional linear section of an algebraic variety $V$ defined over a perfect field $k$. The variety $V$ is the Zariski closure of the…

In this paper, we describe an algorithm that efficiently collect relations in class groups of number fields defined by a small defining polynomial. This conditional improvement consists in testing directly the smoothness of principal ideals…

The distribution of $\alpha p$ modulo one, where $p$ runs over the rational primes and $\alpha$ is a fixed irrational real, has received a lot of attention. It is natural to ask for which exponents $\nu>0$ one can establish the infinitude…

We explore the thinness of hypergeometric groups of type $\mathrm{Sp}(4)$ and $\mathrm{Sp}(6)$ by applying a new approach of computer-assisted ping pong. We prove the thinness of $17$ hypergeometric groups with maximally unipotent monodromy…