Related papers: Explicit Methods for Radical Function Fields over …

Let $K$ be a quadratic field which is not an imaginary quadratic field of class number one. We describe an algorithm to compute the primes $p$ for which there exists an elliptic curve over $K$ admitting a $K$-rational $p$-isogeny. This…

In this paper we introduce elementary and completely explicit formulas for the derivative of any order of any function of the type 1/p, where p is a polynomial with known zeros.

We study the algebraic $K$-theory of the ring of continuous functions on a compact Hausdorff space with values in a local division ring, e.g., a local field: We compute its negative $K$-theory and show its $K$-regularity. The complex case…

We present new, practical algorithms for the hypersurface implicitization problem: namely, given a parametric description (in terms of polynomials or rational functions) of the hypersurface, find its implicit equation. Two of them are for…

Let $k$ be a perfect complete valued field with a nontrivial non-archimedean norm $|\cdot|$ and $\omega\in k$ with $0<|\omega|<1.$ Let $X$ be a reduced and normal $k$-analytic space. Then $O^{\circ}\simeq…

We prove an implicit function theorem for C^k-maps from arbitrary topological vector spaces over valued fields to Banach spaces (for k at least 2). As a tool, we show the C^k-dependence of fixed points on parameters for suitable families of…

Let $k$ be a finite field extension of the function field $\bfF_p(T)$ and $\bar{k}$ its algebraic closure. We count points in projective space $\Bbb P ^{n-1}(\bar{k})$ with given height and of fixed degree $d$ over the field $k$. If…

For a fixed irreducible polynomial $F$ we study the set $\mathcal V_F$ of all valuations on $K[x]$ bounded by valuations whose support is $(F)$. The first main result presents a characterization for valuations in $\mathcal V_F$ in terms of…

In this work we find a unifying scheme for the known explicit complex-valued eigenfunctions on the classical compact Riemannian symmetric spaces. For this we employ the well-known Cartan embedding for those spaces. This also leads to the…

We describe a standard form for the elements in the universal field of fractions of free associative algebras (over a commutative field). It is a special version of the normal form provided by Cohn and Reutenauer and enables the use of…

We develop, via Arnold's geometric framework, a mechanism for constructing explicit, smooth, global-in-time, and typically non-stationary solutions of the incompressible Euler equations. The approach introduces a notion of generalized…

In this thesis, we develop algorithms similar to the Gaussian elimination algorithm in symplectic and split orthogonal similitude groups. As an application to this algorithm, we compute the spinor norm for split orthogonal groups. Also, we…

We present two new results about exact learning by quantum computers. First, we show how to exactly learn a $k$-Fourier-sparse $n$-bit Boolean function from $O(k^{1.5}(\log k)^2)$ uniform quantum examples for that function. This improves…

Relativistic formalism of Green's functions is dicussed in QCD and QED,where the relativistic Green's functions are constructed using the Schwinger proper time formalism and the Fock-Feynman-Schwinger method.As a result a simple and exact…

Rate-independent systems arise in a number of applications. Usually, weak solutions to such problems with potentially very low regularity are considered, requiring mathematical techniques capable of handling nonsmooth functions. In this…

Let k be an algebraically closed field of characteristic zero. An element F from k(x_1,...,x_n) is called a closed rational function if the subfield k(F) is algebraically closed in the field k(x_1,...,x_n). We prove that a rational function…

We compute the constant of approximation for an arbitrary rational point on an arbitrary smooth cubic hypersurface $X$ over a number field $k$, provided that there is a $k$-rational line somewhere on $X$. In the process, we verify the Coba…

computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all abstract computable…

We prove a fast computable criterion that expresses non-flatness in terms of torsion: Let R be a regular algebra of finite type over a field K of characteristic zero and let F be a module finitely generated over an R-algebra of finite type.…

This article establishes a complete approximate axiomatization for the real-closed field $\mathbb{R}$ expanded with all differentially-defined functions, including special functions such as $\sin(x), \cos(x), e^x, \dots$. Every true…