We prove that if $P(X) \in \mathbb{Z}[X]$ is an integer polynomial of degree $n$ and having $P(0) = 1$, then either $P(X)$ is a product of cyclotomic polynomials, or else at least one of the complex roots of $P$ belongs to the disk $|z| \leq 2^{ - 1 / (4n) }$. We also obtain a relative version of this result over the compositum $\mathbb{Q}^{\mathrm{ab}} \cdot \mathbb{Q}^{\mathrm{t.}p}$ of all abelian and all totally $p$-adic extensions of $\mathbb{Q}$, for any fixed prime~$p$, and apply it to prove a $\mathbb{Q}^{\mathrm{ab}} \cdot \mathbb{Q}^{\mathrm{t.}p}$-relative canonical height lower bound on the multiplicative group. Another extension is given to a uniform positive height lower bound, inverse-proportional to the total number of singular points, on holonomic power series in $\mathbb{Q}[[X]]$ and not of the form $p(X) / (X^k-1)^m$, where $p(X) \in \mathbb{Q}[X]$, with a further application to existence of a small critical value for certain rational functions.

A proof of the Schinzel-Zassenhaus conjecture on polynomials

A recent result, conjectured by Arnold and proved by Zarelua, states that for a prime number p, a positive integer k, and a square matrix A with integral entries one has $${\textrm tr}(A^{p^k})
 \equiv {\textrm tr}(A^{p^{k-1}}) ({\textrm mod}{p^k})$$
 . We give a short proof of a more general result, which states that if the characteristic polynomials of two integral matrices A,  B are congruent modulo p
 k
 then the characteristic polynomials of A
 p
 and B
 p
 are congruent modulo p
 k+1, and then we show that Arnold’s conjecture follows from it easily. Using this result, we prove the following generalization of Euler’s theorem for any 2 × 2 integral matrix A: the characteristic polynomials of A
 Φ(n) and A
 Φ(n)-ϕ(n) are congruent modulo n. Here ϕ is the Euler function, $$\prod_{i=1}^{l} p_i^{\alpha_i}$$
 is a prime factorization of n and $$\Phi(n)=(\phi(n)+\prod_{i=1}^{l}
 p_i^{\alpha_i-1}(p_i+1))/2$$
 .

/pdf/generalizations-of-arnold-s-version-of-euler-s-theorem-for-356ar1symb.pdf

Generalizations of Arnold’s version of Euler’s theorem for matrices

Abstract Š. Schwarz in his paper [SCHWARZ, Š.: Zur Theorie der Halbgruppen, Sborník prác Prírodovedeckej fakulty Slovenskej univerzity v Bratislave, Vol. VI, Bratislava, 1943, 64 pp.] proved the existence of maximal subgroups in periodic semigroups and a decade later he brought into play the maximal subsemigroups and thus he embodied the idempotents in the structural description of semigroups [SCHWARZ, Š.: Contribution to the theory of torsion semigroups, Czechoslovak Math. J. 3(1) (1953), 7–21]. Later in his papers he showed that a proper description of these structural elements can be used to (re)prove many useful and important results in algebra and number theory. The present paper gives a survey of selected results scattered throughout the literature where an semigroup approach based on tools like idempotent, maximal subgroup or maximal subsemigroup either led to a new insight into the substance of the known results or helped to discover new approach to solve problems. Special attention will be given to some disregarded historical connections between semigroup and ring theory.

Idempotents, group membership and their applications

Let D be an open disk of radius ≤1 in $\mathbb{C}$, and let (ϵn) be a sequence of ±1. We prove that for every analytic function $f: D \to \mathbb{C}$ without zeros in D, there exists a unique sequence (αn) of complex numbers such that $f(z) = f(0)\prod_{n=1}^{\infty} (1+\epsilon_{n}z^{n})^{\alpha_{n}}$ for every z∈D. From this representation we obtain a numerical method for calculating products of the form ∏p primef(1/p) provided f(0)=1 and f′(0)=0; our method generalizes a well-known method of Pieter Moree. We illustrate this method on a constant of Ramanujan $\pi^{-1/2}\prod _{p~\text{prime}} \sqrt{p^{2}-p}\ln(p/(p-1))$. From the properties of the exponents αn, we obtain a proof of the following congruences, which have been the subject of several recent publications motivated by some questions of Arnold: for every n×n integral matrix A, every prime number p, and every positive integer k we have $\operatorname{tr} A^{p^{k}} \equiv\operatorname{tr} A^{p^{k-1}} { \hbox {\rm { (mod\ $p^{k}$) }}}$.

Representations of analytic functions as infinite products and their application to numerical computations

Let $D$ be an open disk of radius $\le 1$ in $\mathbb C$, and let $(\epsilon_n)$ be a sequence of $\pm 1$. We prove that for every analytic function $f: D \to \mathbb C$ without zeros in $D$, there exists a unique sequence $(\alpha_n)$ of complex numbers such that $f(z) = f(0)\prod_{n=1}^{\infty} (1+\epsilon_nz^n)^{\alpha_n}$ for every $z \in D$. From this representation we obtain a numerical method for calculating products of the form $\prod_{p \text{prime}} f(1/p)$ provided $f(0)=1$ and $f'(0) = 0$; our method generalizes a well known method of Pieter Moree. We illustrate this method on a constant of Ramanujan $\pi^{-1/2}\prod_{p \text{prime}} \sqrt{p^2-p}\ln(p/(p-1))$. From the properties of the exponents $\alpha_n$, we obtain a proof of the following congruences, which have been the subject of several recent publications motivated by some questions of Arnold: for every $n \times n$ integral matrix $A$, every prime number $p$, and every positive integer $k$ we have $\text{tr} A^{p^k} \equiv \text{tr} A^{p^{k-1}} (\text{mod}\,{p^k})$.

The theorem proved in this paper gives a congruence for the traces of powers of an algebraic integer for the case in which the exponent of the power is a prime power. The theorem implies a congruence in Gauss’ form for the traces of the sums of powers of algebraic integers, generalizing many familiar versions of Fermat’s little theorem. Applied to the traces of integer matrices, this gives a proof of Arnold’s conjecture about the congruence of the traces of powers of such matrices for the case in which the exponent of the power is a prime power.

On matrix analogs of Fermat’s little theorem

Handle everyday research tasks with reliable, citation-backed results

Your personal Research Agent to handle research tasks with citation-backed results

Popular Tasks used by Researchers

How can I help with your research?

Meet SciSpace

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

A. V. Zarelua

Author Tools

Chat about Author

Papers

On matrix analogs of Fermat’s little theorem