Related papers: Computing higher rank primitive root densities

Let $k$ be a finite field, and $L$ be a $q$-linearized polynomial defined over $k$ of $q$-degree $r$ ($L=\sum^r_{i=0}a_iZ^{q^i}$, with $a_i\in k$). This paper provides an algorithm to compute a characteristic polynomial of $L$ over a large…

Building upon works of Hironaka, Bierstone-Milman, Villamayor and Wlodarczyk, we give an a priori estimate for the complexity of the simplified Hironaka algorithm. As a consequence of this result, we show that there exists canonical…

We obtain (conditional and unconditional) results on large values of $L$-functions $L(s,\chi)$ in the critical strip $1/2 \leq \Re s \leq 1$ when the character $\chi$ runs through a thin subgroup of all characters modulo an integer $q$.…

We study a relation between roots of characteristic polynomials and intersection points of line arrangements. Using these results, we obtain a lot of applications for line arrangements. Namely, we give (i) a generalized addition theorem for…

We develop the theory of resolvent degree, introduced by Brauer \cite{Br} in order to study the complexity of formulas for roots of polynomials and to give a precise formulation of Hilbert's 13th Problem. We extend the context of this…

There are several methods to treat ensembles of random matrices in symmetric spaces, circular matrices, chiral matrices and others. Orthogonal polynomials and the supersymmetry method are particular powerful techniques. Here, we present a…

We solve the problem of extension of characters of commutative subalgebras in associative (noncommutative) algebras for a class of subrings (Galois orders) in skew group rings. These results can be viewed as a noncommutative analogue of…

We give a new heuristic for all of the main terms in the integral moments of various families of primitive L-functions. The results agree with previous conjectures for the leading order terms. Our conjectures also have an almost identical…

Let k be an imaginary quadratic number field (with class number 1). We describe a new, essentially linear-time algorithm, to list all isomorphism classes of cubic extensions L/k up to a bound X on the norm of the relative discriminant…

Motivated by the orthogonality relations for irreducible characters of a finite group, we evaluate the sum of a finite group of linear characters of a Hopf algebra, at all grouplike and skew-primitive elements. We then discuss results for…

In the study of random access machines (RAMs) it has been shown that the availability of an extra input integer, having no special properties other than being sufficiently large, is enough to reduce the computational complexity of some…

Let $x$ be an eigenvector for an element of a finite irreducible reflection group $W$. Let $W_x$ denote the subgroup of $W$ which stabilises $x$. We provide an upper bound for the number of roots in the root system of $W_x$ . This…

We use tools of additive combinatorics for the study of subvarieties defined by {\it high rank} families of polynomials in high dimensional $\mathbb{F} _q$-vector spaces. In the first, analytic part of the paper we prove a number properties…

Let A be an abelian variety defined over a number field and of dimension g. When g<3, by the recent work of Sawin, we know the exact (nonzero) value of the density of the set of primes which are ordinary for A. In higher dimension very…

The notion of Ehrhart tensor polynomials, a natural generalization of the Ehrhart polynomial of a lattice polytope, was recently introduced by Ludwig and Silverstein. We initiate a study of their coefficients. In the vector and matrix…

We explore an algorithm for approximating roots of integers, discuss its motivation and derivation, and analyze its convergence rates with varying parameters and inputs. We also perform comparisons with established methods for approximating…

These lecture notes are intended as an introduction to several notions of tensor rank and their connections to the asymptotic complexity of matrix multiplication. The latter is studied with the exponent of matrix multiplication, which will…

We prove that the density of polynomials $P(x)=\sum_{i=0}^n a_n x^n$ over a local field $K$ generating an \'etale extension with specified splitting type is a rational function in terms of the size of the residue field of $K$ in the case…

Let $K$ be a field of characteristic zero over which every diagonal form in sufficiently many variables admits a nontrivial solution. For example, $K$ may be a totally imaginary number field or a finite extension of a $p$-adic field.…

Though there have been hundreds of methods on solving rational spectral factorization, most of them are based on a positive definite density matrix assumption. In this work, we propose a novel approach on the spectral factorization of a…