Related papers: Regularity versus complexity in the binary represe…

We find monodromy formulas for line arrangements which are fibered with respect to the projection from one point. We use them to find $0$-dimensional translated components in the first characteristic variety of the arrangement $\mathcal…

Except for crystalline or random structures, an agreed definition of complexity for intermediate and hence interesting cases does not exist. We fill this gap with a notion of complexity that characterises shapes formed by any finite number…

We establish a relationship between the word complexity and the number of generalized diagonals for a polygonal billiard. We conclude that in the rational case the complexity function has cubic upper and lower bounds. In the tiling case the…

Stern's diatomic sequence is a well-studied and simply defined sequence with many fascinating characteristics. The binary signed-digit representation of integers is an alternative representation of integers with much use in efficient…

Series-parallel (SP) graphs are binary edge-labeled graphs with a designated source and target vertex, built using serial and parallel composition. A set of graphs is recognizable if membership depends only on its image under a homomorphism…

The $3x+1$ Problem asks if whether for every natural number $n$, there exists a finite number of iterations of the piecewise function $$f(2n)=n, \quad f(2n-1)=6n-2, $$ with an iterate equal to the number $1$, or in other words, every…

Motivated by algorithmic problems from combinatorial group theory we study computational properties of integers equipped with binary operations +, -, z = x 2^y, z = x 2^{-y} (the former two are partial) and predicates < and =. Notice that…

The sequence 2,5,15,51,187,... with the form $(2^n+1)(2^{n-1}+1)/3$ has two interpretations in terms of the density of a language with four letters and the cardinality of the quotient of $\ZZ_2^n\times \ZZ_2^n$ under the action of the…

We extend a result by Ikeda and Suriajaya (2025) to find the asymptotic behaviour of the average number of representations of an integer $n$, over multiples of a fixed $q\ge 2$, as a sum of two prime $k$-th powers, for $k\ge 2$.

For a rational prime $p \geq 3$ and an integer $n \geq 2$, we study the modularity of continuous 2-dimensional mod $p^n$ Galois representations of $\Gal(\bar{\Q}/\Q)$ whose residual representations are odd and absolutely irreducible. Under…

A \textit{Reinhardt polygon} is a convex $n$-gon that, for $n$ not a power of $2$, is optimal in three different geometric optimization problems, for example, it has maximal perimeter relative to its diameter. Some such polygons exhibit a…

In this paper we study the sequences defined by the last and the last non-zero digits of $n^n$ in base $b$. For the sequence given by the last digits of $n^n$ in base $b$, we prove its periodicity using different techniques than those used…

We construct an explicit filtration of the ring of algebraic power series by finite dimensional constructible sets, measuring the complexity of these series. As an application, we give a bound on the dimension of the set of algebraic power…

Let k>2 be a fixed integer exponent and let \theta > 9/10. We show that a positive integer N can be represented as a non-trivial sum or difference of 3 k-th powers, using integers of size at most B, in O(B^{\theta}N^{1/10}) ways, providing…

Several articles deal with tilings with squares and dominoes on 2-dimensional boards, but only a few on boards in 3-dimensional space. We examine a tiling problem with colored cubes and bricks of $(2\times2\times n)$-board in three…

The 3x+1 Conjecture asserts that the T-orbit of every positive integer contains 1, where T maps x\mapsto x/2 for x even and x\mapsto (3x+1)/2 for x odd. A set S of positive integers is sufficient if the orbit of each positive integer…

A graph is $k$-planar if it can be drawn in the plane such that no edge is crossed more than $k$ times. While for $k=1$, optimal $1$-planar graphs, i.e., those with $n$ vertices and exactly $4n-8$ edges, have been completely characterized,…

This work is devoted to solving some closely related open problems on the average and asymptotic behavior of the $2$-adic complexity of binary sequences. First, for fixed $N$, we prove that the expected value $E^{\mathrm{2-adic}}_N$ of the…

For a fixed integer $k \ge 0$, consider representations of positive integers as sums of binomial coefficients of the form $\binom{n}{k}$. While exact minimal bounds for the number of required summands are known only in a few low-dimensional…

At a conference in Debrecen in October 2010 Nathanson announced some results concerning the arithmetic diameters of certain sets. He proposed some related results on the representation of integers by sums or differences of powers of 2 and…