English
Related papers

Related papers: On the Gap-sum and Gap-product Sequences of Intege…

200 papers

The classical Farey sequence of height $Q$ is the set of rational numbers in reduced form with denominator less than $Q$. In this paper we introduce the concept of a generalized Farey sequence. While these sequences arise naturally in the…

Dynamical Systems · Mathematics 2019-07-04 Christopher Lutsko

In this paper, we study sequences of positive numbers preserving summability. In particular, the open set property for such a family of sequences is shown. Several classes of sequences preserving summability, including polynomials, sums of…

Classical Analysis and ODEs · Mathematics 2025-06-13 Sławomir Michalik , Maria Suwińska , Bożena Tkacz

Inversion sequences are integer sequences $e=e_{1}e_{2}\dots e_{n}$ such that $0\leq e_{i}<i$ for each $i$. The study of patterns in inversion sequences was initiated by Corteel--Martinez--Savage--Weselcouch and Mansour--Shattuck in the…

Combinatorics · Mathematics 2019-06-19 Juan S. Auli , Sergi Elizalde

We introduce a subclass of linear recurrence sequences which we call poly-rational sequences because they are denoted by rational expressions closed under sum and product. We show that this class is robust by giving several…

Formal Languages and Automata Theory · Computer Science 2019-08-13 Corentin Barloy , Nathanaël Fijalkow , Nathan Lhote , Filip Mazowiecki

Base sequences BS(m,n) are quadruples (A;B;C;D) of {+1,-1}-sequences, A and B of length m and C and D of length n, the sum of whose non-periodic auto-correlation functions is zero. Base sequences and some special subclasses of BS(n+1,n)…

Combinatorics · Mathematics 2010-08-02 Dragomir Z. Djokovic

We describe a framework for systematic enumeration of families combinatorial structures which possess a certain regularity. More precisely, we describe how to obtain the differential equations satisfied by their generating series. These…

Combinatorics · Mathematics 2008-02-28 Marni Mishna

Given a positive, non-increasing sequence $a$ with finite sum equal to $1$, we consider the family of all closed subsets of $[0,1]$ whose complementary open intervals have lengths given by a rearrangement of the sequence $a$. We study the…

Classical Analysis and ODEs · Mathematics 2025-11-18 Nicolas Angelini , Ursula Molter

This is a compendium of generating functions involving single, double sums and definite integrals. These generating functions also involve special functions in both the summand function and closed form solution.

General Mathematics · Mathematics 2024-05-03 Robert Reynolds

Random residue sequences (RR) may be used in many random number applications including those related to multiple access in communications. This paper investigates variations on an algorithm to generate RR sequences that was proposed earlier…

Cryptography and Security · Computer Science 2014-06-13 Vamsi Sashank Kotagiri

A program is a finite piece of data that produces a (possibly infinite) sequence of primitive instructions. From scratch we develop a linear notation for sequential, imperative programs, using a familiar class of primitive instructions and…

Programming Languages · Computer Science 2013-04-17 Jan A. Bergstra , Alban Ponse

In this paper, we study cut generating functions for conic sets. Our first main result shows that if the conic set is bounded, then cut generating functions for integer linear programs can easily be adapted to give the integer hull of the…

Optimization and Control · Mathematics 2016-11-15 Asteroide Santana , Santanu S. Dey

We propose a recursive algorithm for identifying all finite sequences of positive integers whose product equals their sum. Our method uses solutions of strictly shorter length that are iteratively extended in pursuit of a valid solution.…

Number Theory · Mathematics 2025-08-14 Hlib Husarov , Eberhard Mayerhofer

The binomial convolution of two sequences $\{a_n\}$ and $\{b_n\}$ is the sequence whose $n$th term is $\sum_{k=0}^{n} \binom{n}{k} a_k b_{n-k}$. If $\{a_n\}$ and $\{b_n\}$ have rational generating functions then so does their binomial…

Combinatorics · Mathematics 2024-02-14 Ira M. Gessel , Ishan Kar

Given a sequence converging to zero, we consider the set of numbers which are sums of (infinite, finite, or empty) subsequences. When the original sequence is not absolutely summable, the subsum set is an unbounded closed interval which…

History and Overview · Mathematics 2013-07-09 Zbigniew Nitecki

We study the pseudorandomness of automatic sequences in terms of well-distribution and correlation measure of order 2. We detect non-random behavior which can be derived either from the functional equations satisfied by their generating…

Number Theory · Mathematics 2017-10-10 László Mérai , Arne Winterhof

We introduce two families of generators (functions) $\mathcal{G}$ that consist of entire and meromorphic functions enjoying a certain periodicity property and contain the classical Gaussian and hyperbolic secant generators. Sharp results…

Functional Analysis · Mathematics 2025-03-03 Alexander Ulanovskii , Ilya Zlotnikov

Gap balancing numbers are a certain generalization of balancing and cobalancing numbers that arise from studying the equation ${T(L)+T(B)=T(m)}$ where $T(i)$ is the $i$th triangular number. In this paper, we survey early results, attempt to…

Number Theory · Mathematics 2018-10-19 Jeremiah Bartz , Bruce Dearden , Joel Iiams

In Bayesian statistics, improper distributions and finitely additive probabilities (FAPs) are the two main alternatives to proper distributions, i.e. countably additive probabilities. Both of them can be seen as limits of proper…

Statistics Theory · Mathematics 2023-06-21 Erwan Saint Loubert Bié , Pierre Druilhet , Erwan Saint , Loubert Bié

We present several sequences of Euler sums involving odd harmonic numbers. The calculational technique is based on proper two-valued integer functions, which allow to compute these sequences explicitly in terms of zeta values only.

Number Theory · Mathematics 2021-03-11 J. Braun , D. Romberger , H. J. Bentz

Random walks are a series of up, down, and level steps that enumerate distinct paths from $(0,0)$ to $(2n,0)$, where $n$ is the semi-length of the path. We used these paths to analyze Catalan, Schr\"{o}der, and Motzkin number sequences…

Combinatorics · Mathematics 2018-11-08 Tonia Bell , Shakuan Frankson , Nikita Sachdeva , Myka Terry
‹ Prev 1 4 5 6 7 8 10 Next ›