Search arXivSearch

arXiv · 2605.29312

On the power of the discriminant of a univariate polynomial as a certain determinant in positive characteristic

Abstract

Let $p$ be a prime. Suppose that integers $r$, $e$, $d$ such that $r \ge 2$, $e \ge 0$, $0 \le d \le p$ are given. Let $f(x)=s_0 x^r + s_1 x^{r-1} + \cdots + s_r$ be a generic polynomial of degree $r$ in characteristic $p$. We put $f(x)^e=\sum_{i \ge 0} c_i x^i$. We define a $d\times d$ matrix $M_d(f(x)^e)$ by $M_d(f(x)^e) = ( c_{i p + j - d -1})_{1 \le i,\, j \le d}$. In this paper, we shall be concerned with the divisibility of $\det M_d(f(x)^e)$ by powers of the discriminant $Δ(f(x))$ of $f(x)$. First, assuming $s_0=1$, we study the condition under which $\det M_d(f(x)^e)$ is a positive power of $Δ(f(x))$ multiplied by a non-zero constant in ${\mathbb F}_p$. Second, for such matrices when $d=r-1$, we present a formula for $M_d(f(x)^e)^{-1} M_d(f(x)^{e+1})$ involving the Bézout matrix of $f'(x)$ and $f(x)-\frac{1}{r} x f'(x)$. Finally, we present two similar experimental equalities, the first of which involves the determinant $\det M_d(f(x)^e)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Akira Kurihara. 2026-05-28. On the power of the discriminant of a univariate polynomial as a certain determinant in positive characteristic. https://arxiv.org/abs/2605.29312

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT