Related papers: Root number bias for newforms

An apriori bound for the condition number associated to each of the following problems is given: general linear equation solving, minimum squares, non-symmetric eigenvalue problems, solving univariate polynomials, solving systems of…

The goal of this paper is to explain certain experimentally observed properties of the (cuspidal) spectrum and its associated automorphic forms (Maass waveforms) on the congruence subgroup $\Gamma_{0}(9)$. The first property is that the…

We show that for any quadratic extension of number fields $K/F$, there exists an abelian variety $A/F$ of positive rank whose rank does not grow upon base change to $K$. This result implies that Hilbert's tenth problem over the ring of…

For an algebraic number $\alpha$ we consider the orders of the reductions of $\alpha$ in finite fields. In the case where $\alpha$ is an integer, it is known by the work on Artin's primitive root conjecture that the order is "almost always…

We prove that vector-valued Siegel cusp forms for $\Gamma_0^n(N)$ with certain nebentypus are determined by their fundamental Fourier coefficients with discriminants coprime to the level $N$, assuming $N$ is odd and square-free. In the case…

Let $S$ be one of $\{aba,bcb\}$ and $\{aba, aca\}$, and let $w$ be an infinite square-free word over $\Sigma=\{a,b,c\}$ with no factor in $S$. Suppose that $f:\Sigma\rightarrow T^*$ is a non-erasing morphism. Word $f(w)$ is square-free if…

The (weak) Nullstellensatz over finite fields says that if $P_1,\ldots,P_m$ are $n$-variate degree-$d$ polynomials with no common zero over a finite field $\mathbb{F}$ then there are polynomials $R_1,\ldots,R_m$ such that…

Bayesian model selection provides a formal method of determining the level of support for new parameters in a model. However, if there is not a specific enough underlying physical motivation for the new parameters it can be hard to assign…

Given a polynomial P in several variables over an algebraically closed field, we show that except in some special cases that we fully describe, if one coefficient is allowed to vary, then the polynomial is irreducible for all but at most…

Let $[\, \cdot\,]$ be the floor function. In this paper we show that when $1<c<\frac{3849}{3334}$, then there exist infinitely many prime numbers of the form $[n^c]$, where $n$ is square-free.

Some easily verifiable sufficient conditions for the nonexistence of iterative roots for multifunctions on arbitrary nonempty sets are presented. Typically if the graph of the multifunction has a distinguished point with a relatively large…

In an earlier work, the authors have determined all possible weights $n$ for which there exists a vanishing sum $\zeta_1+\cdots +\zeta_n=0$ of $m$th roots of unity $\zeta_i$ in characteristic 0. In this paper, the same problem is studied in…

We show that the following two problems are fixed-parameter tractable with parameter k: testing whether a connected n-vertex graph with m edges has a square root with at most n-1+k edges and testing whether such a graph has a square root…

Given a negative $D>-(\log X)^{\log 2-\delta}$, we give a new upper bound on the number of square free integers $<X$ which are represented by some but not all forms of the genus of a primitive positive definite binary quadratic form $f$ of…

We study two related probabilistic models of permutations and trees biased by their number of descents. Here, a descent in a permutation $\sigma$ is a pair of consecutive elements $\sigma(i), \sigma(i+1)$ such that $\sigma(i) >…

This paper studies the structure of core sets under different similarity classes. We investigate the influence of factors of the minimal polynomial with different degrees on the structure of core sets. When $F$ is a finite field of prime…

A theorem of Gekeler compares the number of non-isomorphic automorphic representations associated with the space of cusp forms of weight $k$ on $\Gamma_0(N)$ to a simpler function of $k$ and $N$, showing that the two are equal whenever $N$…

Newton iteration (NI) is an almost 350 years old recursive formula that approximates a simple root of a polynomial quite rapidly. We generalize it to a matrix recurrence (allRootsNI) that approximates all the roots simultaneously. In this…

Let $\sigma(n)$ to be the sum of the positive divisors of $n$. A number is non-deficient if $\sigma(n) \geq 2n$. We establish new lower bounds for the number of distinct prime factors of an odd non-deficient number in terms of its second…

Despite the fact that almost all real numbers are absolutely normal---that is, the digits in their expansions to any base occur in all possible configurations with the expected frequency---not one specific example of an absolutely normal…