Related papers: Solubility of groups can be characterized by confi…
We develop a theory for describing composite objects in physics. These can be static objects, such as tables, or things that happen in spacetime (such as a region of spacetime with fields on it regarded as being composed of smaller such…
Feature toggles and configuration options are modern programmatic techniques to easily include or exclude functionality in a software product. The research contributions to these two techniques have most often been focused on either one of…
Hyperfiniteness or amenability of measurable equivalence relations and group actions has been studied for almost fifty years. Recently, unexpected applications of hyperfiniteness were found in computer science in the context of testability…
We show that there is a dense set $\ourset\subseteq \mathbb{N}$ of group orders and a constant $c$ such that for every $n\in \ourset$ we can decide in time $O(n^2(\log n)^c)$ whether two $n\times n$ multiplication tables describe isomorphic…
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…
In Finite Group Modular Representation Theory, the basic objects are the indecomposable and simple modules. This paper offers a new classification of these objects that refines the Green Theory Classification of indecomposable and simple…
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…
Let $G$ be a finite group and $\psi(G) = \sum_{g \in G} o(g)$, where $o(g)$ denotes the order of $g \in G$. In [M. Herzog, et. al., Two new criteria for solvability of finite groups, J. Algebra, 2018], the authors put forward the following…
In this article we introduce the space of configurations of commuting elements in a topological group and show that it satisfies rational homological stability for the sequences of unitary, special unitary and symplectic groups. We also…
Model theoretic results such as Characterization and Definability give important information about different logics. It is well known that the proofs of those results for several modal logics have, somehow, the same 'taste'. A general proof…
The theory of optimal choice sets offers a well-established solution framework in social choice and game theory. In social choice theory, decision-making is typically modeled as a maximization problem. However, when preferences are cyclic…
We investigate combinations of structures by families of structures relative to families of unary predicates and equivalence relations. Conditions preserving $\omega$-categoricity and Ehrenfeuchtness under these combinations are…
We prove that infinite definably simple locally finite groups of finite centraliser dimension are simple groups of Lie type over locally finite fields. Then, we identify conditions on automorphisms of a stable group that make it resemble…
Wigner found unreasonable the "effectiveness of mathematics in the natural sciences". But if the mathematics we use to describe nature is simply a coded expression of our experience then its effectiveness is quite reasonable. Its…
A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable type, Iljazovi\'c and other authors established the property…
If G is a group with a presentation of the form < x,y|x^3=y^5=W(x,y)^2=1 >, then either G is virtually soluble or G contains a free subgroup of rank 2. This provides additional evidence in favour of a conjecture of Rosenberger.
In domains with high knowledge distribution a natural objective is to create principle foundations for collaborative interactive learning environments. We present a first mathematical characterization of a collaborative learning group, a…
A semigroup is \emph{amiable} if there is exactly one idempotent in each $\mathcal{R}^*$-class and in each $\mathcal{L}^*$-class. A semigroup is \emph{adequate} if it is amiable and if its idempotents commute. We characterize adequate…
We describe the classification of ranked definably quasi-Frobenius groups of odd type : dihedral configurations are isomorphic to PGL(2, K) for K an algebraically closed field of characteristic other than two; Frobenius groups are spilt and…
We study testing properties of functions on finite groups. First we consider functions of the form $f:G \to \mathbb{C}$, where $G$ is a finite group. We show that conjugate invariance, homomorphism, and the property of being proportional to…