English
Related papers

Related papers: The Behavior of a Three-Term Hofstadter-Like Recur…

200 papers

We consider a nonlinear semi-classical Schrodinger equation for which it is known that quadratic oscillations lead to focusing at one point, described by a nonlinear scattering operator. If the initial data is an energy bounded sequence, we…

Analysis of PDEs · Mathematics 2007-05-23 Remi Carles , Clotilde Fermanian-Kammerer , Isabelle Gallagher

We present a method for relevance sensitive non-monotonic inference from belief sequences which incorporates insights pertaining to prioritized inference and relevance sensitive, inconsistency tolerant belief revision. Our model uses a…

Artificial Intelligence · Computer Science 2016-08-31 Samir Chopra , Konstantinos Georgatos , Rohit Parikh

In this paper, we first give new generalizations for third-order Jacobsthal $\{J_{n}^{(3)}\}_{n\in \mathbb{N}}$ and third-order Jacobsthal-Lucas $\{j_{n}^{(3)}\}_{n\in \mathbb{N}}$ sequences for Jacobsthal and Jacobsthal-Lucas numbers.…

Combinatorics · Mathematics 2019-03-29 Gamaliel Cerda-Morales

The numbers we study in this paper are of the form $B_{n, p}(k)$, which is the number of binary words of length $n$ that contain the word $p$ (as a subsequence) exactly $k$ times. Our motivation comes from the analogous study of pattern…

Combinatorics · Mathematics 2023-06-14 Krishna Menon , Anurag Singh

Harvey Friedman gives a comparatively short description of an ``unimaginably large'' number $n(3)$ , beyond, e.g. the values $$ A(7,184)< A({7198},158386) < n(3)$$ of Ackermann's function - but finite. We implement Friedman's combinatorial…

Combinatorics · Mathematics 2023-03-07 Michael Vielhaber , Mónica del Pilar Canales Chacón , Sergio Jara Ceballos

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 $(u(n))_{n\in\mathbb{N}}$ be an arithmetic progression of natural integers in base $b\in\mathbb{N}\setminus \{0,1\}$. We consider the following sequences: $s(n)=\overline{u(0)u(1)\cdots u(n) }^b$ formed by concatenating the first $n+1$…

Combinatorics · Mathematics 2025-08-05 Florian Luca , Bertrand Teguia Tabuguia

Ordinary orthogonal polynomials are uniquely characterized by the three term recurrence relations up to an overall multiplicative constant. We show that the newly discovered M-indexed orthogonal polynomials satisfy 3+2M term recurrence…

Mathematical Physics · Physics 2015-06-15 Satoru Odake

In this paper, we present some criteria for the $2$-$q$-log-convexity and $3$-$q$-log-convexity of combinatorial sequences, which can be regarded as the first column of certain infinite triangular array $[A_{n,k}(q)]_{n,k\geq0}$ of…

Combinatorics · Mathematics 2018-07-04 Bao-Xuan Zhu

We study the recursions $A(n) = A(n-a-A^k(n-b)) + A(A^k(n-b))$ where $a \geq 0$, $b \geq 1$ are integers and the superscript $k$ denotes a $k$-fold composition, and also the recursion $C(n) = C(n-s-C(n-1)) + C(n-s-2-C(n-3))$ where $s \geq…

Combinatorics · Mathematics 2014-07-03 Abraham Isgur , Mustazee Rahman

A positive linear recurrence sequence is of the form $H_{n+1} = c_1 H_n + \cdots + c_L H_{n+1-L}$ with each $c_i \ge 0$ and $c_1 c_L > 0$, with appropriately chosen initial conditions. There is a notion of a legal decomposition (roughly,…

Number Theory · Mathematics 2016-07-19 Steven J. Miller , Dawn Nelson , Zhao Pan , Huanzhong Xu

We show any subset $A\subset\mathbb{N}$ with positive upper Banach density contains the pattern $\{m,m+[n\alpha],\dots,m+k[n\alpha]\}$, for some $m\in\mathbb{N}$ and $n=p-1$ for some prime $p$, where…

Dynamical Systems · Mathematics 2015-07-08 Wenbo Sun

We study matrix three term relations for orthogonal polynomials in two variables constructed from orthogonal polynomials in one variable. Using the three term recurrence relation for the involved univariate orthogonal polynomials, the…

Classical Analysis and ODEs · Mathematics 2016-03-24 Misael Marriaga , Teresa E. Pérez , Miguel A. Piñar

We consider real sequences $(f_n)$ that satisfy a linear recurrence with constant coefficients. We show that the density of the positivity set of such a sequence always exists. In the special case where the sequence has no positive…

Combinatorics · Mathematics 2007-05-23 Jason P. Bell , Stefan Gerhold

We consider a family of nonlinear rational recurrences of odd order which was introduced by Heideman and Hogan. All of these recurrences have the Laurent property, implying that for a particular choice of initial data (all initial values…

Combinatorics · Mathematics 2017-03-03 Andrew N. W. Hone , Chloe Ward

We prove that many sequences of positive numbers $(a_n)$ defined by finite linear difference equations $a_{n+k}=c_{k-1}a_{n+k-1}+...+c_0a_n$ with suitable non negative reals coefficients $c_i$ satisfy Bendford's Law on the first digit in…

Dynamical Systems · Mathematics 2010-08-18 Hugues Deligny , Paul Jolissaint

The present paper investigates consequence relations that are both non-monotonic and paraconsistent. More precisely, we put the focus on preferential consequence relations, i.e. those relations that can be defined by a binary preference…

Artificial Intelligence · Computer Science 2007-05-23 Jonathan Ben-Naim

This paper is the continuation of \cite{htl}, where we deal with Lucas sequences. Here we study integers represented by integer sequences which satisfy binary recursive relations. In case of non-degenerate sequences we give bounds for the…

Number Theory · Mathematics 2024-08-12 L. Hajdu , R. Tijdeman

We consider some bilinear recurrences that have applications in number theory. The explicit solution of a general three-term bilinear recurrence relation of fourth order is given in terms of the Weierstrass sigma function for an associated…

Exactly Solvable and Integrable Systems · Physics 2008-07-17 A. N. W. Hone

Neural sequence-to-sequence models are currently the dominant approach in several natural language processing tasks, but require large parallel corpora. We present a sequence-to-sequence-to-sequence autoencoder (SEQ^3), consisting of two…

Computation and Language · Computer Science 2019-06-11 Christos Baziotis , Ion Androutsopoulos , Ioannis Konstas , Alexandros Potamianos