pith. sign in

arxiv: 2606.25109 · v1 · pith:24QCEUXXnew · submitted 2026-06-23 · 🧮 math.NT · math.CO

Binomial sequences over prime fields

Miguel Beltr\'a , Sara D. Cardell , Ver\'onica Requena This is my paper

Pith reviewed 2026-06-25 22:17 UTC · model grok-4.3

classification 🧮 math.NT math.CO
keywords binomial sequencesp-ary sequencesprime fieldsvector space basisperiodic sequencesPascal's trianglelinear complexity
0
0 comments X

The pith

Binomial p-ary sequences form a basis for the vector space of all sequences over F_p with period a power of p.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper extends the binary binomial sequences, defined as diagonals of Pascal's triangle modulo 2, to the setting of sequences over a prime field F_p. It examines the intrinsic properties and formation rules that define these p-ary sequences. The main result shows that the set of all sequences over F_p whose period is a power of p forms a vector space, and that the binomial sequences constitute a basis for it. This supplies a canonical way to express any such periodic sequence as a unique linear combination of the binomial ones.

Core claim

The family of p-ary sequences with period a power of p forms a vector space over F_p, and the family of binomial p-ary sequences is a basis of this space.

What carries the argument

Binomial p-ary sequences, constructed via formation rules that generalize the diagonals of Pascal's triangle modulo p.

If this is right

  • Every sequence with period a power of p admits a unique expression as a linear combination of binomial sequences with coefficients in F_p.
  • The binomial sequences are linearly independent over F_p.
  • The binomial sequences together span the entire vector space of period-p^k sequences.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The basis expansion supplies a direct route to computing linear complexity or other invariants by examining the support of the coefficient vector.
  • The same vector-space structure may be used to generate or enumerate all sequences of a given period systematically.

Load-bearing premise

The formation rules for binomial p-ary sequences automatically guarantee linear independence and that they span the full space of period-p^k sequences.

What would settle it

An explicit sequence over F_p with period p^k that cannot be expressed as any linear combination of the binomial sequences, or a nontrivial linear dependence relation satisfied by those sequences.

read the original abstract

The binary binomial sequences correspond to the diagonals of the Pascal's triangle modulo 2. They have interesting properties such as they form a basis of the linear space of all binary sequences with period a power of 2. Other properties of these sequences (period, linear complexity, construction rules or relations among different binomial sequences) have been deeply analysed in detail previously. In this work, we study the binomial $p$-ary sequences for a prime $p$, its intrinsic characteristic and formation rules. We also prove that the family of $p$-ary sequences with period a power of $p$ form a vector space over $\mathbb{F}_p$ and that the family of binomial $p$-ary sequences is a basis of this space.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

Summary. The paper studies binomial p-ary sequences, defined analogously to the binary case as diagonals of Pascal's triangle modulo p. It examines their intrinsic characteristics and formation rules, and proves that the family of all F_p-valued sequences with period a power of p forms a vector space over F_p, with the family of binomial p-ary sequences serving as a basis.

Significance. The generalization of the binary binomial sequence basis property to arbitrary primes is of interest in the theory of periodic sequences over finite fields. The vector-space and basis claims follow from the standard forward-difference argument (linear independence by induction on successive differences), which applies verbatim for any prime p with no additional conditions required. The paper's primary contribution therefore lies in the explicit formation rules and intrinsic characteristics for general p.

minor comments (3)
  1. [Abstract] Abstract: the claim of a proof is stated without any outline of the argument or reference to the forward-difference construction; a one-sentence sketch would improve accessibility.
  2. The definition of the binomial p-ary sequences via formation rules should be stated explicitly (with the precise recurrence or generating function) before the vector-space claim is proved.
  3. Notation for the period-p^m sequences and the indexing of the binomial family should be introduced consistently in the first section.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful reading and the recommendation of minor revision. We address the observation regarding the standard nature of the basis argument below.

read point-by-point responses

  1. Referee: The vector-space and basis claims follow from the standard forward-difference argument (linear independence by induction on successive differences), which applies verbatim for any prime p with no additional conditions required. The paper's primary contribution therefore lies in the explicit formation rules and intrinsic characteristics for general p.

    Authors: We agree that the linear independence of the binomial sequences via the forward-difference operator is a standard technique that extends directly to any prime p. The manuscript includes a self-contained presentation of this argument for completeness. The core contribution of the work remains the definition of binomial p-ary sequences, together with their explicit formation rules, intrinsic properties, and relations, which provide a non-trivial generalization of the binary case to arbitrary primes. revision: no

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The central claim is that p-ary sequences of period p^k form a vector space over F_p with the binomial sequences (defined via the natural extension of the binary case, i.e., binom(n,k) mod p) as a basis. This is established by the standard forward-difference argument on the finite rings Z/p^m Z, which shows linear independence and spanning directly from the properties of binomial coefficients and does not reduce to any self-definition, fitted parameter, or self-citation chain. The paper's formation rules coincide with this construction; no load-bearing step collapses to an input by construction. The result is therefore self-contained against external mathematical benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The paper adds no free parameters or new entities; it relies on standard finite field arithmetic and linear algebra axioms to establish the basis property.

axioms (1)
  • standard math Vector space axioms hold over finite fields F_p
    The proof that the sequences form a vector space and have a basis relies on these standard properties.

pith-pipeline@v0.9.1-grok · 5650 in / 1167 out tokens · 50178 ms · 2026-06-25T22:17:52.351731+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

23 extracted references · 12 canonical work pages

  1. [1]

    Aegean Park Press, Laguna Hill, California (1982)

    Golomb, S.W.: Shift Register-Sequences. Aegean Park Press, Laguna Hill, California (1982)

    1982

  2. [2]

    Cambridge University Press, New York, NY (1986)

    Lidl, R., Niederreiter, H.: Introduction to Finite Fields and Their Applications. Cambridge University Press, New York, NY (1986)

    1986

  3. [3]

    Journal of Mathematical Sciences187, 115– 128 (2012) https://doi.org/10.1007/s10958-012-1054-2

    Goltvanitsa, M.A., Zaitsev, S.N., Nechaev, A.A.: Skew linear recurring sequences of maximal period over Galois rings. Journal of Mathematical Sciences187, 115– 128 (2012) https://doi.org/10.1007/s10958-012-1054-2

    work page doi:10.1007/s10958-012-1054-2 2012

  4. [4]

    Finite Fields and Their Applications8(2), 256–267 (2002) https://doi

    Tsaban, B., Vishne, U.: Efficient linear feedback shift registers with maximal period. Finite Fields and Their Applications8(2), 256–267 (2002) https://doi. org/10.1006/ffta.2001.0339

    work page doi:10.1006/ffta.2001.0339 2002

  5. [5]

    Involve, a Journal of Mathematics14(3), 361–376 (2021) https://doi.org/10.2140/involve.2021.14.361 33

    Bush, M.R., Quijada, D.: Period sets of linear recurrences over finite fields and related commutative rings. Involve, a Journal of Mathematics14(3), 361–376 (2021) https://doi.org/10.2140/involve.2021.14.361 33

    work page doi:10.2140/involve.2021.14.361 2021

  6. [6]

    Advances in Applied Mathematics127, 102180 (2021) https://doi.org/10.1016/ j.aam.2021.102180

    Ganesan, G.: Linear recurrences over a finite field with exactly two periods. Advances in Applied Mathematics127, 102180 (2021) https://doi.org/10.1016/ j.aam.2021.102180

    arXiv 2021

  7. [7]

    PhD thesis, Faculty of Technology, Natural Sciences and Maritime Studies, University of South-Eastern Norway (2024)

    Bos, S.: Beyond 0 and 1: A mixed radix design and verification workflow for modern ternary computers. PhD thesis, Faculty of Technology, Natural Sciences and Maritime Studies, University of South-Eastern Norway (2024)

    2024

  8. [8]

    https://www.computer- museum.ru/english/setun.htm

    Brousentsov, N.P., Maslov, S.P., Ramil Alvarez, J., Zhogolev, E.A.: Develop- ment of ternary computers at Moscow State University. https://www.computer- museum.ru/english/setun.htm

  9. [9]

    Complexity2019, 1–13 (2019) https://doi.org/10.1155/2019/2108014

    Cardell, S.D., F´ uster-Sabater, A.: Binomial representation of cryptographic binary sequences and its relation to cellular automata. Complexity2019, 1–13 (2019) https://doi.org/10.1155/2019/2108014

    work page doi:10.1155/2019/2108014 2019

  10. [10]

    Mathematics (8), 1–26 (2020) https://doi

    Cardell, S.D., Climent, J.-J., F´ uster-Sabater, A., Requena, V.: Representations of generalized self-shrunken sequences. Mathematics (8), 1–26 (2020) https://doi. org/10.3390/math8061006

    work page doi:10.3390/math8061006 2020

  11. [11]

    Cambridge University Press, Cambridge (2005)

    Golomb, S.W., Gong, G.: Signal Design for Good Correlation: For Wireless Com- munication, Cryptography, and Radar. Cambridge University Press, Cambridge (2005)

    2005

  12. [12]

    Springer, Berlin, Heidelberg (2015)

    Cox, D.A., Little, J., O’Shea, D.: Ideals, Varieties, and Algorithms: An Intro- duction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics). Springer, Berlin, Heidelberg (2015). https://doi.org/10.1007/978-3-319-16721-3

    work page doi:10.1007/978-3-319-16721-3 2015

  13. [13]

    and Johnson, Charles R

    Horn, R.A., Johnson, C.R.: Matrix Analysis (2nd Edition). Cambridge University Press, Cambridge (2012). https://doi.org/10.1017/CBO9780511810817

    work page doi:10.1017/cbo9780511810817 2012

  14. [14]

    Cambridge University Press, Cambridge (1991)

    Horn, R.A., Johnson, C.R.: Topics in Matrix Analysis. Cambridge University Press, Cambridge (1991)

    1991

  15. [15]

    Linear and Multilinear Algebra47(2), 129–136 (2000) https://doi.org/10.1080/03081080008818638

    Abrams, L., Fishking, D.E., Valdes-Leon, S.: Reflecting the Pascal matrix about its main antidiagonal. Linear and Multilinear Algebra47(2), 129–136 (2000) https://doi.org/10.1080/03081080008818638

    work page doi:10.1080/03081080008818638 2000

  16. [16]

    The American Mathemati- cal Monthly100(4), 372–376 (1993) https://doi.org/10.1080/00029890.1993

    Call, G.S., Velleman, D.J.: Pascal’s matrices. The American Mathemati- cal Monthly100(4), 372–376 (1993) https://doi.org/10.1080/00029890.1993. 11990415

    work page doi:10.1080/00029890.1993 1993

  17. [17]

    Integers2(2002) https: //doi.org/10.5281/zenodo.7589277

    Kubelka, R.P.: Decomposition of Pascal’s kernels modp s. Integers2(2002) https: //doi.org/10.5281/zenodo.7589277

    work page doi:10.5281/zenodo.7589277 2002

  18. [18]

    Journal of Cellular Automata11(2-3), 195–211 (2016)

    Cardell, S.D., F´ uster-Sabater, A.: Linear models for the self-shrinking generator 34 based on CA. Journal of Cellular Automata11(2-3), 195–211 (2016)

    2016

  19. [19]

    In: Proceedings IEEE International Symposium on Information Theory, p

    Smarandache, R., Gluesing-Luerssen, H., Rosenthal, J.: Strongly MDS convo- lutional codes, a new class of codes with maximal decoding capability. In: Proceedings IEEE International Symposium on Information Theory, p. 426 (2002). https://doi.org/10.1109/ISIT.2002.1023698

    work page doi:10.1109/isit.2002.1023698 2002

  20. [20]

    Bulletin de la Soci´ et´ e Math´ ematique de France6, 49–54 (1878) https://doi.org/10.24033/bsmf.127

    Lucas, E.: Sur les congruences des nombres eul´ eriens et des coefficients diff´ erentiels des fonctions trigonom´ etriques suivant un module premier. Bulletin de la Soci´ et´ e Math´ ematique de France6, 49–54 (1878) https://doi.org/10.24033/bsmf.127

    work page doi:10.24033/bsmf.127

  21. [21]

    Philosophical Transactions of the Royal Society of London109, 308–335 (1819)

    Horner, W.G.: A new method of solving numerical equations of all orders, by continuous approximation. Philosophical Transactions of the Royal Society of London109, 308–335 (1819)

  22. [22]

    Addison-Wesley, Boston (1997)

    Knuth, D.E.: The Art of Computer Programming, Volume 2: Seminumerical Algorithms, 3rd edn. Addison-Wesley, Boston (1997)

    1997

  23. [23]

    CRC Press, Boca Raton, FL (1996) 35 Appendix A Table First 25 binomial sequences overF 5, periods and linear complexities

    Menezes, A.J., Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptogra- phy. CRC Press, Boca Raton, FL (1996) 35 Appendix A Table First 25 binomial sequences overF 5, periods and linear complexities. Binomial sequence First terms Period LC n 0 1111111111111111111111111 1 1 n 1 0123401234012340123401234 5 2 n 2 0013100131001310013100131 5 3 n 3 00014...

    1996