Related papers: Directed cycles with zero weight in $\mathbb{Z}_p^…

In this paper, we prove a tight minimum degree condition in general graphs for the existence of paths between two given endpoints, whose lengths form a long arithmetic progression with common difference one or two. This allows us to obtain…

Given a prime power $p^d$ with $p$ a prime and $d$ a positive integer, we classify the finite groups $G$ with $p^{2d}$ dividing $|G|$ in which all subgroups of order $p^d$ are complemented and the finite groups $G$ having a normal…

The stack number of a directed acyclic graph $G$ is the minimum $k$ for which there is a topological ordering of $G$ and a $k$-coloring of the edges such that no two edges of the same color cross, i.e., have alternating endpoints along the…

We prove that for every graph $H$ of maximum degree at most $3$ and for every positive integer $q$ there is a finite $f=f(H,q)$ such that every $K_f$-minor contains a subdivision of $H$ in which every edge is replaced by a path whose length…

We study a version of the lights out game played on directed graphs. For a digraph $D$, we begin with a labeling of $V(D)$ with elements of $\mathbb{Z}_k$ for $k \ge 2$. When a vertex $v$ is toggled, the labels of $v$ and any vertex that…

In this article, we study the Euler's factorial series $F_p(t)=\sum_{n=0}^\infty n!t^n$ in $p$-adic domain under the Generalized Riemann Hypothesis. First, we show that if we consider primes in $k\varphi(m)/(k+1)$ residue classes in the…

Dean conjectured that for each integer $k \ge 3$, every graph with minimum degree at least $k$ has a cycle whose length is divisible by $k$; this conjecture is known to be true for all $k\neq 5$. For $k\in\{3,4\}$, stronger statements are…

In 1935, Erd\H{o}s proved that the sums $f_k=\sum_n 1/(n\log n)$, over integers $n$ with exactly $k$ prime factors, are bounded by an absolute constant, and in 1993 Zhang proved that $f_k$ is maximized by the prime sum $f_1=\sum_p 1/(p\log…

Let $P$ be a simple polytope with $n-d = 2$, where $d$ is the dimension and $n$ is the number of facets. The graph of such a polytope is also called a grid. It is known that the directed random walk along the edges of $P$ terminates after…

In this short note we extend some results obtained in \cite{Gazaki2015}. First, we prove that for an abelian variety $A$ with good ordinary reduction over a finite extension of $\mathbb{Q}_p$ with $p$ an odd prime, the Albanese kernel of…

We show the existence of an absolute constant $\alpha>0$ such that, for every $k \geq 3$, $G:=\mathop{\mathrm{Sym}}(k)$, and for every $H \leqslant G$ of index at least $3$, one has $|H/[H,H]| \leq |G:H|^{\alpha/ \log \log |G:H|}$. This…

A famous conjecture of Graham asserts that every set $A \subseteq \mathbb{Z}_p \setminus \{0\}$ can be ordered so that all partial sums are distinct. Although this conjecture was recently proved for sufficiently large primes by Pham and…

Let $k$ and $\ell$ be positive integers. A cycle with two blocks $C(k,\ell)$ is a digraph consisting of two internally vertex disjoint directed paths of lengths $k$ and $\ell$ with the same initial vertex and terminal vertex.…

Let $k$ be an algebraically closed field of characteristic $p > 0$ and let $G$ be a connected reductive algebraic group over $k$. Under some standard hypothesis on $G$, we give a direct approach to the finite $W$-algebra $U(\mathfrak g,e)$…

A sequence of elements of a finite group G is called a zero-sum sequence if it sums to the identity of G. The study of zero-sum sequences has a long history with many important applications in number theory and group theory. In 1989…

Let $L$ be a set of positive integers. We call a (directed) graph $G$ an $L$\emph{-cycle graph} if all cycle lengths in $G$ belong to $L$. Let $c(L,n)$ be the maximum number of cycles possible in an $n$-vertex $L$-cycle graph (we use…

A well known generalisation of Dirac's theorem states that if a graph $G$ on $n\ge 4k$ vertices has minimum degree at least $n/2$ then $G$ contains a $2$-factor consisting of exactly $k$ cycles. This is easily seen to be tight in terms of…

There are several results in the literature concerning $p$-groups $G$ with a maximal elementary abelian normal subgroup of rank $k$ due to Thompson, Mann and others. Following an idea of Sambale we obtain bounds for the number of generators…

In this paper, we give the following result: If $D$ is a digraph of order $n$, and if $d_{D}^{+}(u) + d_{D}^{-}(v) \ge n$ for every two distinct vertices $u$ and $v$ with $(u, v) \notin A(D)$, then $D$ has a directed $2$-factor with exactly…

A particular case of Caccetta-H\"{a}ggkvist conjecture, says that a digraph of order $n$ with minimum out-degree at least $1/3n$ contains a directed cycle of length at most 3. Recently, Kral, Hladky and Norine proved that a digraph of order…