Arithmetical affine complete varieties and inverse monoids

2008 ◽  
Vol 45 (1) ◽  
pp. 13-28 ◽  
Author(s):  
Kalle Kaarli
Keyword(s):  
Distributive Lattice ◽  
Finite Type ◽  
Categorical Equivalence ◽  
Inverse Monoids ◽  
Affine Complete

This paper gives a classification of arithmetical affine complete varieties of finite type up to categorical equivalence. It is proved that two such varieties are equivalent as categories if and only if their weakly diagonal generators have isomorphic monoids of bicongruences. Moreover, it is proved that the monoids appearing in this situation are precisely the inverse factorizable monoids with zero, with distributive lattice of idempotents, and satisfying a certain idempotent-unit condition (IU).

scholarly journals On classification of some surfaces of revolution of finite type

1993 ◽  
Vol 17 (1) ◽  
pp. 287-298 ◽  
Author(s):  
Bang-yen Chen ◽  
Susumu Ishikawa
Keyword(s):  
Finite Type ◽  
Surfaces Of Revolution

scholarly journals The Lattice of Definable Equivalence Relations in Homogeneous $n$-Dimensional Permutation Structures

10.37236/5980 ◽  
2016 ◽  
Vol 23 (4) ◽  
Author(s):  
Samuel Braunfeld
Keyword(s):  
Distributive Lattice ◽  
Equivalence Relations ◽  
Electronic Journal ◽  
Finite Distributive Lattice ◽  
Linear Orders ◽  
Finite Dimensional ◽  
Homogeneous Structures ◽  
Special Case

In Homogeneous permutations, Peter Cameron [Electronic Journal of Combinatorics 2002] classified the homogeneous permutations (homogeneous structures with 2 linear orders), and posed the problem of classifying the homogeneous $n$-dimensional permutation structures (homogeneous structures with $n$ linear orders) for all finite $n$. We prove here that the lattice of $\emptyset$-definable equivalence relations in such a structure can be any finite distributive lattice, providing many new imprimitive examples of homogeneous finite dimensional permutation structures. We conjecture that the distributivity of the lattice of $\emptyset$-definable equivalence relations is necessary, and prove this under the assumption that the reduct of the structure to the language of $\emptyset$-definable equivalence relations is homogeneous. Finally, we conjecture a classification of the primitive examples, and confirm this in the special case where all minimal forbidden structures have order 2. 

FREE INVERSE MONOIDS AND GRAPH IMMERSIONS

1993 ◽  
Vol 03 (01) ◽  
pp. 79-99 ◽  
Author(s):  
STUART W. MARGOLIS ◽  
JOHN C. MEAKIN
Keyword(s):  
Formal Language ◽  
Inverse Monoid ◽  
Finitely Generated ◽  
Inverse Monoids ◽  
Rational Subset ◽  
The Relationship ◽  
Subgroup Theorem ◽  
Free Inverse Monoid ◽  
Natural Way

The relationship between covering spaces of graphs and subgroups of the free group leads to a rapid proof of the Nielsen-Schreier subgroup theorem. We show here that a similar relationship holds between immersions of graphs and closed inverse submonoids of free inverse monoids. We prove using these methods, that a closed inverse submonoid of a free inverse monoid is finitely generated if and only if it has finite index if and only if it is a rational subset of the free inverse monoid in the sense of formal language theory. We solve the word problem for the free inverse category over a graph Γ. We show that immersions over Γ may be classified via conjugacy classes of loop monoids of the free inverse category over Γ. In the case that Γ is a bouquet of X circles, we prove that the category of (connected) immersions over Γ is equivalent to the category of (transitive) representations of the free inverse monoid FIM(X). Such representations are coded by closed inverse submonoids of FIM(X). These monoids will be constructed in a natural way from groups acting freely on trees and they admit an idempotent pure retract onto a free inverse monoid. Applications to the classification of finitely generated subgroups of free groups via finite inverse monoids are developed.

scholarly journals Geometric classification of simple graph algebras

2012 ◽  
Vol 33 (4) ◽  
pp. 1199-1220 ◽  
Author(s):  
ADAM P. W. SØRENSEN
Keyword(s):  
Finite Type ◽  
Isomorphism Class ◽  
Simple Graph ◽  
The Other ◽  
Graph Algebras ◽  
Short List

AbstractInspired by Franks’ classification of irreducible shifts of finite type, we provide a short list of allowed moves on graphs that preserve the stable isomorphism class of the associated $C^*$-algebras. We show that if two graphs have stably isomorphic and simple unital algebras then we can use these moves to transform one into the other.

scholarly journals ON CYCLES AND COVERINGS ASSOCIATED TO A KNOT

2013 ◽  
Vol 22 (13) ◽  
pp. 1350074
Author(s):  
LILYA LYUBICH ◽  
MIKHAIL LYUBICH
Keyword(s):  
Dynamical System ◽  
Abelian Group ◽  
Finite Type ◽  
Weak Topology ◽  
Knot Theory ◽  
Commutator Subgroup ◽  
Finite Abelian Group ◽  
Complete Classification ◽  
And Shifts

Let [Formula: see text] be a knot, G be the knot group, K be its commutator subgroup, and x be a distinguished meridian. Let Σ be a finite abelian group. The dynamical system introduced by Silver and Williams in [Augmented group systems and n-knots, Math. Ann.296 (1993) 585–593; Augmented group systems and shifts of finite type, Israel J. Math.95 (1996) 231–251] consisting of the set Hom (K, Σ) of all representations ρ : K → Σ endowed with the weak topology, together with the homeomorphism [Formula: see text] is finite, i.e. it consists of several cycles. In [Periodic orbits of a dynamical system related to a knot, J. Knot Theory Ramifications20(3) (2011) 411–426] we found the lengths of these cycles for Σ = ℤ/p,p is prime, in terms of the roots of the Alexander polynomial of the knot, mod p. In this paper we generalize this result to a general abelian group Σ. This gives a complete classification of depth 2 solvable coverings over [Formula: see text].

scholarly journals On the Classification of Links up to Finite Type

2008 ◽  
Author(s):  
N. Habegger ◽  
Jean-Baptiste Meilhan
Keyword(s):  
Finite Type

scholarly journals Properly embedded minimal annuli in $\mathbb{S}^2 \times \mathbb{R}$

2020 ◽  
Vol 5 (1) ◽  
Author(s):  
L Hauswirth ◽  
M Kilian ◽  
M U Schmidt
Keyword(s):  
Spectral Data ◽  
Finite Type ◽  
Harmonic Maps ◽  
Connected Component ◽  
Curvature Estimate ◽  
The Third ◽  
Minimal Annulus

Abstract We prove that every properly embedded minimal annulus in $\mathbb{S}^2\times\mathbb{R}$ is foliated by circles. We show that such minimal annuli are given by periodic harmonic maps $\mathbb{C} \to \mathbb{S}^2$ of finite type. Such harmonic maps are parameterized by spectral data, and we show that continuous deformations of the spectral data preserve the embeddedness of the corresponding annuli. A curvature estimate of Meeks and Rosenberg is used to show that each connected component of spectral data of embedded minimal annuli contains a maximum of the flux of the third coordinate. A classification of these maxima allows us to identify the spectral data of properly embedded minimal annuli with the spectral data of minimal annuli foliated by circles.

THE TOPOLOGICAL IHX RELATION

2001 ◽  
Vol 10 (02) ◽  
pp. 309-329
Author(s):  
NATHAN HABEGGER
Keyword(s):  
Finite Type ◽  
Finite Type Invariants

We give an exposition of the classification of finite type invariants of homology 3-spheres. A new conceptually-based proof of the topological IHX relation, needed to show the well-definedness of diagrams to manifolds, is given

Sign in / Sign up

Export Citation Format

Share Document