Related papers: Testability in group theory

Understanding statistical inference under possibly non-sparse high-dimensional models has gained much interest recently. For a given component of the regression coefficient, we show that the difficulty of the problem depends on the sparsity…

This paper introduces two new families of non-parametric tests of goodness-of-fit on the compact classical groups. One of them is a family of tests for the eigenvalue distribution induced by the uniform distribution, which is consistent…

Testing whether a probability distribution is compatible with a given Bayesian network is a fundamental task in the field of causal inference, where Bayesian networks model causal relations. Here we consider the class of causal structures…

We develop anytime-valid tests of invariance under the action of compact groups. The resulting test statistics are optimal in a logarithmic-growth sense. We apply our method to extend recent anytime-valid tests of independence and to…

Let $\Gamma_G$ denote a graph associated with a group $G$. A compelling question about finite groups asks whether or not a finite group $H$ must be nilpotent provided $\Gamma_H$ is isomorphic to $\Gamma_G$ for a finite nilpotent group $G$.…

We study the irreducibility and Galois group of random polynomials over function fields. We prove that a random polynomial $f=y^n+\sum_{i=0}^{n-1}a_i(x)y^i\in\mathbb F_q[x][y]$ with i.i.d coefficients $a_i$ taking values in the set…

Hyperfiniteness or amenability of measurable equivalence relations and group actions has been studied for almost fifty years. Recently, unexpected applications of hyperfiniteness were found in computer science in the context of testability…

We single out a large class of groups ${\mathscr{M}}$ for which the following unique prime factorization result holds: if $\Gamma_1,\dots,\Gamma_n\in {\mathscr{M}}$ and $\Gamma_1\times\dots\times\Gamma_n$ is measure equivalent to a product…

The solvability of monomial groups is a well-known result in character theory. Certain properties of Artin L-series suggest a generalization of these groups, namely to such groups where every irreducible character has some multiple which is…

We study testing properties of functions on finite groups. First we consider functions of the form $f:G \to \mathbb{C}$, where $G$ is a finite group. We show that conjugate invariance, homomorphism, and the property of being proportional to…

In the context of holomorphic families of ${\mathbb P}^k$ endomorphisms, we show that various notions of stability are equivalent. This allows us to both extend and simplify the architecture of the proof of certain results of [BBD]

Verification of discrete time or continuous time dynamical systems over the reals is known to be undecidable. It is however known that undecidability does not hold for various classes of systems: if robustness is defined as the fact that…

The groups $\Gamma_{n,s}$ are defined in terms of homotopy equivalences of certain graphs, and are natural generalisations of $\mbox{Out}(F_n)$ and $\mbox{Aut}(F_n)$. They have appeared frequently in the study of free group automorphisms,…

We develop the theory of hypothesis testing based on the e-value, a notion of evidence that, unlike the p-value, allows for effortlessly combining results from several studies in the common scenario where the decision to perform a new study…

Let $\Gamma$ be the fundamental group of a closed orientable surface of genus at least two. Consider the composition of a uniformly random element of $\mathrm{Hom}(\Gamma,S_n)$ with the $(n-1)$-dimensional irreducible representation of…

We prove a rigidity theorem for morphisms from products of open subschemes of the projective line into solvable groups not containing a copy of $\Ga$ (for example, wound unipotent groups). As a consequence, we deduce several structural…

A measure preserving action of a countably infinite group \Gamma is called totally ergodic if every infinite subgroup of \Gamma acts ergodically. For example, all mixing and mildly mixing actions are totally ergodic. This note shows that if…

The relationship between overparameterization, stability, and generalization remains incompletely understood in the setting of discontinuous classifiers. We address this gap by establishing a generalization bound for finite function classes…

We consider the group testing problem, in the case where the items are defective independently but with non-constant probability. We introduce and analyse an algorithm to solve this problem by grouping items together appropriately. We give…

We give a deterministic polynomial-time algorithm to check whether the Galois group $\Gal{f}$ of an input polynomial $f(X) \in \Q[X]$ is nilpotent: the running time is polynomial in $\size{f}$. Also, we generalize the Landau-Miller…