English
Related papers

Related papers: Characterizing Follower and Extender Set Sequences

200 papers

We show that the closure of the value set of a real linear recurrence sequence is the union of a countable set and a finite collection of intervals. Conversely, any finite collection of closed intervals is the closure of the value set of…

Number Theory · Mathematics 2009-03-25 Stefan Gerhold

Let A be a finite alphabet and f: A^* --> A^* be a morphism with an iterative fixed point f^\omega(\alpha), where \alpha{} is in A. Consider the subshift (X, T), where X is the shift orbit closure of f^\omega(\alpha) and T: X --> X is the…

Dynamical Systems · Mathematics 2015-08-05 James D. Currie , Narad Rampersad , Kalle Saari

A space $Y$ is called an {\em extension} of a space $X$ if $Y$ contains $X$ as a dense subspace. Two extensions of $X$ are said to be {\em equivalent} if there is a homeomorphism between them which fixes $X$ point-wise. For two (equivalence…

General Topology · Mathematics 2015-06-25 M. R. Koushesh

This paper argues that mathematical objects are constructions and that constructions introduce a flexibility in the ways that mathematical objects are represented (as sets of binary sequences for example) and presented (in a particular…

Logic · Mathematics 2020-01-14 Andrew Powell

A sequence $S=s_{1}s_{2}..._{n}$ is \emph{nonrepetitive} if no two adjacent blocks of $S$ are identical. In 1906 Thue proved that there exist arbitrarily long nonrepetitive sequences over 3-element set of symbols. We study a generalization…

Combinatorics · Mathematics 2011-04-15 Jarosław Grytczuk , Jakub Kozik , Marcin Witkowski

Assuming that ORD is $\omega +\omega $-Erd\"os we show that if a class forcing amenable to $L$ (an $L$-forcing) has a generic then it has one definable in a set-generic extension of $L[O^\#]$. In fact we may choose such a generic to be {\it…

Logic · Mathematics 2016-09-06 Sy D. Friedman

We enumerate total cyclic orders on $\left\{1,\ldots,n\right\}$ where we prescribe the relative cyclic order of consecutive triples $(i,{i+1},{i+2})$, these integers being taken modulo $n$. In some cases, the problem reduces to the…

Combinatorics · Mathematics 2020-07-10 Sanjay Ramassamy

We establish new combinatorial transcendence criteria for continued fraction expansions. Let $\alpha = [0; a_1, a_2,...]$ be an algebraic number of degree at least three. One of our criteria implies that the sequence of partial quotients…

Number Theory · Mathematics 2012-11-26 Yann Bugeaud

Motivated by recent developments in the metrical theory of continued fractions for real numbers concerning the growth of consecutive partial quotients, we consider its analogue over the field of formal Laurent series. Let $A_n(x)$ be the…

Number Theory · Mathematics 2022-02-25 Hui Hu , Mumtaz Hussain , Yueli Yu

Generalizations of linear numeration systems in which the set of natural numbers is recognizable by finite automata are obtained by describing an arbitrary infinite regular language following the lexicographic ordering. For these systems of…

Other Computer Science · Computer Science 2007-05-23 Pierre B. A. Lecomte , Michel Rigo

In this paper we deal with the dimension of multisequences and related properties. For a given multisequence W and an m tuple of positive integers R, we define the R extension of W. Further we count the number of multisequences W whose R…

Cryptography and Security · Computer Science 2012-08-23 Srinivasan Krishnaswamy , Harish K. Pillai

An ultrametric defined on a subset S of a metric space X can be extended to X while roughly preserving distances between pairs in S x X.

Metric Geometry · Mathematics 2012-11-14 Manor Mendel

Mixing dependency lengths from sequences of different length is a common practice in language research. However, the empirical distribution of dependency lengths of sentences of the same length differs from that of sentences of varying…

Computation and Language · Computer Science 2014-12-03 Ramon Ferrer-i-Cancho , Haitao Liu

The technique of symmetric extensions is derived from forcing and it is one of the most important tools for studying models without the Axiom of Choice. Despite being incredibly successful since the 1960s, our understanding of the technique…

Logic · Mathematics 2026-02-20 Asaf Karagila , Jonathan Schilhan

We introduce the $\Sigma_1$-definable universal finite sequence and prove that it exhibits the universal extension property amongst the countable models of set theory under end-extension. That is, (i) the sequence is $\Sigma_1$-definable…

Logic · Mathematics 2020-11-11 Joel David Hamkins , Kameryn J. Williams

We consider a family of integer sequences generated by nonlinear recurrences of the second order, which have the curious property that the terms of the sequence, and integer multiples of the ratios of successive terms (which are also…

Number Theory · Mathematics 2015-07-22 Andrew N. W. Hone

Given pseudo-random binary sequence of length $L$, assuming it consists of $k$ sub-sequences of length $N$. We estimate how $k$ scales with growing $N$ to obtain a {\it limiting} ergodic behaviour, to fulfill the basic definition of…

Statistical Mechanics · Physics 2009-04-22 M. Süzen

We investigate additive properties of sets $A,$ where $A=\{a_1,a_2,\ldots ,a_k\}$ is a monotone increasing set of real numbers, and the differences of consecutive elements are all distinct. It is known that $|A+B|\geq c|A||B|^{1/2}$ for any…

Combinatorics · Mathematics 2021-07-01 Imre Ruzsa , Jozsef Solymosi

Hypergeometric sequences obey first-order linear recurrence relations with polynomial coefficients and are commonplace throughout the mathematical and computational sciences. For certain classes of hypergeometric sequences, we prove linear…

Understanding how Transformers work and how they process information is key to the theoretical and empirical advancement of these machines. In this work, we demonstrate the existence of two phenomena in Transformers, namely isolation and…

‹ Prev 1 4 5 6 7 8 10 Next ›