Related papers: On some polynomial version on the sum-product prob…

A subset $S$ of a vertex set of a graph $G$ is a total $(k,r)$-dominating set if every vertex $u \in V(G)$ is within distance $k$ of at least $r$ vertices in $S$. The minimum cardinality among all total $(k,r)$-dominating sets of $G$ is…

Suppose that G is a finite group and x in G has prime order p > 3. Then x is contained in the solvable radical of G if (and only if) <x,x^g> is solvable for all g in G. If G is an almost simple group and x in G has prime order p > 3 then…

Let $P$ be a probability on a finite group $G$, ${P^{(n)}}$ $n$-fold convolution of $P$ on $G$. Under mild condition, ${P^{(n)}}$ at $n \to \infty $ converges to the uniform probability on the group $G$. If $A = \left\{ {g \in G,\;P\left( g…

We give a criterion when a polynomial $x^n-g$ is irreducible over a pseudofinite field. As an application we give an explicit description of algebraic closure of some pseudofinite fields of zero characteristic.

For a large prime $p$, a rational function $\psi \in F_p(X)$ over the finite field $F_p$ of $p$ elements, and integers $u$ and $H\ge 1$, we obtain a lower bound on the number consecutive values $\psi(x)$, $x = u+1, \ldots, u+H$ that belong…

In 1968, John Thompson proved that a finite group $G$ is solvable if and only if every $2$-generator subgroup of $G$ is solvable. In this paper, we prove that solvability of a finite group $G$ is guaranteed by a seemingly weaker condition:…

Thompson's theorem stated that a finite group $G$ is solvable if and only if every $2$-generated subgroup of $G$ is solvable. In this paper, we prove some new criteria for both solvability and nilpotency of a finite group using certain…

Let $G$ be a finite group and let $H$ be a proper subgroup of $G$ of minimal index. By applying an old result of Y. Berkovich, we provide a polynomial algorithm for computing $|G : H|$ for a permutation group $G$. Moreover, we find $H$…

Let $G$ be the generalized free product of two groups with an amalgamated subgroup. We propose an approach that allows one to use results on the residual $p$-finiteness of $G$ for proving that this generalized free product is residually a…

We consider factorizations of a finite group $G$ into conjugate subgroups, $G=A^{x_{1}}\cdots A^{x_{k}}$ for $A\leq G$ and $x_{1},\ldots ,x_{k}\in G$, where $A$ is nilpotent or solvable. First we exploit the split $BN$-pair structure of…

In 2000, L. H\'{e}thelyi and B. K\"{u}lshammer proved that if $p$ is a prime number dividing the order of a finite solvable group $G$, then $G$ has at least $2\sqrt{p-1}$ conjugacy classes. In this paper we show that if $p$ is large, the…

Guralnick, Kunyavskii, Plotkin and Shalev have shown that the solvable radical of a finite group $G$ can be characterized as the set of all $x\in G$ such that $<x,y>$ is solvable for all $y\in G$. We prove two generalizations of this…

We show that, there exists a constant $a$ such that, for every subgroup $H$ of a finite group $G$, the number of maximal subgroups of $G$ containing $H$ is bounded above by $a|G:H|^{3/2}$. In particular, a transitive permutation group of…

A subset $D \subseteq V $of a graph $G = (V, E)$ is a $(1, j)$-set if every vertex $v \in V \setminus D$ is adjacent to at least $1$ but not more than $j$ vertices in D. The cardinality of a minimum $(1, j)$-set of $G$, denoted as…

We give an explicit upper bound for the algebraic degree and an explicit lower bound for the absolute value of the minimum of a polynomial function on a compact connected component of a basic closed semialgebraic set when this minimum is…

If k is a commutative field and G a reductive (connected) algebraic group over k, we give bounds for the orders of the finite subgroups of G(k); these bounds depends on the type of G and on the Galois groups of the cyclotomic extensions of…

A class of groups C is root in a sense of K. W. Gruenberg if it is closed under taking subgroups and satisfies the Gruenberg condition: for any group X and for any subnormal sequence Z \leqslant Y \leqslant X with factors in C, there exists…

Most results on the value sets $V_f$ of polynomials $f \in \mathbb{F}_q[x]$ relate the cardinality $|V_f|$ to the degree of $f$. In particular, the structure of the spectrum of the class of polynomials of a fixed degree $d$ is rather well…

In this paper, we use methods from spectral graph theory to obtain some results on the sum-product problem over finite valuation rings $\mathcal{R}$ of order $q^r$ which generalize recent results given by Hegyv\'ari and Hennecart (2013).…

The domination polynomial D(G,x) is the ordinary generating function for the dominating sets of an undirected graph G=(V,E) with respect to their cardinality. We consider in this paper representations of D(G,x) as a sum over subsets of the…