Related papers: Orders for which there exist exactly six or seven …

In this note we introduce and characterize a class of finite groups for which the element orders satisfy a certain inequality. This is contained in some well-known classes of finite groups.

A graph $G$ is $k$-ordered if for any distinct vertices $v_1, v_2, \ldots, v_k \in V(G)$, it has a cycle through $v_1, v_2, \ldots, v_k$ in order. Let $f(k)$ denote the minimum integer so that every $f(k)$-connected graph is $k$-ordered.…

After Landau, we define g(n) as the maximal order of a permutation of the symmetric group S(n) on n letters. We give several estimates of the largest prime divisor of g(n).

Given a group $G$ and an integer $n\geq2$ we construct a new group $\tilde{{\cal K}}(G,n)$. Although this construction naturally occurs in the context of finding new invariants for complex algebraic surfaces, it is related to the theory of…

We establish several new bounds for the number of conjugacy classes of a finite group, all of which involve the maximal number c of conjugacy classes of a normal subgroup fixed by some element of a suitable subset of the group. To apply…

This paper continues the study of two numbers that are associated with Lie groups. The first number is $N(G,m)$, the number of conjugacy classes of elements in $G$ whose order divides $m$. The second number is $N(G,m,s)$, the number of…

A finite group $G$ is called $k$-factorizable if for every ordered factorization $|G|=a_1\cdots a_k$ into integers each greater than $1$ there exist subsets $A_1,\dots,A_k\subseteq G$ such that $|A_i|=a_i$ for each $i$ and $G=A_1\cdots…

We determine the groups of minimal order in which all groups of order n can embedded for 1 < n < 16. We further determine the order of a minimal group in which all groups or order n or less can be embedded, also for 1 < n < 16.

In 1954 B. H. Neumann discovered that if G is a group in which all conjugacy classes are finite with bounded size, then the derived group G' is finite. Later (in 1957) Wiegold found an explicit bound for the order of G'. We study groups in…

We present the first fixed-length elementary closed-form expressions for the prime-counting function, $\pi(n)$, and the $n$-th prime number, $p(n)$. These expressions are arithmetic terms, requiring only a finite and fixed number of…

Lehmer's totient problem asks whether there exists any composite number $n$ such that $\varphi(n) \, \mid \, (n-1)$, where $\varphi$ is Euler totient function. It is known that if any such $n$ exists, it must be Carmichael and $n >…

We call $n$ a cyclic number if every group of order $n$ is cyclic. It is implicit in work of Dickson, and explicit in work of Szele, that $n$ is cyclic precisely when $\gcd(n,\phi(n))=1$. With $C(x)$ denoting the count of cyclic $n\le x$,…

In this note we study the complexity of some generalizations of the notion of $st$-numbering. Suppose that given some functions $f$ and $g$, we want to order the vertices of a graph such that every vertex $v$ is preceded by at least $f(v)$…

We show that Morley's theorem on the number of countable models of a countable first-order theory becomes an undecidable statement when extended to second-order logic. More generally, we calculate the number of equivalence classes 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…

Let $G$ be a nonabelian finite group and let $d$ be an irreducible character degree of $G$. Then there is a positive integer $e$ so that $|G| = d(d+e)$. Snyder has shown that if $e > 1$, then $|G|$ is bounded by a function of $e$. This…

We introduce six new algebraic invariants for rational difference equations. We use these invariants to perform a reduction of order in each case. This reduction of order allows us to find forbidden sets in each case. These six cases…

The number of inversions is a statistic on permutation groups measuring the degree to which the entries of a permutation are out of order. We provide a generalization of that statistic by introducing the statistic number of pseudoinversions…

This paper describes a new link between combinatorial number theory and geometry. The main result states that A is a finite set of relatively prime positive integers if and only if A = (K-K) \cap N, where K is a compact set of real numbers…

The "Gr\"unbaum Incidence Calculus" is the common name of a collection of operations introduced by Branko Gr\"unbaum to produce new $(n_{4})$ configurations from various input configurations. In a previous paper, we generalized two of these…