Related papers: A Lebesgue variant of the additive square problem

We investigate the least number of palindromic factors in an infinite word. We first consider general alphabets, and give answers to this problem for periodic and non-periodic words, closed or not under reversal of factors. We then…

In this article we present method of solving some additive problems with primes. The method may be employed to the Goldbach-Euler conjecture and the twin primes conjecture. The presented method also makes it possible to obtain some…

A power is a word of the form $\underbrace{uu...u}_{k \; \text{times}}$, where $u$ is a word and $k$ is a positive integer and a square is a word of the form $uu$. Fraenkel and Simpson conjectured in 1998 that the number of distinct squares…

To analyze the absolute condition number of multivariate polynomial interpolation on Lissajous-Chebyshev node points, we derive upper and lower bounds for the respective Lebesgue constant. The proof is based on a relation between the…

We consider real polynomials in finitely many variables. Let the variables consist of finitely many blocks that are allowed to overlap in a certain way. Let the solution set of a finite system of polynomial inequalities be given where each…

We look at a measure, $\lambda^\infty$, on the infinite-dimensional space, ${\mathbb R}^\infty$, for which we attempt to put forth an analogue of the Lebesgue density theorem. Although this measure allows us to find partial results, for…

Let G be any additive abelian group with cyclic torsion subgroup, and let A, B and C be finite subsets of G with cardinality n>0. We show that there is a numbering {a_i}_{i=1}^n of the elements of A, a numbering {b_i}_{i=1}^n of the…

Partial words are sequences over a finite alphabet that may contain wildcard symbols, called holes, which match or are compatible with all letters; partial words without holes are said to be full words (or simply words). Given an infinite…

Let $0\le \alpha \le \beta\le 1$. For any finite set $B\subset\mathbb{N}$, we show that there exists a set $A\subset\mathbb{N}$ such that $\underline{d}(A+B) = \alpha$ and $\bar{d}(A+B) = \beta$, where $\underline{d}(A+ B)$ and…

Motivated by a historical combinatorial problem that resembles the well-known Josephus problem, we investigate circular partition algorithms and formulate problems in deterministic finite automata with practical algorithms. The historical…

An expansion of a definably complete field either defines a discrete subring, or the image of a definable discrete set under a definable map is nowhere dense. As an application we show a definable version of Lebesgue's differentiation…

Let $A \cong k\langle X \rangle / I$ be an associative algebra. A finite word over alphabet $X$ is $I${\it-reducible} if its image in $A$ is a $k$-linear combination of length-lexicographically lesser words. An {\it obstruction} in a…

We establish a lower bound for the frequency with which an irreducible monic cubic polynomial with negative discriminant can be expressed as a sum of two squares ($\square_{2}$). This provides a quantitative answer to a question posed by…

By replacing the letters to polynomials in F_2[t], an infinite word, over a finite alphabet, can be seen as the sequence of partial quotients of a continued fraction in F_2((1/t)). Here is described a family of such infinite words,…

In this paper, we introduce and develop the circle embedding method. This method hinges essentially on a combinatorial-geometric structure which we choose to call circles of partition. We provide applications in the context of problems that…

The first-order theory of addition over the natural numbers, known as Presburger arithmetic, is decidable in double exponential time. Adding an uninterpreted unary predicate to the language leads to an undecidable theory. We sharpen the…

Let A be an alphabet and W be a set of words in the free monoid A*. Let S(W) denote the Rees quotient over the ideal of A* consisting of all words that are not subwords of words in W. We call a set of words W finitely based if the monoid…

We re-examine previous constructions of infinite binary words containing few distinct squares with the goal of finding the "simplest", in a certain sense. We exhibit several new constructions. Rather than using tedious case-based arguments…

A Lebesgue-type decomposition of a (non necessarily non-negative) sesquilinear form with respect to a non-negative one is studied. This decomposition consists of a sum of three parts: two are dominated by an absolutely continuous form and a…

A perfect number is a number whose divisors add up to twice the number itself. The existence of odd perfect numbers is a millennia-old unsolved problem. This note proposes a proof of the nonexistence of odd perfect numbers. More generally,…