Related papers: Constructing maximal cofinitary groups

We introduce a hierarchy of models of the Axiom of Determinacy called \emph{Nairian models}. Forcing over the simplest Nairian model, we obtain a model of ${\sf{ZFC}}+{\sf{MM^{++}}}(c)+\neg\square_{\omega_3}+\neg\square(\omega_3)$. Then,…

In this paper it is shown how to construct a finite topological space $X$ for a given finitely presentable group $G$ such that $\pi_1(X)\cong G$. Our construction is not optimal in the sense that the cardinality of the space $X$ might not…

This paper studies groups of maximal size acting harmonically on a finite graph. Our main result states that these maximal graph groups are exactly the finite quotients of the modular group $\Gamma=\left<x,y \ | \ x^2=y^3=1\right>$ of size…

We give a definition of weakly sofic groups (w-sofic groups). Our definition is rather natural extension of the definition of sofic groups where instead of Hamming metric on symmetric groups we use general bi-invariant metrics on finite…

This paper describes a computational, declarative approach to prosodic morphology that uses inviolable constraints to denote small finite candidate sets which are filtered by a restrictive incremental optimization mechanism. The new…

The cofinality quantifiers were introduced by Shelah as an example of a compact logic stronger than first-order logic. We show that the classes of models axiomatized by these quantifiers can be turned into an Abstract Elementary Class by…

We study the structure of the category of representations of $\mathbf{FA}$, the category of finite sets and all maps, mostly working over a field of characteristic zero. This category is not semi-simple and exhibits interesting features. We…

The rank of a finite algebraic structure with a single binary operation is the minimum number of elements needed to express every other element under the closure of the operation. In the case of groups, the previous best algorithm for…

We survey results regarding the definability and size of maximal discrete sets in analytic hypergraphs. Our main examples include maximal almost disjoint (or mad) families, $\mathcal I$-mad families, maximal eventually different families,…

We consider the fragment F of first order arithmetic in which quantification is restricted to ''for all but finitely many.'' We show that the integers form an F-elementary substructure of the real numbers. Consequently, the F-theory of…

We construct a model category (in the sense of Quillen) for set theory, starting from two arbitrary, but natural, conventions. It is the simplest category satisfying our conventions and modelling the notions of finiteness, countability and…

Building on work of J. Robinson and A. Shlapentokh, we develop a general framework to obtain definability and decidability results of large classes of infinite algebraic extensions of $\mathbb{F}_p(t)$. As an application, we show that for…

This article explores the model-dependent nature of set cardinality, emphasizing that cardinality is not absolute but varies across different axiomatic frameworks. Although Cantor's diagonal argument shows the real numbers are…

We prove that two reflection factorizations of a parabolic quasi-Coxeter element in a finite Coxeter group belong to the same Hurwitz orbit if and only if they generate the same subgroup and have the same multiset of conjugacy classes. As a…

We compute explicitly the automorphism and outer automorphism group of all large-type free-of-infinity Artin groups. Our strategy involves reconstructing the associated Deligne complexes in a purely algebraic manner, i.e. in a way that is…

Finite covers are a technique for building new structures from simpler ones. The original motivation to study finite covers is in the Ladder theorem of Zilber which describes how totally categorical structures are built from strictly…

Let W be a Coxeter group and L be a weight function on W. Following Lusztig, we have a corresponding decomposition of W into left cells, which have important applications in representation theory. We study the case where $W$ is an affine…

Let $k(G)$ be the number of conjugacy classes of finite groups $G$ and $\pi_e(G)$ be the set of the orders of elements in $G$. Then there exists a non-negative integer $k$ such that $k(G)=|\pi_e(G)|+k$. We call such groups to be $co(k)$…

In this paper, we describe the structure of finite groups whose element orders or proper (abelian) subgroup orders form an arithmetic progression of ratio $r\geq 2$. This extends the case $r=1$ studied in previous papers \cite{1,8,4}.

Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…