English
Related papers

Related papers: $p$-Linear schemes for sequences modulo $p^r$

200 papers

We introduce a random matrix model where the entries are dependent across both rows and columns. More precisely, we investigate matrices of the form $\X=(X_{(i-1)n+t})_{it}\in\R^{p\times n}$ derived from a linear process $X_t=\sum_j c_j…

Probability · Mathematics 2012-02-15 Oliver Pfaffel , Eckhard Schlemm

In this paper we study lower ramification numbers of power series tangent to the identity that are defined over fields of positive characteristics $p$. Let $g$ be such a series, then $g$ has a fixed point at the origin and the corresponding…

Number Theory · Mathematics 2017-04-21 Jonas Nordqvist

We consider a hierarchy of the natural type Hamiltonian systems of $n$ degrees of freedom with polynomial potentials separable in general ellipsoidal and general paraboloidal coordinates. We give a Lax representation in terms of $2\times 2$…

High Energy Physics - Theory · Physics 2009-10-22 J. C. Eilbeck , V. Z. Enol'skii , Vadim B. Kuznetsov , A. V. Tsiganov

In this paper we apply Ax-Schanuel's Theorem to the ultraproduct of $p$-adic fields in order to get some results towards algebraic independence of $p$-adic exponentials for almost all primes $p$.

Logic · Mathematics 2018-11-13 Ali Bleybel

Let $U$ be a Lucas sequence, $p$ be prime, and $\rho_U(p)$ be the rank of appearance of $p$ in $U$. We derive closed-form formulas for the Dirichlet density of primes $p$ for which $d\mid \rho_U(p)$, where $d\geq 1$ is a fixed integer. Our…

Number Theory · Mathematics 2026-05-22 Joaquim Cera Da Conceição

We propose a novel and fully data driven control scheme which relies on machine learning (ML). Exploiting recently developed ML-based prediction capabilities of complex systems, we demonstrate that nonlinear systems can be forced to stay in…

Machine Learning · Computer Science 2021-03-02 Alexander Haluszczynski , Christoph Räth

This paper explores the Law of the Iterated Logarithm (LIL) for $m$-dependent sequences under the framework of sub-linear expectations. We first extend existing LIL results to sequences of independent, non-identically distributed random…

Probability · Mathematics 2025-06-13 Wang-Yun Gu , Li-Xin Zhang

We investigate when the sequence of binomial coefficients \binom{k}{i} modulo a prime p, for a fixed positive integer k, satisfies a linear recurrence relation of (positive) degree h in the finite range 0\le i\le k. In particular, we prove…

Number Theory · Mathematics 2008-04-22 Sandro Mattarei

We consider a system of Fokker-Planck-Kolmogorov (FPK) equations, where the dependence of the coefficients is nonlinear and nonlocal in time with respect to the unknowns. We extend the numerical scheme proposed and studied recently by the…

Numerical Analysis · Mathematics 2018-05-03 Elisabetta Carlini , Francisco J. Silva

In this paper, we construct a family of weakly universal rotation invariant cellular automaton for all grids $\{p,3\}$ of the hyperbolic plane for $p\geq 13$. The scheme is general for $p\geq 17$ and for $13\leq p<17$, we give such a…

Formal Languages and Automata Theory · Computer Science 2012-02-09 Maurice Margenstern

A classical problem in analytic number theory is to study the distribution of $\alpha p$ modulo 1, where $\alpha$ is irrational and $p$ runs over the set of primes. We consider the subsequence generated by the primes $p$ such that $p+2$ is…

Number Theory · Mathematics 2007-11-07 T. L. Todorova , D. I. Tolev

This work is a study of polynomial compositions having a fixed number of terms. We outline a recursive method to describe these characterizations, give some particular results and discuss the general case. In the final sections, some…

Number Theory · Mathematics 2021-09-21 Alessio Moscariello

Global dynamics of a non-linear Cellular Automata is, in general irregular, asymmetric and unpredictable as opposed to that of a linear CA, which is highly systematic and tractable. In the past efforts have been made to systematize…

Computational Complexity · Computer Science 2008-08-13 Sudhakar Sahoo , Pabitra Pal Choudhury , Mithun Chakraborty

In this paper we obtain some congruences involving central binomial coefficients and Lucas sequences. For example, we show that if p>5 is a prime then $\sum_{k=0}^{p-1}F_k*binom(2k,k)/12^k$ is congruent to 0,1,-1 modulo p according as p=1,4…

Number Theory · Mathematics 2009-12-14 Zhi-Wei Sun

This paper presents some basic theorems giving the structure of cyclic codes of length n over the ring of integers modulo p^a and over the p-adic numbers, where p is a prime not dividing n. An especially interesting example is the 2-adic…

Combinatorics · Mathematics 2007-07-16 A. R. Calderbank , N. J. A. Sloane

Linear codes have been an interesting subject of study for many years, as linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, a class of…

Information Theory · Computer Science 2016-01-27 Can Xiang , Chunming Tang , Keqin Feng

Given $k \ge 2$ polynomials in $d \ge 1$ variables with coefficients in a field of characteristic $0$, such that no two are linearly dependent, we show that for any integer $r$ greater than $\max\left\{k {k-1 \choose 2}, 2\right\}$, the…

Commutative Algebra · Mathematics 2025-07-15 Alexandru Crăciun

We explain how to construct matrix product stationary states which are composed of finite-dimensional matrices. Our construction explained in this article was first presented in a part of [Hieida and Sasamoto:J. Phys. A: Math. Gen. 37…

Statistical Mechanics · Physics 2016-11-23 Yasuhiro Hieida , Tomohiro Sasamoto

We prove that the constant terms of powers of a Laurent polynomial satisfy certain congruences modulo prime powers. As a corollary, the generating series of these numbers considered as a function of a p-adic variable satisfies a non-trivial…

Number Theory · Mathematics 2013-06-26 Anton Mellit , Masha Vlasenko

The extremal function $ex(n, P)$ is the maximum possible number of ones in any 0-1 matrix with $n$ rows and $n$ columns that avoids $P$. A 0-1 matrix $P$ is called minimally non-linear if $ex(n, P) = \omega(n)$ but $ex(n, P') = O(n)$ for…

Combinatorics · Mathematics 2020-11-04 Jesse Geneson , Shen-Fu Tsai