Search results for " set"
showing 10 items of 2095 documents
A NOTE ON THE ASYMPTOTIC PROBABILITIES OF EXISTENTIAL SECOND-ORDER MINIMAL GÖDEL SENTENCES WITH EQUALITY
1995
The minimal Gödel class is the class of first-order prenex sentences whose quantifier prefix consists of two universal quantifiers followed by just one existential quantifier. We prove that asymptotic probabilities of existential second-order sentences, whose first-order part is in the minimal Gödel class, form a dense subset of the unit interval.
Zur Hyperebenenalgebraisierung in desargues-Schen projektiven Verbandsgeometrien
1991
As a completion and extension of a result of A. Day and D. Pickering [5] we obtain the following structure theorem in the conceptual frame of projective lattice geometries: In a Desarguesian projective geometry the subgeometry of every at least one-dimensional hyperplane is module induced.
A Group-theoretical Finiteness Theorem
2008
We start with the universal covering space $${\*M^n}$$ of a closed n-manifold and with a tree of fundamental domains which zips it $${T\longrightarrow\*M^n}$$ . Our result is that, between T and $${\* M^n}$$ , is an intermediary object, $${T\stackrel{p} {\longrightarrow} G \stackrel{F}{\longrightarrow} \*M^n}$$ , obtained by zipping, such that each fiber of p is finite and $${T\stackrel{p}{\longrightarrow}G\stackrel{F}{\longrightarrow} \*M^n}$$ admits a section.
Pattern Matching and Pattern Discovery Algorithms for Protein Topologies
2001
We describe algorithms for pattern-matching and pattern-learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgraph isomorphism and finding maximal common subgraphs in a restricted class of ordered graphs. We have developed a subgraph isomorphism algorithm for ordered graphs, which performs well on the given set of data. The maximal common subgraph problem then is solved by repeated subgraph extension and checking for isomorphisms. Despite its apparent inefficiency, this approach yields an algorithm with time complexity proportional to the number of graphs in the input set and is still practical on the given set of data. As a…
Extensions of cocycles for hyperfinite actions and applications
1997
Given a countable, hyperfinite, ergodic and measure-preserving equivalence relationR on a standard probability space (X, ℬ, μ) and an elementW of the normalizerN (R) ofR, we investigate the problem of extendingR-cocycles to\(\bar R\), where\(\bar R\) is the relation generated byR andW. As an application, we obtain that for a Bernoulli automorphism the smallest family of natural factors in sense of [6] consists of all factors. Given an automorphism which is embeddable in a measurable flow and a compact, metric group, we show that for a typical cocycle we cannot lift the whole flow to the centralizer of the corresponding group extension.
4-Manifold topology I: Subexponential groups
1995
The technical lemma underlying the 5-dimensional topological s-cobordism conjecture and the 4-dimensional topological surgery conjecture is a purely smooth category statement about locating ~-null immersions of disks. These conjectures are theorems precisely for those fundamental groups ("good groups") where the ~l-null disk lemma (NDL) holds. We expand the class of known good groups to all groups of subexponential growth and those that can be formed from these by a finite number of application of two opera- tions: (1) extension and (2) direct limit. The finitely generated groups in this class are amenable and no amenable group is known to lie outside this class.
On Certain Metrizable Locally Convex Spaces
1986
Publisher Summary This chapter discusses on certain metrizable locally convex spaces. The linear spaces used are defined over the field IK of real or complex numbers. The word "space" will mean "Hausdorff locally convex space". This chapter presents a proposition which states if U be a neighborhood of the origin in a space E. If A is a barrel in E which is not a neighborhood of the origin and F is a closed subspace of finite codimension in E’ [σ(E’,E)], then U° ∩ F does not contain A° ∩ F. Suppose that U° ∩ F contain A° ∩ F. Then A° ∩ F is equicontinuous hence W is also equicontinuous. Since W° is contained in A, it follows that A is a neighborhood of the origin, a contradiction.
On closures of discrete sets
2018
The depth of a topological space $X$ ($g(X)$) is defined as the supremum of the cardinalities of closures of discrete subsets of $X$. Solving a problem of Mart\'inez-Ruiz, Ram\'irez-P\'aramo and Romero-Morales, we prove that the cardinal inequality $|X| \leq g(X)^{L(X) \cdot F(X)}$ holds for every Hausdorff space $X$, where $L(X)$ is the Lindel\"of number of $X$ and $F(X)$ is the supremum of the cardinalities of the free sequences in $X$.
The complex of words and Nakaoka stability
2005
We give a new simple proof of the exactness of the complex of injective words and use it to prove Nakaoka's homology stability for symmetric groups. The methods are generalized to show acyclicity in low degrees for the complex of words in "general position". Hm(§ni1;Z) = Hm(§n;Z) for n=2 > m where §n denotes the permutation group of n elements. An elementary proof of this fact has not been available in the literature. In the first section the complex C⁄(m) of abelian groups is studied which in de- gree n is freely generated by injective words of length n. The alphabet consists of m letters. The complex C⁄(m) has the only non vanishing homology in degree m (Theorem 1). This is a result of F.…
The solution to a conjecture of Tits on the subgroup generated by the squares of the generators of an Artin group
2000
It was conjectured by Tits that the only relations amongst the squares of the standard generators of an Artin group are the obvious ones, namely that a^2 and b^2 commute if ab=ba appears as one of the Artin relations. In this paper we prove Tits' conjecture for all Artin groups. More generally, we show that, given a number m(s)>1 for each Artin generator s, the only relations amongst the powers s^m(s) of the generators are that a^m(a) and b^m(b) commute if ab=ba appears amongst the Artin relations.