Related papers: A problem in comparative order theory

In this note we provide some counterexamples for the conjecture of Moret\'{o} on finite simple groups, which says that any finite simple group $G$ can determined in terms of its order $|G|$ and the number of elements of order $p$, where $p$…

We study a family of generalizations of Edge Dominating Set on directed graphs called Directed $(p,q)$-Edge Dominating Set. In this problem an arc $(u,v)$ is said to dominate itself, as well as all arcs which are at distance at most $q$…

We consider the problem of sorting $n$ items, given the outcomes of $m$ pre-existing comparisons. We present a simple and natural deterministic algorithm that runs in $O(m + \log T)$ time and does $O(\log T)$ comparisons, where $T$ is the…

We introduce the \emph{Parry order} $\mathrm{Ord}_P(\beta)$, defined as the largest integer $n$ for which $\beta^n$ is a Parry number. This leads to a natural partition of the set of Perron numbers as follows: \[ \mathcal{P} = \left(…

Let $K$ be a number field, let $\phi \in K(t)$ be a rational map of degree at least 2, and let $\alpha, \beta \in K$. We show that if $\alpha$ is not in the forward orbit of $\beta$, then there is a positive proportion of primes ${\mathfrak…

A well-known conjecture asserts that there are infinitely many primes $p$ for which $p - 1$ is a perfect square. We obtain upper and lower bounds of matching order on the number of pairs of distinct primes $p,q \le x$ for which $(p - 1)(q -…

Let $FG$ be the group algebra of a finite $p$-group $G$ over a finite field $F$ of positive characteristic $p$. Let $\cd$ be an involution of the algebra $FG$ which is a linear extension of an anti-automorphism of the group $G$ to $FG$. If…

An upper dominating set in a graph is a minimal (with respect to set inclusion) dominating set of maximum cardinality. The problem of finding an upper dominating set is generally NP-hard. We study the complexity of this problem in classes…

Given two points $p, q \in \mathbb R^d$, we say that $p$ dominates $q$ and write $p \succ q$ if each coordinate of $p$ is larger than the corresponding coordinate of $q$. That is, if $p = (p^{(1)}, p^{(2)}, \ldots, p^{(d)})$ and $q =…

Let $|| \cdot ||$ denote the distance to the nearest integer and, for a prime number $p$, let $| \cdot |_p$ denote the $p$-adic absolute value. In 2004, de Mathan and Teuli\'e asked whether $\inf_{q \ge 1} \, q \cdot || q \alpha || \cdot |…

Let G be a primitive permutation group on a finite set Omega. Let p^2 divide |G|, for a prime p. We show that when G is solvable, there exists a subset of Omega whose stabilizer S has the property that 1<|S|_p<|G|_p. We offer a counting…

Let $k$ be a given positive odd integer and $p$ an odd prime. In this paper, we shall give a sufficient condition when a prime $p$ divides the order of the groups $K_{2k}(\mathbb{Z}[\zeta_m+\zeta_m^{-1}])$ and $K_{2k}(\mathbb{Z}[\zeta_m])$,…

For a prime $p$ and an arbitrary finite group $G$, we show that if $p^{2}$ does not divide the size of each conjugacy class of \emph{$p$-regular} element (element of order not divisible by $p$) in $G$, then the largest power of $p$ dividing…

We show that the $p$-part of the degree of an irreducible character of a symmetric group is completely determined by the set of vanishing elements of $p$-power order. As a corollary we deduce that the set of zeros of prime power order…

The first-order (FO) model checking problem asks, given an FO sentence $\phi$ and a graph $G$, whether $G$ is a model of $\phi$. This problem is known to be $\mathsf{AW[*]}$-hard when parameterized by the quantifier rank of the formula. A…

Let $E_1$ and $E_2$ be elliptic curves in Legendre form with integer parameters. We show there exists a constant $C$ such that for almost all primes, for all but at most $C$ pairs of points on the reduction of $E_1 \times E_2$ modulo $p$…

Let $\mathcal{S}$ be a dataset of $n$ 2-dimensional points. The top-$k$ dominating query aims to report the $k$ points that dominate the most points in $\mathcal{S}$. A point $p$ dominates a point $q$ iff all coordinates of $p$ are smaller…

For a finite group $G$, we associate the quantity $\beta(G)=\frac{|L(G)|}{|G|}$, where $L(G)$ is the subgroup lattice of $G$. Different properties and problems related to this ratio are studied throughout the paper. We determine the second…

We study the algorithmic decidability of the domination number in the Erdos-Renyi random graph model $G(n,p)$. We show that for a carefully chosen edge probability $p=p(n)$, the domination problem exhibits a strong irreducible property.…

Let P(n) denote the largest prime factor of $n \ge 2, P(1) = 1$, and let $$ \beta(n) = \sum_{p|n}p, \Beta(n) = \sum_{p^\alpha||n}\alpha p, \Beta_1(n) = \sum_{\p^\alpha||n}p^\alpha $$ denote "large" additive functions. A survey of results on…