Related papers: Test Groups for Whitehead Groups
Semigraphoids are combinatorial structures that arise in statistical learning theory. They are equivalent to convex rank tests and to polyhedral fans that coarsen the reflection arrangement of the symmetric group. We resolve two problems on…
Gromov asked whether every one-ended word-hyperbolic group contains a hyperbolic surface group. We prove that every one-ended double of a free group has a hyperbolic surface subgroup if (1) the free group has rank two, or (2) every…
Group testing is a well known search problem that consists in detecting up to $s$ defective elements of the set $[t]=\{1,\ldots,t\}$ by carrying out tests on properly chosen subsets of $[t]$. In classical group testing the goal is to find…
We report experiment results on binary categorization of (i) gray color, (ii) speech sounds, and (iii) number discrimination. Data analysis is based on constructing psychometric functions and focusing on asymptotics. We discuss the…
The group isomorphism problem asks whether two finite groups given by their Cayley tables are isomorphic or not. Although there are polynomial-time algorithms for some specific group classes, the best known algorithm for testing isomorphism…
Groups, in which every subgroup containing some fixed primary cyclic subgroup has a complement, are investigated.
We define a class of finite groups based on the properties of the closed twins of their power graphs and study the structure of those groups. As a byproduct, we obtain results about finite groups admitting a partition by cyclic subgroups.
The group testing problem is concerned with identifying a small set of infected individuals in a large population. At our disposal is a testing procedure that allows us to test several individuals together. In an idealized setting, a test…
The worst-case complexity of group-theoretic algorithms has been studied for a long time. Generic-case complexity, or complexity on random inputs, was introduced and studied relatively recently. In this paper, we address the average-case…
The use of double groupoids and their associated double Lie algebroids and characteristic distributions is proposed for the description and analysis of continuous media that carry two different constitutive or geometric structures. Various…
We investigate ternary products of groupoids and prove that there is a one-to-one correspondence between the collection of right modular groupoids with a left identity element l and laterally commutative, l-bi-unital semiheaps. This result…
We introduce Poisson double algebroids, and the equivalent concept of double Lie bialgebroid, which arise as second-order infinitesimal counterparts of Poisson double groupoids. We develop their underlying Lie theory, showing how these…
In this paper we will first present a generalization of the wedge product of association schemes to table algebras and give a necessary and sufficient condition for a table algebra to be the wedge product of two table algebras. Then we show…
The purpose of testing a system with respect to a requirement is to refute the hypothesis that the system satisfies the requirement. We build a theory of tests and refutation based on the elementary notions of satisfaction and refinement.…
We introduce the notion of groupoid pre-equivalences and prove that they give rise to groupoid equivalences by taking certain quotients. Then, given an equivalence of Fell bundles $\mathscr{B}$ and $\mathscr{C}$ and another equivalence…
When does the complex product of a given number of subsets of a group generate the same subgroup as their union? We answer this question in a more general form by introducing HS-stability and characterising the HS-stable involution…
We show that for an alternating pretzel knot K the canonical genera of its Whitehead doubles W(K) are equal to the crossing number c(K) of K, verifying a conjecture of Tripp in the case of these knots.
We give a construction of classifiers for double negation stable h-propositions in a variety of cubical set models of homotopy type theory and cubical type theory. This is used to give some relative consistency results: classifiers for…
A Coxeter group W is called reflection independent if its reflections are uniquely determined by W only, independently on the choice of the generating set. We give a new sufficient condition for the reflection independence, and examine this…
A simple observation, showing that every groupoid becomes an inverse semigroup after adding one element. In such inverse semigroups all idempotents are mutually orthogonal. This fact implies that every C*-algebra of a discrete groupoid is a…