中文
相关论文

相关论文: Order and Chaos in Hofstadter's Q(n) Sequence

200 篇论文

Kronecker sequences $(k \alpha \mod 1)_{k=1}^{\infty}$ for some irrational $\alpha > 0$ have played an important role in many areas of mathematics. It is possible to associate to each finite segment $(k \alpha \mod 1)_{k=1}^{n}$ a…

组合数学 · 数学 2025-09-05 François Clément

The ring of q-character polynomials is a q-analog of the classical ring of character polynomials for the symmetric groups. This ring consists of certain class functions defined simultaneously on the groups $Gl_n(F_q)$ for all n, which we…

组合数学 · 数学 2021-06-23 Adithya Balachandran , Nir Gadish , Andrew Huang , Siwen Sun

Picking permutations at random, the expected number of k-cycles is known to be 1/k and is, in particular, independent of the size of the permuted set. This short note gives similar size-independent statistics of finite general linear…

组合数学 · 数学 2019-10-29 Nir Gadish

We say that the polynomial sequence $(Q^{(\lambda)}_n)$ is a semiclassical Sobolev polynomial sequence when it is orthogonal with respect to the inner product $$ <p, r>_S=<{{\bf u}} ,{p\, r}> +\lambda <{{\bf u}}, {{\mathscr D}p \,{\mathscr…

经典分析与常微分方程 · 数学 2011-09-06 R. S. Costas-Santos , J. J. Moreno-Balcázar

Consider a generic random element $F_\infty= \sum_{\text{finite}} \lambda_k (N^2_k -1)$ in the second Wiener chaos with a finite number of non-zero coefficients in the spectral representation where $(N_k)_{k \ge 1}$ is a sequence of i.i.d…

概率论 · 数学 2018-02-20 Ehsan Azmoodeh , Dario Gasbarra

We consider arithmetic sequences, here defined as ordered lists of positive integers. Any such a sequence can be cast onto a quantum state, enabling the quantification of its `surprise' through von Neumann entropy. We identify typical…

量子物理 · 物理学 2025-01-14 Ruge Lin , Germán Sierra , José I. Latorre

One possible data encryption scheme is related to stream ciphers, which use a sufficiently long pseudo-random sequence. To increase the cryptographic strength of the cipher, linear shift algorithms (generated by linear recurrent sequences…

经典分析与常微分方程 · 数学 2026-03-12 Vitaly M. Khamitov , Dmitriy Dmitrishin , Alexander Stokolos , Daniel Gray

The Fibonacci numbers are the prototypical example of a recursive sequence, but grow too quickly to enumerate sets of integer partitions. The same is true for the other classical sequences $a(n)$ defined by Fibonacci-like recursions: the…

组合数学 · 数学 2023-03-22 Cristina Ballantine , George Beck

In this work, we investigate $H$-recurrence which is defined by $H(n) = H(n-H(n-2)) + H(n-H(n-3))$ thanks to a recent approach to certain recurrences such as Conway and Hofstadter $Q$ recursions.

动力系统 · 数学 2022-11-14 Altug Alkan , Orhan Ozgur Aybar , Zehra Akdeniz

In the paper, from the point of view of recurrent numbers of the Jacobsthal type, the Collatz problem with the general aq+-1 function of conjecture odd positive integers q from the set of natural numbers is investigated. Formulated…

综合数学 · 数学 2023-08-08 Petro Kosobutskyy

We show that for the classical Fibonacci sequence (Fn) and the Lucas sequence (Ln) the following identity holds for every integer n >= 2: (n-1)Fn equals the sum from k=1 to n-1 of Lk multiplied by F(n-k). Equivalently, this gives a…

数论 · 数学 2025-09-03 Tapan Suthar

A beautiful theorem of Zeckendorf states that every integer can be written uniquely as a sum of non-consecutive Fibonacci numbers $\{F_n\}_{n=1}^{\infty}$. Lekkerkerker proved that the average number of summands for integers in $[F_n,…

数论 · 数学 2011-10-27 Steven J. Miller , Yinghui Wang

Every k entries in a permutation can have one of k! different relative orders, called patterns. How many times does each pattern occur in a large random permutation of size n? The distribution of this k!-dimensional vector of pattern…

组合数学 · 数学 2023-09-14 Chaim Even-Zohar

The holomorphic multiplicative chaos (HMC) is a holomorphic analogue of the Gaussian multiplicative chaos. It arises naturally as the limit in large matrix size of the characteristic polynomial of Haar unitary, and more generally…

概率论 · 数学 2025-02-21 Joseph Najnudel , Elliot Paquette , Nick Simm , Truong Vu

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…

数论 · 数学 2011-04-11 Lenny Jones

For any field k and any integers m,n with 0 <= 2m <= n+1, let W_n be the k-vector space of sequences (x_0,...,x_n), and let H_m be the subset of W_n consisting of the sequences that satisfy a degree-m linear recursion, that is, for which…

组合数学 · 数学 2007-05-23 Noam D. Elkies

We introduce the category Pstem[n] of n-stems, with a functor P[n] from spaces to Pstem[n]. This can be thought of as the n-th order homotopy groups of a space. We show how to associate to each simplicial n-stem Q an (n+1)-truncated…

代数拓扑 · 数学 2014-10-01 Hans-Joachim Baues , David Blanc

For every odd prime $p$ and every integer $n\geq 12$ there is a Heisenberg group of order $p^{5n/4+O(1)}$ that has $p^{n^2/24+O(n)}$ pairwise nonisomorphic quotients of order $p^{n}$. Yet, these quotients are virtually indistinguishable.…

群论 · 数学 2015-01-23 Mark L. Lewis , James B. Wilson

We studied complex spectra of spin-two boson systems represented by E$\otimes$e and E$\otimes (b_1+b_2)$ Jahn-Teller models. For E$\otimes$e, at particular rotation quantum numbers we found a coexistence of up to three regions of the…

强关联电子 · 物理学 2009-11-11 E. Majernikova , S. Shpyrko

Denote by p_k the k-th power sum symmetric polynomial n variables. The interpretation of the q-analogue of the binomial coefficient as Hilbert function leads us to discover that n consecutive power sums in n variables form a regular…

交换代数 · 数学 2018-08-30 Aldo Conca , Christian Krattenthaler , Junzo Watanabe