Related papers: Is it possible to compute the Moebius function wit…
Recently Dritschel proves that any positive multivariate Laurent polynomial can be factorized into a sum of square magnitudes of polynomials. We first give another proof of the Dritschel theorem. Our proof is based on the univariate matrix…
Let $D>1$ be an integer, and let $b=b(D)>1$ be its smallest divisor. We show that there are infinitely many number fields of degree $D$ whose primitive elements all have relatively large height in terms of $b$, $D$ and the discriminant of…
In Bayesian hypothesis testing, evidence for a statistical model is quantified by the Bayes factor, which represents the relative likelihood of observed data under that model compared to another competing model. In general, computing Bayes…
Define the $n$-th fibotomic polynomial to be the product of the monic irredicible factors of the $n$-th Fibonacci polynomial which are not factors of any Fibonacci polynomial of smaller degree. In this paper, we prove a number of properties…
We obtain an explicit simple formula for the coefficients of the asymptotic expansion for the factorial of a natural number,in terms of derivatives of powers of an elementary function. The unique explicit expression for the coefficients…
We show that the adjoint matrix of a generic square matrix of even size can be factored nontrivially, answering a question of G. Bergman. This note is a preliminary report on work in progress.
We present a simple method for the construction of polynomials with cyclic Galois groups, hoping to encourage a reader with some background in algebra to make computations of his/her own.
We show that the logarithm $\log_q$ of the Frobenius morphism $x\to x^q$ is given by the formula $x\to x\log x$ (the natural logarithm). In particular, it does not depend on $q$. This is the explicit (although heuristical) formula for the…
We show that every function f implemented as a lookup table can be implemented such that the computational complexity of evaluating f^m(x) is small, independently of m and x. The implementation only increases the storage space by a…
It is proved that for certain algebras of continuous functions on compact abelian groups, the set of factorable matrix functions with entries in the algebra is not dense in the group of invertible matrix functions with entries in the…
We construct blocks of finite groups with arbitrarily large Morita Frobenius numbers, an invariant which determines the size of the minimal field of definition of the associated basic algebra. This answers a question of Benson and Kessar.…
We develop a method to construct elusive functions using techniques of commutative algebra and algebraic geometry. The key notions of this method are elusive subsets and evaluation mappings. We also develop the effective elimination theory…
A computable ring is a ring equipped with mechanical procedure to add and multiply elements. In most natural computable integral domains, there is a computational procedure to determine if a given element is prime/irreducible. However,…
In this paper we derive an explicit formula for calculating the marginal likelihood of a given factorization of a categorical dataset. Since the marginal likelihood is proportional to the posterior probability of the factorization, these…
Bayesian inference gets its name from *Bayes's theorem*, expressing posterior probabilities for hypotheses about a data generating process as the (normalized) product of prior probabilities and a likelihood function. But Bayesian inference…
In this paper, we study the properties of Carmichael numbers, false positives to several primality tests. We provide a classification for Carmichael numbers with a proportion of Fermat witnesses of less than 50%, based on if the smallest…
Let $m$ be a Carmichael number and let $L$ be the least common multiple of $p-1$, where $p$ runs over the prime factors of $m$. We determine all the Carmichael numbers $m$ with a Fermat prime factor such that $L=2^{\alpha}P^2$, where $k\in…
Indicator functions mentioned in the title are constructed on an arbitrary nondiscrete locally compact Abelian group of finite dimension. Moreover, they can be obtained by small perturbation from any indicator function fixed beforehand. In…
We provide a new algorithm for tabulating composite numbers which are pseudoprimes to both a Fermat test and a Lucas test. Our algorithm is optimized for parameter choices that minimize the occurrence of pseudoprimes, and for pseudoprimes…
In his book \emph{Topics in Analytic Number Theory}, Hans Rademacher conjectured that the limits of certain sequences of coefficients that arise in the ordinary partial fraction decomposition of the generating function for partitions of…