No Arabic abstract
We study a natural discrete Bochner-type inequality on graphs, and explore its merit as a notion of curvature in discrete spaces. An appealing feature of this discrete version seems to be that it is fairly straightforward to compute this notion of curvature parameter for several specific graphs of interest - particularly, abelian groups, slices of the hypercube, and the symmetric group under various sets of generators. We further develop this notion by deriving Buser-type inequalities (a la Ledoux), relating functional and isoperimetric constants associated with a graph. Our derivations provide a tight bound on the Cheeger constant (i.e., the edge-isoperimetric constant) in terms of the spectral gap, for graphs with nonnegative curvature, particularly, the class of abelian Cayley graphs - a result of independent interest.
A subset $B$ of a group $G$ is called a difference basis of $G$ if each element $gin G$ can be written as the difference $g=ab^{-1}$ of some elements $a,bin B$. The smallest cardinality $|B|$ of a difference basis $Bsubset G$ is called the difference size of $G$ and is denoted by $Delta[G]$. The fraction $eth[G]:=frac{Delta[G]}{sqrt{|G|}}$ is called the difference characteristic of $G$. Using properies of the Galois rings, we prove recursive upper bounds for the difference sizes and characteristics of finite Abelian groups. In particular, we prove that for a prime number $pge 11$, any finite Abelian $p$-group $G$ has difference characteristic $eth[G]<frac{sqrt{p}-1}{sqrt{p}-3}cdotsup_{kinmathbb N}eth[C_{p^k}]<sqrt{2}cdotfrac{sqrt{p}-1}{sqrt{p}-3}$. Also we calculate the difference sizes of all Abelian groups of cardinality $<96$.
Hovey introduced $A$-cordial labelings as a generalization of cordial and harmonious labelings cite{Hovey}. If $A$ is an Abelian group, then a labeling $f colon V (G) rightarrow A$ of the vertices of some graph $G$ induces an edge labeling on $G$; the edge $uv$ receives the label $f (u) + f (v)$. A graph $G$ is $A$-cordial if there is a vertex-labeling such that (1) the vertex label classes differ in size by at most one and (2) the induced edge label classes differ in size by at most one. Patrias and Pechenik studied the larger class of finite abelian groups $A$ such that all path graphs are $A$-cordial. They posed a conjecture that all but finitely many paths graphs are $A$-cordial for any Abelian group $A$. In this paper we solve this conjecture. Moreover we show that all cycle graphs are $A$-cordial for any Abelian group $A$ of odd order.
Let $overrightarrow{G}$ be a directed graph with no component of orderless than~$3$, and let $Gamma$ be a finite Abelian group such that $|Gamma|geq 4|V(overrightarrow{G})|$ or if $|V(overrightarrow{G})|$ is large enough with respect to an arbitrarily fixed $varepsilon>0$ then $|Gamma|geq (1+varepsilon)|V(overrightarrow{G})|$. We show that there exists an injective mapping $varphi$ from $V(overrightarrow{G})$ to the group $Gamma$ such that $sum_{xin V(C)}varphi(x) = 0$ for every connected component $C$ of $overrightarrow{G}$, where $0$ is the identity element of $Gamma$. Moreover we show some applications of this result to group distance magic labelings.
Let $G$ be a finite group. We will say that $M$ and $S$ form a textsl{complete splitting} (textsl{splitting}) of $G$ if every element (nonzero element) $g$ of $G$ has a unique representation of the form $g=ms$ with $min M$ and $sin S$, and $0$ has a such representation (while $0$ has no such representation). In this paper, we determine the structures of complete splittings of finite abelian groups. In particular, for complete splittings of cyclic groups our description is more specific. Furthermore, we show some results for existence and nonexistence of complete splittings of cyclic groups and find a relationship between complete splittings and splittings for finite groups.
Let $(G, +)$ be an abelian group. In 2004, Eliahou and Kervaire found an explicit formula for the smallest possible cardinality of the sumset $A+A$, where $A subseteq G$ has fixed cardinality $r$. We consider instead the smallest possible cardinality of the difference set $A-A$, which is always greater than or equal to the smallest possible cardinality of $A+A$ and can be strictly greater. We conjecture a formula for this quantity and prove the conjecture in the case that $G$ is a cyclic group or a vector space over a finite field. This resolves a conjecture of Bajnok and Matzke on signed sumsets.