English
Related papers

Related papers: The Membership Problem for Hypergeometric Sequence…

200 papers

Given a separable nonconstant polynomial $f(x)$ with integer coefficients, we consider the set $S$ consisting of the squarefree parts of all the rational values of $f(x)$, and study its behavior modulo primes. Fixing a prime $p$, we…

Number Theory · Mathematics 2014-07-21 David Krumm

Given a differential or $q$-difference equation $P$ of order $n$, we prove that the set of exponents of a generalized power series solution has its rational rank bounded by the rational rank of the support of $P$ plus $n$. We also prove…

Classical Analysis and ODEs · Mathematics 2025-02-10 J. Cano , P. Fortuny Ayuso

Let x be a quadratic irrational and let P be the set of prime numbers. We show the existence of an infinite subset S of P such that the statistics of the period of the continued fraction expansions along the sequence {px: p\in S} approach…

Number Theory · Mathematics 2019-05-21 Menny Aka

A result of Deza, Levin, Meesum, and Onn shows that the problem of deciding if a given sequence is the degree sequence of a 3-uniform hypergraph is NP complete. We tackle this problem in the random case and show that a random integer…

Combinatorics · Mathematics 2024-08-22 Nicholas Christo , Marcus Michelen

We consider two decision problems in infinite groups. The first problem is Subgroup Intersection: given two finitely generated subgroups $\langle \mathcal{G} \rangle, \langle \mathcal{H} \rangle$ of a group $G$, decide whether the…

Group Theory · Mathematics 2023-09-28 Ruiwen Dong

Let G be an arithmetic lattice in a semisimple algebraic group over a number field. We show that if G has the congruence subgroup property, then the number of n-dimensional irreducible representations of G grows like n^a, where a is a…

Group Theory · Mathematics 2008-03-11 Nir Avni

We consider the rational subset membership problem for Baumslag-Solitar groups. These groups form a prominent class in the area of algorithmic group theory, and they were recently identified as an obstacle for understanding the rational…

Group Theory · Mathematics 2020-06-23 Michaël Cadilhac , Dmitry Chistikov , Georg Zetzsche

For a variety of finite groups $\mathbf H$, let $\overline{\mathbf H}$ denote the variety of finite semigroups all of whose subgroups lie in $\mathbf H$. We give a characterization of the subsets of a finite semigroup that are pointlike…

Group Theory · Mathematics 2018-01-16 Samuel J. v. Gool , B. Steinberg

Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready…

Number Theory · Mathematics 2018-09-05 Fusun Akman

Let $G$ be a finitely generated group of isometries of $\HH^m$, hyperbolic $m$-space, for some positive integer $m$. %or equivalently elements of $PSL(2,\CC)$. The discreteness problem is to determine whether or not $G$ is discrete. Even in…

Group Theory · Mathematics 2017-12-01 Jane Gilman

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

Register automata are finite automata equipped with a finite set of registers ranging over the domain of some relational structure like $(\mathbb N;=)$ or $(\mathbb Q;<)$. Register automata process words over the domain, and along a run of…

Formal Languages and Automata Theory · Computer Science 2021-02-17 Wojciech Czerwiński , Antoine Mottet , Karin Quaas

We consider the following problem: Given a set S of at most n elements from a universe of size m, represent it in memory as a bit string so that membership queries of the form "Is x in S?" can be answered by making at most t probes into the…

Data Structures and Algorithms · Computer Science 2022-01-03 Shyam Dhamapurkar , Shubham Vivek Pawar , Jaikumar Radhakrishnan

We study the growth behaviour of rational linear recurrence sequences. We show that for low-order sequences, divergence is decidable in polynomial time. We also exhibit a polynomial-time algorithm which takes as input a divergent rational…

Computational Complexity · Computer Science 2021-11-22 Shaull Almagor , Brynmor Chapman , Mehran Hosseini , Joël Ouaknine , James Worrell

Schnorr showed that a real is Martin-Loef random if and only if all of its initial segments are incompressible with respect to prefix-free complexity. Fortnow and independently Nies, Stephan and Terwijn noticed that this statement remains…

Computational Complexity · Computer Science 2017-03-03 George Barmpalias , Andrew Lewis-Pye , Angsheng Li

The matrix semigroup membership problem asks, given square matrices $M,M_1,\ldots,M_k$ of the same dimension, whether $M$ lies in the semigroup generated by $M_1,\ldots,M_k$. It is classical that this problem is undecidable in general but…

Logic in Computer Science · Computer Science 2023-11-13 Julian D'Costa , Joel Ouaknine , James Worrell

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,…

Functional Analysis · Mathematics 2012-07-10 Maria Charina , Mihai Putinar , Claus Scheiderer , Joachim Stoeckler

We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. In addition to divisibility and irreducibility results we also consider…

Number Theory · Mathematics 2021-09-27 Karl Dilcher , Maciej Ulas

An elliptic divisibility sequence, generated by a point in the image of a rational isogeny, is shown to possess a uniformly bounded number of prime terms. This result applies over the rational numbers, assuming Lang's conjecture, and over…

Number Theory · Mathematics 2015-05-13 Graham Everest , Patrick Ingram , Valery Mahe , Shaun Stevens

For a ring R, Hilbert's Tenth Problem HTP(R) is the set of polynomial equations over R, in several variables, with solutions in R. We consider computability of this set for subrings R of the rationals. Applying Baire category theory to…

Logic · Mathematics 2016-02-11 Russell Miller
‹ Prev 1 4 5 6 7 8 10 Next ›