Related papers: On finitary Hindman's numbers

We introduce the notion of residual finiteness for categories. In analogy with the group-theoretic setting, we prove that free categories and finitely generated subcategories of finite-dimensional vector spaces are residually finite.…

In this article, we study the Euler's factorial series $F_p(t)=\sum_{n=0}^\infty n!t^n$ in $p$-adic domain under the Generalized Riemann Hypothesis. First, we show that if we consider primes in $k\varphi(m)/(k+1)$ residue classes in the…

In general the multiplicity one theorem fails for Fourier-Jacobi models over finite fields. In this paper we prove that there is an upper bound for the multiplicities of Fourier-Jacobi models which is independent of $q$. As a consequence,…

In a recent paper, Frank Ruskey asked whether every linear recurrent sequence can occur in some solution of a meta-Fibonacci sequence. In this paper, we answer his question in the affirmative for recurrences with positive coefficients.

We prove that the uniform recurrence of morphic sequences is decidable. For this we show that the number of derived sequences of uniformly recurrent morphic sequences is bounded. As a corollary we obtain that uniformly recurrent morphic…

We establish primitive recursive versions of some known facts about computable ordered fields of reals and computable reals, and then apply them to proving primitive recursiveness of some natural problems in linear algebra and analysis. In…

R. P. Stanley proved the Upper Bound Conjecture in 1975. We imitate his proof for the Ehrhart rings. We give some upper bounds for the volume of integrally closed lattice polytopes. We derive some inequalities for the delta-vector of…

In this note let us give two remarks on proof-theory of PA. First a derivability relation is introduced to bound witnesses for provable $\Sigma_{1}$-formulas in PA. Second Paris-Harrington's proof for their independence result is…

We describe an algorithm that takes as input a complex sequence $(u_n)$ given by a linear recurrence relation with polynomial coefficients along with initial values, and outputs a simple explicit upper bound $(v_n)$ such that $|u_n| \leq…

We prove some theorems which give sufficient conditions for the existence of prime numbers among the terms of a sequence which has pairwise relatively prime terms.

We present upper bounds on certain sums which are related to Artin's primitive root conjecture and are also used in counting ray class characters.

It is quite well-known from Kurt Godel's (1931) ground-breaking result on the Incompleteness Theorem that rudimentary relations (i.e., those definable by bounded formulae) are primitive recursive, and that primitive recursive functions are…

By means of classical fixed point index, we prove new results on the existence, non-existence, localization and multiplicity of nontrivial solutions for systems of Hammerstein integral equations where the nonlinearities are allowed to…

We prove recursive formulas for sums of squares and sums of triangular numbers in terms of sums of divisors functions and we give a variety of consequences of these formulas. Intermediate applications include statements about positivity of…

This paper concerns extension of the classical Lagrange theorem, on the eventual periodicity of continued fraction expansions of quadratic surds, and the versions of it found in the literature in the case of complex numbers. In this…

The FPP conjecture, proposed by J. Adams, S. Miller, and D. Vogan and proved by D. Davis and L. Mason-Brown in arXiv:2411.01372, imposes a strong upper bound on the infinitesimal character of a unitary representation of a real reductive…

Let $\boldsymbol{\alpha}\in \mathbb{R}^N$ and $Q\geq 1$. We consider the sum $\sum_{\boldsymbol{q}\in [-Q,Q]^N\cap\mathbb{Z}^N\backslash\{\boldsymbol{0}\}}\|\boldsymbol{\alpha}\cdot\boldsymbol{q}\|^{-1}$. Sharp upper bounds are known when…

We obtain a new upper bound for binary sums with multiplicative characters over variables belong to some sets, having small additive doubling.

We prove an analogue of the celebrated Hall-Higman theorem, which gives a lower bound for the degree of the minimal polynomial of any semisimple element of prime power order $p^{a}$ of a finite classical group in any nontrivial irreducible…

We prove that every topologically transitive shift of finite type in one dimension is topologically conjugate to a subshift arising from a primitive random substitution on a finite alphabet. As a result, we show that the set of values of…