Related papers: Algorithms for experimenting with Zariski dense ma…

Sparse polynomial approximation has become indispensable for approximating smooth, high- or infinite-dimensional functions from limited samples. This is a key task in computational science and engineering, e.g., surrogate modelling in…

Motivated by recent works on statistics of matrices over sets of number theoretic interest, we study matrices with entries from arbitrary finite subsets $\mathcal A$ of finite rank multiplicative groups infields of characteristic zero. We…

In the past two decades, some major efforts have been made to reduce exact (e.g. integer, rational, polynomial) linear algebra problems to matrix multiplication in order to provide algorithms with optimal asymptotic complexity. To provide…

Let $ H $ be a subgroup of a finite group $ G $. We say that $ H $ satisfies $ \mathscr L $-$ \Pi $-property in $ G $ if $ | G / K : N _{G / K} (HK/K)| $ is a $ \pi (HK/K) $-number for all maximal $ G $-invariant subgroup $ K $ of $ H^{G}…

We introduce a family of mathematical objects called $\mathcal{P}$-schemes, where $\mathcal{P}$ is a poset of subgroups of a finite group $G$. A $\mathcal{P}$-scheme is a collection of partitions of the right coset spaces $H\backslash G$,…

We present a performant and rigorous algorithm for certifying that a matrix is close to being a projection onto an irreducible subspace of a given group representation. This addresses a problem arising when one seeks solutions to…

We define Lie subalgebras of the group algebra of a finite pseudo-reflection group that are involved in the definition of the Cherednik KZ-systems, and determine their structure. We provide applications for computing the Zariski closure of…

We show that orbit equivalence relations arising from essentially free ergodic probability measure preserving actions of Zariski dense discrete subgroups of simple algebraic groups are strongly prime. As a consequence, we prove the…

We study a form of refined class number formula (resp. type number formula) for maximal orders in totally definite quaternion algebras over real quadratic fields, by taking into consideration the automorphism groups of right ideal classes…

The main result of this article is a refinement of the well-known subgroup separability results of Hall and Scott for free and surface groups. We show that for any finitely generated subgroup, there is a finite dimensional representation of…

We describe a general approach for computing generators for elimination ideals associated with matrix and hypermatrix spectral decomposition constraints. We derive from these generators iterative procedures for approximating the spectral…

Given a Hecke symmetry $R$, one can define a matrix bialgebra $E_R$ and a matrix Hopf algebra $H_R$, which are called function rings on the matrix quantum semi-group and matrix quantum groups associated to $R$. We show that for an even…

Let $G$ be a finitely generated pro-$p$ group of positive rank gradient. Motivated by the study of Hausdorff dimension, we show that finitely generated closed subgroups $H$ of infinite index in $G$ never contain any infinite subgroups $K$…

Let $G$ be a finite almost simple group and let $H$ be a Sylow $p$-subgroup of $G$. As a special case of a theorem of Zenkov, there exist $x,y \in G$ such that $H \cap H^x \cap H^y = 1$. In fact, if $G$ is simple, then a theorem of Mazurov…

We give an algorithm to determine finitely many generators for a subgroup of finite index in the unit group of an integral group ring $\mathbb{Z} G$ of a finite nilpotent group $G$, this provided the rational group algebra $\mathbb{Q} G$…

The following refinement of the Higman embedding theorem is proved: A finitely generated group $R$ is recursively presented if and only if there exists a quasi-isometric malnormal embedding of $R$ into a finitely presented group $H$ such…

The Zariski theorem says that for every hypersurface in a complex projective (resp. affine) space of dimension at least 3 and for every generic plane in the projective (resp. affine) space the natural embedding generates an isomorphism of…

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…

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…

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…