Related papers: A New Trinomial Recombination Tree Algorithm and I…
Many problems in science and engineering fields require the solution of shifted linear systems. To solve such systems efficiently, the recycling BiCG (RBiCG) algorithm in [SIAM J. SCI. COMPUT, 34 (2012) 1925-1949] is extended in this paper.…
Recent work has proven the existence of extreme inbreeding in a European ancestry sample taken from the contemporary UK population \cite{nature_01}. This result brings our attention again to a math problem related to inbreeding family trees…
Techniques for the evaluation of complex polynomials with one and two variables are introduced. Polynomials arise in may areas such as control systems, image and signal processing, coding theory, electrical networks, etc., and their…
It is shown that the unique representation of positive integers in terms of tribonacci numbers and the unique representation in terms of iterated A, B and C sequences defined from the tribonacci word are equivalent. Two auxiliary…
In this note we prove an explicit binomial formula for Jack polynomials and discuss some applications of it.
This paper examines the use of a hierarchical coevolutionary genetic algorithm under different partnering strategies. Cascading clusters of sub-populations are built from the bottom up, with higher-level sub-populations optimising larger…
Reconciling a gene tree with a species tree is an important task that reveals much about the evolution of genes, genomes, and species, as well as about the molecular function of genes. A wide array of computational tools have been devised…
In this study, we apply "r" times the binomial transform to the Padovan and Perrin matrix sequences. Also, the Binet formulas, summations, generating functions of these transforms are found using recurrence relations. Finally, we give the…
We prove a binomial formula for Macdonald polynomials and consider applications of it.
Numerous attempts have been made to replicate the success of complex-valued algebra in engineering and science to other hypercomplex domains such as quaternions, tessarines, biquaternions, and octonions. Perhaps, none have matched the…
An observation on Hall-Littlewood polynomials.
We combinatorially prove a new recurrence between the Tutte polynomials of graphs obtained by contraction of the complete graphs $K_{n}$%. This generalizes, to two variables, a relation previously obtained by the author between the…
Dynamic regression trees are an attractive option for automatic regression and classification with complicated response surfaces in on-line application settings. We create a sequential tree model whose state changes in time with the…
Given any two sequences of complex numbers, we establish simple relations between their binomial convolution and the binomial convolution of their individual binomial transforms. We employ these relations to derive new identities involving…
We take a categorical approach to describe ternary derivations and ternary automorphisms of triangular algebras. New classes of automorphisms and derivations of triangular algebras are also introduced and studied.
We present four novel approximation algorithms for finding triangulation of minimum treewidth. Two of the algorithms improve on the running times of algorithms by Robertson and Seymour, and Becker and Geiger that approximate the optimum by…
Embeddings of graphs into distributions of trees that preserve distances in expectation are a cornerstone of many optimization algorithms. Unfortunately, online or dynamic algorithms which use these embeddings seem inherently randomized and…
In this paper I present a conjecture for a recursive algorithm that finds each permutation of combining two sets of objects (AKA the Shuffle Product). This algorithm provides an efficient way to navigate this problem, as each atomic…
Tree kernels are fundamental tools that have been leveraged in many applications, particularly those based on machine learning for Natural Language Processing tasks. In this paper, we devise a parallel implementation of the sequential…
We proposed the tensor-input tree (TT) method for scalar-on-tensor and tensor-on-tensor regression problems. We first address scalar-on-tensor problem by proposing scalar-output regression tree models whose input variable are tensors (i.e.,…