Related papers: On Kronecker's Solvability Theorem

We will present a novel elementary, self-contained, and explicit proof of the local Kronecker-Weber theorem. Apart from discrete valuation theory, it does not make use of any tools beyond those introduced in a second undergraduate course on…

This diploma thesis is concerned with functional decomposition $f = g \circ h$ of polynomials. First an algorithm is described which computes decompositions in polynomial time. This algorithm was originally proposed by Zippel (1991). A…

The Eigenvalue Theorem shows that solving a zero-dimensional polynomial system can be recast as an eigenvalue problem. This paper explores the relation between the Eigenvalue Theorem and the work of Ludwig Stickelberger (1850-1936).

A paper of the first author and Zilke proposed seven combinatorial problems around formulas for the characteristic polynomial and the exponents of an isolated quasihomogeneous singularity. The most important of them was a conjecture on the…

We propose a novel method for the construction of orthogonal arrays. The algorithm makes use of the Kronecker Product operator in association with unit column vectors to generate new orthogonal arrays from existing orthogonal arrays. The…

In this work one proves that, around each point of a dense open set (regular points), a real analytic or holomorphic bihamiltonian structure decomposes into a product of a Kronecker bihamiltonian structure and a symplectic one if a…

A procedure is proposed to construct solutions of the double confluent Heun equation with a determinate behaviour at the singular points. The connection factors are expressed as quotients of Wronskians of the involved solutions. Asymptotic…

In this paper, we give a proof of the classical Kronecker limit formulas using the distribution relation of the Eisenstein-Kronecker series. Using a similar idea, we then prove $p$-adic analogues of the Kronecker limit formulas for the…

This paper investigates Voevodsky's univalence axiom in intensional Martin-L\"of type theory. In particular, it looks at how univalence can be derived from simpler axioms. We first present some existing work, collected together from various…

In this paper we will give a unified proof of several results on the sovability of systems of certain equations over finite fields, which were recently obtained by Fourier analytic methods. Roughly speaking, we show that almost all systems…

We prove that a large family of graphs which are decomposable with respect to the modular decomposition can be reconstructed from their collection of vertex-deleted subgraphs.

We combine the language of monoids with the language of preorders so as to refine some fundamental aspects of the classical theory of factorization and prove an abstract factorization theorem with a variety of applications. In particular,…

Contrary to widespread perception, there is ever since 1994 a unified, general type independent theory for the existence of solutions for very large classes of nonlinear systems of PDEs. This solution method is based on the Dedekind order…

Let $g(x)$ be a fixed non-constant complex polynomial. It was conjectured by Schinzel that if $g(h(x))$ has boundedly many terms, then $h(x)\in \C[x]$ must also have boundedly many terms. Solving an older conjecture raised by R\'enyi and by…

We develop two applications of the Kronecker's limit formula associated to elliptic Eisenstein series: A factorization theorem for holomorphic modular forms, and a proof of Weil's reciprocity law. Several examples of the general…

Recently Brownawell and the second author proved a "non-degenerate" case of the (unproved) "Zilber Nullstellensatz" in connexion with "Strong Exponential Closure". Here we treat some significant new cases. In particular these settle…

We formulate and prove a criterion for reducibility of a quadratic polynomial over the integers. The main theorem was suggested by the teaching experience with the concrete material called "the polynomial box". Through the corollaries we…

The paper presents a method for obtaining problems whose conclusions contain disjunctive propositions. These problems constitute a version of inverse problems with a given logical structure. The logical models in the groups of problems…

The Dowker theorem is a classical result in the topology of finite spaces, claiming that any binary relation between two finite spaces defines two homotopy-equivalent complexes (the Dowker complexes). Recently, Barmak strengthened this to a…

Pourchet proved in 1971 that every nonnegative univariate polynomial with rational coefficients is a sum of five or fewer squares. Nonetheless, there are no known algorithms for constructing such a decomposition. The sole purpose of the…