English
Related papers

Related papers: Zero sum cycles in complete digraphs

200 papers

Suppose $G$ is a finite abelian group and $S$ is a sequence of elements in $G$. For any element $g$ of $G$, let $N_g(S)$ denote the number of subsequences of $S$ with sum $g$. The purpose of this paper is to investigate the lower bound for…

Combinatorics · Mathematics 2011-01-25 Gerard Jennhwa Chang , Sheng-Hua Chen , Yongke Qu , Guoqing Wang , Haiyan Zhang

The problem of finding upper bounds for minimal vertex number of graphs with a given automorphism group is addressed in this article for the case of cyclic $2$-groups. We show that for any natural $n\ge 2$ there is an undirected graph…

Combinatorics · Mathematics 2015-04-06 Peteris Daugulis

In this paper, building among others on earlier works by U. Krause and C. Zahlten (dealing with the case of cyclic groups), we obtain a new upper bound for the little cross number valid in the general case of arbitrary finite Abelian…

Number Theory · Mathematics 2011-10-11 Benjamin Girard

Bollob\'as and Nikiforov conjectured that for any graph $G \neq K_n$ with $m$ edges \[ \lambda_1^2+\lambda_2^2\le \bigg( 1-\frac{1}{\omega(G)}\bigg)2m\] where $\lambda_1$ and $\lambda_2$ denote the two largest eigenvalues of the adjacency…

Combinatorics · Mathematics 2024-07-30 Hitesh Kumar , Shivaramakrishna Pragada

In this paper, we study commutative zero-divisor semigroups determined by graphs. We prove a uniqueness theorem for a class of graphs. We show two classes of graphs that have no corresponding semigroups. In particular, any complete graph…

Rings and Algebras · Mathematics 2007-05-23 Tongsuo Wu , Li Chen

In this paper, we give a recipe for producing infinitely many non-divisible codimension $2$ cycles on a product of two or more very general Abelian varieties. In the process, we introduce the notion of "field of definition" for cycles in…

Algebraic Geometry · Mathematics 2020-11-09 Humberto A. Diaz

We prove a refinement of the flat wall theorem of Robertson and Seymour to undirected group-labelled graphs $(G,\gamma)$ where $\gamma$ assigns to each edge of an undirected graph $G$ an element of an abelian group $\Gamma$. As a…

Combinatorics · Mathematics 2024-06-25 Robin Thomas , Youngho Yoo

Let $G$ be a finite abelian group. The Erd{\H o}s--Ginzburg--Ziv constant $\mathsf s (G)$ of $G$ is defined as the smallest integer $l \in \mathbb N$ such that every sequence \ $S$ \ over $G$ of length $|S| \ge l$ \ has a zero-sum…

Number Theory · Mathematics 2011-03-07 Yushuang Fan , Weidong Gao , Qinghai Zhong

Let $X$ be a compact tree, $f$ be a continuous map from $X$ to itself, $End(X)$ be the number of endpoints and $Edg(X)$ be the number of edges of $X$. We show that if $n>1$ has no prime divisors less than $End(X)+1$ and $f$ has a cycle of…

Dynamical Systems · Mathematics 2016-01-25 Alexander M. Blokh

We prove that for every integer $k$, there exists $\varepsilon > 0$ such that for every n-vertex graph $G$ with no pivot-minor isomorphic to $C_k$, there exist disjoint sets $A,B \subseteq V(G)$ such that $|A|,|B| \geq \varepsilon n$, and…

Combinatorics · Mathematics 2021-07-02 Jaehoon Kim , Sang-il Oum

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot...\cdot(n_kg)$ where $g\in G$ and $n_1,\cdots,n_k\in[1,{\hbox{\rm ord}}(g)]$, and the index $\ind S$ of $S$ is defined to be the minimum…

Number Theory · Mathematics 2014-02-03 Li-meng Xia , Caixia Shen

Gallai asked in 1984 if any $k$-critical graph on $n$ vertices contains at least $n$ distinct $(k-1)$-critical subgraphs. The answer is trivial for $k\leq 3$. Improving a result of Stiebitz, Abbott and Zhou proved in 1995 that for all…

Combinatorics · Mathematics 2019-07-02 Jie Ma , Tianchi Yang

Let E be an elliptic curve over Q, and let n=>1. The central object of study of this article is the division field Q(E[n]) that results by adjoining to Q the coordinates of all n-torsion points on E(Q). In particular, we classify all curves…

Number Theory · Mathematics 2021-06-21 Enrique Gonzalez-Jimenez , Alvaro Lozano-Robledo

Let X be an algebraic curve over Q and t a non-constant Q-rational function on X such that Q(t) is a proper subfield of Q(X). For every integer n pick a point P_n on X such that t(P_n)=n. We conjecture that, for large N, among the number…

Number Theory · Mathematics 2016-10-14 Yuri Bilu , Florian Luca

We construct indecomposable cycles in the motivic cohomology group $H^3_{{\mathcal M}}(A,{\mathbb Q}(2))$ where $A$ is an Abelian surface over a number field or the function field of a base. When $A$ is the self product of the universal…

Number Theory · Mathematics 2022-08-18 Ramesh Sreekantan

Let $G$ be a finite Abelian group. For a subset $S \subseteq G$, let $T_3(S)$ denote the number of length three arithemtic progressions in $S$ and Prob[$S$] $= \frac{1}{|S|^2}\sum_{x,y \in S} 1_S(x+y)$. For any $q \ge 1$ and $\alpha \in…

Combinatorics · Mathematics 2018-09-12 Zachary Chase

Given a positive integer $N$ and real number $\alpha\in [0, 1]$, let $m(\alpha,N)$ denote the minimum, over all sets $A\subset \mathbb{Z}/N\mathbb{Z}$ of size at least $\alpha N$, of the normalized count of 3-term arithmetic progressions…

Combinatorics · Mathematics 2014-09-11 Pablo Candela , Olof Sisask

We generalize Abel's classical theorem on linear equivalence of divisors on a Riemann surface. For every closed submanifold $M^d \subset X^n$ in a compact oriented Riemannian $n$--manifold, or more generally for any $d$--cycle $Z$ relative…

Differential Geometry · Mathematics 2008-12-02 Johan L. Dupont , Franz W. Kamber

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…

Combinatorics · Mathematics 2017-03-30 Mitchell Lee

The basic theme of this paper is the fact that if $A$ is a finite set of integers, then the sum and product sets cannot both be small. A precise formulation of this fact is Conjecture 1 below due to Erd\H os-Szemer\'edi [E-S]. (see also…

Combinatorics · Mathematics 2007-05-23 Mei-Chu Chang
‹ Prev 1 8 9 10 Next ›