Related papers: The Membership Problem for Hypergeometric Sequence…

Linear recurrent sequences are those whose elements are defined as linear combinations of preceding elements, and finding recurrence relations is a fundamental problem in computer algebra. In this paper, we focus on sequences whose elements…

We study the following problem and its applications: given a homogeneous degree-$d$ polynomial $g$ as an arithmetic circuit, and a $d \times d$ matrix $X$ whose entries are homogeneous linear polynomials, compute $g(\partial/\partial x_1,…

We consider the complexity of deciding membership of a given finite semigroup to a fixed pseudovariety. While it is known that there exist pseudovarieties with NP-complete or even undecidable membership problems, for many well-known…

Suppose $H$ is a hyperbolic subgroup of a hyperbolic group $G$. Assume there exists $n > 0$ such that the intersection of $n$ essentially distinct conjugates of $H$ is always finite. Further assume $G$ splits over $H$ with hyperbolic vertex…

A homomorphism $f$ from a guest graph $G$ to a host graph $H$ is locally bijective, injective or surjective if for every $u\in V(G)$, the restriction of $f$ to the neighbourhood of $u$ is bijective, injective or surjective, respectively.…

Motivated by approaches to the word problem for one-relation monoids arising from work of Adian and Oganesian (1987), Guba (1997), and Ivanov, Margolis and Meakin (2001), we study the submonoid and rational subset membership problems in…

Nowhere dense classes of graphs are very general classes of uniformly sparse graphs with several seemingly unrelated characterisations. From an algorithmic perspective, a characterisation of these classes in terms of uniform quasi-wideness,…

The present work stemmed from the study of the problem of harmonic analysis on the infinite-dimensional unitary group U(\infty). That problem consisted in the decomposition of a certain 4-parameter family of unitary representations, which…

We consider hypergraph network design problems where the goal is to construct a hypergraph that satisfies certain connectivity requirements. For graph network design problems where the goal is to construct a graph that satisfies certain…

We show that the Identity Problem is decidable in polynomial time for finitely generated sub-semigroups of the group $\mathsf{UT}(4, \mathbb{Z})$ of $4 \times 4$ unitriangular integer matrices. As a byproduct of our proof, we also show the…

Let $G$ be a u.s.c decomposition of $S^n$, $H_G$ denote the set of nondegenerate elements and $\pi$ be the projection of $S^n$ onto $S^n/G$. Suppose that each point in the decomposition space has arbitrarily small neighborhoods with…

We prove hypergeometric type identities for a function defined in terms of quotients of the $p$-adic gamma function. We use these identities to prove a supercongruence conjecture of Rodriguez-Villegas between a truncated $_4F_3$…

We establish a novel connection between the central binomial coefficients $\binom{2n}{n}$ and Gould's sequence through the construction of a specialized multivariate polynomial quotient ring. Our ring structure is characterized by ideals…

We study both the Submonoid Membership problem and the Rational Subset Membership problem in finitely generated nilpotent groups. We give two reductions with important applications. First, Submonoid Membership in any nilpotent group can be…

We study divide-and-conquer recurrences of the form \begin{equation*} f(n) = \alpha f(\lfloor \tfrac n2\rfloor) + \beta f(\lceil \tfrac n2\rceil) + g(n) \qquad(n\ge2), \end{equation*} with $g(n)$ and $f(1)$ given, where $\alpha,\beta\ge0$…

For a given divison algebra of the quaternions we construct two types of units: Pell units and Gauss units. If K is a rational quadratic extension and G is a finite group, we classify R and G, s.t., the unit group U(RG) of augmentation one…

New convolution identities of hypergeometric Bernoulli polynomials are presented. Two different approaches to proving these identities are discussed, corresponding to the two equivalent definitions of hypergeometric Bernoulli polynomials as…

Using parafermionic field theoretical methods, the fundamentals of 2d fractional supersymmetry ${\bf Q}^{K} =P$ are set up. Known difficulties induced by methods based on the $U_{q}(sl(2))$ quantum group representations and non commutative…

For any sequences $\mathbf{u}=\{u(n)\}_{n\geq0}, \mathbf{v}=\{v(n)\}_{n\geq0},$ we define $\mathbf{u}\mathbf{v}:=\{u(n)v(n)\}_{n\geq0}$ and $\mathbf{u}+\mathbf{v}:=\{u(n)+v(n)\}_{n\geq0}$. Let $f_i(x)~(0\leq i< k)$ be sequence polynomials…

Geometric representation learning has recently shown great promise in several machine learning settings, ranging from relational learning to language processing and generative models. In this work, we consider the problem of performing…