All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 22 Next

Displaying 421 – 440 of 584

Showing per page

Positive knots, closed braids and the Jones polynomial

Alexander Stoimenow (2003)

Annali della Scuola Normale Superiore di Pisa - Classe di Scienze

Using the recent Gauß diagram formulas for Vassiliev invariants of Polyak-Viro-Fiedler and combining these formulas with the Bennequin inequality, we prove several inequalities for positive knots relating their Vassiliev invariants, genus and degrees of the Jones polynomial. As a consequence, we prove that for any of the polynomials of Alexander/Conway, Jones, HOMFLY, Brandt-Lickorish-Millett-Ho and Kauffman there are only finitely many positive knots with the same polynomial and no positive knot...

Prime ideals in the lattice of additive induced-hereditary graph properties

Amelie J. Berger, Peter Mihók (2003)

Discussiones Mathematicae Graph Theory

An additive induced-hereditary property of graphs is any class of finite simple graphs which is closed under isomorphisms, disjoint unions and induced subgraphs. The set of all additive induced-hereditary properties of graphs, partially ordered by set inclusion, forms a completely distributive lattice. We introduce the notion of the join-decomposability number of a property and then we prove that the prime ideals of the lattice of all additive induced-hereditary properties are divided into two groups,...

Propriétés combinatoires, ergodiques et arithmétiques de la substitution de Tribonacci

Nataliya Chekhova, Pascal Hubert, Ali Messaoudi (2001)

Journal de théorie des nombres de Bordeaux

Nous étudions certaines propriétés combinatoires, ergodiques et arithmétiques du point fixe de la substitution de Tribonacci (introduite par G. Rauzy) et de la rotation du tore 𝕋 2 qui lui est associée. Nous établissons une généralisation géométrique du théorème des trois distances et donnons une formule explicite pour la fonction de récurrence du point fixe. Nous donnons des propriétés d’approximation diophantienne du vecteur de la rotation de 𝕋 2 : nous montrons, que pour une norme adaptée, la suite...

Reducible properties of graphs

P. Mihók, G. Semanišin (1995)

Discussiones Mathematicae Graph Theory

Let L be the set of all hereditary and additive properties of graphs. For P₁, P₂ ∈ L, the reducible property R = P₁∘P₂ is defined as follows: G ∈ R if and only if there is a partition V(G) = V₁∪ V₂ of the vertex set of G such that ⟨ V ₁ ⟩ G ∈ P ₁ and ⟨ V ₂ ⟩ G ∈ P ₂ . The aim of this paper is to investigate the structure of the reducible properties of graphs with emphasis on the uniqueness of the decomposition of a reducible property into irreducible ones.

Currently displaying 421 – 440 of 584