相关论文: The cofinality spectrum of the infinite symmetric …
We investigate this class of groups originally called ulf (universal locally finite groups) of cardinality $\lambda$. We prove that for every locally finite group $G$ there is a canonical existentially closed extention of the same…
A subset S of a group G invariably generates G if G = <s^(g(s)) | s in S> for each choice of g(s) in G, s in S. In this paper we study invariable generation of infinite groups, with emphasis on linear groups. Our main result shows that a…
We prove that Thompson's group $F$ has a subgroup $H$ such that the conjugacy problem in $H$ is undecidable and the membership problem in $H$ is easily decidable. The subgroup $H$ of $F$ is a closed subgroup of $F$. That is, every function…
For a group $G$ and a natural number $m$, a subset $A$ of $G$ is called $m$-thin if, for each finite subset $F$ of $G$, there exists a finite subset $K$ of $G$ such that $|Fg\cap A|\leqslant m$ for every $g\in G\setminus K$. We show that…
The Gruenberg-Kegel graph $\Gamma(G)$ associated with a finite group $G$ has as vertices the prime divisors of $|G|$, with an edge from $p$ to $q$ if and only if $G$ contains an element of order $pq$. This graph has been the subject of much…
We prove: $\mathbf{Theorem}$ Let $K$ be a universal class. If $K$ is categorical in cardinals of arbitrarily high cofinality, then $K$ is categorical on a tail of cardinals. The proof stems from ideas of Adi Jarden and Will Boney, and also…
In this paper, we classify all the finite groups $G$ such that the commuting graph $\Gamma_C(G)$, order-sum graph $\Gamma_{OS}(G)$ and non-inverse graph $\Gamma_{NI}(G)$ are minimally edge connected graphs. We also classify all the finite…
For a finite group $G$, we define the inclusion graph of subgroups of $G$, denoted by $\mathcal I(G)$, is a graph having all the proper subgroups of $G$ as its vertices and two distinct vertices $H$ and $K$ in $\mathcal I(G)$ are adjacent…
We prove the consistency of: for suitable strongly inaccessible cardinal lambda the dominating number, i.e., the cofinality of ^{lambda}lambda, is strictly bigger than cov_lambda(meagre), i.e. the minimal number of nowhere dense subsets of…
The $\kappa$-density of a cardinal $\mu\ge\kappa$ is the least cardinality of a dense collection of $\kappa$-subsets of $\mu$ and is denoted by $\mathcal D(\mu,\kappa)$. The Singular Density Hypothesis (SDH) for a singular cardinal $\mu$ of…
Denote by $\mathrm m(S)$ the multiplicity of a numerical semigroup $S$. A covariety is a nonempty family $\mathscr{C}$ of numerical semigroups that fulfills the following conditions: there is the minimum of $\mathscr{C},$ the intersection…
Let $G$ be a closed highly homogeneous subgroup of $S_{\infty}$ not involving circular orderings. We show that the closure of a conjugacy class from $G$ contains a conjugacy class which is comeagre in it. Furthermore, we show that the…
We characterize the fundamental group of a locally finite graph G with ends combinatorially, as a group of infinite words. Our characterization gives rise to a canonical embedding of this group in the inverse limit of the (free) fundamental…
Let $G$ be a group. \textit{The permutability graph of cyclic subgroups of $G$}, denoted by $\Gamma_c(G)$, is a graph with all the proper cyclic subgroups of $G$ as its vertices and two distinct vertices in $\Gamma_c(G)$ are adjacent if and…
If cf(kappa) = kappa, kappa^+< cf(lambda) = \lambda, then there is a stationary subset S of {delta<lambda:cf(delta)=kappa} in I[lambda]. Moreover, we can find <C_delta :delta in S>, C_delta a club of lambda, otp(C_delta)=kappa, guessing…
We introduce new formulations of aperiodicity and cofinality for finitely aligned higher-rank graphs \Lambda, and prove that C*(\Lambda) is simple if and only if \Lambda is aperiodic and cofinal. The main advantage of our versions of…
The genus spectrum of a finite group $G$ is the set of all $g$ such that $G$ acts faithfully on a compact Riemann surface of genus $g$. It is an open problem to find a general description of the genus spectrum of the groups in interesting…
Let $\Gamma$ be an undirected and simple graph. A set $ S $ of vertices in $\Gamma$ is called a {cyclic vertex cutset} of $\Gamma$ if $\Gamma - S$ is disconnected and has at least two components each containing a cycle. If $\Gamma$ has a…
A finite group $P$ is said to be \emph{primary} if $|P|=p^{a}$ for some prime $p$. We say a primary subgroup $P$ of a finite group $G$ satisfies the \emph{Frobenius normalizer condition} in $G$ if $N_{G}(P)/C_{G}(P)$ is a $p$-group provided…
It is consistent that for every monotonically increasing function f:omega->omega there is a graph with size and chromatic number aleph_1 in which every n-chromatic subgraph has at least f(n) elements (n >= 3). This solves a $250 problem of…