English
Related papers

Related papers: Substitutions over infinite alphabet generating (-…

200 papers

In this article, we consider the factor complexity of a fixed point of a primitive substitution canonically defined by a beta-numeration system. We provide a necessary and sufficient condition on the Renyi expansion of 1 for having an…

Combinatorics · Mathematics 2007-05-23 J. Bernat , Z. Masáková , E. Pelantová

Let $\alpha,\beta \in \mathbb{R}_{>0}$ be such that $\alpha,\beta$ are quadratic and $\mathbb{Q}(\alpha)\neq \mathbb{Q}(\beta)$. Then every subset of $\mathbb{R}^n$ definable in both $(\mathbb{R},{<},+,\mathbb{Z},x\mapsto \alpha x)$ and…

Logic · Mathematics 2024-07-23 Philipp Hieronymi , Sven Manthe , Chris Schulz

Building on the work of Arizmendi and Celestino (2021), we derive the $*$-distributions of polynomials in monotone independent and infinitesimally monotone independent elements. For non-zero complex numbers $\alpha$ and $\beta$, we derive…

Probability · Mathematics 2024-05-09 Marwa Banna , Pei-Lun Tseng

Tarski initiated a logic-based approach to formal geometry that studies first-order structures with a ternary betweenness relation \beta, and a quaternary equidistance relation \equiv. Tarski established, inter alia, that the first-order…

Logic in Computer Science · Computer Science 2019-03-14 Antti Kuusisto , Jeremy Meyers , Jonni Virtema

We deal with countable alphabet locally compact random subshifts of finite type (the latter merely meaning that the symbol space is generated by an incidence matrix) under the absence of Big Images Property and under the absence of uniform…

Dynamical Systems · Mathematics 2015-09-02 Volker Mayer , Mariusz Urbanski

We consider semigroup dynamical systems defined by several monnomials over a number field $K$. We prove a finiteness result for preperiodic points of such systems which are $S$-integral with respect to a non-preperiodic point $\beta$, which…

Number Theory · Mathematics 2024-02-22 Marley Young

We study languages over infinite alphabets equipped with some structure that can be tested by recognizing automata. We develop a framework for studying such alphabets and the ensuing automata theory, where the key role is played by an…

Logic in Computer Science · Computer Science 2015-07-01 Mikołaj Bojańczyk , Bartek Klin , Sławomir Lasota

Cross-bifix-free sets are sets of words such that no prefix of any word is a suffix of any other word. In this paper, we introduce a general constructive method for the sets of cross-bifix-free binary words of fixed length. It enables us to…

Formal Languages and Automata Theory · Computer Science 2011-12-15 Stefano Bilotta , Elisa Pergola , Renzo Pinzani

The main purpose of this paper is to find the fixed point in such cases where existing literature remain silent. In this paper we introduce partial completeness, a new type of contraction and many other definitions. Using this approach the…

Functional Analysis · Mathematics 2018-03-23 Tawseef Rashid , Qamrul Haque Khan

Let $\beta>1$ be a non-integer. First we show that Lebesgue almost every number has a $\beta$-expansion of a given frequency if and only if Lebesgue almost every number has infinitely many $\beta$-expansions of the same given frequency.…

Dynamical Systems · Mathematics 2019-10-09 Yao-Qiang Li

Building on previous work by Lambert, Plagne and the third author, we study various aspects of the behavior of additive bases in infinite abelian groups and semigroups. We show that, for every infinite abelian group $T$, the number of…

Combinatorics · Mathematics 2024-12-24 Pierre-Yves Bienvenu , Benjamin Girard , Thái Hoàng Lê

Let $\Gamma_{\beta,N}$ be the $N$-part homogeneous Cantor set with $\beta\in(1/(2N-1),1/N)$. Any string $(j_\ell)_{\ell=1}^\N$ with $j_\ell\in\{0,\pm 1,...,\pm(N-1)\}$ such that $t=\sum_{\ell=1}^\N j_\ell\beta^{\ell-1}(1-\beta)/(N-1)$ is…

Dynamical Systems · Mathematics 2011-10-17 Derong Kong , Wenxia Li , Michel Dekking

An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.

Discrete Mathematics · Computer Science 2011-08-19 Alexander Valyuzhenich

Tarski initiated a logic-based approach to formal geometry that studies first-order structures with a ternary betweenness relation (\beta) and a quaternary equidistance relation (\equiv). Tarski established, inter alia, that the first-order…

Logic · Mathematics 2012-08-27 Antti Kuusisto , Jeremy Meyers , Jonni Virtema

D. Bures defined a metric $\beta $ on states of a $C^*$-algebra and this concept has been generalized to unital completely positive maps $\phi : \mathcal A \to \mathcal B$, where $\mathcal B$ is either an injective $C^*$-algebra or a von…

Functional Analysis · Mathematics 2020-04-24 B. V. Rajarama Bhat , Mithun Mukherjee

We study inequalities between graded Betti numbers of ideals in a standard graded algebra over a field and their images under embedding maps, defined earlier by us in [Math. Z. 274, (2013), no. 3-4, pp. 809-819; arXiv:1009.4488]. We show…

Commutative Algebra · Mathematics 2014-04-18 Giulio Caviglia , Manoj Kummini

This paper is a contribution to the study of extensions of arbitrary models of ZF (Zermelo-Fraenkel set theory), with no regard to countability or well-foundedness of the models involved. We present some new constructions of certain types…

Logic · Mathematics 2026-04-07 Ali Enayat

Expansions in non-integer bases have been extensively investigated since a pioneering work of R\'enyi. We introduce a more general framework of alphabet-base systems that also includes Pedicini's general alphabets and the multiple-base…

Combinatorics · Mathematics 2021-02-22 Yuru Zou , Vilmos Komornik , Jian Lu

A first characterization of the isomorphism classes of $k$-involutions for any reductive algebraic group defined over a perfect field was given in \cite{Helm2000} using $3$ invariants. In \cite{HWD04,Helm-Wu2002} a full classification of…

Representation Theory · Mathematics 2015-01-05 Robert W. Benim , Christopher E. Dometrius , Aloysius G. Helminck , Ling Wu

Precision tests of the Standard Model using $\beta$ decay have always relied on a careful choice of transition to minimize residual nuclear structure uncertainties. Following breakthroughs in nucleon-level radiative corrections in the last…

Nuclear Theory · Physics 2026-04-06 Leendert Hayen