Related papers: On a sequence related to the Josephus problem

We state some elementary problems concerning the relation between difference calculus and differential calculus, and we try to convince the reader that, in spite of the simplicity of the statements, a solution of these problems would be a…

Let $k$ be an infinite field. Fix a Jordan nilpotent $n$ by $n$ matrix $B = J_P$ with entries in $k$ and associated Jordan type $P$. Let $Q(P)$ be the Jordan type of a generic nilpotent matrix commuting with $B$. In this paper, we use the…

Let $Q(n)$ denote the count of the primitive subsets of the integers $\{1,2\ldots n\}$. We give a new proof that $Q(n) = \alpha^{(1+o(1))n}$ which allows us to give a good error term and to improve upon the lower bound for the value of this…

In this note, we precisely elaborate the connection between recognisable series (in the sense of Berstel and Reutenauer) and $q$-regular sequences (in the sense of Allouche and Shallit) via their linear representations. In particular, we…

The main result here gives an algebra(/linear category) isomorphism between a geometrically defined subcategory $J^1_0$ of a short Brauer category $J_0$ and a certain one-parameter specialisation of the blob category $b$. That is, we prove…

In this paper, we find all integers $c$ having at least two representations as a difference between linear recurrent sequences. This problem is a pillai problem involving Padovan and Fibonacci sequence. The proof of our main theorem uses…

We study the minimal gap statistic for fractional parts of sequences of the form $\mathcal A^\alpha = \{\alpha a(n)\}$ where $\mathcal A = \{a(n)\}$ is a sequence of distinct of integers. Assuming that the additive energy of the sequence is…

Finding integer solutions to norm form equations is a classical Diophantine problem. Using the units of the associated coefficient ring, we can produce sequences of solutions to these equations. It is known that these solutions can be…

This paper proves the minimum size of a supersequence over a set of eight elements is 52. This disproves a conjecture that the lower bound of the supersequence is the partial sum of the geometric Connell sequence. By studying the internal…

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot\ldots\cdot(n_lg)$ where $g\in G$ and $n_1, \ldots, n_l\in[1, \ord(g)]$, and the index $\ind(S)$ of $S$ is defined to be the minimum of…

In this paper we propose a conjecture concerning partial sums of an arbitrary finite subset of an abelian group, that naturally arises investigating simple Heffter systems. Then, we show its connection with related open problems and we…

Two problems are addressed: reduction of an arbitrary degree non-special divisor to the equivalent divisor of the degree equal to genus of a curve, and addition of divisors of arbitrary degrees. The hyperelliptic case is considered as the…

In this paper; we prove that all sequences can be broken up in cycles. Each cycle follows the same pattern: 1) Upward trajectory. Odd and even numbers alternate until the cycle reaches an upper bound 2) Downward trajectory. Two or more…

We deal with the obstacle problem for the porous medium equation in the slow diffusion regime $m>1$. Our main interest is to treat fairly irregular obstacles assuming only boundedness and lower semicontinuity. In particular, the considered…

We consider a category of all finite partial orderings with quotient maps as arrows and construct a Fra\"iss\'e sequence in this category. Then we use commonly known relations between partial orders and lattices to construct a sequence of…

This paper addresses the Data-Diff problem: given a dataset and a subsequent version of the dataset, find the shortest sequence of operations that transforms the dataset to the subsequent version, under a restricted family of operations. We…

Many theorems of mathematics have the form that for a certain problem, e.g. a differential equation or polynomial (in)equality, there exists a solution. The sequential version then states that for a sequence of problems, there is a sequence…

Let $(G, 1_G)$ be a finite group and let $S=g_1\bdot \ldots\bdot g_{\ell}$ be a nonempty sequence over $G$. We say $S$ is a tiny product-one sequence if its terms can be ordered such that their product equals $1_G$ and…

The OEIS sequence A342810 contains the numbers that divide the smallest number that has the sum of their digits. It is proved that if a term $x$ has the form $3^m \times y$ where $m \geq 2$, then all prime factors of $y$ are prime divisors…

In this note, we present a curious $q$-series identity with applications to certain partitions with bounded part differences.