English
Related papers

Related papers: Recurrence Relations for $S$-Legal Index Differenc…

200 papers

The Fibonacci sequence is periodic modulo every positive integer $m>1$, and perhaps more surprisingly, each period has exactly 1, 2, or 4 zeros that are evenly spaced, which also holds true for more general $K$-Fibonacci sequences. This…

Number Theory · Mathematics 2025-02-03 Brennan Benfield , Oliver Lippard

The classical Erd\H{o}s-Ginzburg-Ziv constant of a group $G$ denotes the smallest positive integer $\ell$ such that any sequence $S$ of length at least $\ell$ contains a zero-sum subsequence of length $\exp(G)$. In a recent paper, Caro and…

Combinatorics · Mathematics 2023-05-01 Simone Costa , Stefano Della Fiore

We investigate abelian repetitions in Sturmian words. We exploit a bijection between factors of Sturmian words and subintervals of the unitary segment that allows us to study the periods of abelian repetitions by using classical results of…

Formal Languages and Automata Theory · Computer Science 2013-05-10 Gabriele Fici , Alessio Langiu , Thierry Lecroq , Arnaud Lefebvre , Filippo Mignosi , Élise Prieur-Gaston

The $\mathbb{Z}_2$-index ${\rm ind}(X)$ of a $\mathbb{Z}_2$-CW-complex $X$ is the smallest number $n$ such that there is a $\mathbb{Z}_2$-map from $X$ to $S^n$. Here we consider $S^n$ as a $\mathbb{Z}_2$-space by the antipodal map.…

Algebraic Topology · Mathematics 2019-04-02 Takahiro Matsushita

Define a sequence of positive integers by the rule that a(n) = n for 1 <= n <= 3, and for n >= 4, a(n) is the smallest number not already in the sequence which has a common factor with a(n-2) and is relatively prime to a(n-1). We show that…

A generalization of the well-known Fibonacci sequence is the $k$-Fibonacci sequence with some fixed integer $k\ge 2$. The first $k$ terms of this sequence are $0,0, \ldots, 1$, and each term afterwards is the sum of the preceding $k$ terms.…

Number Theory · Mathematics 2025-07-21 Jhon J. Bravo , Pranabesh Das , Jose L. Herrera , John C. Saunders

Let $\mathcal S$ be a multiset of integers. We say $\mathcal S$ is a $\textit{zero-sum sequence}$ if the sum of its elements is 0. We study zero-sum sequences whose elements lie in the interval $[-k,k]$ such that no subsequence of length…

Number Theory · Mathematics 2018-08-24 Aaron Berger

We establish a combinatorial connection between the sequence $(i_{n,k})$ counting the involutions on $n$ letters with $k$ descents and the sequence $(a_{n,k})$ enumerating the semistandard Young tableaux on $n$ cells with $k$ symbols. This…

Combinatorics · Mathematics 2008-03-14 Marilena Barnabei , Flavio Bonetti , Matteo Silimbani

The Ulam sequence is given by $a_1 =1, a_2 = 2$, and then, for $n \geq 3$, the element $a_n$ is defined as the smallest integer that can be written as the sum of two distinct earlier elements in a unique way. This gives the sequence $1, 2,…

Combinatorics · Mathematics 2018-08-28 Noah Kravitz , Stefan Steinerberger

For an abelian group $G$ and an integer $t > 0$, the modified Erd\H{o}s-Ginzburg-Ziv constant $s'_t(G)$ is the smallest integer $\ell$ such that any zero-sum sequence of length at least $\ell$ with elements in $G$ contains a zero-sum…

Combinatorics · Mathematics 2019-07-29 Trajan Hammonds

In the base phi expansion any natural number is written uniquely as a sum of powers of the golden mean with coefficients 0 and 1, where it is required that the product of two consecutive digits is always 0. We tackle the problem of…

Number Theory · Mathematics 2023-05-16 F. Michel Dekking

A number $s$ is the sum of the entries of the inverse of an $n \times n, (n \geq 3)$ upper triangular matrix with entries from the set $\{0, 1\}$ if and only if $s$ is an integer lying between $2-F_{n-1}$ and $2+F_{n-1}$, where $F_n$ is the…

Combinatorics · Mathematics 2025-03-24 Manami Chatterjee , K. C. Sivakumar

For positive integers $m$ and $n$, define $f(m,n)$ to be the smallest integer such that any subset $A$ of the $m \times n$ integer grid with $|A| \geq f(m,n)$ contains a rectangle; that is, there are $x\in [m]$ and $y \in [n]$ and…

Combinatorics · Mathematics 2013-10-29 Jeremy F. Alm , Jacob Manske

For an arbitrary homogeneous linear recurrence sequence of order d with constant coefficients, we derive recurrence relations for all subsequences with indices in arithmetic progression. The coefficients of these recurrences are given…

Number Theory · Mathematics 2016-11-29 Daniel Birmajer , Juan B. Gil , Michael D. Weiner

The Steinitz constant in dimension $d$ is the smallest value $c(d)$ such that for any norm on $\mathbb{R}^{ d}$ and for any finite zero-sum sequence in the unit ball, the sequence can be permuted such that the norm of each partial sum is…

Optimization and Control · Mathematics 2022-11-28 Timm Oertel , Joseph Paat , Robert Weismantel

For positive integers $s$ and $L \geq 3$, Berkovich and Uncu (Ann. Comb. $23$ ($2019$) $263$--$284$) conjectured an inequality between the sizes of two closely related sets of partitions whose parts lie in the interval $\{s, \ldots, L+s\}$.…

Combinatorics · Mathematics 2021-08-16 Damanvir Singh Binner , Amarpreet Rattan

We provide another approach to Friedland's result that the topological entropy $h$ of a symmetric nearest-neighbor subshift is computable. Instead of the previous algebraic technique, our approach is mostly combinatorial and involves only…

Dynamical Systems · Mathematics 2026-05-19 Vuong Bui

Aperiodic algebras are infinite dimensional algebras with generators corresponding to an element of the aperiodic set. These algebras proved to be an useful tool in studying elementary excitations that can propagate in multilayered…

Rings and Algebras · Mathematics 2023-03-07 Daniele Corradetti , David Chester , Raymond Aschheim , Klee Irwin

A string attractor of a string $T[1..|T|]$ is a set of positions $\Gamma$ of $T$ such that any substring $w$ of $T$ has an occurrence that crosses a position in $\Gamma$, i.e., there is a position $i$ such that $w = T[i..i+|w|-1]$ and the…

Combinatorics · Mathematics 2026-02-19 Mutsunori Banbara , Hideo Bannai , Peaker Guo , Dominik Köppl , Takuya Mieno , Yoshio Okamoto

A lattice is a set of all the integer linear combinations of certain linearly independent vectors. One of the most important concepts on lattice is the successive minima which is of vital importance from both theoretical and practical…

Information Theory · Computer Science 2018-05-16 Jinming Wen