English
Related papers

Related papers: The Membership Problem for Hypergeometric Sequence…

200 papers

We investigate the Membership Problem for hypergeometric sequences: given a hypergeometric sequence $\langle u_n \rangle_{n=0}^\infty$ of rational numbers and a target $t \in \mathbb{Q}$, decide whether $t$ occurs in the sequence. We show…

Logic in Computer Science · Computer Science 2022-05-25 Klara Nosan , Amaury Pouly , Mahsa Shirmohammadi , James Worrell

Hypergeometric sequences are rational-valued sequences that satisfy first-order linear recurrence relations with polynomial coefficients; that is, $\langle u_n \rangle_{n=0}^\infty$ is hypergeometric if it satisfies a first-order linear…

Logic in Computer Science · Computer Science 2024-04-25 George Kenison

Hypergeometric sequences obey first-order linear recurrence relations with polynomial coefficients and are commonplace throughout the mathematical and computational sciences. For certain classes of hypergeometric sequences, we prove linear…

For $a,b,p\in \mathbb{R}$, $-c\notin \mathbb{N\cup }\left\{ 0\right\} $ and $ \theta \in \left[ -1,1\right] $, let \begin{equation*} U_{\theta }\left( x\right) =\left( 1-\theta x\right) ^{p}F\left( a,b;c;x\right) =\sum_{n=0}^{\infty…

Classical Analysis and ODEs · Mathematics 2022-04-12 Zhen-Hang Yang

We study the minimum membership geometric set cover, i.e., MMGSC problem [SoCG, 2023] in the continuous setting. In this problem, the input consists of a set $P$ of $n$ points in $\mathbb{R}^{2}$, and a geometric object $t$, the goal is to…

Computational Geometry · Computer Science 2025-06-03 Sathish Govindarajan , Mayuresh Patle , Siddhartha Sarkar

Six families of generalized hypergeometric series in a variable $x$ and an arbitrary number of parameters are considered. Each of them is indexed by an integer $n$. Linear recurrence relations in $n$ relate these functions and their product…

Classical Analysis and ODEs · Mathematics 2022-10-25 Nicolas Brisebarre , Bruno Salvy

Let $\mathbb{F}[X]$ be the polynomial ring over the variables $X=\{x_1,x_2, \ldots, x_n\}$. An ideal $I=\langle p_1(x_1), \ldots, p_n(x_n)\rangle$ generated by univariate polynomials $\{p_i(x_i)\}_{i=1}^n$ is a \emph{univariate ideal}. We…

Data Structures and Algorithms · Computer Science 2018-09-24 V. Arvind , Abhranil Chatterjee , Rajit Datta , Partha Mukhopadhyay

We introduce hypergeometric-type sequences. They are linear combinations of interlaced hypergeometric sequences (of arbitrary interlacements). We prove that they form a subring of the ring of holonomic sequences. An interesting family of…

Symbolic Computation · Computer Science 2024-04-22 Bertrand Teguia Tabuguia

This paper investigates complexity of the uniform membership problem for hyperedge replacement grammars in comparison with other mildly context-sensitive grammar formalisms. It turns out that the complexity of this problem depends on how…

Formal Languages and Automata Theory · Computer Science 2026-03-03 Tikhon Pshenitsyn

We consider the Membership and the Half-Space Reachability problems for matrices in dimensions two and three. Our first main result is that the Membership Problem is decidable for finitely generated sub-semigroups of the Heisenberg group…

Computational Complexity · Computer Science 2019-04-30 Thomas Colcombet , Joël Ouaknine , Pavel Semukhin , James Worrell

Given $n \geq 3$, a combinatorial object called a \textit{ pedigree } is defined using $3$-element subsets from $[n]$ obeying certain conditions. The convex hull of pedigrees is called the pedigree polytope for $n$. Pedigrees are in $1-1$…

Combinatorics · Mathematics 2025-07-15 Tiru Arthanari

We present a new approach to the ideal membership problem for polynomial rings over the integers: given polynomials $f_0,f_1,...,f_n\in\Z[X]$, where $X=(X_1,...,X_N)$ is an $N$-tuple of indeterminates, are there $g_1,...,g_n\in\Z[X]$ such…

Commutative Algebra · Mathematics 2007-05-23 Matthias Aschenbrenner

We study the question of when the coefficients of a hypergeometric series are p-adically unbounded for a given rational prime p. Our first main result is a necessary and sufficient criterion (applicable to all but finitely many primes) for…

Number Theory · Mathematics 2017-08-15 Cameron Franc , Terry Gannon , Geoffrey Mason

We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; indefinite and definite summation of sequences that are…

Symbolic Computation · Computer Science 2008-04-03 Alin Bostan , Frédéric Chyzak , Bruno Salvy , Thomas Cluzeau

The central idea of this article is to present a systematic approach to construct some recurrence relations for the solutions of the second-order linear difference equation of hypergeometric-type defined on the quadratic-type lattices. We…

Classical Analysis and ODEs · Mathematics 2019-05-06 Rezan Sevinik Adıgüzel

We revisit a natural variant of geometric set cover, called minimum-membership geometric set cover (MMGSC). In this problem, the input consists of a set $S$ of points and a set $\mathcal{R}$ of geometric objects, and the goal is to find a…

Computational Geometry · Computer Science 2023-05-09 Sayan Bandyapadhyay , William Lochet , Saket Saurabh , Jie Xue

Take a multiplicative monoid of sequences in which the multiplication is given by Hadamard product. The set of linear combinations of interleaving monoid elements then yields a ring. For hypergeometric sequences, the resulting ring is a…

Symbolic Computation · Computer Science 2024-10-16 Bertrand Teguia Tabuguia

As a homomorphic image of the hyperalgebra $U_{q,R}(m|n)$ associated with the quantum linear supergroup $U_\upsilon(\mathfrak{gl}_{m|n})$, we first give a presentation for the $q$-Schur superalgebra $S_{q,R}(m|n,r)$ over a commutative ring…

Representation Theory · Mathematics 2018-05-29 Jie Du , Yanan Lin , Zhongguo Zhou

An infinite sequence $\langle{u_n}\rangle_{n\in\mathbb{N}}$ of real numbers is holonomic (also known as P-recursive or P-finite) if it satisfies a linear recurrence relation with polynomial coefficients. Such a sequence is said to be…

Correspondence is a ubiquitous problem in computer vision and graph matching has been a natural way to formalize correspondence as an optimization problem. Recently, graph matching solvers have included higher-order terms representing…

Computer Vision and Pattern Recognition · Computer Science 2014-05-27 Mayank Bansal , Kostas Daniilidis
‹ Prev 1 2 3 10 Next ›