English
Related papers

Related papers: Testing Properties of Functions on Finite Groups

200 papers

Let $\mathcal{P}$ be a property of function $\mathbb{F}_p^n \to \{0,1\}$ for a fixed prime $p$. An algorithm is called a tester for $\mathcal{P}$ if, given a query access to the input function $f$, with high probability, it accepts when $f$…

Computational Complexity · Computer Science 2014-02-11 Yuichi Yoshida

We characterize the set of properties of Boolean-valued functions on a finite domain $\mathcal{X}$ that are testable with a constant number of samples. Specifically, we show that a property $\mathcal{P}$ is testable with a constant number…

Data Structures and Algorithms · Computer Science 2016-12-20 Eric Blais , Yuichi Yoshida

Given a function f: {0,1}^n \to {0,1}, the f-isomorphism testing problem requires a randomized algorithm to distinguish functions that are identical to f up to relabeling of the input variables from functions that are far from being so. An…

Data Structures and Algorithms · Computer Science 2011-12-30 Eric Blais , Amit Weinstein , Yuichi Yoshida

Assume $\mathbf{G}$ is a connected reductive algebraic group defined over an algebraic closure $\mathbb{K} = \overline{\mathbb{F}}_p$ of the finite field of prime order $p>0$. Furthermore, assume that $F : \mathbf{G} \to \mathbf{G}$ is a…

Representation Theory · Mathematics 2014-10-21 Jay Taylor

We study the groups $G$ with the curious property that there exists an element $k\in G$ and a function $f\colon G\to G$ such that $f(xk)=xf(x)$ holds for all $x\in G$. This property arose from the study of near-rings and input-output…

Group Theory · Mathematics 2022-02-11 Dominik Bernhardt , Tim Boykett , Alice Devillers , Johannes Flake , S. P. Glasby

Approximate algebraic structures play a defining role in arithmetic combinatorics and have found remarkable applications to basic questions in number theory and pseudorandomness. Here we study approximate representations of finite groups:…

Representation Theory · Mathematics 2010-10-01 Cristopher Moore , Alexander Russell

Gowers introduced, for d\geq 1, the notion of dimension-d uniformity U^d(f) of a function f: G -> \C, where G is a finite abelian group and \C are the complex numbers. Roughly speaking, if U^d(f) is small, then f has certain…

Combinatorics · Mathematics 2007-05-23 Alex Samorodnitsky , Luca Trevisan

We study the class $\mathcal{M}$ of functions meromorphic outside a countable closed set of essential singularities. We show that if a function in $\mathcal{M}$, with at least one essential singularity, permutes with a non-constant rational…

Complex Variables · Mathematics 2016-10-03 J. W. Osborne , D. J. Sixsmith

Invariance with respect to linear or affine transformations of the domain is arguably the most common symmetry exhibited by natural algebraic properties. In this work, we show that any low complexity affine-invariant property of…

Computational Complexity · Computer Science 2012-10-09 Arnab Bhattacharyya , Eldar Fischer , Shachar Lovett

We give the definition of an invariant random positive definite function on a discrete group, generalizing both the notion of an invariant random subgroup and a character. We use von Neumann algebras to show that all invariant random…

Group Theory · Mathematics 2018-04-30 Vadim Alekseev , Rahel Brugger

Let F = F_p for any fixed prime p >= 2. An affine-invariant property is a property of functions on F^n that is closed under taking affine transformations of the domain. We prove that all affine-invariant property having local…

Computational Complexity · Computer Science 2013-01-18 Arnab Bhattacharyya , Eldar Fischer , Hamed Hatami , Pooya Hatami , Shachar Lovett

Let $G$ be a finite group, and let $d$ be the degree of an irreducible character of $G$ such that $|G|=d(d+e)$ for some $e>1$. Consider the case when $G$ is solvable, $d$ is square-free, and $(d,d+e)=1$. We wish to explore an equivalent…

Group Theory · Mathematics 2024-11-14 Mark L. Lewis , Brandon Martin

We construct and study finitely presented groups with quadratic Dehn function (QD-groups) and present the following applications of the method developed in our recent papers. (1) The isomorphism problem is undecidable in the class of…

Group Theory · Mathematics 2020-12-21 A. Yu. Olshanskii , M. V. Sapir

Recently there has been much interest in Gowers uniformity norms from the perspective of theoretical computer science. This is mainly due to the fact that these norms provide a method for testing whether the maximum correlation of a…

Computational Complexity · Computer Science 2013-08-14 Hamed Hatami , Shachar Lovett

In this series of papers, we investigate properties of a finite group which are determined by its low degree irreducible representations over a number field $F$, i.e. its representations on matrix rings $\operatorname{M}_n(D)$ with $n \leq…

Representation Theory · Mathematics 2026-02-13 Robynn Corveleyn , Geoffrey Janssens , Doryan Temmerman

For $G$ a finite group, one way to construct irreducible quandle representations over $\mathbb{C}$ of the conjugacy quandle $Conj(G)$ is by taking the product of an irreducible linear group representation of $G$ by what we call a quandle…

Representation Theory · Mathematics 2026-05-06 Mohamad Maassarani

Let G be a reductive connected linear algebraic group over an algebraically closed field of positive characteristic and let g be its Lie algebra. First we extend a well-known result about the Picard group of a semisimple group to reductive…

Commutative Algebra · Mathematics 2008-01-22 R. H. Tange

We investigate the finite soluble groups $G$ with the following property (replacement property): for every irredundant generating set $\{g_1,\dots,g_m\}$ of maximal size and for any $1\neq g\in G$ there exists an $i\in \{1,\dots,m\}$ so…

Group Theory · Mathematics 2017-10-31 A. Lucchini

Let $\mathbf{G}$ be a unipotent group scheme defined in terms of a nilpotent Lie lattice over the ring $\mathcal{O}$ of integers of a number field. We consider bivariate zeta functions of groups of the form $\mathbf{G}(\mathcal{O})$…

Group Theory · Mathematics 2018-07-17 Paula Macedo Lins de Araujo

Let $G$ be a complex connected reductive algebraic group and let $G_{\mathbb{R}}$ be a real form of $G$. We construct a sequence of functors $L_i\mathcal{R}$ from admissible (resp. finite-length) representations of $G$ to admissible (resp.…

Representation Theory · Mathematics 2022-04-25 Lucas Mason-Brown
‹ Prev 1 2 3 10 Next ›