English
Related papers

Related papers: Testing Isomorphism of Boolean Functions over Fini…

200 papers

The role of symmetry in Boolean functions $f:\{0,1\}^n \to \{0,1\}$ has been extensively studied in complexity theory. For example, symmetric functions, that is, functions that are invariant under the action of $S_n$, is an important class…

Computational Complexity · Computer Science 2025-10-01 Sourav Chakraborty , Chandrima Kayal , Manaswi Paraashar

A group $G$ has cube-free order if no prime to the third power divides $|G|$. We describe an algorithm that given two cube-free groups $G$ and $H$ of known order, decides whether $G\cong H$, and, if so, constructs an isomorphism $G\to H$.…

Group Theory · Mathematics 2019-05-06 Heiko Dietrich , James B. Wilson

Given a finite abelian group $G$ and elements $x, y \in G$, we prove that there exists $\phi \in \text{Aut}(G)$ such that $\phi(x) = y$ if and only if $G/\langle x \rangle \cong G/\langle y \rangle$. This result leads to our development of…

Group Theory · Mathematics 2025-12-23 Arjun Agarwal , Rachel Chen , Rohan Garg , Jared Kettinger

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 paper, we exhibit $\textsf{AC}^{3}$ isomorphism tests for coprime extensions $H \ltimes N$ where $H$ is elementary Abelian and $N$ is Abelian; and groups where $\text{Rad}(G) = Z(G)$ is elementary Abelian and $G =…

Computational Complexity · Computer Science 2026-04-16 Michael Levet

Over the last three decades, function testing has been extensively studied over Boolean, finite fields, and discrete settings. However, to encode the real-world applications more succinctly, function testing over the reals (where the domain…

Data Structures and Algorithms · Computer Science 2026-03-31 Vipul Arora , Arnab Bhattacharyya , Philips George John , Sayantan Sen

We introduce the \textit{almost goodness-of-fit} test, a procedure to assess whether a (parametric) model provides a good representation of the probability distribution generating the observed sample. Specifically, given a distribution…

Methodology · Statistics 2025-10-15 Amparo Baíllo , Javier Cárcamo

A function $f$ is $d$-resilient if all its Fourier coefficients of degree at most $d$ are zero, i.e., $f$ is uncorrelated with all low-degree parities. We study the notion of $\mathit{approximate}$ $\mathit{resilience}$ of Boolean…

Machine Learning · Computer Science 2014-07-10 Dana Dachman-Soled , Vitaly Feldman , Li-Yang Tan , Andrew Wan , Karl Wimmer

We give a new fpt algorithm testing isomorphism of $n$-vertex graphs of tree width $k$ in time $2^{k\operatorname{polylog} (k)}\operatorname{poly} (n)$, improving the fpt algorithm due to Lokshtanov, Pilipczuk, Pilipczuk, and Saurabh (FOCS…

Data Structures and Algorithms · Computer Science 2018-03-20 Martin Grohe , Daniel Neuen , Pascal Schweitzer , Daniel Wiebking

We present an algorithm for testing halfspaces over arbitrary, unknown rotation-invariant distributions. Using $\tilde O(\sqrt{n}\epsilon^{-7})$ random examples of an unknown function $f$, the algorithm determines with high probability…

Data Structures and Algorithms · Computer Science 2018-11-02 Nathaniel Harms

We develop a BV framework on Cayley graphs, which yields a sharp discrete Wulff isoperimetric inequality with the best constant tied to the generating set/stencil $S$, a quantitative $\Gamma$-convergence of discrete to continuum anisotropic…

Group Theory · Mathematics 2025-09-29 Mayukh Mukherjee

We prove a stability result for general $3$-wise correlations over distributions satisfying mild connectivity properties. More concretely, we show that if $\Sigma,\Gamma$ and $\Phi$ are alphabets of constant size, and $\mu$ is a pairwise…

Computational Complexity · Computer Science 2024-08-02 Amey Bhangale , Subhash Khot , Dor Minzer

Let $\mathbf{x}_j = \mathbf{\theta} + \mathbf{\epsilon}_j$, $j=1,\dots,n$ be i.i.d. copies of a Gaussian random vector $\mathbf{x}\sim\mathcal{N}(\mathbf{\theta},\mathbf{\Sigma})$ with unknown mean $\mathbf{\theta} \in \mathbb{R}^d$ and…

Statistics Theory · Mathematics 2020-12-23 Fan Zhou , Ping Li

Invariant and equivariant models incorporate the symmetry of an object to be estimated (here non-parametric regression functions $f : \mathcal{X} \rightarrow \mathbb{R}$). These models perform better (with respect to $L^2$ loss) and are…

Machine Learning · Statistics 2022-05-31 Louis G. Christie , John A. D. Aston

The computational cost of simulating quantum many-body systems can often be reduced by taking advantage of physical symmetries. While methods exist for specific symmetry classes, a general algorithm to find the full permutation symmetry…

Quantum Physics · Physics 2025-12-01 Saumya Shah , Patrick Rebentrost

We study linearization models for continuous one-parameter semigroups of parabolic type. In particular, we introduce new limit schemes to obtain solutions of Abel's functional equation and to study asymptotic behavior of such semigroups.…

Complex Variables · Mathematics 2009-07-16 Mark Elin , Dmitry Khavinson , Simeon Reich , David Shoikhet

For an Abelian group $G$, any homomorphism $\mu\colon G\otimes G\rightarrow G$ is called a \textsf{multiplication} on $G$. The set $\text{Mult}\,G$ of all multiplications on an Abelian group $G$ itself is an Abelian group with respect to…

Group Theory · Mathematics 2022-05-24 Ekaterina Kompantseva , Askar Tuganbaev

It is shown that the four $(3 + 1)$-dimensional (4D) free Abelian 2-form gauge theory provides an example of (i) a class of field theoretical models for the Hodge theory, and (ii) a possible candidate for the quasi-topological field theory…

High Energy Physics - Theory · Physics 2008-11-26 R. P. Malik

Two graphs $G$ and $H$ are homomorphism indistinguishable over a graph class $\mathcal{F}$ if they admit the same number of homomorphisms from every graph $F \in \mathcal{F}$. Many graph isomorphism relaxations such as (quantum) isomorphism…

Computational Complexity · Computer Science 2025-12-16 Marek Černý , Tim Seppelt

The problem of verifying the nonnegativity of a function on a finite abelian group is a long-standing challenging problem. The basic theory of representation theory of finite groups indicates that a function $f$ on a finite abelian group…

Optimization and Control · Mathematics 2023-10-27 Jianting Yang , Ke Ye , Lihong Zhi