Fibered knots and links in lens spaces

La tesi propone alcuni esempi di link fibrati in spazi lenticolari. Sfruttando la compatibilità fra le mosse di chirurgia intera e la nozione di open book decomposition, si ricava un esempio di link fibrato prima in L(p,1), per poi generalizzarlo a L(p,q). Si conclude determinando una struttura di contatto equivalente alla open book relativa agli spazi del tipo L(p,1).

Real map germs and higher open book structures

The paper focusses on the existence of higher open book structures defined by real map germs psi : (R(m), 0) -> (R(p), 0) such that Sing psi boolean AND psi(-1)(0) subset of {0}. A general existence criterion is proved, with view to weighted-homogeneous maps.

Genus for knots and links in renormalizable templates with several branch nodes

We apply kneading theory to describe the knots and links generated by the iteration of renormalizable nonautonomous dynamical systems with reducible kneading invariants, in terms of the links corresponding to each factor. As a consequence we obtain explicit formulas for the genus for this kind of knots and links.

A topological invariant to predict the three-dimensional writhe of ideal configurations of knots and links.

We present herein a topological invariant of oriented alternating knots and links that predicts the three-dimensional (3D) writhe of the ideal geometrical configuration of the considered knot/link. The fact that we can correlate a geometrical property of a given configuration with a topological invariant supports the notion that the ideal configuration contains important information about knots and links. The importance of the concept of ideal configuration was already suggested by the good correlation between the 3D writhe of ideal knot configurations and the ensemble average of the 3D writhe of random configurations of the considered knots. The values of the new invariant are quantized: multiples of 4/7 for links with an odd number of components (including knots) and 2/7 plus multiples of 4/7 for links with an even number of components.

Linear relations between writhe and minimal crossing number in Conway families of ideal knots and links

We showed earlier how to predict the writhe of any rational knot or link in its ideal geometric configuration, or equivalently the average of the 3D writhe over statistical ensembles of random configurations of a given knot or link (Cerf and Stasiak 2000 Proc. Natl Acad. Sci. USA 97 3795). There is no general relation between the minimal crossing number of a knot and the writhe of its ideal geometric configuration. However, within individual families of knots linear relations between minimal crossing number and writhe were observed (Katritch et al 1996 Nature 384 142). Here we present a method that allows us to express the writhe as a linear function of the minimal crossing number within Conway families of knots and links in their ideal configuration. The slope of the lines and the shift between any two lines with the same

A partial ordering of knots and links through diagrammatic unknotting

In this paper we de. ne a partial ordering of knots and links using a special property derived from their minimal diagrams. A link K' is called a predecessor of a link K if Cr(K') < Cr(K) and a diagram of K' can be obtained from a minimal diagram D of K by a single crossing change. In such a case, we say that K' < K. We investigate the sets of links that can be obtained by single crossing changes over all minimal diagrams of a given link. We show that these sets are specific for different links and permit partial ordering of all links. Some interesting results are presented and many questions are raised.

Knots and links in lens spaces

The aim of this dissertation is to improve the knowledge of knots and links in lens spaces. If the lens space L(p,q) is defined as a 3-ball with suitable boundary identifications, then a link in L(p,q) can be represented by a disk diagram, i.e. a regular projection of the link on a disk. In this contest, we obtain a complete finite set of Reidemeister-type moves establishing equivalence, up to ambient isotopy. Moreover, the connections of this new diagram with both grid and band diagrams for links in lens spaces are shown. A Wirtinger-type presentation for the group of the link and a diagrammatic method giving the first homology group are described. A class of twisted Alexander polynomials for links in lens spaces is computed, showing its correlation with Reidemeister torsion. One of the most important geometric invariants of links in lens spaces is the lift in 3-sphere of a link L in L(p,q), that is the counterimage of L under the universal covering of L(p,q). Starting from the disk diagram of the link, we obtain a diagram of the lift in the 3-sphere. Using this construction it is possible to find different knots and links in L(p,q) having equivalent lifts, hence we cannot distinguish different links in lens spaces only from their lift. The two final chapters investigate whether several existing invariants for links in lens spaces are essential, i.e. whether they may assume different values on links with equivalent lift. Namely, we consider the fundamental quandle, the group of the link, the twisted Alexander polynomials, the Kauffman Bracket Skein Module and an HOMFLY-PT-type invariant.

An open book: what and how young children learn from picture and story books

Looking at and listening to picture and story books is a ubiquitous activity, frequently enjoyed by many young children and their parents. Well before children can read for themselves they are able to learn from books. Looking at and listening to books increases children’s general knowledge, understanding about the world and promotes language acquisition. This collection of papers demonstrates the breadth of information pre-reading children learn from books and increases our understanding of the social and cognitive mechanisms that support this learning. Our hope is that this Research Topic/eBook will be useful for researchers as well as educational practitioners and parents who are interested in optimizing children’s learning. We conceptually divide this research topic into four broad sections, which focus on the nature and attributes of picture and story books, what children learn from picture and story books, the interactions children experience during shared reading, and potential applications of research into shared reading, respectively.

The work of the Open court publishing co.; an illustrated catalogue of its publications covering a period of twenty-one years (1887-1907) consisting of a complete book list with brief characterization of authors and contents, including also a selection of noteworthy articles from the Monist and the Open court.

Cover title.

Subknots in ideal knots, random knots, and knotted proteins.

We introduce disk matrices which encode the knotting of all subchains in circular knot configurations. The disk matrices allow us to dissect circular knots into their subknots, i.e. knot types formed by subchains of the global knot. The identification of subknots is based on the study of linear chains in which a knot type is associated to the chain by means of a spatially robust closure protocol. We characterize the sets of observed subknot types in global knots taking energy-minimized shapes such as KnotPlot configurations and ideal geometric configurations. We compare the sets of observed subknots to knot types obtained by changing crossings in the classical prime knot diagrams. Building upon this analysis, we study the sets of subknots in random configurations of corresponding knot types. In many of the knot types we analyzed, the sets of subknots from the ideal geometric configurations are found in each of the hundreds of random configurations of the same global knot type. We also compare the sets of subknots observed in open protein knots with the subknots observed in the ideal configurations of the corresponding knot type. This comparison enables us to explain the specific dispositions of subknots in the analyzed protein knots.

KnotProt: a database of proteins with knots and slipknots.

The protein topology database KnotProt, http://knotprot.cent.uw.edu.pl/, collects information about protein structures with open polypeptide chains forming knots or slipknots. The knotting complexity of the cataloged proteins is presented in the form of a matrix diagram that shows users the knot type of the entire polypeptide chain and of each of its subchains. The pattern visible in the matrix gives the knotting fingerprint of a given protein and permits users to determine, for example, the minimal length of the knotted regions (knot's core size) or the depth of a knot, i.e. how many amino acids can be removed from either end of the cataloged protein structure before converting it from a knot to a different type of knot. In addition, the database presents extensive information about the biological functions, families and fold types of proteins with non-trivial knotting. As an additional feature, the KnotProt database enables users to submit protein or polymer chains and generate their knotting fingerprints.

Linear random knots and their scaling behavior

We present here a nonbiased probabilistic method that allows us to consistently analyze knottedness of linear random walks with up to several hundred noncorrelated steps. The method consists of analyzing the spectrum of knots formed by multiple closures of the same open walk through random points on a sphere enclosing the walk. Knottedness of individual "frozen" configurations of linear chains is therefore defined by a characteristic spectrum of realizable knots. We show that in the great majority of cases this method clearly defines the dominant knot type of a walk, i.e., the strongest component of the spectrum. In such cases, direct end-to-end closure creates a knot that usually coincides with the knot type that dominates the random closure spectrum. Interestingly, in a very small proportion of linear random walks, the knot type is not clearly defined. Such walks can be considered as residing in a border zone of the configuration space of two or more knot types. We also characterize the scaling behavior of linear random knots.