Related papers: The great trinomial hunt
Let $p$ be a prime divisor of the order of a finite group $G$. Then $G$ has at least $2 \sqrt{p-1}$ complex irreducible characters of degrees prime to $p$. In case $p$ is a prime with $\sqrt{p-1}$ an integer this bound is sharp for…
Artificial Neural Networks (ANNs) are prevalent machine learning models that are applied across various real-world classification tasks. However, training ANNs is time-consuming and the resulting models take a lot of memory to deploy. In…
We define tensors, corresponding to cubic polynomials, which have the same exponent $\omega$ as the matrix multiplication tensor. In particular, we study the symmetrized matrix multiplication tensor $sM_n$ defined on an $n\times n$ matrix…
We describe the set of prime numbers splitting completely in the non-abelian splitting field of certain monic irreducible polynomials of degree three. As an application we establish some divisibility properties of the associated ternary…
Given a parametric polynomial ideal I, the algorithm DISPGB, introduced by the author in 2002, builds up a binary tree describing a dichotomic discussion of the different reduced Groebner bases depending on the values of the parameters,…
Recent work by Craig, van Ittersum, and Ono constructs explicit expressions in the partition functions of MacMahon that detect the prime numbers. Furthermore, they define generalizations, the MacMahonesque functions, and prove there are…
Weakly Interacting Massive Particles (WIMPs) are among the best-motivated dark matter candidates. In light of no conclusive detection signal yet despite an extensive search program that combines, often in a complementary way, direct,…
We prove that the universal homogeneous 3-uniform hypergraph has finite big Ramsey degrees. This is the first case where big Ramsey degrees are known to be finite for structures in a non-binary language. Our proof is based on the vector (or…
Let $p_n$ is the $n$-th prime. With help of the Cram\'er-like model, we prove that the set of intervals of the form $(2p_n,\enskip2p_{n+1})$ containing at list 3 primes has a positive density with respect to the set of all intervals of such…
We study properties of recently introduced Wieferich primes for Drinfeld modules, as their relation with Fermat equations and finitess or non-finiteness of their number. We also introduce Mersenne numbers for Drinfeld modules, and study the…
We speculate on the distribution of primes in exponentially growing, linear recurrence sequences $(u_n)_{n\geq 0}$ in the integers. By tweaking a heuristic which is successfully used to predict the number of prime values of polynomials, we…
This is an introductory document surveying several results in polynomial approximation, known as the Bramble-Hilbert lemma.
We present TripNet, a method for constructing phylogenetic networks from triplets. We will present the motivations behind our approach and its theoretical and empirical justification. To demonstrate the accuracy and efficiency of TripNet,…
We give all non splitting bi-unitary perfect polynomials over the prime field of two elements, which have only Mersenne polynomials as odd irreducible divisors.
The highly sensitive method to search for WIMPs dark matter particles is proposed. An array of thin NaI(Tl) plate has the great selectivity for distinguishing the WIMPs events and background ones. The principle of signal selection for WIMPs…
After a brief introduction to dark matter in general and to WIMPs as candidates, we review recent results of direct dark matter searches. We concentrate on older and more recent hints pointing to light WIMP's with mass below 10 GeV.
Building on the concept of pretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions.
Given a presilting object in a triangulated category, we find necessary and sufficient conditions for the existence of a complement. This is done both for classic (pre)silting objects and for large (pre)silting objects. The key technique is…
The Systematic KMTNet Planetary Anomaly Search series was conducted using the KMTNet data archived from $2016$ to $2019$. From this first phase of the series, we reported a total of $50$ planetary systems hidden in the data archive, which…
There is presented an algorithm for computing the topological degree for a large class of polynomial mappings. As an application there is given an effective algebraic formula for the intersection number of a polynomial immersion M --> R^2m,…