Related papers: Applying the K\"ov\'ari-S\'os-Tur\'an theorem to a…

Let $n$ be a positive integer and let $G$ be a group. We denote by $\nu(G)$ a certain extension of the non-abelian tensor square $G \otimes G$ by $G \times G$. Set $T_{\otimes}(G) = \{g \otimes h \mid g,h \in G\}$. We prove that if the size…

Let $G$ be a permutation group acting on $[n]=\{1, ..., n\}$ and $\mathcal{V}=\{V_{i}: i=1, ..., n\}$ be a system of $n$ subsets of $[n]$. When is there an element $g \in G$ so that $g(i) \in V_{i}$ for each $i \in [n]$? If such $g$ exists,…

A group $G$ is said to be $\frac{3}{2}$-generated if every nontrivial element belongs to a generating pair. It is easy to see that if $G$ has this property then every proper quotient of $G$ is cyclic. In this paper we prove that the…

By a [$K$-]approximate subring of a ring we mean an additively symmetric subset $X$ such that $X \cdot X \cup (X + X)$ is covered by finitely many [resp.\ $K$] additive translates of $X$. We prove a structure theorem for finite approximate…

There are numbers k and s and a URM program A(n,m) satisfying the following conditions. 1. If A(n,m) halts, then Cn(m) diverges. 2. For all n, C_k(n) = A(n,n) and C_s(n) = C_k(s). 3. A(k,s) halts and for all n, A(s,n) diverges. Here C_n(_)…

Suppose that $\Gamma$ is a non-empty connected graph, $\mathfrak{G}$ is the fundamental group of a graph of groups over $\Gamma$, and $\mathcal{C}$ is a root class of groups (the last means that $\mathcal{C}$ contains non-trivial groups and…

We discuss the relative K-theory for a $C^{*}$-algebra, $A$, together with a $C^{*}$-subalgebra, $A' \subseteq A$. The relative group is denoted $K_{i}(A';A), i = 0, 1$, and is due to Karoubi. We present a situation of two pairs $A'…

Let $G$ be a finite group and let $H$ be a subgroup of $G$. We say that $H$ is extremely closed in $G$ if $\langle H,H^g\rangle\cap N_G(H)=H$ for all $g\in G.$ In this paper, we determine the structure of finite groups with an extremely…

We prove an analogue of the classical Erd\H{o}s-Ko-Rado theorem for intersecting sets of permutations in finite 2-transitive groups. Given a finite group G acting faithfully and 2-transitively on the set X, we show that an intersecting set…

An old problem in group theory is that of describing how the order of an element behaves under multiplication. To generalize some classical bounds concerning the order $\mathrm o(ab)$ of two elements $a, b$ in a finite abelian group to the…

We prove a strong general-purpose bound for the diameter of a finite group depending only on the diameters of its composition factors and the maximal exponent of a normal abelian section. There are a number of notable applications: (1) if…

If $G$ is a finite Abelian group, define $s_{k}(G)$ to be the minimal $m$ such that a sequence of $m$ elements in $G$ always contains a $k$-element subsequence which sums to zero. Recently Bitz et al. proved that if $n = exp(G)$, then…

We establish a group-action version of the Szemer\'edi-Trotter theorem over any field, extending Bourgain's result for the group $\mathrm{SL}_2(k)$. As an Elekes-Szab\'o-type application, we obtain quantitative bounds on the number of…

We compute the cardinality $\mathfrak n_{\dim}(\mathcal M)$ of the sets of dimension functions on the ordered structures $\mathcal M$. The inequality $\mathfrak n_{\dim}(\mathcal M) \leq 1$ holds if $\mathcal M$ is a d-minimal expansion of…

Let $S$ be the group of finitely supported permutations of a countably infinite set. Let $K[S]$ be the group algebra of $S$ over a field $K$ of characteristic $0$. According to a theorem of Formanek and Lawrence, $K[S]$ satisfies the…

The existence of $1$-factorizations of an infinite complete equipartite graph $K_m[n]$ (with $m$ parts of size $n$) admitting a vertex-regular automorphism group $G$ is known only when $n=1$ and $m$ is countable (that is, for countable…

We prove the following theorem: for all positive integers $b$ there exists a positive integer $k$, such that for every finite set $A$ of integers with cardinality $|A| > 1$, we have either $$ |A + ... + A| \geq |A|^b$$ or $$ |A \cdot ...…

Let $X$ be a set and let $S$ be an inverse semigroup of partial bijections of $X$. Thus, an element of $S$ is a bijection between two subsets of $X$, and the set $S$ is required to be closed under the operations of taking inverses and…

In this paper we introduce a unifying approach to the generalized Tur\'an problem and supersaturation results in graph theory. The supersaturation-extremal function $satex(n, F : m, G)$ is the least number of copies of a subgraph $G$ an…

Let $H$ be a subgroup of a finite group $G$. We say that $H$ satisfies partial $\Pi$-property in $G$ if there exists a chief series $\mathit{\Gamma}_G:1=G_0<G_1<\cdots<G_n=G$ of $G$ such that for every $G$-chief factor $G_i/G_{i-1}$ ($1\leq…