English
Related papers

Related papers: Structure of a sequence with prescribed zero-sum s…

200 papers

Let $G$ be a multiplicatively written finite group. We denote by $\mathsf E(G)$ the smallest integer $t$ such that every sequence of $t$ elements in $G$ contains a product-one subsequence of length $|G|$. In 1961, Erd\H{o}s, Ginzburg and…

Combinatorics · Mathematics 2021-07-19 Weidong Gao , Yuanlin Li , Yongke Qu

For a finite abelian group $G$, the generalized Erd\H{o}s--Ginzburg--Ziv constant $\mathsf s_{k}(G)$ is the smallest $m$ such that a sequence of $m$ elements in $G$ always contains a $k$-element subsequence which sums to zero. If $n =…

Combinatorics · Mathematics 2021-12-03 Jared Bitz , Sarah Griffith , Xiaoyu He

Let G be an additive, finite abelian group. The critical number $\mathsf{cr}(G)$ of $G$ is the smallest positive integer $\ell$ such that for every subset $S \subset G \setminus \{0\}$ with $|S| \ge \ell$ the following holds: Every element…

Number Theory · Mathematics 2008-10-20 Michael Freeze , Weidong Gao , Alfred Geroldinger

In 2002, Kamae and Zamboni introduced maximal pattern complexity and determined that any aperiodic sequence must have maximal pattern complexity at least $2k$. In 2006, Kamae and Rao examined the maximal pattern complexity of sequences over…

Dynamical Systems · Mathematics 2026-04-22 Casey Schlortt

We prove that any finite abelian group $G$ contains a collection of not too many subsets with a special structure, so that for every subset $A$ of $G$ with a small doubling, there is a member $F$ of the collection that is fully contained in…

Combinatorics · Mathematics 2025-09-03 Noga Alon , Huy Tuan Pham

Let $G$ be a finite group, written multiplicatively. The Davenport constant of $G$ is the smallest positive integer $D(G)$ such that every sequence of $G$ with $D(G)$ elements has a non-empty subsequence with product $1$. Let $D_{2n}$ be…

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

We investigate finite effect algebras and their classification. We show that an effect algebra with $n$ elements has at least $n-2$ and at most $(n-1)(n-2)/2$ nontrivial defined sums. We characterize finite effect algebras with these…

Quantum Physics · Physics 2026-02-13 Stan Gudder , Teiko Heinosaari

We study Lie algebras generated by extremal elements (i.e., elements spanning inner ideals of L) over a field of characteristic distinct from 2. We prove that any Lie algebra generated by a finite number of extremal elements is finite…

Rings and Algebras · Mathematics 2007-05-23 Arjeh M. Cohen , Anja Steinbach , Rosane Ushirobira , David B. Wales

Let s and k be integers with s \geq 2 and k \geq 2. Let g_k^{(s)}(n) denote the cardinality of the largest subset of the set {1,2,..., n} that contains no geometric progression of length k whose common ratio is a power of s. Let r_k(\ell)…

Number Theory · Mathematics 2016-05-04 Melvyn B. Nathanson , Kevin O'Bryant

Let $k\geq 2$ and $n\geq 3(k-1)$. Let $\mathcal{F}$ and $\mathcal{G}$ be families of $k$-element subsets of an $n$-element set. Suppose that $|F\cap G|\geq 2$ for all $F\in\mathcal{F}$ and $G\in\mathcal{G}$. We show that…

Combinatorics · Mathematics 2025-03-20 Hajime Tanaka , Norihide Tokushige

A sequence $(a_{n}) $ in an Abelian group is called a $T$-sequence if there exists a Hausdorff group topology on $G$ in which $(a_{n}) $ converges to $0$. For a $T$-sequence $(a_{n}) $, $\tau_{(a_{n}) } $ denotes the strongest group…

General Topology · Mathematics 2019-02-07 D. Dikranjan , I. Protasov

Let $t$ and $k$ be a positive integers, and let $I_k=\{i\in \mathbb{Z}:\; -k\leq i\leq k\}$. Let $\mathsf{s}'_t(I_k)$ be the smallest positive integer $\ell$ such that every zero-sum sequence $S$ over $I_k$ of length $|S|\ge \ell$ contains…

Combinatorics · Mathematics 2016-12-02 C. Augspurger , M. Minter , K. Shoukry , P. Sissokho , K. Voss

The Binary Two-Up Sequence is the lexicographically earliest sequence of distinct nonnegative integers with the property that the binary expansion of the n-th term has no 1-bits in common with any of the previous floor(n/2) terms. We show…

Combinatorics · Mathematics 2022-09-12 Michael De Vlieger , Thomas Scheuerle , Rémy Sigrist , N. J. A. Sloane , Walter Trump

This paper presents results on structures in P based on tools developed from subjects of elementary number theory. Key findings are: The arithmetical sequence H = (+-3*2; 1) is in Z the smallest superset of P \ {3, 2}. H is a semigroup. A…

General Mathematics · Mathematics 2018-12-27 Michael H. Hebert

A real-valued sequence $f = \{ f(n) \}_{n \in \mathbb{N}}$ is said to be second-order holonomic if it satisfies a linear recurrence $f (n + 2) = P (n) f (n + 1) + Q (n) f (n)$ for all sufficiently large $n$, where $P, Q \in \mathbb{R}(x)$…

Discrete Mathematics · Computer Science 2025-12-09 Fugen Hagihara , Akitoshi Kawamura

We prove that the sequence $(N_k)_k$, where each $N_k$ is defined as the smallest positive integer $n$ for which the $n$th term $g_{k,n}$ of the $k$-G\"obel sequence is not an integer, is unbounded.

Combinatorics · Mathematics 2025-02-26 Yuh Kobayashi , Shin-ichiro Seki

In this article, we study the maximal cross number of long zero-sumfree sequences in a finite Abelian group. Regarding this inverse-type problem, we formulate a general conjecture and prove, among other results, that this conjecture holds…

Number Theory · Mathematics 2010-10-19 Benjamin Girard

Let $G$ be a finite abelian group. For any positive integers $d$ and $m$, let $\varphi_G(d)$ be the number of elements in $G$ of order $d$ and $\mathsf M(G,m)$ be the set of all zero-sum sequences of length $m$. In this paper, for any…

Combinatorics · Mathematics 2022-02-01 Mao-Sheng Li , Hanbin Zhang

The aim of this paper is to present a complete description of the structure of subsets S of an orderable group G satisfying |S^2| = 3|S|-2 and <S> is non-abelian.

Group Theory · Mathematics 2015-11-11 G. A. Freiman , M. Herzog , P. Longobardi , M. Maj , A. Plagne , D. J. S. Robinson , Y. V. Stanchescu

A well-known result of Shelah and Spencer tells us that the almost sure theory for first order language on the random graph sequence $\left\{G(n, cn^{-1})\right\}$ is not complete. This paper proposes and proves what the complete set of…

Probability · Mathematics 2018-02-02 Moumanti Podder
‹ Prev 1 4 5 6 7 8 10 Next ›