Related papers: Genericity, the Arzhantseva-Ol'shanskii method and…

Let $G$ be a simple algebraic group over an algebraically closed field and let $X$ be an irreducible subvariety of $G^r$ with $r \geqslant 2$. In this paper, we consider the general problem of determining if there exists a tuple $(x_1,…

In the 80's Aschbacher classified the maximal subgroups of almost all of the finite almost simple classical groups. Essentially, this classification divide these subgroups into two types. The first of these consist roughly of subgroups that…

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…

Tkachenko and Yaschenko [34] characterized the abelian groups G such that all proper unconditionally closed subsets of G are finite, these are precisely the abelian groups G having cofinite Zariski topology (they proved that such a G is…

Let $X$ be an Abelian group of the form $X=\mathbb{R}^m\times K\times D$, where $m\geq 0$, $K$ is a compact totally disconnected group of the special form, $D$ is a discrete group. Let $\xi_i, i=1,2,...,n,n\geq 2,$ be independent random…

This is the first in a planned series of papers giving an alternate approach to Zlil Sela's work on the Tarski problems. The present paper is an exposition of work of Kharlampovich-Myasnikov and Sela giving a parametrization of Hom(G,F)…

The Addition Theorem for the algebraic entropy of group endomorphisms of torsion abelian groups was proved by Dikranjan, Goldsmith, Salce and Zanardo. It was later extended by Shlossberg to torsion nilpotent groups of class 2. As our main…

We consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G and H are isomorphic. The n^(log n) barrier for group isomorphism has withstood all attacks --- even for the…

A group homomorphism $i: H \to G$ is a localization of $H$ if for every homomorphism $\varphi: H\rightarrow G$ there exists a unique endomorphism $\psi: G\rightarrow G$, such that $i \psi=\varphi$ (maps are acting on the right). G\"{o}bel…

The classical Khintchine-Groshev theorem is a generalization of Khintchine's theorem on simultaneous Diophantine approximation, from approximation of points in $\mathbb R^m$ to approximation of systems of linear forms in $\mathbb R^{nm}$.…

We study the isomorphism problem for random hypergraphs. We show that it is solvable in polynomial time for the binomial random $k$-uniform hypergraph $H_{n,p;k}$, for a wide range of $p$. We also show that it is solvable w.h.p. for random…

The state-of-the-art solvers for the graph isomorphism problem can readily solve generic instances with tens of thousands of vertices. Indeed, experiments show that on inputs without particular combinatorial structure the algorithms scale…

We generalize and strengthen the theorem of Gromov that every compact Riemannian manifold of diameter at most D has a set of generators g_1,...,g_k of length at most 2D and relators of the form g_ig_m = g_j . In particular, we obtain an…

Using the theory of group action, we first introduce the concept of the automorphism group of an exponential family or a graphical model, thus formalizing the general notion of symmetry of a probabilistic model. This automorphism group…

Let $\mathcal{T}$ denote the class of finitely generated torsion-free nilpotent groups. For a group $G$ let $F(G)$ be the set of isomorphism classes of finite quotients of $G$. Pickel proved that if $G \in \mathcal{T}$, then the set…

In various occasions the conjugacy problem in finitely generated amalgamated products and HNN extensions can be decided efficiently for elements which cannot be conjugated into the base groups. This observation asks for a bound on how many…

We give a simple algorithm to solve the subgroup membership problem for virtually free groups. For a fixed virtually free group with a fixed generating set $X$, the subgroup membership problem is uniformly solvable in time $O(n\log^*(n))$…

Call a monomial ideal M "generic" if no variable appears with the same nonzero exponent in two distinct monomial generators. Using a convex polytope first studied by Scarf, we obtain a minimal free resolution of M. Any monomial ideal M can…

In this paper we formulate and study the problem of representing groups on graphs. We show that with respect to polynomial time turing reducibility, both abelian and solvable group representability are all equivalent to graph isomorphism,…

We give a proof of Kontsevich's formality theorem for a general manifold using Fedosov resolutions of algebras of polydifferential operators and polyvector fields. The main advantage of our construction of the formality quasi-isomorphism is…