Related papers: Moebius transforms and cyclic equations
Using Galois Theory, we construct explicitly absolutely simple (principally polarized) Prym varieties that are not isomorphic to jacobians of curves even if we ignore the polarizations. Our approach is based on the previous papers…
In this paper, we explain how to compute the Lie algebra of the differential Galois group of a reducible linear differential system. We achieve this by showing how to transform a block-triangular linear differential system into a…
An accurate method to compute enclosures of Abelian integrals is developed. This allows for an accurate description of the phase portraits of planar polynomial systems that are perturbations of Hamiltonian systems. As an example, it is…
Let $P\in\mathbb Q[t,x]$ be a polynomial in two variables with rational coefficients, and let $G$ be the Galois group of $P$ over the field $\mathbb Q(t)$. It follows from Hilbert's Irreducibility Theorem that for most rational numbers $c$…
A cyclic cohomology theory adapted to Hopf algebras has been introduced recently by Connes and Moscovici. In this paper, we consider this object in the homological framework, in the spirit of Loday-Quillen and Karoubi's work on the cyclic…
We consider Galois/monodromy groups arising in computer vision applications, with a view towards building more efficient polynomial solvers. The Galois/monodromy group allows us to decide when a given problem decomposes into algebraic…
In this preprint we present an outline of the multidimensional version of topological Galois theory. The theory studies topological obstruction to solvability of equations "in finite terms" (i.e. to their solvability by radicals, by…
We develop Hopf-Galois theory for weak Hopf algebras, and recover analogs of classical results for Hopf algebras. Our methods are based on the recently introduced Galois theory for corings. We focus on the situatation where the weak Hopf…
We generalize the definition of the polylogarithm classes to the case of commutative group schemes, both in the sheaf theoretic and the motivic setting. This generalizes and simplifies the existing cases.
We compute the Groebner basis of a system of polynomial equations related to the Jacobian conjecture using a recursive formula for the Catalan numbers.
Recently, a $q$-polynomial approach to the construction and analysis of cyclic codes over $\gf(q)$ was given by Ding and Ling. The objective of this paper is to give another $q$-polynomial approach to all cyclic codes over $\gf(q)$.
We produce an explicit family of totally real cyclic quartic polynomials that are monogenic in many cases and, if the $abc$ conjecture holds, generate distinct monogenic quartic fields infinitely often. Additional families (also…
Previously the second author has constructed by cobordism methods, an invariant associated to a finite group $G$. This invariant approximates the number of subgroups of a group, giving in some cases the number of abelian and cyclic…
A general theorem on factorization of matrices with polynomial entries is proven and it is used to reduce polynomial Darboux matrices to linear ones. Some new examples of linear Darboux matrices are discussed.
To a "stable homotopy theory" (a presentable, symmetric monoidal stable $\infty$-category), we naturally associate a category of finite \'etale algebra objects and, using Grothendieck's categorical machine, a profinite group that we call…
In this article, the Galois groupoid of the first Painlev\'{e} equation is computed. This computation use E. Cartan's classification of structural equations of pseudogroups acting on $C^2$ and the degeneration of the first Painlev\'{e}…
In this paper I present a kind of proof for classical Euclidean geometric problems which relies on both synthetic and analytic geometry. Using the elementary tools of polynomial algebra and multivariate calculus we manage to reduce the…
These are the notes for an undergraduate course at the University of Edinburgh, 2021-2023. Assuming basic knowledge of ring theory, group theory and linear algebra, the notes lay out the theory of field extensions and their Galois groups,…
A method of constructing algebraic-geometric codes with many automorphisms arising from Galois points for algebraic curves is presented.
In this paper we describe an efficient involutive algorithm for constructing Groebner bases of polynomial ideals. The algorithm is based on the concept of involutive monomial division which restricts the conventional division in a certain…