Computations with Witt vectors of length $3$

Luís R. A. Finotti

Displaying similar documents to “Computations with Witt vectors of length $3$ ”

Recurrences and Legendre transform.

Strehl, Volker (1992)

Séminaire Lotharingien de Combinatoire [electronic only]

Similarity:

Jacobsthal numbers and alternating sign matrices.

Frey, Darrin D., Sellers, James A. (2000)

Journal of Integer Sequences [electronic only]

Similarity:

Inversion of incidence mappings.

Krämer, Helmut (1997)

Séminaire Lotharingien de Combinatoire [electronic only]

Similarity:

A class of transcendental numbers with explicit g-adic expansion and the Jacobi-Perron algorithm

Jun-ichi Tamura (1992)

Acta Arithmetica

Similarity:

In this paper, we give transcendental numbers φ and ψ such that (i) both φ and ψ have explicit g-adic expansions, and simultaneously, (ii) the vector $^{t} (φ, ψ)$ has an explicit expression in the Jacobi-Perron algorithm (cf. Theorem 1). Our results can be regarded as a higher-dimensional version of some of the results in [1]-[5] (see also [6]-[8], [10], [11]). The numbers φ and ψ have some connection with algebraic numbers with minimal polynomials x³ - kx² - lx - 1 satisfying (1.1) k ≥ l ≥0, k...

On the Carlitz problem on the number of solutions to some special equations over finite fields

Ioulia N. Baoulina (2011)

Journal de Théorie des Nombres de Bordeaux

Similarity:

We consider an equation of the type $a_{1}^{} x_{1}^{2} + \dots + a_{n}^{} x_{n}^{2} = b x_{1} \dots x_{n}$ over the finite field $𝔽_{q} = 𝔽_{p^{s}}$ . Carlitz obtained formulas for the number of solutions to this equation when $n = 3$ and when $n = 4$ and $q \equiv 3 (mod 4)$ . In our earlier papers, we found formulas for the number of solutions when $d = gcd (n - 2, (q - 1) / 2) = 1$ or $2$ or $4$ ; and when $d > 1$ and $- 1$ is a power of $p$ modulo $2 d$ . In this paper, we obtain formulas for the number of solutions when $d = 2^{t}$ , $t \geq 3$ , $p \equiv 3 or 5 (mod 8)$ or $p \equiv 9 (mod 16)$ . For general case, we derive lower bounds for the number of solutions.