Related papers: The tree method for multidimensional q-Hahn and q-…
Meta-analysis represents a widely accepted approach for evaluating the accuracy of diagnostic tools in clinical and psychological investigations. This paper investigates the applicability of multinomial tree models recently suggested in the…
A metric phylogenetic tree relating a collection of taxa induces weighted rooted triples and weighted quartets for all subsets of three and four taxa, respectively. New intertaxon distances are defined that can be calculated from these…
We find a formula for the number of permutation polynomials of degree q-2 over a finite field Fq, which has q elements, in terms of the permanent of a matrix. We write down an expression for the number of permutation polynomials of degree…
This paper is devoted to one theory of hypergraph connectivity and presents the proof of the polynomial algorithm for finding an optimal spanning hyperforest(hypertree) for any given weighed q-uniform hypergraph.
Kopparty and Wang studied in [3] the relation between the roots of a univariate polhynomial over GF(q) and the zero-nonzero pattern of its coefficients. We generalize their results to polynomials in more variables.
A many variable $q$-calculus is introduced using the formalism of braided covector algebras. Its properties when certain of its deformation parameters are roots of unity are discussed in detail, and related to fractional supersymmetry. The…
This work addresses a full characterization of three new q-polynomials derived from the $q-$oscillator algebra. Related matrix elements and generating functions are deduced. Further, a connection between Hahn factorial and q-Gaussian…
We explore the relationship between polynomial functors and (rooted) trees. In the first part we use polynomial functors to derive a new convenient formalism for trees, and obtain a natural and conceptual construction of the category…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…
Given a sequence of polynomials $(p_n)_n$, an algebra of operators $\mathcal A$ acting in the linear space of polynomials and an operator $D_p\in \mathcal A$ with $D_p(p_n)=\theta_np_n$, where $\theta_n$ is any arbitrary eigenvalue, we…
Let $\mathbb{F}_q$ be the finite field with $q$ elements, where $q$ is a prime power and $n$ be a positive integer. In this paper, we explore the factorization of $f(x^{n})$ over $\mathbb{F}_q$, where $f(x)$ is an irreducible polynomial…
Rooted tree maps assign to an element of the Connes-Kreimer Hopf algebra of rooted trees a linear map on the noncommutative polynomial algebra in two letters. Evaluated at any admissible word these maps induce linear relations between…
We develop a theory of extensions of hyperfields that generalizes the notion of field extensions. Since hyperfields have a multivalued addition, we must consider two kinds of extensions that we call weak hyperfield extensions and strong…
We introduce the notion of quota trees in directed graphs. Given a nonnegative integer ``quota'' for each vertex of a directed multigraph $G$, a quota tree is an immersed rooted tree which hits each vertex of $G$ the prescribed number of…
We describe fast algorithms for approximating the connection coefficients between a family of orthogonal polynomials and another family with a polynomially or rationally modified measure. The connection coefficients are computed via…
We introduce a graph polynomial that distinguishes tree structures to represent dependency grammar and a measure based on the polynomial representation to quantify syntax similarity. The polynomial encodes accurate and comprehensive…
Given a weighted, ordered query set $Q$ and a partition of $Q$ into classes, we study the problem of computing a minimum-cost decision tree that, given any query $q$ in $Q$, uses equality tests and less-than comparisons to determine the…
In the computation of Feynman integrals which evaluate to multiple polylogarithms one encounters quite often square roots. To express the Feynman integral in terms of multiple polylogarithms, one seeks a transformation of variables, which…
Poly-trees are singly connected causal networks in which variables may arise from multiple causes. This paper develops a method of recovering ply-trees from empirically measured probability distributions of pairs of variables. The method…
Orthogonal polynomials with respect to the hypergeometric distribution on lattices in polyhedral domains in ${\mathbb R}^d$, which include hexagons in ${\mathbb R}^2$ and truncated tetrahedrons in ${\mathbb R}^3$, are defined and studied.…