English
Related papers

Related papers: Sturmian words, $\beta$-shifts, and transcendence

200 papers

Using a human-oriented formal example proof of the (lim+) theorem, i.e. that the sum of limits is the limit of the sum, which is of value for reference on its own, we exhibit a non-permutability of beta-steps and delta+-steps (according to…

Artificial Intelligence · Computer Science 2013-09-17 Claus-Peter Wirth

In the present paper and as an application of Roth's theorem concerning the rational approximation of algebraic numbers, we give a sufficient condition that will assure us that a series of positive rational terms is a transcendental number.…

Number Theory · Mathematics 2023-01-18 Fedoua Sghiouer , Kacem Belhroukia , Ali Kacha

We prove a conjecture by Tu, Zeng, Li, and Helleseth concerning trinomials $f_{\alpha,\beta}(x)= x + \alpha x^{q(q-1)+1} + \beta x^{2(q-1)+1} \in \mathbb{F}_{q^2}[x]$, $\alpha\beta \neq 0$, $q$ even, characterizing all the pairs…

Combinatorics · Mathematics 2018-01-01 Daniele Bartoli

Distributional semantics provides multi-dimensional, graded, empirically induced word representations that successfully capture many aspects of meaning in natural languages, as shown in a large body of work in computational linguistics;…

Computation and Language · Computer Science 2020-03-19 Gemma Boleda

We compare a piecewise linear map with constant slope beta>1 and a piecewise linear map with constant slope -beta. These maps are called the positive and negative beta-transformations. We show that for a certain set of beta's, the…

Dynamical Systems · Mathematics 2019-02-20 Charlene Kalle

In this paper we study substitutions on $A^\mathbb{Z}$ where $A$ is a finite alphabet. We precisely characterize the minimal components of substitution subshifts, give an optimal bound for their number and describe their dynamics. The…

Dynamical Systems · Mathematics 2026-02-16 Raphaël Henry

Given a countable set X (usually taken to be the natural numbers or integers), an infinite permutation, \pi, of X is a linear ordering of X. This paper investigates the combinatorial complexity of infinite permutations on the natural…

Discrete Mathematics · Computer Science 2011-08-19 Steven Widmer

In this paper we present a semantic study of motion complexes (ie. of a motion verb followed by a spatial preposition). We focus on the spatial and the temporal intrinsic semantic properties of the motion verbs, on the one hand, and of the…

cmp-lg · Computer Science 2016-08-31 Pierre Sablayrolles

Let $\theta=(\theta_1,\ldots,\theta_m) \in \R^m, \kappa=(\kappa_1,\ldots,\kappa_n) \in \R^n$ be two tuples of real numbers each linearly independent over $\Q$, and $T$ the transcendence degree of the field generated by $\{\exp(\theta_i…

Number Theory · Mathematics 2025-06-03 Heinrich Massold

We consider expanding maps such that the unit interval can be represented as a full symbolic shift space with bounded distortion. There are already theorems about the Hausdorff dimension for sets defined by the set of accumulation points…

Dynamical Systems · Mathematics 2009-04-29 David Färm

In this paper, we characterize by lexicographic order all finite Sturmian and episturmian words, i.e., all (finite) factors of such infinite words. Consequently, we obtain a characterization of infinite episturmian words in a "wide sense"…

Combinatorics · Mathematics 2010-03-16 Amy Glen , Jacques Justin , Giuseppe Pirillo

The construction of effective Lagrangians commonly involves the application of the `classical equation of motion' to eliminate redundant structures and thus generate the minimal number of independent terms. We investigate this procedure in…

High Energy Physics - Phenomenology · Physics 2009-10-28 S. Scherer , H. W. Fearing

We prove that for any integers $\alpha, \beta > 1$, the existential fragment of the first-order theory of the structure $\langle \mathbb{Z}; 0,1,<, +, \alpha^{\mathbb{N}}, \beta^{\mathbb{N}}\rangle$ is decidable (where $\alpha^{\mathbb{N}}$…

Logic in Computer Science · Computer Science 2025-07-22 Toghrul Karimov , Florian Luca , Joris Nieuwveld , Joël Ouaknine , James Worrell

A variety of associative algebras over a field of characteristic 0 is called minimal if its codimension sequence grows much faster than the codimension sequence of any of its proper subvarieties. By the results of Giambruno and Zaicev it…

Rings and Algebras · Mathematics 2020-04-21 Vesselin Drensky

Continued fraction expansions provide a well-established bridge between algebraic properties of numbers and combinatorics on words. In this article, we investigate the algebraicity of $p$-adic numbers whose continued fractions arise from…

Number Theory · Mathematics 2025-03-21 Laura Capuano , Sara Checcoli , Marzio Mula , Lea Terracini

Using Schmidt's Subspace Theorem, this paper improves and extends an existing transcendence result for sequences of algebraic numbers. The theorems thus produced correspond to a central theorem on the irrationality of sequences due to…

Number Theory · Mathematics 2025-03-18 Mathias L. Laursen

We discuss certain features of pseudo-Hermiticity and weak pseudo-Hermiticity conditions and point out that, contrary to a recent claim, there is no inconsistency if the correct orthogonality condition is used for the class of…

Quantum Physics · Physics 2015-06-26 B. Bagchi , C. Quesne

We present several enumeration results holding in sets of words called neutral and which satisfy restrictive conditions on the set of possible extensions of nonempty words. These formulae concern return words and bifix codes. They…

Discrete Mathematics · Computer Science 2015-03-23 Francesco Dolce , Dominique Perrin

Central, standard, and Christoffel words are three strongly interrelated classes of binary finite words which represent a finite counterpart of characteristic Sturmian words. A natural arithmetization of the theory is obtained by…

Discrete Mathematics · Computer Science 2014-10-16 Aldo de Luca , Alessandro De Luca

We present a novel method of computing the beta-normal eta-long form of a simply-typed lambda-term by constructing traversals over a variant abstract syntax tree of the term. In contrast to beta-reduction, which changes the term by…

Programming Languages · Computer Science 2015-11-10 C. -H. Luke Ong