English
Related papers

Related papers: A New Approach to the Hofstadter $Q$-Recurrence

200 papers

Reconstructing a hypothetical recurrence equation from the first terms of an infinite sequence is a classical and well-known technique in experimental mathematics. We propose a variation of this technique which can succeed with fewer input…

Symbolic Computation · Computer Science 2022-07-11 Manuel Kauers , Christoph Koutschan

I propose and investigate the use of continuous functional equations for the study of meta-Fibonacci integer sequences. This exploratory study includes three sequences with quite different behavior: Conway's famous sequence $A(n)=…

Statistical Mechanics · Physics 2026-03-19 Klaus Pinn

We consider a first neighbor interaction where agents are spread through a uni-dimensional network. Some agents are also connected to a hub, or master node, who has preferential values (or orientation). The role of master node is to…

Physics and Society · Physics 2020-07-15 Anderson A. Ferreira , Leandro A. Ferreira , Fernando F. Ferreira

In this numerical study, recurrence quantification analysis of chaotic trajectories is explored to detect atypical dynamical behaviour in non-linear Hamiltonian systems. An ensemble of initial conditions is evolved up to a maximum iteration…

Chaotic Dynamics · Physics 2025-07-11 Matheus S. Palmero , Flavio H. Graciano , Edson D. Leonel , Juliano A. de Oliveira

Our original results refer to multivariate recurrences: discrete multitime diagonal recurrence, bivariate recurrence, trivariate recurrence, solutions tailored to particular situations, second order multivariate recurrences, characteristic…

Dynamical Systems · Mathematics 2015-06-16 Cristian Ghiu , Raluca Tuliga , Constantin Udriste , Ionel Tevy

We introduce the first cut-free nested sequent systems for first-order modal logics that admit increasing, decreasing, constant, and empty domains along with so-called general path conditions and seriality. We obtain such systems by means…

Logic in Computer Science · Computer Science 2023-11-09 Tim S. Lyon

Interaction nets are a form of restricted graph rewrite system that can serve as a graphical or textual programming language. As such, benefits include one-step confluence, ease of parallelism and explicit garbage collection. However, some…

Programming Languages · Computer Science 2024-10-02 Shinya Sato

Quantum circuits that generate coherent superpositions of stochastic processes are key to many downstream quantum-accelerated tasks, such as risk analysis, importance sampling, and DNA sequencing. However, traditional methods for designing…

Quantum Physics · Physics 2026-03-26 Ximing Wang , Chengran Yang , Chidambaram Aditya Somasundaram , Jayne Thompson , Mile Gu

Algorithms for computing equilibria, optima, and fixed points in nonconvex problems often depend sensitively on practitioner-chosen initial conditions. When uniqueness of a solution is of interest, a common heuristic is to run such…

Econometrics · Economics 2026-02-17 Moeen Nehzati , Diego Cussen

Nested conditions are used, among other things, as a graphical way to express first order formulas ruling the applicability of a graph transformation rule to a given match. In this paper, we propose (for the first time) a notion of…

Logic in Computer Science · Computer Science 2024-08-13 Arend Rensink , Andrea Corradini

Systems of dynamical interactions between competing species can be used to model many complex systems, and can be mathematically described by {\em random} networks. Understanding how patterns of activity arise in such systems is important…

Adaptation and Self-Organizing Systems · Physics 2016-01-21 Nick McCullen , Thomas Wagenknecht

For $p, q\in \mathbb{N}$, a finite nonempty set $F$ is said to be $(p,q)$-Schreier (or maximal $(p,q)$-Schreier, respectively) if $q\min F\ge p|F|$ (or $q\min F = p|F|$, respectively). For $n\in \mathbb{N}$, let $$\mathcal{S}^{p/q}_{n}\ :=\…

Combinatorics · Mathematics 2026-02-17 Hung Viet Chu , Zachary Louis Vasseur

We use the fact that certain cosets of the stabilizer of points are pairwise conjugate in a symmetric group $S_n$ in order to construct recurrence relations for enumerating certain subsets of $S_n$. Occasionally one can find `closed form'…

Combinatorics · Mathematics 2016-08-18 S. P. Glasby

While many production-ready and robust algorithms are available for the task of recommendation systems, many of these systems do not take the order of user's consumption into account. The order of consumption can be very useful and matters…

Information Retrieval · Computer Science 2022-05-03 Mehdi Soleiman Nejad , Meysam Varasteh , Hadi Moradi , Mohammad Amin Sadeghi

In this paper the approach to obtaining nonrecurrent formulas for some recursively defined sequences is illustrated. The most interesting result in the paper is the formula for the solution of quadratic map-like recurrence. Also, some…

Combinatorics · Mathematics 2019-11-05 Sergei Kazenas

We consider the $k$-nested sum of integer powers, $F(n,m,k)$, defined as repeated partial sums of the classical Faulhaber polynomials. We provide an explicit recurrence relation relating $F(n,m,k)$ to sums of lower power $m-1$ and higher…

Combinatorics · Mathematics 2025-11-21 Alexander R. Povolotsky

Patterns are fundamental to human cognition, enabling the recognition of structure and regularity across diverse domains. In this work, we focus on structural repeats, patterns that arise from the repetition of hierarchical relations within…

Computation and Language · Computer Science 2025-04-15 Zeng Ren , Xinyi Guan , Martin Rohrmeier

We exhibit a three parameter infinite family of quadratic recurrence relations inspired by the well known Somos sequences. For one infinite subfamily we prove that the recurrence generates an infinite sequence of integers by showing that…

Combinatorics · Mathematics 2009-04-07 Paul Heideman , Emilie Hogan

Stochastic resetting breaks detailed balance and drives the formation of nonequilibrium steady states . Here, we consider a chain of diffusive processes $x_i(t)$ that interact unilaterally: at random time intervals, the process $x_n$…

Statistical Mechanics · Physics 2025-02-06 Henry Alston , Callum Britton , Thibault Bertrand

We use the theory of q-characters to establish a number of short exact sequences in the category of finite-dimensional representations of the quantum affine groups of types A and B. That allows us to introduce a set of 3-term recurrence…

Quantum Algebra · Mathematics 2012-12-07 E. Mukhin , C. A. S. Young