Related papers: A taylor-made arithmetic model of the genetic code…
Pedigrees, or family trees, are graphs of family relationships that are used to study inheritance. A fundamental problem in computational biology is to find, for a pedigree with $n$ individuals genotyped at every site, a set of…
We introduce the degenerate Bernoulli numbers of the second kind as a degenerate version of the Bernoulli numbers of the second kind. We derive a family of nonlinear differential equations satisfied by a function closely related to the…
In this paper, we study the degenerate Eulerian polynomials and numbers and give some new and interesting identities associated with several special numbers and polynomials.
A class of random recursive sequences (Y_n) with slowly varying variances as arising for parameters of random trees or recursive algorithms leads after normalizations to degenerate limit equations of the form X\stackrel{L}{=}X. For…
It is shown that Pythagorean triples can be used to generate matrices that have integer eigenvalues for all permutations of their coefficients, via simple formulas. For example, each and every permutation of the $2\times2$ matrix…
In [4] we describe a variation of the classical permutation decoding algorithm that can be applied to any binary affine-invariant code; in particular, it can be applied to first-order Reed-Muller codes successfully. In this paper we study…
We study the computational complexity of singularity for multilinear maps. While the determinant characterizes singularity for matrices, its multilinear analogue -- the hyperdeterminant -- is defined only in boundary format and quickly…
This work aims at showing the relevance and the applications possibilities of the Fibonacci sequence, and also its q-deformed or quantum extension, in the study of the genetic code(s). First, after the presentation of a new formula, an…
A novel decoding algorithm is developed for general quantum convolutional codes. Exploiting useful ideas from classical coding theory, the new decoder introduces two innovations that drastically reduce the decoding complexity compared to…
In this paper, we consider the degenerate multi-poly-Bernoulli numbers and polynomials which are defined by means of the multiple polylogarithms and degenerate versions of the multi-poly-Bernoulli numbers and polynomials. We investigate…
In this paper, we study the degenerate derangement polynomials and numbers, investigate some properties of those polynomials and numbers and explore their connections with the degenerate gamma distributions. In more detail, we derive their…
Modern advances in general-purpose computer algebra systems offer solutions to a variety of problems, which in the past required substantial time investments by trained mathematicians. An excellent example of such development are the…
A permutiple is a natural number that is a nontrivial multiple of a permutation of its digits in some base. Special cases of permutiples include cyclic numbers (multiples of cyclic permutations of their digits) and palintiple numbers…
This paper introduces and investigates degenerate versions of the A-algorithm and B-algorithm by incorporating a parameter lambda into their respective recurrence relations. We derive explicit formulas for the final sequences of these…
We study the variation of the Enriquez connection for higher genus polylogarithms under degenerations of Riemann surfaces with marked points, and show that this connection becomes the connection constructed by the author for degenerating…
Learning ensembles by bagging can substantially improve the generalization performance of low-bias, high-variance estimators, including those evolved by Genetic Programming (GP). To be efficient, modern GP algorithms for evolving (bagging)…
We present new results on the classical algorithm of variable elimination, which underlies many algorithms including for probabilistic inference. The results relate to exploiting functional dependencies, allowing one to perform inference…
For simple digital circuits, conventional method of designing circuits can easily be applied. But for complex digital circuits, the conventional method of designing circuits is not fruitfully applicable because it is time-consuming. On the…
Among the evolutionary methods, one that is quite prominent is Genetic Programming, and, in recent years, a variant called Geometric Semantic Genetic Programming (GSGP) has shown to be successfully applicable to many real-world problems.…
Analyzing the computational complexity of evolutionary algorithms for binary search spaces has significantly increased their theoretical understanding. With this paper, we start the computational complexity analysis of genetic programming.…