On the cardinality of β-expansions of some numbers

2016 ◽  
Vol 12 (06) ◽  
pp. 1497-1507
Author(s):  
Yuru Zou ◽  
Wenxia Li ◽  
Jian Lu
Keyword(s):  
Finiteness Condition

Let [Formula: see text]. It is well known that every [Formula: see text] has a [Formula: see text]-expansion of the form [Formula: see text] with [Formula: see text], where [Formula: see text] denotes the largest integer not exceeding [Formula: see text]. Let [Formula: see text] and [Formula: see text] denote the sets of all [Formula: see text]-expansions of [Formula: see text] and the set of [Formula: see text]-prefixes of all [Formula: see text]-expansions of [Formula: see text], respectively. We show that [Formula: see text], [Formula: see text] and [Formula: see text] are equivalent under a certain finiteness condition.

scholarly journals A finiteness condition for rewriting systems

1994 ◽  
Vol 131 (2) ◽  
pp. 271-294 ◽  
Author(s):  
Craig C. Squier ◽  
Friedrich Otto ◽  
Yuji Kobayashi
Keyword(s):  
Finiteness Condition ◽  
Rewriting Systems

scholarly journals Computability and the algebra of fields: Some affine constructions

1980 ◽  
Vol 45 (1) ◽  
pp. 103-120 ◽  
Author(s):  
J. V. Tucker
Keyword(s):  
Algebraic Structure ◽  
Algebraic System ◽  
Finiteness Condition ◽  
Coordinate Systems ◽  
Natural Numbers ◽  
Algebraic Foundation ◽  
Image Position ◽  
Technical Idea ◽  
Natural Way ◽  
General Method

A natural way of studying the computability of an algebraic structure or process is to apply some of the theory of the recursive functions to the algebra under consideration through the manufacture of appropriate coordinate systems from the natural numbers. An algebraic structure A = (A; σ1,…, σk) is computable if it possesses a recursive coordinate system in the following precise sense: associated to A there is a pair (α, Ω) consisting of a recursive set of natural numbers Ω and a surjection α: Ω → A so that (i) the relation defined on Ω by n ≡α m iff α(n) = α(m) in A is recursive, and (ii) each of the operations of A may be effectively followed in Ω, that is, for each (say) r-ary operation σ on A there is an r argument recursive function on Ω which commutes the diagramwherein αr is r-fold α × … × α.This concept of a computable algebraic system is the independent technical idea of M.O.Rabin [18] and A.I.Mal'cev [14]. From these first papers one may learn of the strength and elegance of the general method of coordinatising; note-worthy for us is the fact that computability is a finiteness condition of algebra—an isomorphism invariant possessed of all finite algebraic systems—and that it serves to set upon an algebraic foundation the combinatorial idea that a system can be combinatorially presented and have effectively decidable term or word problem.

Amenability and Translation Experiments

1983 ◽  
Vol 35 (1) ◽  
pp. 49-58 ◽  
Author(s):  
Alan L. T. Paterson
Keyword(s):  
Present Note ◽  
Locally Compact Group ◽  
Finiteness Condition ◽  
Probability Measures ◽  
Multiplier Theorem ◽  
Bounded Linear ◽  
Discrete Semigroups ◽  
Transition Operators ◽  
Semigroup Version ◽  
Similar Issue

In [11] it is shown that the deficiency of a translation experiment with respect to another on a σ-finite, amenable, locally compact group can be calculated in terms of probability measures on the group. This interesting result, brought to the writer's notice by [1], does not seem to be as wellknown in the theory of amenable groups as it should be. The present note presents a simple proof of the result, removing the σ-finiteness condition and repairing a gap in Torgersen's argument. The main novelty is the use of Wendel's multiplier theorem to replace Torgersen's approach which is based on disintegration of a bounded linear operator from L1(G) into C(G)* for G σ-finite (cf. [5], VI.8.6). The writer claims no particular competence in mathematical statistics, but hopes that the discussion of the above result from the “harmonic analysis” perspective may prove illuminating.We then investigate a similar issue for discrete semigroups. A set of transition operators, which reduce to multipliers in the group case, is introduced, and a semigroup version of Torgersen's theorem is established.

Defining Families for Integral Domains of Real Finite Character

1972 ◽  
Vol 24 (6) ◽  
pp. 1170-1177 ◽  
Author(s):  
William Heinzer ◽  
Jack Ohm
Keyword(s):  
Zero Element ◽  
Finiteness Condition ◽  
Quotient Field ◽  
Integral Domains ◽  
Valuation Rings ◽  
Rank One

Throughout this paper R and D will denote integral domains with the same quotient field K. A set of integral domains {Di} i∊I with quotient field K will be said to have FC (“finite character” or “finiteness condition“) if 0 ≠ ξ ∊ K implies ξ is a unit of Di for all but finitely many i. If ∩i∊IDi also has quotient field K, then {Di} has FC if and only if every non-zero element in ∩i∊IDi is a non-unit in at most finitely many Di. A non-empty set {Vi}i∊:I of rank one valuation rings with quotient field K will be called a defining family of real R-representativesfor D if {Vi} i∊:I has FC, R (⊄ ∩i∊IVi, and D = R∩ (∩i∊I Vi).

scholarly journals Coherency and Constructions for Monoids

2020 ◽  
Vol 71 (4) ◽  
pp. 1461-1488
Author(s):  
Yang Dandan ◽  
Victoria Gould ◽  
Miklós Hartmann ◽  
Nik Ruškuc ◽  
Rida-E Zenab
Keyword(s):  
Finiteness Condition ◽  
Direct Products ◽  
Finitely Generated ◽  
Rees Matrix Semigroups ◽  
The Relationship ◽  
Brandt Semigroups ◽  
Finitely Presented ◽  
Matrix Semigroups

Abstract A monoid S is right coherent if every finitely generated subact of every finitely presented right S-act is finitely presented. This is a finiteness condition, and we investigate whether or not it is preserved under some standard algebraic and semigroup theoretic constructions: subsemigroups, homomorphic images, direct products, Rees matrix semigroups, including Brandt semigroups, and Bruck–Reilly extensions. We also investigate the relationship with the property of being weakly right noetherian, which requires all right ideals of S to be finitely generated.

scholarly journals A finiteness condition on centralizers in locally nilpotent groups

2015 ◽  
Vol 182 (2) ◽  
pp. 289-298 ◽  
Author(s):  
Gustavo A. Fernández-Alcober ◽  
Leire Legarreta ◽  
Antonio Tortora ◽  
Maria Tota
Keyword(s):  
Nilpotent Groups ◽  
Finiteness Condition ◽  
Locally Nilpotent Groups ◽  
Locally Nilpotent

Quasi-stationary distributions for Markov chains on a general state space

1974 ◽  
Vol 11 (4) ◽  
pp. 726-741 ◽  
Author(s):  
Richard. L. Tweedie
Keyword(s):  
Markov Chain ◽  
Invariant Measure ◽  
Markov Chains ◽  
State Space ◽  
Finiteness Condition ◽  
General State ◽  
Stationary Distributions ◽  
General State Space ◽  
Countably Infinite ◽  
Stationary Behaviour

The quasi-stationary behaviour of a Markov chain which is φ-irreducible when restricted to a subspace of a general state space is investigated. It is shown that previous work on the case where the subspace is finite or countably infinite can be extended to general chains, and the existence of certain quasi-stationary limits as honest distributions is equivalent to the restricted chain being R-positive with the unique R-invariant measure satisfying a certain finiteness condition.

Sign in / Sign up

Export Citation Format

Share Document