Related papers: Substitutions over infinite alphabet generating (-…
In this paper, we study linear forms \[\lambda = \beta_1\mathrm{e}^{\alpha_1}+\cdots+\beta_m\mathrm{e}^{\alpha_m},\] where $\alpha_i$ and $\beta_i$ are algebraic numbers. An explicit lower bound for the absolute value of $\lambda$ is…
Results for $\beta$-functions and anomalous dimensions in general scalar fermion theories are presented to three loops. Various constraints on the individual coefficients for each diagram following from supersymmetry are analysed. The…
We define a notion of (one-sided) edge shift spaces associated to ultragraphs. In the finite case our notion coincides with the edge shift space of a graph. In general, we show that our space is metrizable and has a countable basis of…
This paper describes an alternative method of generating fixed points of certain substitution systems. This method centres on taking infinite words consisting of one repeated letter per word. These infinite words are then interlaced to form…
In 1976, Rauzy studied two complexity functions, $\underline{\beta}$ and $\overline{\beta}$, for infinite sequences over a finite alphabet. The function $\underline{\beta}$ achieves its maximum precisely for Borel normal sequences, while…
We consider the four fragments FO2, the intersection of Sigma2 and FO2, the intersection of Pi2 and FO2, and Delta2 of first-order logic FO[<] over finite and infinite words. For all four fragments, we give characterizations in terms of…
Consider $\beta > 1$ and $\lfloor \beta \rfloor$ its integer part. It is widely known that any real number $\alpha \in \Bigl[0, \frac{\lfloor \beta \rfloor}{\beta - 1}\Bigr]$ can be represented in base $\beta$ using a development in series…
Igarashi introduce the concept of $(\alpha, \beta)$-metric in Cartan space $\ell^{n}$ analogously to one in Finsler space and obtained the basic important geometric properties and also investigate the special class of the space with…
In this paper we consider a type system with a universal type $\omega$ where any term (whether open or closed, $\beta$-normalising or not) has type $\omega$. We provide this type system with a realisability semantics where an atomic type is…
Given $\beta\in(1,2)$ and $x\in[0,\frac{1}{\beta-1}]$, a sequence $(\epsilon_{i})_{i=1}^{\infty}\in\{0,1\}^{\mathbb{N}}$ is called a $\beta$-expansion for $x$ if $$x=\sum_{i=1}^{\infty}\frac{\epsilon_{i}}{\beta^{i}}.$$ In a recent article…
In this paper we prove some results on the possible multiplicative orders of $\alpha + \alpha^{-1}$ when $\alpha$ is a non-zero element of a finite field of characteristic 2. The results of the paper rely on a previous investigation on the…
Let $\mathcal{A}$ be a separable nuclear C*-algebra, and $\mathcal{B}$ be a nonunital separable simple $\mathcal{Z}$-stable C*-algebra. Continuing the work from Gabe-Lin-Ng, we classify all essential extensions, with large complement, of…
Motivated by the set-antiset method for codes over permutations under the infinity norm, we study anticodes under this metric. For half of the parameter range we classify all the optimal anticodes, which is equivalent to finding the maximum…
We study cube-free words over arbitrary non-unary finite alphabets and prove the following structural property: for every pair $(u,v)$ of $d$-ary cube-free words, if $u$ can be infinitely extended to the right and $v$ can be infinitely…
We investigate the expressive power of quantifier alternation hierarchy of first-order logic over words. This hierarchy includes the classes ${\Sigma}_i$ (sentences having at most $i$ blocks of quantifiers starting with an $\exists$) and…
S. Baker (2019), B. B\'ar\'any and A. K\"{a}enm\"{a}ki (2019) independently showed that there exist iterated function systems without exact overlaps and there are super-exponentially close cylinders at all small levels. We adapt the method…
We introduce a new notion of a relational word as a finite totally ordered set of positions endowed with three binary relations that describe which positions are labeled by equal data, by unequal data and those having an undefined relation…
In this paper, we investigate the problem of synthesizing computable functions of infinite words over an infinite alphabet (data omega-words). The notion of computability is defined through Turing machines with infinite inputs which can…
We study the lexicographically least infinite $a/b$-power-free word on the alphabet of non-negative integers. Frequently this word is a fixed point of a uniform morphism, or closely related to one. For example, the lexicographically least…
We continue the research of an extension $\widetilde{\mid}$ of the divisibility relation to the Stone-\v Cech compactification $\beta N$. First we prove that ultrafilters we call prime actually possess the algebraic property of primality.…