Related papers: The Membership Problem for Hypergeometric Sequence…
A phylogenetic tree shows the evolutionary relationships among species. Internal nodes of the tree represent speciation events and leaf nodes correspond to species. A goal of phylogenetics is to combine such trees into larger trees, called…
Let $(x_n)_{n\geq0}$ be a linear recurrence sequence of order $k\geq2$ satisfying $$x_n=a_1x_{n-1}+a_2x_{n-2}+\dots+a_kx_{n-k}$$ for all integers $n\geq k$, where $a_1,\dots,a_k,x_0,\dots, x_{k-1}\in \mathbb{Z},$ with $a_k\neq0$. In 2017,…
Based on a reduction processing, we rewrite a hypergeometric term as the sum of the difference of a hypergeometric term and a reduced hypergeometric term (the reduced part, in short). We show that when the initial hypergeometric term has a…
In this work we study orthogonal polynomials via polynomial mappings in the framework of the $H_q-$semiclassical class. We consider two monic orthogonal polynomial sequences $\{p_n (x)\}_{n\geq0}$ and $\{q_n(x)\}_{n\geq0}$ such that $$…
The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…
We investigate the degree sequences of geometric preferential attachment graphs in general compact metric spaces. We show that, under certain conditions on the attractiveness function, the behaviour of the degree sequence is similar to that…
We define the generalized hypergeometric polynomial of degree N in terms of the generalized hypergeometric function that depends on p parameters a_1, ..., a_p and q parameters b_1, ..., b_q. The parameters are "generic", possibly complex,…
Using an algebraic method for solving the wave equation in quantum mechanics, we encountered a new class of orthogonal polynomials on the real line. It consists of a four-parameter polynomial with continuous spectrum on the whole real line…
Linear recursions of degree $k$ are determined by evaluating the sequence of Generalized Fibonacci Polynomials, $\{F_{k,n}(t_1,...,t_k)\}$ (isobaric reflects of the complete symmetric polynomials) at the integer vectors $(t_1,...,t_k)$. If…
Modified dispersion relations (MDRs) arise in many quantum-gravity approaches, often in non-polynomial or non-analytic form beyond the reach of effective field theory (EFT). Logarithmic, exponential and trigonometric MDRs appear in causal…
In this paper we study the problem of deciding whether two disjoint semialgebraic sets of an algebraic variety over R are separable by a polynomial. For that we isolate a dense subfamily of Spaces of Orderings, named Geometric, which…
We construct a class of representations of the quadratic $R$-matrix algebra given by the reflection equation with the spectral parameter, $$ R{\,}(u-v)\,T^{(1)}(u)\,R{\,}(u+v)\,T^{(2)}(v)= T^{(2)}(v)\,R{\,}(u+v)\,T^{(1)}(u)\,R{\,}(u-v), $$…
Hypertree decompositions (HDs), as well as the more powerful generalized hypertree decompositions (GHDs), and the yet more general fractional hypertree decompositions (FHDs) are hypergraph decomposition methods successfully used for…
We study the Diophantine equation of type $U_n(x)=V_m(y)$, where $(U_n)_{n\geq 0}$ and $(V_m)_{m\geq 0}$ are polynomial power sums defined over a number field $K$. By applying the finiteness criterion of Bilu and Tichy, we show under…
We give a general procedure to construct algebro-geometric Feynman rules, that is, characters of the Connes-Kreimer Hopf algebra of Feynman graphs that factor through a Grothendieck ring of immersed conical varieties, via the class of the…
We show that every countable group H with solvable word problem (=computable group) can be subnormally embedded into a 2-generated group G which also has solvable word problem. Moreover, the membership problem for H < G is also solvable. We…
We study the Identity Problem, the problem of determining if a finitely generated semigroup of matrices contains the identity matrix; see Problem 3 (Chapter 10.3) in ``Unsolved Problems in Mathematical Systems and Control Theory'' by…
We describe an algorithm that takes as input a complex sequence $(u_n)$ given by a linear recurrence relation with polynomial coefficients along with initial values, and outputs a simple explicit upper bound $(v_n)$ such that $|u_n| \leq…
We introduce the "moment rank" and "unitary rank" of numerical sequences, close relatives of linear-recursive order. We show that both parameters can be characterized by a broad set of criteria involving moments of measures, types of…
In 2017, He [Proc. Amer. Math. Soc. 145 (2017), 501--508] established two spuercongruences on truncated hypergeometric series and further proposed two related conjectures. Subsequently, Liu [Results Math. 72 (2017), 2057--2066] extended…