Related papers: Configuration Equivalence is not Equivalent to Iso…

Risandles are nonassociative algebraic structures recently introduced to construct invariants of 3-manifolds. In this note, we show that the categories of groups and nonempty, faithful risandles are equivalent. In analogy to knot quandles,…

The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case where both groups are abelian is well understood and can be solved efficiently, very little is known about the complexity of isomorphism…

We prove that the isomorphism problem is decidable for generalized Baumslag-Solitar (GBS) groups with one quasi-conjugacy class and full support gaps. In order to do so we introduce a family of invariants that fully characterize the…

Two groups are orbit equivalent if they both admit an action on a same probability space that share the same orbits. In particular the Ornstein-Weiss theorem implies that all infinite amenable groups are orbit equivalent to the group of…

We consider the problem of characterizing isomorphisms of types, or, equivalently, constructive cardinality of sets, in the simultaneous presence of disjoint unions, Cartesian products, and exponentials. Mostly relying on results about…

We give a new perspective on the homological characterisations of amenability given by Johnson in the context of bounded cohomology and by Block and Weinberger in the context of uniformly finite homology. We examine the interaction between…

Two first-order logic theories are definitionally equivalent if and only if there is a bijection between their model classes that preserves isomorphisms and ultraproducts (Theorem 2). This is a variant of a prior theorem of van Benthem and…

In his book `Physics and Philosophy', Heisenberg suggested that the quantum world is one of ``potentialities or possibilities'' and that the classical realm is one of ``things or facts''. After ascertaining that his categories most…

We initiate a quantitative study of measure equivalence (and orbit equivalence) between finitely generated groups, which extends the classical setting of $\mathrm L^p$ measure equivalence. In this paper, our main focus will be on amenable…

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

This is the fourth in a series of papers math.AG/0312190, math.AG/0503029, math.AG/0410267 on configurations in an abelian category A. Given a finite partially ordered set (I,<), an (I,<)-configuration is a finite collection of objects and…

We discuss the relationship between (co)homology groups and categorical diagonalization. We consider the category of chain complexes in the category of finitely generated free modules on a commutative ring. For a fixed chain complex with…

We introduce a notion of equivalence on tilings which is formulated in terms of their local structure. We compare it with the known concept of locally deriving one tiling from another and show that two tilings of finite type are…

Satisfiability is a classic problem in computational complexity theory, in which one wishes to determine whether an assignment of values to a collection of Boolean variables exists in which all of a collection of clauses composed of logical…

Let g be a complex simple Lie algebra and e a nilpotent element of g. We are interested in the isomorphism question (raised by Premet) between the finite W-algebras constructed from some nilpotent subalgebras of g called e-admissible. We…

We provide a treatment of isomorphism within a set-theoretic formulation of dependent type theory. Type expressions are assigned their natural set-theoretic compositional meaning. Types are divided into small and large types --- sets and…

Many mechanical systems have configuration spaces that admit symmetries. Mathematically, such symmetries are modelled by the action of a group on a topological space. Several variations of topological complexity have emerged that take…

Homomorphism indistinguishability is a way of characterising many natural equivalence relations on graphs. Two graphs $G$ and $H$ are called homomorphism indistinguishable over a graph class $\mathcal{F}$ if for each $F \in \mathcal{F}$,…

Abelian categories provide a self-dual axiomatic context for establishing homomorphism theorems (such as the isomorphism theorems and homological diagram lemmas) for abelian groups, and more generally, modules. In this paper we describe a…

We prove that if two finite metacyclic groups have isomorphic rational group algebras, then they are isomorphic. This contributes to understand where is the line separating positive and negative solutions to the Isomorphism Problem for…