中文
相关论文

相关论文: Complete Padovan sequences in finite fields

200 篇论文

Many sequences of $p$-adic integers project modulo $p^\alpha$ to $p$-automatic sequences for every $\alpha \geq 0$. Examples include algebraic sequences of integers, which satisfy this property for every prime $p$, and some cocycle…

动力系统 · 数学 2017-05-02 Eric Rowland , Reem Yassawi

Given $F= \mathbb{F}_{p^{t}}$, a field with $p^t$ elements, where $p $ is a prime power, $t\geq 7$, $n$ are positive integers and $f=f_1/f_2$ is a rational function, where $f_1, f_2$ are relatively prime, irreducible polynomials with…

数论 · 数学 2023-01-09 Aakash Choudhary , R. K. Sharma

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

Consider percolation on the triangular lattice. Let $\kappa(p)$ be the free energy at the zero field. We show that $$|\kappa'''(p)| \leq |p-p_c|^{-1/3+o(1)} \mbox{ if } p \neq p_c.$$ Furthermore, we show that there exists a sequence…

概率论 · 数学 2020-03-03 Yu Zhang

Let $n,k\in\mathbb{N}$ and let $p_{n}$ denote the $n$th prime number. We define $p_{n}^{(k)}$ recursively as $p_{n}^{(1)}:=p_{n}$ and $p_{n}^{(k)}=p_{p_{n}^{(k-1)}}$, that is, $p_{n}^{(k)}$ is the $p_{n}^{(k-1)}$th prime. In this note we…

数论 · 数学 2022-01-06 Błażej Żmija

Let $G$ be a finite primitive permutation group and let $\kappa(G)$ be the number of conjugacy classes of derangements in $G$. By a classical theorem of Jordan, $\kappa(G) \geqslant 1$. In this paper we classify the groups $G$ with…

群论 · 数学 2014-04-01 Timothy C. Burness , Hung P. Tong-Viet

A positive integer n is called a covering number if there are some distinct divisors n_1,...,n_k of n greater than one and some integers a_1,...,a_k such that Z is the union of the residue classes a_1(mod n_1),...,a_k(mod n_k). A covering…

数论 · 数学 2007-05-23 Zhi-Wei Sun

Let $p$ be an odd prime with $2$-adic expansion $\sum_{i=0}^kp_i\cdot2^i$. For a sequence $\underline{a}=(a(t))_{t\ge 0}$ over $\mathbb{F}_{p}$, each $a(t)$ belongs to $\{0,1,\ldots, p-1\}$ and has a unique $2$-adic expansion…

信息论 · 计算机科学 2014-02-20 Yupeng Jiang , DongDai Lin

We define a sequence of positive integers recursively, where each term is determined as follows: starting with a given positive integer, if the term is odd, the next is the sum of its positive divisors; if the term is even, the subsequent…

数论 · 数学 2025-06-04 Ritesh Dwivedi , Rohit Yadav

For the sequence defined by \[ a(n) = \frac{n^2 - n - 1}{\gcd\big(n^2 - n - 1,\, b(n-3) + n\,b(n-4)\big)} \] Where $b(n) = (n+2)\big(b(n-1) - b(n-2)\big),$ with initial conditions $b(-1) = 0$ and $b(0) = 1$, we find that $a(n)$ contains…

综合数学 · 数学 2025-09-15 Mohammed Bouras

An infinite sequence $\langle{u_n}\rangle_{n\in\mathbb{N}}$ of real numbers is holonomic (also known as P-recursive or P-finite) if it satisfies a linear recurrence relation with polynomial coefficients. Such a sequence is said to be…

For any cardinal $\kappa \geq 2$, there is a unique complete real tree whose points all have valence $\kappa$. In this note, we show that, when $\kappa \geq 3$, it is necessary to assume completeness. More precisely, we show that there…

度量几何 · 数学 2025-11-06 Pénélope Azuelos

This paper provides counterexamples to a previously conjectured upper bound on the first index $n_0$ at which a zero appears in constant term sequences of the form $A_p(n) = ct(P^n) \mod p$, where $P(t) \in \mathbb{Z}[t, t^{-1}]$. The…

数论 · 数学 2025-04-29 Justin Offutt

We prove that any prime $p$ satisfying $\phi(p-1)\leq (p-1)/4$ contains two consecutive quadratic non-residues modulo $p$ neither of which is a primitive root modulo $p$.

数论 · 数学 2017-10-16 Tamiru Jarso , Tim Trudgian

The aim of this article is to give some properties of the so-called Padovan sequence $(T_n)_{n \ge 0}$ defined by $$ T_{n+3}=T_{n+1}+T_n \forall n \in \mathbb{N}, T_1=T_2=T_3=1$$ that is divisibility properties, periods, identities.

数论 · 数学 2019-05-21 Alain Faisant

In this paper, we define a variant of Fibonacci-like sequences that we call prime Fibonacci sequences, where one takes the sum of the previous two terms and returns the smallest odd prime divisor of that sum as the next term. We prove that…

数论 · 数学 2015-07-20 Jeremy Alm , Taylor Herald

A sequence in the additive group ${\mathbb Z}_n$ of integers modulo $n$ is called $n$-zero-free if it does not contain subsequences with length $n$ and sum zero. The article characterizes the $n$-zero-free sequences in ${\mathbb Z}_n$ of…

组合数学 · 数学 2007-05-23 Svetoslav Savchev , Fang Chen

First, we show that the sum-free set generated by the period-doubling sequence is not $\kappa$-regular for any $\kappa\geq 2$. Next, we introduce a generalization of the period-doubling sequence, which we call the period-$k$-folding…

组合数学 · 数学 2019-11-06 Jean-Paul Allouche , Jeffrey Shallit , Zhixiong Wen , Wen Wu , Jiemeng Zhang

For any prime number $p$, positive integers $m, k, n$ satisfying ${\rm gcd}(p,n)=1$ and $\lambda_0\in \mathbb{F}_{p^m}^\times$, we prove that any $\lambda_0^{p^k}$-constacyclic code of length $p^kn$ over the finite field $\mathbb{F}_{p^m}$…

信息论 · 计算机科学 2017-08-30 Yuan Cao , Yonglin Cao , Fang-Wei Fu

A nonnegative matrix $A$ is called primitive if $A^k$ is positive for some integer $k>0$. A generalization of this concept to finite sets of matrices is as follows: a set of matrices $\mathcal M = \{A_1, A_2, \ldots, A_m \}$ is primitive if…

组合数学 · 数学 2015-04-16 Vincent D. Blondel , Raphael M. Jungers , Alex Olshevsky