English
Related papers

Related papers: Zero sum cycles in complete digraphs

200 papers

In this paper we study conditions for the vanishing of Abelian integrals on families of zero-dimensional cycles. That is, for any rational function $f(z)$, characterize all rational functions $g(z)$ and zero-sum integers $\{n_i\}$ such that…

Dynamical Systems · Mathematics 2015-03-17 Amelia Álvarez Sánchez , José Luis Bravo Trinidad , Pavao Mardesić

Kaplanski's Zero Divisor Conjecture envisions that for a torsion-free group G and an integral domain R, the group ring R[G] does not contain non-trivial zero divisors. We define the length of an element a in R[G] as the minimal non-negative…

Rings and Algebras · Mathematics 2012-03-01 Pascal Schweitzer

In this paper, we study the minimal number of elements of maximal order within a zero-sumfree sequence in a finite Abelian p-group. For this purpose, in the general context of finite Abelian groups, we introduce a new number, for which…

Number Theory · Mathematics 2011-10-18 Benjamin Girard

We prove that for every compactum X and every integer $n \geq 2$ there are a compactum Z of $\dim \leq n$ and a surjective $UV^{n-1}$-map $r: Z \lo X$ having the property that: for every finitely generated abelian group G and every integer…

General Topology · Mathematics 2007-05-23 Michael Levin

Let $G$ be a finite group and $D_{2n}$ be the dihedral group of $2n$ elements. For a positive integer $d$, let $\mathsf{s}_{d\mathbb{N}}(G)$ denote the smallest integer $\ell\in \mathbb{N}_0\cup \{+\infty\}$ such that every sequence $S$…

Combinatorics · Mathematics 2020-04-01 Kevin Zhao

Recently it was shown (by the author) that every graph of size $q$ (the number of edges) and minimum degree $\delta$ is hamiltonian if $q\le\delta^2+\delta-1$ (arXiv:1107.2201v1). In this paper we present the exact analog of this result for…

Combinatorics · Mathematics 2011-12-13 Zh. G. Nikoghosyan

Let $C_{n}$ be a cycle of length $n$. As an application of Szemer\'{e}di's regularity lemma, {\L}uczak ($R(C_n,C_n,C_n)\leq (4+o(1))n$, J. Combin. Theory Ser. B, 75 (1999), 174--187) in fact established that…

Combinatorics · Mathematics 2018-09-21 Meng Liu , Yusheng Li , Qizhong Lin , Chunlin You

We count the ordered sum-free triplets of subsets in the group $\mathbb{Z}/p\mathbb{Z}$, i.e., the triplets $(A,B,C)$ of sets $A,B,C \subset \mathbb{Z}/p\mathbb{Z}$ for which the equation $a+b=c$ has no solution with $a\in A$, $b \in B$ and…

Combinatorics · Mathematics 2021-08-20 Igor Araujo , József Balogh , Ramon I. Garcia

Let A be an abelian surface over F_q, the field of q elements. The rational points on A/\F_q form an abelian group A(\F_q) \simeq \Z/n_1\Z \times \Z/n_1 n_2 \Z \times \Z/n_1 n_2 n_3\Z \times\Z/n_1 n_2 n_3 n_4\Z. We are interested in knowing…

Number Theory · Mathematics 2013-07-04 Chantal David , Derek Garton , Zachary Scherr , Arul Shankar , Ethan Smith , Lola Thompson

This paper establishes a classification of the critical numbers for restricted sumsets in finite abelian groups, determining them exactly for even-order groups and bounding them for odd-order groups, while revealing a fundamental structural…

Combinatorics · Mathematics 2026-02-12 Bocong Chen , Jing Huang

We use the \emph{unit-graphs} and the \emph{special unit-digraphs} on matrix rings to show that every $n \times n$ nonzero matrix over $\Bbb F_q$ can be written as a sum of two $\operatorname{SL}_n$-matrices when $n>1$. We compute the…

Combinatorics · Mathematics 2017-10-25 Yeşim Demiroğlu Karabulut

Let $G = (V,E)$ be a finite graph and let $(\mathbb{A},+)$ be an abelian group with identity 0. Then $G$ is \textit{$\mathbb{A}$-magic} if and only if there exists a function $\phi$ from $E$ into $\mathbb{A} - \{0\}$ such that for some $c…

Combinatorics · Mathematics 2015-09-01 J. P. Georges , D. Mauro , K. Wash

A number is perfect if it is the sum of its proper divisors; here we call a finite group `perfect' if its order is the sum of the orders of its proper normal subgroups. (This conflicts with standard terminology but confusion should not…

Group Theory · Mathematics 2007-05-23 Tom Leinster

Let $G$ be a finite abelian group with $\exp(G)$ the exponent of $G$. Then $\mathsf W(G)$ denotes the set of cross numbers of minimal zero-sum sequences over $G$ and $\mathsf w(G)$ denotes the set of all cross numbers of non-trivial…

Combinatorics · Mathematics 2024-03-13 Aqsa Bashir , Wolfgang A. Schmid

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…

Group Theory · Mathematics 2022-01-11 Luca Sabatini

Ancel, Dobrowolski, and Grabowski (Studia Math., 1994) proved that every countable discrete subgroup of the additive group of a normed space is free Abelian, hence isomorphic to the direct sum of a certain number of copies of the additive…

Functional Analysis · Mathematics 2024-08-07 Tomasz Kania , Ziemowit Kostana

Let $A$ be a finite, nonempty subset of an abelian group. We show that if every element of $A$ is a sum of two other elements, then $A$ has a nonempty zero-sum subset. That is, a (finite, nonempty) sum-full subset of an abelian group is not…

Number Theory · Mathematics 2021-05-20 Vsevolod F. Lev , Janos Nagy , Peter Pal Pach

Let $s$ be a positive integer. Our goal is to find all finite abelian groups $G$ that contain a $2$-subset $A$ for which the undirected Cayley graph $\Gamma(G,A)$ has diameter at most $s$. We provide a complete answer when $G$ is cyclic,…

Combinatorics · Mathematics 2024-12-11 Bela Bajnok , W. Kyle Beatty

An acyclic set in a digraph is a set of vertices that induces an acyclic subgraph. In 2011, Harutyunyan conjectured that every planar digraph on $n$ vertices without directed 2-cycles possesses an acyclic set of size at least $3n/5$. We…

Combinatorics · Mathematics 2014-07-31 Noah Golowich , David Rolnick

Let $F$ be a graph which contains an edge whose deletion reduces its chromatic number. We prove tight bounds on the number of copies of $F$ in a graph with a prescribed number of vertices and edges. Our results extend those of Simonovits,…

Combinatorics · Mathematics 2009-05-20 Dhruv Mubayi