Related papers: Algorithms for experimenting with Zariski dense su…
We characterize the effectiveness of a classical algorithm for recovering the Markov graph of a general discrete pairwise graphical model from i.i.d. samples. The algorithm is (appropriately regularized) maximum conditional log-likelihood,…
We give several resolutions of the Steinberg representation St_n for the general linear group over a principal ideal domain, in particular over Z. We compare them, and use these results to prove that the computations in [AGM4] are…
We give a new, simple proof of the trace formula for Hecke operators on modular forms for finite index subgroups of the modular group. The proof uses algebraic properties of certain universal Hecke operators acting on period polynomials of…
Algorithms working with linear algebraic groups often represent them via defining polynomial equations. One can always choose defining equations for an algebraic group to be of the degree at most the degree of the group as an algebraic…
The FLAME methodology makes it possible to derive provably correct algorithms from a formal description of a linear algebra problem. So far, the methodology has been successfully used to automate the derivation of direct algorithms such as…
A framework is developed to describe the Zariski topologies on the prime and primitive spectra of a quantum algebra $A$ in terms of the (known) topologies on strata of these spaces and maps between the collections of closed sets of…
Let G be a connected and reductive algebraic group over an algebraically closed field of characteristic p > 0. An interesting class of representations of G consists of those G-modules having a good filtration -- i.e. a filtration whose…
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…
It is well-known that an element of the linear group ${\rm GL}_n(\C)$ is semisimple if and only if its conjugacy class is Zariski closed. The aim of this paper is to show that the same result holds for the group of complex plane polynomial…
The symmetries described by Pin groups are the result of combining a finite number of discrete reflections in (hyper)planes. The current work shows how an analysis using geometric algebra provides a picture complementary to that of the…
In this paper, we investigate the computational complexity of isomorphism testing for finite groups and quasigroups, given by their multiplication tables. We crucially take advantage of their various decompositions to show the following: -…
Let $G$ be a connected, absolutely almost simple, algebraic group defined over a finitely generated, infinite field $K$, and let $\Gamma$ be a Zariski dense subgroup of $G(K)$. We show, apart from some few exceptions, that the…
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…
We present two approaches that can be used to compute modular forms on noncongruence subgroups. The first approach uses Hejhal's method for which we improve the arbitrary precision solving techniques so that the algorithm becomes about up…
In this paper we are interested in the fine-grained complexity of deciding whether there is a homomorphism from an input graph $G$ to a fixed graph $H$ (the $H$-Coloring problem). The starting point is that these problems can be viewed as…
We construct motivic $\ell$-adic representations of $\GQ$ into exceptional groups of type $E_7,E_8$ and $G_2$ whose image is Zariski dense. This answers a question of Serre. The construction is uniform for these groups and uses the…
In this paper we develop a method to transfer density results for primitive automatic sequences to logarithmic-density results for general automatic sequences. As an application we show that the logarithmic densities of any automatic…
We present a new technique to efficiently sample and communicate a large number of elements from a distributed sampling space. When used in the context of a recent LOCAL algorithm for $(\operatorname{degree}+1)$-list-coloring (D1LC), this…
We show that a surface group contained in a reductive real algebraic group can be deformed to become Zariski dense, unless its Zariski closure acts transitively on a Hermitian symmetric space of tube type. This is a kind of converse to a…
We study the recently introduced problem of finding dense common subgraphs: Given a sequence of graphs that share the same vertex set, the goal is to find a subset of vertices $S$ that maximizes some aggregate measure of the density of the…