Related papers: Configuration Equivalence is not Equivalent to Iso…
The origins of the notion of matchings in groups spawn from a linear algebra problem proposed by E. K. Wakeford [24] which was tackled in 1996 [10]. In this paper, we first discuss unmatchable subsets in abelian groups. Then we formulate…
The ordinary Structure Identity Principle states that any property of set-level structures (e.g., posets, groups, rings, fields) definable in Univalent Foundations is invariant under isomorphism: more specifically, identifications of…
The primary goal of this paper is to abstract notions, results and constructions from the theory of categories to the broader setting of plots. Loosely speaking, a plot can be thought of as a non-associative non-unital category with a…
Since the work of Ornstein and Weiss in 1987 (J. Analyse Math. 48 (1987)) it has been understood that the natural category for classical ergodic theory would be probability measure preserving actions of discrete amenable groups. A…
Over 50 years ago, Lov\'{a}sz proved that two graphs are isomorphic if and only if they admit the same number of homomorphisms from any graph [Acta Math. Hungar. 18 (1967), pp. 321--328]. In this work we prove that two graphs are quantum…
We construct examples of number fields which are not isomorphic but for which their idele class groups are isomorphic. We also construct examples of projective algebraic curves which are not isomorphic but for which their Jacobian varieties…
The notion of Moufang set was introduced by Jacques Tits in \cite{Tits92}. We recall briefly the well-established definition and a construction which, under certain conditions, yields a Moufang set. We show that these conditions can be…
This is the first in a series of papers math.AG/0503029, math.AG/0410267, math.AG/0410268 on "configurations" in an abelian category A. Given a finite partially ordered set (I,<), an (I,<)-configuration (\sigma,\iota,\pi) is a finite…
We generalize the concept of the group determinant and prove a necessary and sufficient novel condition for a subset to be a subgroup. This development is based on the group determinant work by Edward Formanek, David Sibley, and Richard…
An adjoint Chevalley group of rank at least 2 over a rational algebra (or a similar ring), its elementary subgroup, and the corresponding Lie ring have the same automorphism group. These automorphisms are explicitly described.
Testing isomorphism of infinite groups is a classical topic, but from the complexity theory viewpoint, few results are known. S{\'e}nizergues and the fifth author (ICALP2018) proved that the isomorphism problem for virtually free groups is…
In recent years philosophers of science have explored categorical equivalence as a promising criterion for when two (physical) theories are equivalent. On the one hand, philosophers have presented several examples of theories whose…
For a congruence subgroup $\Gamma$, we define the notion of $\Gamma$-equivalence on binary quadratic forms which is the same as proper equivalence if $\Gamma = \mathrm{SL}_2(\mathbb Z)$. We develop a theory on $\Gamma$-equivalence such as…
Commability is the finest equivalence relation between locally compact groups such that $G$ and $H$ are equivalent whenever there is a continuous proper homomorphism $G \to H$ with cocompact image. Answering a question of Cornulier, we show…
We introduce the notion of uniform exactness, or uniform amenability at infinity, for discrete groups and prove it for a wide class of groups containing free groups and their limit groups. This shows a novel strong convergence phenomenon…
We consider two variants of those Abelian groups with all proper characteristic subgroups isomorphic and give an in-depth study of their basic and specific properties in either parallel or contrast to the Abelian groups with all proper…
In this note, we establish an equivalence of categories between the category of all eight-dimensional composition algebras with any given quadratic form $n$ over a field $k$ of characteristic not two, and a category arising from an action…
Isomorphism is central to the structure of mathematics and has been formalized in various ways within dependent type theory. All previous treatments have done this by replacing quantification over sets with quantification over groupoids of…
While efficient algorithms are known for solving many important problems related to groups, no efficient algorithm is known for determining whether two arbitrary groups are isomorphic. The particular case of 2-nilpotent groups, a special…
A group $G$ is called to be acceptable (due to M. Larsen) if for any finite group $H$, two element-conjugate homomorphisms are globally conjugate. We answer the acceptability question for general linear, special linear, unitary, symplectic…