Related papers: The Membership Problem for Hypergeometric Sequence…

We investigate the parameterized complexity of finding subgraphs with hereditary properties on graphs belonging to a hereditary graph class. Given a graph $G$, a non-trivial hereditary property $\Pi$ and an integer parameter $k$, the…

The Ap\'ery numbers may be defined by a cubic three-term recurrence relation, that is, a three-term relation where the coefficients are polynomials in the index of degree $3$. In this work, we first provide a systematic review of Ap\'ery…

Let $f(x)\in {\mathbb Z}[x]$ be an $N$th degree polynomial that is monic and irreducible over ${\mathbb Q}$. We say that $f(x)$ is {\em monogenic} if $\{1,\theta,\theta^2,\ldots ,\theta^{N-1}\}$ is a basis for the ring of integers of…

We define the generalized basic hypergeometric polynomial of degree $N \geq 1$ in terms of the generalized basic hypergeometric function, which depends on (arbitrary, generic, possibly complex) parameters $q \neq 1$, the $r \geq 0$…

In a previous work ([Eb]), the author proposed a method employing contiguity relations to derive hypergeometric series in closed form. In [Eb], this method was used to derive Gauss's hypergeometric series $_2F_1$ possessing closed forms.…

Difficulties in replication and reproducibility of empirical evidences in machine learning research have become a prominent topic in recent years. Ensuring that machine learning research results are sound and reliable requires…

In a representative democracy, the electoral process involves partitioning geographical space into districts which each elect a single representative. These representatives craft and vote on legislation, incentivizing political parties to…

Let $n$ and $k$ be positive integers, and $f_n(k)$ (resp. $g_n(k)$) be the number of unital subrings (resp. unital irreducible subrings) of $\mathbb{Z}^n$ of index $k$. The numbers $f_n(k)$ are coefficients of certain zeta functions of…

We give a systematic and unified discussion of various classes of hypergeometric type equations: the hypergeometric equation, the confluent equation, the F_1 equation (equivalent to the Bessel equation), the Gegenbauer equation and the…

In the discrete Tempotron learning problem a neuron receives time varying inputs and for a set of such input sequences ($\mathcal S_-$ set) the neuron must be sub-threshold for all times while for some other sequences ($\mathcal S_+$ set)…

Motivated by various results on homogeneous geodesics of Riemannian spaces, we study homogeneous trajectories, i.e. trajectories which are orbits of a one-parameter symmetry group, of Lagrangian and Hamiltonian systems. We present criteria…

In this paper, we present a new method for finding identities for hypergeoemtric series, such as the (Gauss) hypergeometric series, the generalized hypergeometric series and the Appell-Lauricella hypergeometric series. Furthermore, using…

We introduce a procedure based on computational algebraic geometry to determine whether two algebras are isomorphic. We then apply it to show that if $R$ is a commutative unital ring in which $2$ is not invertible, $G$ is a group of order…

In this paper we study the threshold model of \emph{geometric inhomogeneous random graphs} (GIRGs); a generative random graph model that is closely related to \emph{hyperbolic random graphs} (HRGs). These models have been observed to…

In this note, we shall provide several properties of hypergeometric Bernoulli numbers and polynomials, including sums of products identity, differential equations and recurrence formulas.

Complex systems, ranging from soft materials to wireless communication, are often organised as random geometric networks in which nodes and edges evenly fill up the volume of some space. Studying such networks is difficult because they…

The Gauss-Manin connection of a family of hypersurfaces governs the change of the period matrix along the family. This connection can be complicated even when the equations defining the family look simple. When this is the case, it is…

Subgraph pattern detection aims to uncover complex interaction structures in graphs. However, state-of-the-art graph neural network (GNN)-based solutions assume centralized access to the entire graph. When graphs are instead distributed…

We study a random graph $G_n$, which combines aspects of geometric random graphs and preferential attachment. The resulting random graphs have power-law degree sequences with finite mean and possibly infinite variance. In particular, the…

In this paper, we consider rational hypergeometric series of the form \[\frac{p}{\pi}= \sum_{k=0}^\infty u_k\quad\text{with}\quad u_k=\frac{\left(\frac{1}{2}\right)_k \left(q\right)_k \left(1-q\right)_k}{(k!)^3}(r+s\,k)\,t^k,\] where…