English
Related papers

Related papers: The Membership Problem for Hypergeometric Sequence…

200 papers

We study existence and regularity properties of solutions to the singular $p$-Laplacean parabolic system in a bounded domain $\Omega$. The main purpose is to prove global $L^r(\varepsilon,T;L^q(\Omega))$, $\varepsilon\geq0$, integrability…

Analysis of PDEs · Mathematics 2012-09-06 Francesca Crispo , Paolo Maremonti

We study the periodic boundary value problem associated with the second order nonlinear equation \begin{equation*} u'' + ( \lambda a^{+}(t) - \mu a^{-}(t) ) g(u) = 0, \end{equation*} where $g(u)$ has superlinear growth at zero and sublinear…

Classical Analysis and ODEs · Mathematics 2015-12-23 Alberto Boscaggin , Guglielmo Feltrin , Fabio Zanolin

Here, we give upper and lower bounds on the count of positive integers $n\le x$ dividing the $n$th term of a nondegenerate linearly recurrent sequence with simple roots.

Number Theory · Mathematics 2011-02-02 Juan Jose Alba Gonzalez , Florian Luca , Carl Pomerance , Igor Shparlinski

The sequence of the primes $p$ for which a variety over $\mathbb{Q}$ has no $p$-adic point plays a fundamental role in arithmetic geometry. This sequence is deterministic, however, we prove that if we choose a typical variety from a family…

Number Theory · Mathematics 2020-05-18 Efthymios Sofos

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…

Computational Complexity · Computer Science 2010-11-08 Peter Buergisser , Christian Ikenmeyer

We prove an upper bound for the number of rational points of bounded height on irreducible affine hypersurfaces. More precisely, given an irreducible polynomial $f \in \mathbb{Z}[X_1, \dots, X_n]$, we prove an upper bound on the number of…

Number Theory · Mathematics 2025-12-04 Anders Mah

In this paper we consider the problem $$(P)\qquad \{{array}{rclll} u_t-\D u^m&=&|\n u|^q +\,f(x,t),&\quad u\ge 0 \hbox{in} \Omega_T\equiv \Omega\times (0,T), u(x,t)&=&0 &\quad \hbox{on} \partial\Omega\times (0,T) u(x,0)&=&u_0(x),&\quad x\in…

Analysis of PDEs · Mathematics 2012-10-19 Boumediene Abdellaoui , Ireneo Peral , Magdalena Walias

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…

Discrete Mathematics · Computer Science 2016-12-16 Petr A. Golovach , Bernard Lidický , Barnaby Martin , Daniël Paulusma

A classical conjecture by Graham Higman states that the number of conjugacy classes of $U_n(q)$, the group of upper triangular $n\times n$ matrices over $\mathbb{F}_q$, is polynomial in $q$, for all $n$. In this paper we present both…

Combinatorics · Mathematics 2015-07-03 Igor Pak , Andrew Soffer

We study questions around the existence of bounds and the dependence on parameters for linear-algebraic problems in polynomial rings over rings of an arithmetic flavor.In particular, we show that the module of syzygies of polynomials…

Commutative Algebra · Mathematics 2007-05-23 Matthias Aschenbrenner

A regular realizability (RR) problem is testing nonemptiness of intersection of some fixed language (filter) with given regular language. We study here complexity of RR problems. It appears that for any language L there exists RR problem…

Computational Complexity · Computer Science 2013-01-01 Mikhail N. Vyalyi

We derive a number of summation and transformation formulas for elliptic hypergeometric series on the root systems A_n, C_n and D_n. In the special cases of classical and q-series, our approach leads to new elementary proofs of the…

Classical Analysis and ODEs · Mathematics 2007-05-23 Hjalmar Rosengren

We investigate the decidability of the monadic second-order (MSO) theory of the structure $\langle \mathbb{N};<,P_1, \ldots,P_d \rangle$, for various unary predicates $P_1,\ldots,P_d \subseteq \mathbb{N}$. We focus in particular on…

Logic in Computer Science · Computer Science 2026-03-25 Valérie Berthé , Toghrul Karimov , Joris Nieuwveld , Joël Ouaknine , Mihir Vahanwala , James Worrell

Geometric Complexity Theory as initiated by Mulmuley and Sohoni in two papers (SIAM J Comput 2001, 2008) aims to separate algebraic complexity classes via representation theoretic multiplicities in coordinate rings of specific group…

Computational Complexity · Computer Science 2019-01-16 Julian Dörfler , Christian Ikenmeyer , Greta Panova

Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…

Discrete Mathematics · Computer Science 2008-06-20 Tsiriniaina Andriamampianina

We obtain new recurrence relations, an explicit formula, and convolution identities for higher order geometric polynomials. These relations generalize known results for geometric polynomials, and lead to congruences for higher order…

Number Theory · Mathematics 2021-06-08 Levent Kargın , Mehmet Cenkci

We prove a conjecture of Helfgott on the structure of sets of bounded tripling in bounded rank, which states the following. Let $A$ be a finite symmetric subset of $\mathrm{GL}_n(\mathbf{F})$ for any field $\mathbf{F}$ such that $|A^3| \leq…

Group Theory · Mathematics 2025-08-04 Sean Eberhard , Brendan Murphy , László Pyber , Endre Szabó

In this article, we study word equations in free semigroups and the conjecture that the existence of infinitely many solutions entails the existence of solutions with arbitrarily large exponent of periodicity. We examine this question in…

Formal Languages and Automata Theory · Computer Science 2026-02-26 Volker Diekert , Silas Natterer , Alexander Thumm

We prove that, for a finitely generated residually finite group, having solvable word problem is not a sufficient condition to be a subgroup of a finitely presented residually finite group. The obstruction is given by a residually finite…

Group Theory · Mathematics 2021-03-19 Emmanuel Rauzy

We consider recursion equations of the form $u_{n+1}(x)=Q[u_n](x),~n\ge 1,~x\in R$, with a non-local operator $Q[u](x)= g( u\ast q)$, where $g$ is a polynomial, satisfying $g(0)=0$, $g(1)=1$, $g((0,1)) \subseteq (0,1)$, and $q$ is a…

Probability · Mathematics 2023-12-08 Xaver Kriechbaum , Lenya Ryzhik , Ofer Zeitouni