English
Related papers

Related papers: Intrinsic linking with linking numbers of specifie…

200 papers

We derive an integral formula for the linking number of two submanifolds of the n-sphere S^n, of the product S^n x R^m, and of other manifolds which appear as "nice" hypersurfaces in Euclidean space. The formulas are geometrically…

Geometric Topology · Mathematics 2011-10-07 Clayton Shonkwiler , David Shea Vela-Vick

Given an $n$-component link $L$ in any 3-manifold $M$, the space $\mathcal{L} \subset (\mathbb{Q}\cup \mkern-1.5mu\{\infty\})^n$ of rational surgery slopes yielding L-spaces is already fully characterized (in joint work by the author) when…

Geometric Topology · Mathematics 2020-07-29 Sarah Dean Rasmussen

A low-dimensional version of our main result is the following `converse' of the Conway-Gordon-Sachs Theorem on intrinsic linking of the graph $K_6$ in 3-space: For any integer $z$ there are 6 points $1,2,3,4,5,6$ in 3-space, of which every…

Geometric Topology · Mathematics 2026-01-08 R. Karasev , A. Skopenkov

In this paper, we study the unit graph $ G(\mathbb{Z}_n) $, where $ n $ is of the form $n = p_1^{n_1} p_2^{n_2} \dots p_r^{n_r}$, with $ p_1, p_2, \dots, p_r $ being distinct prime numbers and $ n_1, n_2, \dots, n_r $ being positive…

Information Theory · Computer Science 2025-03-06 Apurba Sarkar , Kalyan Hansda , Makhan Maji

Various properties of a class of braid matrices, presented before, are studied considering $N^2 \times N^2 (N=3,4,...)$ vector representations for two subclasses. For $q=1$ the matrices are nontrivial. Triangularity $(\hat R^2 =I)$…

Quantum Algebra · Mathematics 2009-11-10 A. Chakrabarti

Let $q>r\ge1$ be coprime integers. Let $R(n,q,r)$ be the $n$th record gap between primes in the arithmetic progression $r$, $r+q$, $r+2q,\ldots,$ and denote by $N_{q,r}(x)$ the number of such records observed below $x$. For $x\to\infty$, we…

Number Theory · Mathematics 2018-02-27 Alexei Kourbatov

A general result by Jackson (Flat algebras and the translation of universal Horn logic to equational logic, J. Symb. Log. 73(1) (2008) 90--128) implies that the lattice of all quasivarieties of groups of exponent dividing $n$ embeds into…

Group Theory · Mathematics 2025-07-15 Miaomiao Ren , Xianzhong Zhao , Mikhail V. Volkov

Let $S$ be a nonempty set of vertices of a connected graph $G$. A collection $T_1,..., T_\ell$ of trees in $G$ is said to be internally disjoint trees connecting $S$ if $E(T_i)\cap E(T_j)= \emptyset$ and $V(T_i)\cap V(T_j)=S$ for any pair…

Combinatorics · Mathematics 2012-01-17 Hengzhe Li , Xueliang Li , Yaping Mao , Yuefang Sun

Let $n(k_1, k_2)$ be the least integer $n$ such that there exists a graph on $n$ vertices in which every vertex is contained in both a clique of size $k_1$ and an independent set of size $k_2$. Recently, Feige and Pauzner showed that ${n(k,…

Combinatorics · Mathematics 2026-04-24 Veronica Bitonti , Emma Hogan , Tommy Walker Mackay

We prove an $L^2\times L^2\to L^q_tL^r_x$ bilinear adjoint Fourier restriction estimate for $n$-dimensional elliptic paraboloids, with $n\ge 2$ and $1\le q \le \infty$, $1\le r\le 2$ being on the endline…

Analysis of PDEs · Mathematics 2022-05-24 Jianwei Urbain Yang

For an interconnection network $G$, the {\it $\omega$-wide diameter} $d_\omega(G)$ is the least $\ell$ such that any two vertices are joined by $\omega$ internally-disjoint paths of length at most $\ell$, and the {\it $(\omega-1)$-fault…

Discrete Mathematics · Computer Science 2016-06-21 Meijie Ma , Douglas B. West , Jun-Ming Xu

In this work we show that given a connectivity graph $G$ of a $[[n,k,d]]$ quantum code, there exists $\{K_i\}_i, K_i \subset G$, such that $\sum_i |K_i|\in \Omega(k), \ |K_i| \in \Omega(d)$, and the $K_i$'s are $\tilde{\Omega}(…

Information Theory · Computer Science 2023-09-29 Nouédyn Baspin

New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…

Combinatorics · Mathematics 2016-11-22 Bernardo Abrego , Silvia Fernandez-Merchant , Daniel J. Katz , Levon Kolesnikov

Error-correcting codes resilient to synchronization errors such as insertions and deletions are known as insdel codes. Due to their important applications in DNA storage and computational biology, insdel codes have recently become a focal…

Combinatorics · Mathematics 2024-08-21 Xiangliang Kong , Itzhak Tamo , Hengjia Wei

The no-(k+1)-in line problem seeks the maximum number of points that can be selected from an $n \times n$ square lattice such that no $k+1$ of them are collinear. The problem was first posed more than $100$ years ago for the special case…

Combinatorics · Mathematics 2025-08-12 Benedek Kovács , Zoltán Lóránt Nagy , Dávid R. Szabó

The set of isotopy classes of ordered n-component links in the 3-sphere is acted on by the symmetric group via permutation of the components. The intrinsic symmetry group of the link, S(L), is defined to be the set of elements in the…

Geometric Topology · Mathematics 2023-08-02 Charles Livingston

An important geometric invariant of links in lens spaces is the lift in the 3-sphere of a link $L$ in $L(p,q)$, that is the counterimage $\widetilde L$ of $L$ under the universal covering of $L(p,q)$. If lens spaces are defined as a lens…

Geometric Topology · Mathematics 2013-12-05 Enrico Manfredi

We consider certain subsets of the space of $n\times n$ matrices of the form $K = \cup_{i=1}^m SO(n)A_i$, and we prove that for $p>1, q \geq 1$ and for connected $\Omega'\subset\subset\Omega\subset \R^n$, there exists positive constant…

Classical Analysis and ODEs · Mathematics 2008-02-07 Robert L. Jerrard , Andrew Lorent

We introduce new sufficient conditions for intrinsic knotting and linking. A graph on n vertices with at least 4n-9 edges is intrinsically linked. A graph on n vertices with at least 5n-14 edges is intrinsically knotted. We also classify…

Geometric Topology · Mathematics 2007-05-23 J. Campbell , T. W. Mattman , R. Ottman , J. Pyzer , M. Rodrigues , S. Williams

We show that with high probability the random graph $G_{n, 1/2}$ has an induced subgraph of linear size, all of whose degrees are congruent to $r\pmod q$ for any fixed $r$ and $q\geq 2$. More generally, the same is true for any fixed…

Combinatorics · Mathematics 2021-07-16 Asaf Ferber , Liam Hardiman , Michael Krivelevich