English
Related papers

Related papers: A General Framework for Low Soundness Homomorphism…

200 papers

Let $X$ be a set of items of size $n$ that contains some defective items, denoted by $I$, where $I \subseteq X$. In group testing, a {\it test} refers to a subset of items $Q \subset X$. The outcome of a test is $1$ if $Q$ contains at least…

Data Structures and Algorithms · Computer Science 2023-08-16 Nader H. Bshouty

A method is described to probe high-scale physics in lower-energy experiments by employing sum rules in terms of renormalisation group invariants. The method is worked out in detail for the study of supersymmetry-breaking mechanisms in the…

High Energy Physics - Phenomenology · Physics 2012-11-06 Jamil Hetzel , Wim Beenakker

One of the main necessities for population geneticists is the availability of statistical tools that enable to accept or reject the neutral Wright-Fisher model with high power. A number of statistical tests have been developed to detect…

Quantitative Methods · Quantitative Biology 2010-11-08 Luca Ferretti , Giacomo Marmorini , Sebastian Ramos-Onsins

We determine a condition on the minimum Hamming weight of some special abelian group codes and, as a consequence of this result, we establish that any such code is, up to permutational equivalence, a subspace of the direct sum of $s$ copies…

Information Theory · Computer Science 2022-09-29 Angelo Marotta

The issue addressed in this paper is that of testing for common breaks across or within equations of a multivariate system. Our framework is very general and allows integrated regressors and trends as well as stationary regressors. The null…

Statistics Theory · Mathematics 2018-01-12 Tatsushi Oka , Pierre Perron

It is well known that the discrete analogue of a lattice is a linear code which is a vector subspace of Hamming space $\mathbb{F}^n$. The set $\mathbb{F}$ is a finite field and $n \in \mathbb{Z}_{>0}$. Our attempt is to construct a class of…

Information Theory · Computer Science 2023-08-15 Rameez Raja

Hypothesis testing in the linear regression model is a fundamental statistical problem. We consider linear regression in the high-dimensional regime where the number of parameters exceeds the number of samples ($p> n$). In order to make…

Statistics Theory · Mathematics 2019-09-24 Adel Javanmard , Jason D. Lee

The group testing problem consists of determining a small set of defective items from a larger set of items based on a number of possibly-noisy tests, and is relevant in applications such as medical testing, communication protocols, pattern…

Information Theory · Computer Science 2018-10-05 Jonathan Scarlett

Group testing tackles the problem of identifying a population of $K$ defective items from a set of $n$ items by pooling groups of items efficiently in order to cut down the number of tests needed. The result of a test for a group of items…

Information Theory · Computer Science 2015-08-20 Kangwook Lee , Ramtin Pedarsani , Kannan Ramchandran

Statistical models of unobserved heterogeneity are typically formalized as mixtures of simple parametric models and interest naturally focuses on testing for homogeneity versus general mixture alternatives. Many tests of this type can be…

Methodology · Statistics 2016-03-22 Jiaying Gu , Roger Koenker , Stanislav Volgushev

Many binary classification problems minimize misclassification above (or below) a threshold. We show that instances of ranking problems, accuracy at the top or hypothesis testing may be written in this form. We propose a general framework…

Machine Learning · Computer Science 2020-02-26 Lukáš Adam , Václav Mácha , Václav Šmídl , Tomáš Pevný

We investigate the conditions for a finite abelian group $G$ under which any cyclic subgroup $H$ and any group homomorphism $f \in \operatorname{Hom}(H,G)$ can be extended to an endomorphism $F \in \operatorname{End}(G)$. As a result, we…

Group Theory · Mathematics 2025-01-08 Yusuke Fujiyoshi

Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions which are far from linear. Linearity tests were first…

Computational Complexity · Computer Science 2008-02-21 Shachar Lovett

Let $f$ and $g$ be Boolean functions over a finite Abelian group $\mathcal{G}$, where $g$ is fully known, and we have {\em query access} to $f$, that is, given any $x \in \mathcal{G}$ we can get the value $f(x)$. We study the tolerant…

Computational Complexity · Computer Science 2025-07-11 Swarnalipa Datta , Arijit Ghosh , Chandrima Kayal , Manaswi Paraashar , Manmatha Roy

A group homomorphism eta:H-->G is called a localization of H if every homomorphism phi:H-->G can be `extended uniquely' to a homomorphism Phi:G-->G in the sense that Phi eta=phi. Libman showed that a localization of a finite group need not…

Logic · Mathematics 2007-05-23 Ruediger Goebel , Jose L. Rodriguez , Saharon Shelah

Friedl and L\"oh (2021, Confl. Math.) prove that testing whether or not there is an epimorphism from a finitely presented group to a virtually cyclic group, or to the direct product of an abelian and a finite group, is decidable. Here we…

Group Theory · Mathematics 2025-01-15 Murray Elder , Jerry Shen , Armin Weiß

This manuscript represents the author's PhD dissertation thesis.The first part studies decision problems in Thompson's groups F,T,V and some generalizations. The simultaneous conjugacy problem is determined to be solvable for Thompson's…

Group Theory · Mathematics 2008-07-21 Francesco Matucci

Given a finite group with a generating subset there is a well-established notion of length for a group element given in terms of its minimal length expression as a product of elements from the generating set. Recently, certain quantities…

This paper studies the classification of high-dimensional Gaussian signals from low-dimensional noisy, linear measurements. In particular, it provides upper bounds (sufficient conditions) on the number of measurements required to drive the…

Information Theory · Computer Science 2016-11-03 Hugo Reboredo , Francesco Renna , Robert Calderbank , Miguel R. D. Rodrigues

We study the computational phase transition in a multi-frequency group synchronization problem, where pairwise relative measurements of group elements are observed across multiple frequency channels and corrupted by Gaussian noise. Using…

Statistics Theory · Mathematics 2026-01-29 Zhangsong Li