English
Related papers

Related papers: On unit-weighted zero-sum constants of $\mathbb Z_…

200 papers

We study the properties of a sequence cn defined by the recursive relation \[\frac{c_0}{n + 1}+\frac{c_1}{n + 2}+\ldots+\frac{c_n}{2n + 1}=0\] for $n>1$ and $c_0=1$. This sequence also has an alternative definition in terms of certain norm…

Number Theory · Mathematics 2019-01-15 Alexander Kalmynin , Petr Kosenko

Let $\mathcal{A}$ be a sequence of $rk$ terms which is made up of $k$ distinct integers each appearing exactly $r$ times in $\mathcal{A}$. The sum of all terms of a subsequence of $\mathcal{A}$ is called a subsequence sum of $\mathcal{A}$.…

Number Theory · Mathematics 2022-11-24 Jagannath Bhanja , Ram Krishna Pandey

We prove that if $(v_i)$ is a normalized basic sequence and X is a Banach space such that every normalized weakly null sequence in X has a subsequence that is dominated by $(v_i)$, then there exists a uniform constant $C\geq1$ such that…

Functional Analysis · Mathematics 2007-05-23 Daniel Freeman

We show that if $A=\{a_1,a_2,..., a_k\}$ is a monotone increasing set of numbers, and the differences of the consecutive elements are all distinct, then $|A+B|\geq c|A|^{1/2}|B|$ for any finite set of numbers $B$. The bound is tight up to…

Combinatorics · Mathematics 2007-05-23 J. Solymosi

A starting point in the investigation of intersecting systems of subsets of a finite set is the elementary observation that the size of a family of pairwise intersecting subsets of a finite set [n]={1,...,n}, denoted by 2^{[n]}, is at most…

Combinatorics · Mathematics 2017-03-03 Eva Czabarka , Glenn Hurlbert , Vikram Kamat

Let $G=C_n\oplus C_{mn}$ with $n\geq 2$ and $m\geq 1$, and let $k\in [0,n-1]$. It is known that any sequence of $mn+n-1+k$ terms from $G$ must contain a nontrivial zero-sum of length at most $mn+n-1-k$. The associated inverse question is to…

Number Theory · Mathematics 2021-09-22 David J. Grynkiewicz , Chao Liu

Let $M_n$ be an $n\times n$ signed random combinatorial matrix whose rows are independent and uniformly distributed over the set of $\{-1,0,1\}$-vectors with exactly $n/2$ zero coordinates. Despite the dependence induced by the row…

Probability · Mathematics 2026-04-14 Kexin Yu

A decomposition of a natural number n is a sequence of consecutive natural numbers that sums to n. We construct a one-to-one correspondence between the odd factors of a natural number and its decompositions. We study the decompositions by…

History and Overview · Mathematics 2007-05-23 Wai Yan Pong

By well known results of probability theory, any sequence of random variables with bounded second moments has a subsequence satisfying the central limit theorem and the law of the iterated logarithm in a randomized form. In this paper we…

Probability · Mathematics 2017-07-28 I. Berkes , R. Tichy

Let $h\geq 2$ be a positive integer. For any subset $\mathcal{A}\subset \mathbb{Z}_n$, let $h^{\wedge}\mathcal{A}$ be the set of the elements of $\mathbb{Z}_n$ which are sums of $h$ distinct elements of $\mathcal{A}$. In this paper, we…

Number Theory · Mathematics 2018-10-19 Min Tang , Meng-Ting Wei

The problem of expressing a selfadjoint element that is zero on every bounded trace as a finite sum (or a limit of sums) of commutators is investigated in the setting of C*-algebras of finite nuclear dimension. Upper bounds -- in terms of…

Operator Algebras · Mathematics 2013-09-03 Leonel Robert

Let $G$ be a finite group, written multiplicatively. The Davenport constant of $G$ is the smallest positive integer $d$ such that every sequence of $G$ with $d$ elements has a non-empty subsequence with product $1$. Let $C_n \simeq \mathbb…

Number Theory · Mathematics 2017-02-01 Fabio Enrique Brochero Martínez , Sávio Ribas

Let $G$ be an abelian group, let $S$ be a sequence of terms $s_1,s_2,...,s_{n}\in G$ not all contained in a coset of a proper subgroup of $G$, and let $W$ be a sequence of $n$ consecutive integers. Let $$W\odot S=\{w_1s_1+...+w_ns_n:\;w_i…

Number Theory · Mathematics 2011-06-29 David J. Grynkiewicz , Andreas Philipp , Vadim Ponomarenko

Let $\left\{a_1, \dots, a_n\right\} \subset \mathbb{N}$ be a set of positive integers, $a_n$ denoting the largest element, so that for any two of the $2^n$ subsets the sum of all elements is distinct. Erd\H{o}s asked whether this implies…

Number Theory · Mathematics 2023-01-03 Stefan Steinerberger

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 ||.|| be a norm in R^d whose unit ball is B. Assume that V\subset B is a finite set of cardinality n, with \sum_{v \in V} v=0. We show that for every integer k with 0 \le k \le n, there exists a subset U of V consisting of k elements…

Metric Geometry · Mathematics 2020-12-04 Gergely Ambrus , Imre Barany , Victor Grinberg

We introduce a concept of the bounded rank (with respect to a positive constant) for unital C*-algebras as a modification of the usual real rank and present a series of conditions insuring that bounded and real ranks coincide. These…

Operator Algebras · Mathematics 2007-05-23 Alex Chigogidze , Vesko Valov

The Index Conjecture in zero-sum theory states that when $n$ is coprime to $6$ and $k$ equals $4$, every minimal zero-sum sequence of length $k$ modulo $n$ has index $1$. While other values of $(k,n)$ have been studied thoroughly in the…

Number Theory · Mathematics 2025-10-15 Andrew Pendleton

For a finite abelian group $G$ and a positive integer $d$, let $\mathsf s_{d \mathbb N} (G)$ denote the smallest integer $\ell \in \mathbb N_0$ such that every sequence $S$ over $G$ of length $|S| \ge \ell$ has a nonempty zero-sum…

Number Theory · Mathematics 2010-07-05 Alfred Geroldinger , David J. Grynkiewicz , Wolfgang A. Schmid

For a fixed positive $\epsilon$, we show the existence of a constant $C_\epsilon$ with the following property: Given a $\pm1$-edge-labeling $c:E(K_n)\to \{ -1,1\}$ of the complete graph $K_n$ with $c(E(K_n))=0$, and a spanning forest $F$ of…

Combinatorics · Mathematics 2021-02-23 Johannes Pardey , Dieter Rautenbach