English
Related papers

Related papers: Classification of higher Mobility closed-loop Link…

200 papers

In analogy with the well-known 2-linkage tractor-trailer problem, we define a 2-linkage problem in the plane with novel non-holonomic ``no-slip'' conditions. Using constructs from sub-Riemannian geometry, we look for geodesics corresponding…

Dynamical Systems · Mathematics 2023-07-27 Ron Perline , Sergei Tabachnikov

We use the recently introduced factorization of motion polynomials for constructing overconstrained spatial linkages with a straight line trajectory. Unlike previous examples, the end-effector motion is not translational and the link graph…

Metric Geometry · Mathematics 2018-07-31 Zijia Li , Josef Schicho , Hans-Peter Schröcker

Given a real analytic function $f$ from $\mathbb{R}^4$ to $\mathbb{R}^2$ with isolated critical point at the origin, the link $L_f$ of the singularity is a real fibred knot in $\mathbb{S}^{3}$. From this singularities, we construct a family…

Geometric Topology · Mathematics 2013-12-03 Haydée Aguilar-Cabrera

We study the linking numbers in a rational homology 3-sphere and in the infinite cyclic cover of the complement of a knot. They take values in $\Bbb Q$ and in ${Q}({\Bbb Z}[t,t^{-1}])$ respectively, where ${Q}({\Bbb Z}[t,t^{-1}])$ denotes…

Geometric Topology · Mathematics 2007-05-23 Jozef H. Przytycki , Akira Yasuhara

Designing an m-bar linkage with a maximal number of assembly modes is important in robot kinematics, and has further applications in structural biology and computational geometry. A related question concerns the number of assembly modes of…

Robotics · Computer Science 2017-10-18 Ioannis Z. Emiris , Guillaume Moroz

This work proposes a new approach to study transport properties of highly correlated local structures. The method, dubbed the Logarithmic Discretization Embedded Cluster Approximation (LDECA), consists of diagonalizing a finite cluster…

Strongly Correlated Electrons · Physics 2009-11-13 E. V. Anda , G. Chiappe , C. A. Busser , M. A. Davidovich , G. B. Martins , F. Heidrich-Meisner , E. Dagotto

Rank-based linkage is a new tool for summarizing a collection $S$ of objects according to their relationships. These objects are not mapped to vectors, and ``similarity'' between objects need be neither numerical nor symmetrical. All an…

Combinatorics · Mathematics 2026-03-25 R. W. R. Darling , Will Grilliette , Adam Logan

We construct the cyclic open--closed map for the big (i.e., bulk-deformed) relative Fukaya category, in the semipositive case, and show that it is a morphism of `polarized variations of semi-infinite Hodge structures'. We also give a…

Algebraic Geometry · Mathematics 2025-11-07 Sheel Ganatra , Nick Sheridan

A pass-move and a $#$-move are local moves on oriented links defined by L.H. Kauffman and H. Murakami respectively. Two links are self pass-equivalent (resp. self $#$-equivalent) if one can be deformed into the other by pass-moves (resp.…

Geometric Topology · Mathematics 2007-05-23 Tetsuo Shibuya , Akira Yasuhara

An explicit polynomial in the linking numbers $l_{ij}$ and Milnor's triple linking numbers $\mu(rst)$ on six component links is shown to be a well-defined finite type link-homotopy invariant. This solves a problem raised by B. Mellor and D.…

Geometric Topology · Mathematics 2007-05-23 Xiao-Song Lin

New conjectures are proposed on the numbers of FPL configurations pertaining to certain types of link patterns. Making use of the Razumov and Stroganov Ansatz, these conjectures are based on the analysis of the ground state of the…

Mathematical Physics · Physics 2016-09-07 Jean-Bernard Zuber

The homotopy trivializing number, \(n_h(L)\), and the Delta homotopy trivializing number, \(n_\Delta(L)\), are invariants of the link homotopy class of \(L\) which count how many crossing changes or Delta moves are needed to reduce that…

Geometric Topology · Mathematics 2025-06-24 Anthony Bosman , Christopher William Davis , Taylor Martin , Carolyn Otto , Katherine Vance

Loop percolation, also known as the dense O(1) loop model, is a variant of critical bond percolation in the square lattice Z^2 whose graph structure consists of a disjoint union of cycles. We study its connectivity pattern, which is a…

Probability · Mathematics 2015-06-15 Dan Romik

We study loop percolation models in two and in three space dimensions, in which configurations of occupied bonds are forced to form closed loop. We show that the uncorrelated occupation of elementary plaquettes of the square and the simple…

Disordered Systems and Neural Networks · Physics 2009-11-07 Frank O. Pfeiffer , Heiko Rieger

The relation between discrete topological field theories on triangulations of two-dimensional manifolds and associative algebras was worked out recently. The starting point for this development was the graphical interpretation of the…

High Energy Physics - Theory · Physics 2009-10-28 Claus Nowak

Tangent points, especial dynamics existing only in piecewise-smooth systems, usually have dynamical properties like equilibria of smooth systems. Loops connecting tangent points own partly properties of limit cycles and homoclinic loops of…

Dynamical Systems · Mathematics 2024-05-01 Zhihao Fang , Xingwu Chen

In this article we provide a classification of the projective transformations in $PSL(n+1,\Bbb{C})$ considered as automorphisms of the complex projective space $\Bbb{P}^n$. Our classification is an interplay between algebra and dynamics,…

Dynamical Systems · Mathematics 2017-01-05 Angel Cano , Luis Loeza , Alejandro Ucan

Let $M_1$ and $M_2$ be closed connected orientable $3$-manifolds. We classify the sets of smooth and piecewise linear isotopy classes of embeddings $M_1\sqcup M_2\rightarrow S^6$.

Geometric Topology · Mathematics 2022-12-21 Sergey Avvakumov

We develop a new general algorithm for finding a regular tight-binding lattice Hamiltonian in infinite dimensions for an arbitrary given shape of the density of states (DOS). The availability of such an algorithm is essential for the…

Strongly Correlated Electrons · Physics 2007-05-23 N. Blümer , P. G. J. van Dongen

A graph $G$ of order $n>2$ is pancyclic if $G$ contains a cycle of length $l$ for each integer $l$ with $3 \leq l \leq n $ and it is called vertex-pancyclic if every vertex is contained in a cycle of length $l$ for every $3 \leq l \leq n $.…

Combinatorics · Mathematics 2022-06-24 S. Morteza Mirafzal , Sara Kouhi