Related papers: The great trinomial hunt
The incircle of a triangle touches the sides of the triangle in three points. It is well known that the lines from these points to the opposite vertices meet at a point known as the Gergonne point of the triangle. We use a computer to…
A total prime labeling of a graph of order $n$ is an extension of a prime labeling in which we distinctly label the vertices and edges. The goal of the labeling is for adjacent vertex labels to be relatively prime, and for each vertex of…
A (positive definite and integral) quadratic form is said to be $\textit{prime-universal}$ if it represents all primes. Recently, Doyle and Williams in [2] classified all prime-universal diagonal ternary quadratic forms, and all…
Mastermind is in essence a search problem in which a string of symbols that is kept secret must be found by sequentially playing strings that use the same alphabet, and using the responses that indicate how close are those other strings to…
We describe the images of multilinear polynomials of degree up to four on the upper triangular matrix algebra.
We propose an equivalent formula for the higher-order derivatives used in the study of Generalized Almost Perfect Nonlinear functions over an arbitrary finite field of characteristic $p$. The result is obtained by counting the number of…
We present a method for finding large fixed-size primes of the form $X^2+c$. We study the density of primes on the sets $E_c = \{N(X,c)=X^2+c,\ X \in (2\mathbb{Z}+(c-1))\}$, $c \in \mathbb{N}^*$. We describe an algorithm for generating…
The aim of this paper is the introduction of a new method for the numerical computation of the rank of a three-way array. We show that the rank of a three-way array over R is intimately related to the real solution set of a system of…
For each integer $n\ge 2$, we identify new infinite families of monogenic trinomials $f(x)=x^n+Ax^m+B$ with non-squarefree discriminant, many of which have small Galois group. These families are thus different from many previous…
We consider the sequence of integers whose $n$th term has base-$p$ expansion given by the $n$th row of Pascal's triangle modulo $p$ (where $p$ is a prime number). We first present and generalize well-known relations concerning this…
The new method for obtaining a variety of extensions of Hermite polynomials is given. As a first example a family of orthogonal polynomial systems which includes the generalized Hermite polynomials is considered. Apparently, either these…
We use computational algorithms recently developed by us to study completely four index divergence free quadratic in Riemann tensor polynomials in GR. Some results are new and some other reproduce and/or correct known ones. The algorithms…
Since the first microlensing planet discovery in 2003, more than 200 planets have been detected with gravitational microlensing, in addition to several free-floating planet and black hole candidates. In this chapter the microlensing theory…
An overview of the main strategies followed in the search for non-baryonic particle dark matter in the form of WIMPs is given. To illustrate these searches the case for Germanium ionization detectors is selected.
Highly efficient and even nearly optimal algorithms have been developed for the classical problem of univariate polynomial root-finding (see, e.g., \cite{P95}, \cite{P02}, \cite{MNP13}, and the bibliography therein), but this is still an…
This paper investigates the problem of determining a binary-valued function through a sequence of strategically selected queries. The focus is an algorithm called Generalized Binary Search (GBS). GBS is a well-known greedy algorithm for…
The primary purpose of this article is to study the asymptotic and numerical estimates in detail for higher degree polynomials in $\pi(x)$ having a general expression of the form, \begin{align*} P(\pi(x)) - \frac{e x}{\log x} Q(\pi(x/e)) +…
In the design of greedy algorithms for the maximum cardinality matching problem the utilization of degree information when selecting the next edge is a well established and successful approach. We define the class of "degree sensitive"…
We consider the Tutte polynomial of three classes of greedoids: those arising from rooted graphs, rooted digraphs and binary matrices. We establish the computational complexity of evaluating each of these polynomials at each fixed rational…
Here we demonstrate a sieve for analysing primes and their composites, using equivalence classes based on the modulo 6 return value as applied to the Natural numbers. Five features of this 'Hexile' sieve are reviewed. The first aspect, is…