Related papers: A Lebesgue variant of the additive square problem
We provide a strengthened version of the famous Jakobson's theorem. Consider an interval map $f$ satisfying a summability condition. For a generic one-parameter family $f_t$ of maps with $f_0=f$, we prove that $t=0$ is a Lebesgue density…
A binary shuffle square is a binary word of even length that can be partitioned into two disjoint, identical subwords. Huang, Nam, Thaper, and the first author conjectured that as $n\rightarrow \infty$, asymptotically half of all binary…
Erd\H{o}s posed the question whether there exist infinitely many sets of consecutive numbers whose least common multiple (lcm) exceeds the lcm of another, larger set with greater consecutive numbers. In this paper, we answer this question…
We associate in a canonical way a substitution to any abstract numeration system built on a regular language. In relationship with the growth order of the letters, we define the notion of two independent substitutions. Our main result is…
We consider a combinatorial problem occurring naturally in a group theoretical setting and provide a constructive solution in a special case. More precisely, in 1999 the author established a logarithmic bound for the derived length of the…
Let $s(n)$ denote the sum of the proper divisors of the natural number $n$. We show that the number of $n \leq x$ such that $s(n)$ is a sum of two squares has order of magnitude $x/\sqrt{\log x}$, which agrees with the count of $n \leq x$…
We use results on Dyck words and lattice paths to derive a formula for the exact number of binary words of a given length with a given minimal abelian border length, tightening a bound on that number from Christodoulakis et al. (Discrete…
We settle the existence of certain "anti-magic" cubes using combinatorial block designs and graph decompositions to align a handful of small examples.
In this article, we describe a class of vector fields exhibiting abundant switching} near a network: for every neighbourhood of the network and every infinite admissible path, the set of initial conditions within the neighbourhood that…
We study a mean value of the classical additive divisor problem. The main term we are interested in here is the one by Motohashi, but we also give an upper bound for the case where the main term is that of Atkinson. Furthermore, we point…
We study the dual space of the variable Lebesgue space $\Lp$ with unbounded exponent function $\pp$ and provide an answer to a question posed in~[fiorenza-cruzuribe2013]. Our approach is to decompose the dual into a topological direct sum…
The mixed area of a Reuleaux polygon and its symmetric with respect to the origin is expressed in terms of the mixed area of two explicit polygons. This gives a geometric explanation of a classical proof due to Chakerian. Mixed areas and…
We study the problem of whether a given finite algebra with finitely many basic operations contains a cube term; we give both structural and algorithmic results. We show that if such an algebra has a cube term then it has a cube term of…
We continue investigations on the average number of representations of a large positive integer as a sum of given powers of prime numbers. The average is taken over a short interval, whose admissible length depends on whether or not we…
We characterize the squares occurring in infinite overlap-free binary words and construct various alpha power-free binary words containing infinitely many overlaps.
We propose a technique for exploring the abelian complexity of recurrent infinite words, focusing particularly on infinite words associated with Parry numbers. Using that technique, we give the affirmative answer to the open question posed…
The notion of Abelian complexity of infinite words was recently used by the three last authors to investigate various Abelian properties of words. In particular, using van der Waerden's theorem, they proved that if a word avoids Abelian…
Let $S$ be a finite alphabet. An injective word over $S$ is a word over $S$ such that each letter in $S$ appears at most once in the word. We study Boolean cell complexes of injective words over $S$ and their commutation classes. This…
Given an integer n>1, it is a classical Diophantine problem that whether n can be written as a sum of two rational cubes. The study of this problem, considering several special cases of n, has a copious history that can be traced back to…
In this paper we show that the following problem is NP-complete: Given an alphabet $\Sigma$ and two strings over $\Sigma$, the question is whether there exists a permutation of $\Sigma$ which is a subsequence of both of the given strings.