Solutions of diophantine equations as periodic points of pp-adic algebraic functions, I

Solutions of the quartic Fermat equation in ring class fields of odd conductor over quadratic fields $K=\mathbb{Q}(\sqrt{-d})$ with $-d \equiv 1$ (mod $8$) are shown to be periodic points of a fixed algebraic function $T(z)$ defined on the punctured disk $0< |z|_2 \le \frac{1}{2}$ of the maximal unramified, algebraic extension $\textsf{K}_2$ of the $2$-adic field $\mathbb{Q}_2$. All ring class fields of odd conductor over imaginary quadratic fields in which the prime $p=2$ splits are shown to be generated by complex periodic points of the algebraic function $T$, and conversely, all but two of the periodic points of $T$ generate ring class fields over suitable imaginary quadratic fields. This gives a dynamical proof of a class number relation originally proved by Deuring. It is conjectured that a similar situation holds for an arbitrary prime $p$ in place of $p=2$, where the case $p=3$ has been previously proved by the author, and the case $p=5$ will be handled in Part II.Comment: 28 page

The Life of Evariste Galois and his Theory of Field Extension

Evariste Galois made many important mathematical discoveries in his short lifetime, yet perhaps the most important are his studies in the realm of field extensions. Through his discoveries in field extensions, Galois determined the solvability of polynomials. Namely, given a polynomial P with coefficients is in the field F and such that the equation P(x) = 0 has no solution, one can extend F into a field L with α in L, such that P(α) = 0. Whereas Galois Theory has numerous practical applications, this thesis will conclude with the examination and proof of the fact that it is impossible to trisect an angle using only a ruler and compass

Counting Basic-Irreducible Factors Mod p^k in Deterministic Poly-Time and p-Adic Applications

Finding an irreducible factor, of a polynomial f(x) modulo a prime p, is not known to be in deterministic polynomial time. Though there is such a classical algorithm that counts the number of irreducible factors of f mod p. We can ask the same question modulo prime-powers p^k. The irreducible factors of f mod p^k blow up exponentially in number; making it hard to describe them. Can we count those irreducible factors mod p^k that remain irreducible mod p? These are called basic-irreducible. A simple example is in f=x^2+px mod p^2; it has p many basic-irreducible factors. Also note that, x^2+p mod p^2 is irreducible but not basic-irreducible! We give an algorithm to count the number of basic-irreducible factors of f mod p^k in deterministic poly(deg(f),k log p)-time. This solves the open questions posed in (Cheng et al, ANTS\u2718 & Kopp et al, Math.Comp.\u2719). In particular, we are counting roots mod p^k; which gives the first deterministic poly-time algorithm to compute Igusa zeta function of f. Also, our algorithm efficiently partitions the set of all basic-irreducible factors (possibly exponential) into merely deg(f)-many disjoint sets, using a compact tree data structure and split ideals

Provably Weak Instances of PLWE Revisited, Again

Learning with Errors has emerged as a promising possibility for postquantum cryptography. Variants known as RLWE and PLWE have been shown to be more efficient, but the increased structure can leave them vulnerable to attacks for certain instantiations. This work aims to identify specific cases where proposed cryptographic schemes based on PLWE work particularly poorly under a specific attack

A computer algebra user interface manifesto

Many computer algebra systems have more than 1000 built-in functions, making expertise difficult. Using mock dialog boxes, this article describes a proposed interactive general-purpose wizard for organizing optional transformations and allowing easy fine grain control over the form of the result even by amateurs. This wizard integrates ideas including: * flexible subexpression selection; * complete control over the ordering of variables and commutative operands, with well-chosen defaults; * interleaving the choice of successively less main variables with applicable function choices to provide detailed control without incurring a combinatorial number of applicable alternatives at any one level; * quick applicability tests to reduce the listing of inapplicable transformations; * using an organizing principle to order the alternatives in a helpful manner; * labeling quickly-computed alternatives in dialog boxes with a preview of their results, * using ellipsis elisions if necessary or helpful; * allowing the user to retreat from a sequence of choices to explore other branches of the tree of alternatives or to return quickly to branches already visited; * allowing the user to accumulate more than one of the alternative forms; * integrating direct manipulation into the wizard; and * supporting not only the usual input-result pair mode, but also the useful alternative derivational and in situ replacement modes in a unified window.Comment: 38 pages, 12 figures, to be published in Communications in Computer Algebr