Related papers: A Simple Trigonometric Classification of Quintic R…

We explore extensions of tropical methods to arithmetic enumerative problems such as $\mathbb{A}^1$-enumeration with values in the Grothendieck-Witt ring, and rationality over Henselian valued fields, using bitangents to plane quartics as a…

Investigations of monogenity and power integral bases were recently extended from the absolute case (over Q) to the relative case (over algebraic number fields). Formerly, in the relative case we only succeeded to calculate generators of…

In this paper we give an algorithm for solving a main case of the conjugacy problem in the braid groups. We also prove that half-twists satisfy a special root property which allows us to reduce the solution for the conjugacy problem in…

Baxter's TQ-equation is solved for the six-vertex model using the representation theory of quantum groups at roots of unity. A novel simplified construction of the Q-operator is given depending on a new free parameter. Specializing this…

The most frequently asked question in the $p-$adic lattice models of statistical mechanics is that whether a root of a polynomial equation belongs to domains $\mathbb{Z}_p^{*}, \ \mathbb{Z}_p\setminus\mathbb{Z}_p^{*}, \ \mathbb{Z}_p, \…

The review of modern study of algebraic, geometric and differential properties of quaternionic (Q) numbers with their applications. Traditional and "tensor" formulation of Q-units with their possible representations are discussed and groups…

Using methods from analytic number theory, for $m > 5$ and for $m = 4$, we obtain asymptotics with power-saving error terms for counts of elliptic curves with a cyclic $m$-isogeny up to quadratic twist over the rational numbers. For $m >…

[Inserted by J. Maurice Rojas] We give a formula for the number of complex roots of a generic system of two polynomial equations in two unknowns. The formula is completely combinatorial, ultimately depending just on the convex hull of the…

We prove the classical result, which goes back at least to Fourier, that a polynomial with real coefficients has all zeros real and distinct if and only if the polynomial and also all of its nonconstant derivatives have only negative minima…

We show in this paper that the roots $x_1$ and $x_2$ of a scalar quadratic polynomial $ax^2+bx+c=0$ with real or complex coefficients $a$, $b$ $c$ can be computed in a element-wise mixed stable manner, measured in a relative sense. We also…

In this paper, we use the Mellin-Barnes-Watson method to relate solutions of a certain type of $q$-difference equations at $Q=0$ and $Q=\infty$. We consider two special cases; the first is the $q$-difference equation of $K$-theoretic…

We present two effective tools for computing the positive tropicalization of algebraic varieties. First, we outline conditions under which the initial ideal can be used to compute the positive tropicalization, offering a real analogue to…

Let $\mathbb{F}_q$ denote the finite field with $q$ elements. In this work, we use characters to give the number of rational points on suitable curves of low degree over $\mathbb{F}_q$ in terms of the number of rational points on elliptic…

In this manuscript we study the counting problem for harmonic trinomials of the form $a\zeta^n+b\overline{\zeta}^m+c$, where $n,m\in \mathbb{N}$, $n>m$, and $a$, $b$ and $c$ are non-zero complex numbers. As a consequence, we obtain the…

Let $k$ be a field of characteristic $\neq 2$. In this paper we study squares, cubes and their products in split and anisotropic groups of type $A_1$. In split case, we show that computing $n^{\rm th}$ roots is equivalent to finding…

We study totally real number fields that admit a universal quadratic form whose coefficients are rational integers. We show that $\mathbb Q(\sqrt 5)$ is the only such real quadratic field, and that among fields of degrees 3, 4, 5, and 7…

We present a new algorithm for computing $m$-th roots over the finite field $\F_q$, where $q = p^n$, with $p$ a prime, and $m$ any positive integer. In the particular case $m=2$, the cost of the new algorithm is an expected $O(\M(n)\log (p)…

We determine all graphs whose matching polynomials have at most five distinct zeros. As a consequence, we find new families of graphs which are determined by their matching polynomial.

Using the interplay between topological, combinatorial, and geometric properties of polynomials and analytic results (primarily the covering structure and distortion estimates), we analyze a path-lifting method for finding approximate…

A fundamental problem in the theory of linearized and projective polynomials over finite fields is to characterize the number of roots in the coefficient field directly from the coefficients. We prove results of this type, of a recursive…