Related papers: The Membership Problem for Hypergeometric Sequence…
Sequence transformations accomplish an acceleration of convergence or a summation in the case of divergence by detecting and utilizing regularities of the elements of the sequence to be transformed. For sufficiently large indices, certain…
Many complex networks exhibit hierarchical, tree-like structures, making hyperbolic space a natural candidate wherein to learn representations of them. Based on this observation, Hyperbolic Graph Neural Networks (HGNNs) have been widely…
Models for sequential data such as the recurrent neural network (RNN) often implicitly model a sequence as having a fixed time interval between observations and do not account for group-level effects when multiple sequences are observed. We…
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…
We study the parameterized complexity of dominating sets in geometric intersection graphs. In one dimension, we investigate intersection graphs induced by translates of a fixed pattern Q that consists of a finite number of intervals and a…
For $a,b,c,z,p, \theta \in \mathbb{C}$, where $\mathbb{C}$ is the complex plane, $-c\notin \mathbb{N\cup }\left\{ 0\right\} $, let \begin{equation*} \mathcal{M}\left( z\right) =\left( 1-\theta z\right) ^{p}M\left(a;c;z\right)…
Mulmuley and Sohoni (GCT1 in SICOMP 2001, GCT2 in SICOMP 2008) proposed to view the permanent versus determinant problem as a specific orbit closure problem and to attack it by methods from geometric invariant and representation theory. We…
The special case of the hypergeometric function $_{2}F_{1}$ represents the binomial series $(1+x)^{\alpha}=\sum_{n=0}^{\infty}(\:\alpha n\:)x^{n}$ that always converges when $|x|<1$. Convergence of the series at the endpoints, $x=\pm 1$,…
Let $\xi$ be an irrational algebraic real number and $(p_k / q_k)_{k \ge 1}$ denote the sequence of its convergents. Let $(u_n)_{n \geq 1}$ be a non-degenerate linear recurrence sequence of integers, which is not a polynomial sequence. We…
Recent results from real algebraic geometry and the theory of polynomial optimization are related in a new framework to the existence question of multivariate tight wavelet frames whose generators have at least one vanishing moment. Namely,…
We study the set $\mathcal{L}_{F}$ of all $F$-vector spaces $L(P)$ where $P$ is monic and splits over $F$ and $L(Q)$ denotes the set of linear recurrence sequences over $F$ with characteristic polynomial $Q$. We show that $\mathcal{L}_{F}$…
Fox, Gromov, Lafforgue, Naor, and Pach proved a regularity lemma for semi-algebraic $k$-uniform hypergraphs of bounded complexity, showing that for each $\epsilon>0$ the vertex set can be equitably partitioned into a bounded number of parts…
Graph neural networks (GNNs) have emerged as powerful tools for learning protein structures by capturing spatial relationships at the residue level. However, existing GNN-based methods often face challenges in learning multiscale…
Motivated by its applications to the word problem for one-relator inverse monoids, via results of Ivanov, Margolis, and Meakin (2001), we prove several decidability and undecidability results about the submonoid membership problem in…
We define the Homomorphism Extension (HomExt) problem: given a group $G$, a subgroup $M \leq G$ and a homomorphism $\varphi: M \to H$, decide whether or not there exists a homomorphism $\widetilde{\varphi}: G\to H$ extending $\varphi$,…
In this paper, we present a new algorithm for computing the linear recurrence relations of multi-dimensional sequences. Existing algorithms for computing these relations arise in computational algebra and include constructing structured…
Graph Neural Networks (GNNs) have emerged as a prominent research topic in the field of machine learning. Existing GNN models are commonly categorized into two types: spectral GNNs, which are designed based on polynomial graph filters, and…
We study congruences involving truncated hypergeometric series of the form_rF_{r-1}(1/2,...,1/2;1,...,1;\lambda)_{(mp^s-1)/2} = \sum_{k=0}^{(mp^s-1)/2} ((1/2)_k/k!)^r \lambda^k where p is a prime and m, s, r are positive integers. These…
The Surjective Homomorphism problem is to test whether a given graph G called the guest graph allows a vertex-surjective homomorphism to some other given graph H called the host graph. The bijective and injective homomorphism problems can…
Let $U_n(q)$ denote the upper triangular group of degree $n$ over the finite field $\F_q$ with $q$ elements. It is known that irreducible constituents of supercharacters partition the set of all irreducible characters $\Irr(U_n(q)).$ In…