Related papers: Grzegorczyk sequence
In this paper we deal with a classical problem in elementary number theory, namely repeating decimals. We show how the digits of the period of the decimal representation of any fraction $\frac{k}{m}$, where $k$ and $m$ are positive integers…
We investigate the arithmetic nature of P-recursive sequences through the lens of their D-finite generating functions. Building on classical tools from differential algebra, we revisit the integrality criterion for Motzkin-type sequences…
We present a sequent calculus for the modal Grzegorczyk logic Grz allowing non-well-founded proofs and obtain the cut-elimination theorem for it by constructing a continuous cut-elimination mapping acting on these proofs.
We present a sequent calculus for the Grzegorczyk modal logic Grz allowing cyclic and other non-well-founded proofs and obtain the cut-elimination theorem for it by constructing a continuous cut-elimination mapping acting on these proofs.…
We extend our investigation of $2$-determinants, which we defined in a previous paper. For a linear homogenous recurrence of the second order, we consider relations between different sequences satisfying the same linear homogeneous…
We introduce a proper display calculus for first-order logic, of which we prove soundness, completeness, conservativity, subformula property and cut elimination via a Belnap-style metatheorem. All inference rules are closed under uniform…
For a set of natural numbers $A$, let $R_{A}(n)$ be the number of representations of a natural number $n$ as the sum of two terms from $A$. Many years ago, Nathanson studied the conditions for the set $A$ and $B$ of natural numbers that are…
The Hurwitz--Radon number originates in the composition problem of quadratic forms and is related to the maximum number of pointwise linearly independent vector fields on spheres. Kannaka--Tojo [arXiv:2602.04544] reformulated the…
We use generalised Zeckendorf representations of natural numbers to investigate mixing properties of symbolic dynamical systems. The systems we consider consist of bi-infinite sequences associated with so-called random substitutions. We…
All the already known results on self descriptive numbers, together with the demonstration of the uniqueness for bases greater than 6, are here obtained through a systematic scheme of proof and not trial and error. The proof is also…
How can we reason around logical paradoxes without falling into them? This paper introduces grounded deduction or GD, a Kripke-inspired approach to first-order logic and arithmetic that is neither classical nor intuitionistic, but…
Let G be a real or complex linear algebraic reductive group. Let H and F be reductive subgroups. We study the natural H action on G/F. The main theorem of this note shows that generic H orbits are closed. This theorem is then applied to…
For Hilbert, the consistency of a formal theory T is an infinite series of statements "D is free of contradictions" for each derivation D and a consistency proof is i) an operation that, given D, yields a proof that D is free of…
In this paper we introduce a family of partitions of the set of natural numbers, Fibonacci-like partitions. In particular, we introduce a Fibonacci-like partition in a number of parts corresponding to the Fibonacci numbers, the standard…
In this article some difficulties are deduced from the set of natural numbers. By using the method of transfinite recursion we define an iterative process which is designed to deduct all the non-greatest elements of the set of natural…
We show that braided Cherednik algebras introduced by the first two authors are cocycle twists of rational Cherednik algebras of the imprimitive complex reflection groups $G(m,p,n)$, when $m$ is even. This gives a new construction of mystic…
We consider representing of natural numbers by expressions using 1's, addition, multiplication and parentheses. $\left\| n \right\|$ denotes the minimum number of 1's in the expressions representing $n$. The logarithmic complexity $\left\|…
It is well-known that for any non-constant polynomial $P$ with integer coefficients the sequence $(P(n))_{ n\in \mathbb N}$ has the property that there are infinitely many prime numbers dividing at least one term of this sequence.…
A dependent theory is a (first order complete theory) T which does not have the independence property. A main result here is: if we expand a model of T by the traces on it of sets definable in a bigger model then we preserve its being…
In the base phi representation any natural number is written uniquely as a sum of powers of the golden mean with coefficients 0 and 1, where it is required that the product of two consecutive digits is always 0. In this self-contained paper…