Related papers: Multidimensional extension of the Morse--Hedlund t…
A theorem of Bayer and Teichmann implies that if a finite real multisequence \beta = \beta^(2d) has a representing measure, then the associated moment matrix M_d admits positive, recursively generated moment matrix extensions M_(d+1),…
The classical theory of continued fractions has been widely studied for centuries for its important properties of good approximation, and more recently it has been generalized to $p$-adic numbers where it presents many differences with…
Let $A$ be a finite multiset of integers. If $B$ be a multiset such that $A$ and $B$ are $t$-complementing multisets of integers, then $B$ is periodic. We obtain the Biro-type upper bound for the smallest such period of $B$: Let…
Arithmetical congruence monoids, which arise in non-unique factorization theory, are multiplicative monoids $M_{a,b}$ consisting of all positive integers $n$ satsfying $n \equiv a \bmod b$. In this paper, we examine the asymptotic behavior…
Let k be an algebraically closed field of characteristic 0, let X=P^1\times A^N and let f be a rational endomorphism of X given by (x,y)--->(g(x), A(x)y), where g is a rational function, while A is an N-by-N matrix with entries in k(x). We…
A novel higher-dimensional definition for Costas arrays is introduced. This definition works for arbitrary dimensions and avoids some limitations of previous definitions. Some non-existence results are presented for multidimensional Costas…
A factorization of an element $x$ in a monoid $(M, \cdot)$ is an expression of the form $x = u_1^{z_1} \cdots u_k^{z_k}$ for irreducible elements $u_1, \ldots, u_k \in M$, and the length of such a factorization is $z_1 + \cdots + z_k$. We…
J. Hurwitz introduced an algorithm that generates a continued fraction expansion for complex numbers $\alpha \in \mathbb{C}$, where the partial quotients belong to $(1+i)\mathbb{Z}[i]$. J. Hurwitz's work also provides a result analogous to…
Let T be a bounded linear operator acting on a complex Banach space X and (\lambda_n) a sequence of complex numbers. Our main result is that if |\lambda_n|/|\lambda_{n+1}| \to 1 and the sequence (\lambda_n T^n) is frequently universal then…
Employing Morse theory for the global control of monodromy and the method of analytic discs for local extension, we establish a version of the global Hartogs extension theorem in a singular setting: for every domain D of an (n-1)-complete…
The usual product $m\cdot n$ on $\mathbb{Z}$ can be viewed as the sum of $n$ terms of an arithmetic progression whose first term is $a_{1}=m-n+1$ and whose difference is $d=2$. Generalizing this idea, we define new similar product mappings,…
The Lagrange theorem on continued fractions states that a number is a quadratic surd if and only if its continued fraction expansion is eventually periodic. The current paper is devoted to a multidimensional generalization of this fact. As…
Nourdin et al. [9] established the following universality result: if a sequence of off-diagonal homogeneous polynomial forms in i.i.d. standard normal random variables converges in distribution to a normal, then the convergence also holds…
In this paper, we present some generalizations of Lagrange's theorem in the classical theory of continued fractions motivated by the geometric interpretation of the classical theory in terms of closed geodesics on the modular curve. As a…
The core of a finite-dimensional modular representation $M$ of a finite group $G$ is its largest non-projective summand. We prove that the dimensions of the cores of $M^{\otimes n}$ have algebraic Hilbert series when $M$ is Omega-algebraic,…
A word is quasiperiodic (or coverable) if it can be covered with occurrences of another finite word, called its quasiperiod. A word is multi-scale quasiperiodic (or multi-scale coverable) if it has infinitely many different quasiperiods.…
The decimal expansion of 1/7 is 0.142857142857..., the block 142857 repeating forever. We call 142857 the period and its length is 6 = 2x3. If the period is broken into 2 pieces each of length 3 which are then added, the result is 142 + 857…
We describe new, simple, recursive methods of construction for orientable sequences over an arbitrary finite alphabet, i.e. periodic sequences in which any sub-sequence of n consecutive elements occurs at most once in a period in either…
A factorisation $x = u_1 u_2 \cdots$ of an infinite word $x$ on alphabet $X$ is called `monochromatic', for a given colouring of the finite words $X^*$ on alphabet $X$, if each $u_i$ is the same colour. Wojcik and Zamboni proved that the…
In this paper, we study some of the factorization aspects of rational multicyclic monoids, that is, additive submonoids of the nonnegative rational numbers generated by multiple geometric sequences. In particular, we provide a complete…