English
Related papers

Related papers: On the $k$-abelian complexity of the Cantor sequen…

200 papers

In this paper we look at the topological type of algebraic sum of achievement sets. We show that there is a Cantorval such that the algebraic sum of its $k$ copies is still a Cantorval for any $k \in \mathbb{N}$. We also prove that for any…

Classical Analysis and ODEs · Mathematics 2023-09-06 Jacek Marchwicki , Piotr Nowakowski , Franciszek Prus-Wiśniowski

In this note, we investigate the regularity of Cantor's one-to-one mapping between the irrational numbers of the unit interval and the irrational numbers of the unit square. In particular, we explore the fractal nature of this map by…

Functional Analysis · Mathematics 2014-04-03 Samuel Nicolay , Laurent Simons

For an integer \( k \geq 2 \), the sequence of \( k \)-generalized Lucas numbers is defined by the recurrence relation \( L_n^{(k)} = L_{n-1}^{(k)} + \cdots + L_{n-k}^{(k)} \) for all \( n \geq 2 \), with initial conditions \( L_0^{(k)} = 2…

Number Theory · Mathematics 2025-09-30 Alex Behakanira Tumwesigye , Mahadi Ddamulira , Prosper Kaggwa

A word $u$ defined over an alphabet $\mathcal{A}$ is $c$-balanced ($c\in\mathbb{N}$) if for all pairs of factors $v$, $w$ of $u$ of the same length and for all letters $a\in\mathcal{A}$, the difference between the number of letters $a$ in…

Combinatorics · Mathematics 2010-11-02 Ondřej Turek

In this paper, we study arithmetic properties satisfied by the $k$-tuple $\ell$-regular partitions. A $k$-tuple of partitions $(\xi_1, \xi_2, \ldots, \xi_k)$ is said to be $\ell$-regular if all the $\xi_i$'s are $\ell$-regular. We study the…

Number Theory · Mathematics 2025-05-13 Hemjyoti Nath , Manjil P. Saikia , Abhishek Sarma

Let $S_{a,b}$ denote the sequence of leading digits of $a^n$ in base $b$. It is well known that if $a$ is not a rational power of $b$, then the sequence $S_{a,b}$ satisfies Benford's Law; that is, digit $d$ occurs in $S_{a,b}$ with…

Number Theory · Mathematics 2023-06-22 Xinwei He , A. J. Hildebrand , Yuchen Li , Yunyi Zhang

Although 10^230 terms of Recaman's sequence have been computed, it remains a mystery. Here three distant cousins of that sequence are described, one of which is also mysterious. (i) {A(n), n >= 3} is defined as follows. Start with n, and…

Consider an a.e.c. (abstract elementary class), that is, a class K of models with a partial order refining inclusion (submodel) which satisfy the most basic properties of an elementary class. Our test question is trying to show that the…

Logic · Mathematics 2013-12-30 Saharon Shelah

Cantor primes are primes p such that 1/p belongs to the middle-third Cantor set. One way to look at them is as containing the base-3 analogues of the famous Mersenne primes, which encompass all base-2 repunit primes, i.e., primes consisting…

Number Theory · Mathematics 2012-05-04 Christian Salas

We bound the number of permutations with a fixed number $r$ of $321 \ominus p_0$ patterns by a constant times the number of permutations which avoid $321 \ominus p_0$. We use this new upper bound to show that the ordinary generating…

Combinatorics · Mathematics 2025-10-29 Michael Waite

We are looking for integer sets that resemble classical Cantor set and investigate the structure of their sum sets. Especially we investigate $FS(B)$ the subset sum of sequence type $B=\{\lfloor p^n\alpha\rfloor\}^\infty_{n=0}$. When $p=2$,…

Combinatorics · Mathematics 2023-07-17 Norbert Hegyvári

We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…

Information Theory · Computer Science 2011-09-20 John Scoville

We answer a question in [Landsberg, Ressayre, 2015], showing the regular determinantal complexity of the determinant det_m is O(m^3). We answer questions in, and generalize results of [Aravind, Joglekar, 2015], showing there is no rank one…

Computational Complexity · Computer Science 2016-10-04 Christian Ikenmeyer , J. M. Landsberg

In this paper we study the maximal pattern complexity of infinite words up to Abelian equivalence. We compute a lower bound for the Abelian maximal pattern complexity of infinite words which are both recurrent and aperiodic by projection.…

Combinatorics · Mathematics 2019-02-20 Teturo Kamae , Steven Widmer , Luca Q. Zamboni

By an $abc$ triple, we mean a triple $(a,b,c)$ of relatively prime positive integers $a,b,$ and $c$ such that $a+b=c$ and $\operatorname{rad}(abc)<c$, where $\operatorname{rad}(n)$ denotes the product of the distinct prime factors of $n$.…

Number Theory · Mathematics 2023-08-29 Elise Alvarez-Salazar , Alexander J. Barrios , Calvin Henaku , Summer Soller

In the exact quantum query model a successful algorithm must always output the correct function value. We investigate the function that is true if exactly $k$ or $l$ of the $n$ input bits given by an oracle are 1. We find an optimal…

Quantum Physics · Physics 2018-01-11 Andris Ambainis , Jānis Iraids , Daniel Nagaj

It is proved that the class of separable Rosenthal compacta on the Cantor set having a uniformly bounded dense sequence of continuous functions, is strongly bounded.

Logic · Mathematics 2008-05-15 Pandelis Dodos

Given an equivalence class $[A]$ in the measure algebra of the Cantor space, let $\hat\Phi([A])$ be the set of points having density 1 in $A$. Sets of the form $\hat\Phi([A])$ are called $\mathcal{T}$-regular. We establish several results…

Logic · Mathematics 2011-05-18 Alessandro Andretta , Riccardo Camerlo

We show generic existence of power series a with complex coefficients a_n, such that the sequence of partial sums of a new power series where its coefficients b_n are functions of a_0, a_1, ..., a_n approximate every polynomial uniformly on…

Complex Variables · Mathematics 2019-06-05 Konstantinos Maronikolakis , Vassili Nestoridis

Let $ k \geq 2 $ be an integer. The $ k- $generalized Fibonacci sequence is a sequence defined by the recurrence relation $ F_{n}^{(k)}=F_{n-1}^{(k)} + \cdots + F_{n-k}^{(k)}$ for all $ n \geq 2$ with the initial values $ F_{i}^{(k)}=0 $…

General Mathematics · Mathematics 2024-07-25 Alaa Altassan , Murat Alan