FINITELY BASED, FINITE SETS OF WORDS

2000 ◽  
Vol 10 (06) ◽  
pp. 683-708 ◽  
Author(s):  
MARCEL JACKSON ◽  
OLGA SAPIR
Keyword(s):  
Direct Product ◽  
Free Monoid ◽  
Finitely Based ◽  
Finite Sets ◽  
Finite Semigroups ◽  
Finite Set ◽  
Rees Quotient ◽  
The Ideal

For W a finite set of words, we consider the Rees quotient of a free monoid with respect to the ideal consisting of all words that are not subwords of W. This resulting monoid is denoted by S(W). It is shown that for every finite set of words W, there are sets of words U⊃W and V⊃W such that the identities satisfied by S(V) are finitely based and those of S(U) are not finitely based [regardless of the situation for S(W)]. The first examples of finitely based (not finitely based) aperiodic finite semigroups whose direct product is not finitely based (finitely based) are presented and it is shown that every monoid of the form S(W) with fewer than 9 elements is finitely based and that there is precisely one not finitely based 9 element example.

FINITELY BASED WORDS

2000 ◽  
Vol 10 (04) ◽  
pp. 457-480 ◽  
Author(s):  
OLGA SAPIR
Keyword(s):  
Sufficient Conditions ◽  
Basis Property ◽  
Free Monoid ◽  
Finite Basis ◽  
Finitely Based ◽  
Finite Basis Property ◽  
Letter Alphabet ◽  
Finite Language ◽  
Rees Quotient ◽  
The Ideal

Let W be a finite language and let Wc be the closure of W under taking subwords. Let S(W) denote the Rees quotient of a free monoid over the ideal consisting of all words that are not in Wc. We call W finitely based if the monoid S(W) is finitely based. Although these semigroups have easy structure they behave "generically" with respect to the finite basis property [6]. In this paper, we describe all finitely based words in a two-letter alphabet. We also find some necessary and some sufficient conditions for a set of words to be finitely based.

On completely recursively enumerable classes and their key arrays

1956 ◽  
Vol 21 (3) ◽  
pp. 304-308 ◽  
Author(s):  
H. G. Rice
Keyword(s):  
Decision Procedure ◽  
Cardinal Number ◽  
Maximum Amount ◽  
Infinite Class ◽  
Finite Sets ◽  
Amount Of Information ◽  
Recursively Enumerable ◽  
Finite Set ◽  
Partial Recursive Functions ◽  
Set Up

The two results of this paper (a theorem and an example) are applications of a device described in section 1. Our notation is that of [4], with which we assume familiarity. It may be worth while to mention in particular the function Φ(n, x) which recursively enumerates the partial recursive functions of one variable, the Cantor enumerating functions J(x, y), K(x), L(x), and the classes F and Q of r.e. (recursively enumerable) and finite sets respectively.It is possible to “give” a finite set in a way which conveys the maximum amount of information; this may be called “giving explicitly”, and it requires that in addition to an effective enumeration or decision procedure for the set we give its cardinal number. It is sometimes desired to enumerate effectively an infinite class of finite sets, each given explicitly (e.g., [4] p. 360, or Dekker [1] p. 497), and we suggest here a device for doing this.We set up an effective one-to-one correspondence between the finite sets of non-negative integers and these integers themselves: the integer , corresponds to the set αi, = {a1, a2, …, an} and inversely. α0 is the empty set. Clearly i can be effectively computed from the elements of αi and its cardinal number.

Undecidability of the identity problem for finite semigroups

1992 ◽  
Vol 57 (1) ◽  
pp. 179-192 ◽  
Author(s):  
Douglas Albert ◽  
Robert Baldinger ◽  
John Rhodes
Keyword(s):  
Word Problem ◽  
Finite Semigroup ◽  
Identity Problem ◽  
Finite Semigroups ◽  
Or Groups ◽  
Finite Set ◽  
Variety Of Semigroups ◽  
Finite Products

In 1947 E. Post [28] and A. A. Markov [18] independently proved the undecidability of the word problem (or the problem of deducibility of relations) for semigroups. In 1968 V. L. Murskil [23] proved the undecidability of the identity problem (or the problem of deducibility of identities) in semigroups.If we slightly generalize the statement of these results we can state many related results in the literature and state our new results proved here. Let V denote either a (Birkhoff) variety of semigroups or groups or a pseudovariety of finite semigroups. By a very well-known theorem a (Birkhoff) variety is defined by equations or equivalently closed under substructure, surmorphisms and all products; see [7]. It is also well known that V is a pseudovariety of finite semigroups iff V is closed under substructure, surmorphism and finite products, or, equivalently, determined eventually by equations w1 = w1′, w2 = w2′, w3 = w3′,… (where the finite semigroup S eventually satisfies these equations iff there exists an n, depending on S, such that S satisfies Wj = Wj′ for j ≥ n). See [8] and [29]. All semigroups form a variety while all finite semigroups form a pseudovariety.We now consider a table (see the next page). In it, for example, the box denoting the “word” (identity) problem for the psuedovariety V” means, given a finite set of relations (identities) E and a relation (identity) u = ν, the problem of whether it is decidable that E implies u = ν inside V.

scholarly journals On minimal log discrepancies and kollár components

2021 ◽  
pp. 1-20
Author(s):  
Joaquín Moraga
Keyword(s):  
Blow Up ◽  
Chain Condition ◽  
Fano Varieties ◽  
Finite Sets ◽  
Fixed Dimension ◽  
Log Canonical ◽  
Finite Set ◽  
Canonical Singularities ◽  
Ascending Chain Condition

Abstract In this article, we prove a local implication of boundedness of Fano varieties. More precisely, we prove that $d$ -dimensional $a$ -log canonical singularities with standard coefficients, which admit an $\epsilon$ -plt blow-up, have minimal log discrepancies belonging to a finite set which only depends on $d,\,a$ and $\epsilon$ . This result gives a natural geometric stratification of the possible mld's in a fixed dimension by finite sets. As an application, we prove the ascending chain condition for minimal log discrepancies of exceptional singularities. We also introduce an invariant for klt singularities related to the total discrepancy of Kollár components.

scholarly journals On the sum and the difference of finite sets of integers

1976 ◽  
Vol 15 (2) ◽  
pp. 245-251
Author(s):  
Reinhard A. Razen
Keyword(s):  
Finite Sets ◽  
Finite Set ◽  
The Difference

Let A = {ai} be a finite set of integers and let p and m denote the cardinalities of A + A = {ai+aj} and A - A {ai–aj}, respectively. In the paper relations are established between p and m; in particular, if max {ai–ai-1} = 2 those sets are characterized for which p = m holds.

Degree Functions in Local Rings

1961 ◽  
Vol 57 (1) ◽  
pp. 1-7 ◽  
Author(s):  
D. Rees
Keyword(s):  
Maximal Ideal ◽  
Zero Element ◽  
Transcendence Degree ◽  
Local Rings ◽  
Local Domain ◽  
Degree Function ◽  
Finite Set ◽  
Residue Fields ◽  
Image Position ◽  
The Ideal

Let Q be a local domain of dimension d with maximal ideal m and let q be an m-primary ideal. Then we define the degree function dq(x) to be the multiplicity of the ideal , where x; is a non-zero element of m. The degree function was introduced by Samuel (5) in the case where q = m. The function dq(x) satisfies the simple identityThe main purpose of this paper is to obtain a formulawhere vi(x) denotes a discrete valuation centred on m (i.e. vi(x) ≥ 0 if x ∈ Q, vi(x) > 0 if x ∈ m) of the field of fractions K of Q. The valuations vi(x) are assumed to have the further property that their residue fields Ki have transcendence degree d − 1 over k = Q/m. The symbol di(q) denotes a non-negative integer associated with vi(x) and q which for fixed q is zero for all save a finite set of valuations vi(x).

scholarly journals Unicity theorems for meromorphic or entire functions II

1995 ◽  
Vol 52 (2) ◽  
pp. 215-224 ◽  
Author(s):  
Hong-Xun Yi
Keyword(s):  
Meromorphic Functions ◽  
Entire Functions ◽  
Inverse Image ◽  
Finite Sets ◽  
Finite Set ◽  
Special Case

In 1976, Gross posed the question “can one find two (or possibly even one) finite sets Sj (j = 1, 2) such that any two entire functions f and g satisfying Ef(Sj) = Eg(Sj) for j = 1,2 must be identical?”, where Ef(Sj) stands for the inverse image of Sj under f. In this paper, we show that there exists a finite set S with 11 elements such that for any two non-constant meromorphic functions f and g the conditions Ef(S) = Eg(S) and Ef({∞}) = Eg({∞}) imply f ≡ g. As a special case this also answers the question posed by Gross.

scholarly journals On families of finite sets no two of which intersect in a singleton

1977 ◽  
Vol 17 (1) ◽  
pp. 125-134 ◽  
Author(s):  
Peter Frankl
Keyword(s):  
Finite Sets ◽  
Finite Set

Let X be a finite set of cardinality n, and let F be a family of k-subsets of X. In this paper we prove the following conjecture of P. Erdös and V.T. Sós.If n > n0(k), k ≥ 4, then we can find two members F and G in F such that |F ∩ G| = 1.

scholarly journals Monogenic endomorphisms of a free monoid

1989 ◽  
Vol 31 (1) ◽  
pp. 87-101 ◽  
Author(s):  
Mario Petrich
Keyword(s):  
Free Monoid ◽  
Formal Languages ◽  
Free Monoids ◽  
Finite Set ◽  
Full Discussion

Free monoids play a central role in the theory of formal languages. Their endomorphisms appear naturally in the context of deterministic OL-schemes which trace their origin to biology. Closely related to such a scheme is a DOL-system which consists of a triple (X, φ, w) where X is a finite set, φ is an endomorphism of the free monoid X* and w ∈ X. The associated language is defined as the set {w, φw, φ2w,…} called a DOL-language. For a full discussion of this subject, we recommend the book [2] by Herman and Rozenberg.

Continuum-many Boolean algebras of the form Borel

2004 ◽  
Vol 69 (3) ◽  
pp. 799-816 ◽  
Author(s):  
Michael Ray Oliver
Keyword(s):  
Equivalence Relation ◽  
Continuum Hypothesis ◽  
Boolean Algebras ◽  
New Technique ◽  
Finite Sets ◽  
A New Technique ◽  
Borel Ideals ◽  
Forcing Axiom ◽  
The Continuum ◽  
The Ideal

Abstract.We examine the question of how many Boolean algebras, distinct up to isomorphism, that are quotients of the powerset of the naturals by Borel ideals, can be proved to exist in ZFC alone. The maximum possible value is easily seen to be the cardinality of the continuum ; earlier work by Ilijas Farah had shown that this was the value in models of Martin's Maximum or some similar forcing axiom, but it was open whether there could be fewer in models of the Continuum Hypothesis.We develop and apply a new technique for constructing many ideals whose quotients must be nonisomorphic in any model of ZFC. The technique depends on isolating a kind of ideal, called shallow, that can be distinguished from the ideal of all finite sets even after any isomorphic embedding, and then piecing together various copies of the ideal of all finite sets using distinct shallow ideals. In this way we are able to demonstrate that there are continuum-many distinct quotients by Borel ideals, indeed by analytic P-ideals, and in fact that there is in an appropriate sense a Borel embedding of the Vitali equivalence relation into the equivalence relation of isomorphism of quotients by analytic P-ideals. We also show that there is an uncountable definable wellordered collection of Borel ideals with distinct quotients.

Sign in / Sign up

Export Citation Format

Share Document