English
Related papers

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

200 papers

A Filbert matrix is a matrix whose (i,j) entry is 1/F_(i+j-1), where F_n is the nth Fibonacci number. The inverse of the n by n Filbert matrix resembles the inverse of the n by n Hilbert matrix, and we prove that it shares the property of…

Rings and Algebras · Mathematics 2007-05-23 Thomas M. Richardson

Let G be a finite additive abelian group with exponent exp(G)=n>1 and let A be a nonempty subset of {1,...,n-1}. In this paper, we investigate the smallest positive integer $m$, denoted by s_A(G), such that any sequence {c_i}_{i=1}^m with…

Combinatorics · Mathematics 2011-12-02 Sukumar Das Adhikari , David J. Grynkiewicz , Zhi-Wei Sun

Let $\epsilon\in \{-1,1\}$. A sequence of prime numbers $p_1, p_2, p_3, ...$, such that $p_i=2p_{i-1}+\epsilon$ for all $i$, is called a {\it Cunningham chain} of the first or second kind, depending on whether $\epsilon =1$ or -1…

Number Theory · Mathematics 2011-04-11 Lenny Jones

Trellises are crucial graphical representations of codes. While conventional trellises are well understood, the general theory of (tail-biting) trellises is still under development. Iterative decoding concretely motivates such theory. In…

Information Theory · Computer Science 2014-02-27 David Conti , Nigel Boston

Let $G$ be an additive finite abelian group, and let $\mathrm{disc}(G)$ denote the smallest positive integer $t$ with the property that every sequence $S$ over $G$ with length $|S|\geq t $ contains two nonempty zero-sum subsequences of…

Combinatorics · Mathematics 2025-10-17 Wanzhen Hui , Xue Li

We prove that certain sequences of finite continued fractions associated with a 2-periodic continued fraction with period a,b>0 are moment sequences of discrete signed measures supported in the interval [-1,1], and we give necessary and…

Classical Analysis and ODEs · Mathematics 2009-02-10 Christian Berg , Antonio J. Durán

Steiner and Schwarz symmetrizations, and their most important relatives, the Minkowski, Minkowski-Blaschke, fiber, inner rotational, and outer rotational symmetrizations, are investigated. The focus is on the convergence of successive…

Metric Geometry · Mathematics 2022-05-06 Gabriele Bianchi , Richard J. Gardner , Paolo Gronchi

Through the following, we establish the conditions which allow us to express recursive sequences of real numbers, enumerated through the recurrence relation a_{n+1} = Aa_n + Ba_{n-1}, by means of algebraic equations in two variables of…

Number Theory · Mathematics 2008-03-25 Luigi Cimmino

Let $D^+$ be the first octant of the Euclidean space and consider the integral cube grid $G$ in $D^+$. The intersections of each line with $G$ form an infinite sequence of three letters which can be considered as an extension of well-known…

Combinatorics · Mathematics 2017-09-13 Mahdi Saleh , Majid Jahangiri

Let $\mathcal{S}$ be the set of all positive-definite, symmetrizable integer matrices with non-zero upper and lower diagonal and $\mathcal{T}$ to be the set of all positive-definite real symmetric matrices with nonzero upper diagonal such…

Number Theory · Mathematics 2024-01-24 Srijonee Shabnam Chaudhury

The `spider theorem' for a general Frobenius algebra $A$, classifies all maps $A^{\otimes m}\to A^{\otimes n}$ that are built from the operations and, in a graphical representation, represented by a {\it connected} diagram. Here the algebra…

Quantum Algebra · Mathematics 2021-11-29 Shahn Majid , Konstanze Rietsch

In a capacitated directed graph, it is known that the set of all min-cuts forms a distributive lattice [1], [2]. Here, we describe this lattice as a regular predicate whose forbidden elements can be advanced in constant parallel time after…

Data Structures and Algorithms · Computer Science 2025-12-23 Robert Streit , Vijay K. Garg

Let $(L_n)_{n \geq 1}$ be the sequence of Lucas numbers, defined recursively by $L_1 := 1$, $L_2 := 3$, and $L_{n + 2} := L_{n + 1} + L_n$, for every integer $n \geq 1$. We determine the asymptotic behavior of $\log \operatorname{lcm} (L_1…

Number Theory · Mathematics 2021-08-10 Carlo Sanna

The Steinitz lemma, a classic from 1913, states that $a_1,\ldots,a_n$, a sequence of vectors in $\R^d$ with $\sum_1^n a_i=0$, can be rearranged so that every partial sum of the rearranged sequence has norm at most $2d\max \|a_i\|$. In the…

Combinatorics · Mathematics 2024-02-13 Imre Barany

Let $G$ be a finite cyclic group of order $n \ge 2$. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot ... \cdot (n_lg)$ where $g\in G$ and $n_1,..., n_l \in [1,\ord(g)]$, and the index $\ind (S)$ of $S$ is defined as…

Combinatorics · Mathematics 2011-03-14 Weidong Gao , Yuanlin Li , Jiangtao Peng , Chris Plyley , Guoqing Wang

An integer sequence is called realizable if it is the count of periodic points of some map. The Fibonacci sequence $(F_n)$ does not have this property, and the Fibonacci sequence sampled along the squares $(F_{n^2})$ also does not have this…

Number Theory · Mathematics 2025-08-18 Patrick Moss , Tom Ward

The Fibonacci sequence (FS) possesses exceptional mathematical properties that have captivated mathematicians, scientists, and artists across centuries. Its intriguing nature lies in its profound connection to the golden ratio, as well as…

Signal Processing · Electrical Eng. & Systems 2023-06-09 JM Gorriz

Let $G$ be a finite abelian group, and let $m>0$ with $\exp(G)\mid m$. Let $s_{m}(G)$ be the generalized Erd\H{o}s-Ginzburg-Ziv invariant which denotes the smallest positive integer $d$ such that any sequence of elements in $G$ of length…

Combinatorics · Mathematics 2013-05-01 Haiyan Zhang , Guoqing Wang

In this note, starting with a little-known result of Kuo, I derive a recurrence relation for the Bernoulli numbers $B_{2 n}$, $n$ being any positive integer. This new recurrence seems advantageous in comparison to other known formulae since…

Number Theory · Mathematics 2018-05-10 F. M. S. Lima

In this paper, we study the three-term nested recurrence relation $B(n)=B(n-B(n-1))+B(n-B(n-2))+B(n-B(n-3))$ subject to initial conditions where the first $N$ terms are the integers $1$ through $N$. This recurrence is the three-term analog…

Number Theory · Mathematics 2024-06-04 Nathan Fox
‹ Prev 1 8 9 10 Next ›