Results 41 to 50 of about 1,321,651 (326)

Crossing numbers of composite knots and spatial graphs [PDF]

open access: yes, 2018
We study the minimal crossing number $c(K_{1}\# K_{2})$ of composite knots $K_{1}\# K_{2}$, where $K_1$ and $K_2$ are prime, by relating it to the minimal crossing number of spatial graphs, in particular the $2n$-theta curve $\theta_{K_{1},K_{2}}^n$ that
Bode, Benjamin
core   +3 more sources

The Crossing Numbers of Join Products of Paths and Cycles with Four Graphs of Order Five

open access: yesMathematics, 2021
The main aim of the paper is to establish the crossing numbers of the join products of the paths and the cycles on n vertices with a connected graph on five vertices isomorphic to the graph K1,1,3\e obtained by removing one edge e incident with some ...
Michal Staš
doaj   +1 more source

On the Degenerate Crossing Number [PDF]

open access: yesDiscrete & Computational Geometry, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ackerman, Eyal, Pinchasi, Rom
openaire   +2 more sources

Immersed disks, slicing numbers and concordance unknotting numbers [PDF]

open access: yes, 2015
We study three knot invariants related to smoothly immersed disks in the four-ball. These are the four-ball crossing number, which is the minimal number of normal double points of such a disk bounded by a given knot; the slicing number, which is the ...
Owens, Brendan, Strle, Saso
core   +3 more sources

Parity Properties of Configurations

open access: yesMathematics, 2022
In the paper, the crossing number of the join product G*+Dn for the disconnected graph G* consisting of two components isomorphic to K2 and K3 is given, where Dn consists of n isolated vertices.
Michal Staš
doaj   +1 more source

Improvement on the Crossing Number of Crossing-Critical Graphs [PDF]

open access: yesDiscrete & Computational Geometry, 2020
AbstractThe crossing number of a graph G is the minimum number of edge crossings over all drawings of G in the plane. A graph G is k-crossing-critical if its crossing number is at least k, but if we remove any edge of G, its crossing number drops below k.
János Barát, Géza Tóth
openaire   +5 more sources

Anomalous fermion number nonconservation: Paradoxes in the level crossing picture [PDF]

open access: yes, 2006
In theories with anomalous fermion number nonconservation, the level crossing picture is considered a faithful representation of the fermionic quantum number variation.
Burnier, Yannis
core   +2 more sources

N-flation: Non-Gaussianity in the horizon-crossing approximation [PDF]

open access: yes, 2006
We analyze the cosmic non-gaussianity produced in inflation models with multiple uncoupled fields with monomial potentials, such as Nflation. Using the horizon-crossing approximation to compute the non-gaussianity, we show that when each field has the ...
Kim, Soo A, Liddle, Andrew R
core   +2 more sources

Triple crossing number and double crossing braid index [PDF]

open access: yesJournal of Knot Theory and Its Ramifications, 2019
Traditionally, knot theorists have considered projections of knots where there are two strands meeting at every crossing. A triple crossing is a crossing where three strands meet at a single point, such that each strand bisects the crossing. In this paper we find a relationship between the triple crossing number and the double crossing braid index for
openaire   +3 more sources

Monotone Crossing Number [PDF]

open access: yes, 2012
The monotone crossing number of G is defined as the smallest number of crossing points in a drawing of G in the plane, where every edge is represented by an x-monotone curve, that is, by a connected continuous arc with the property that every vertical line intersects it in at most one point.
János Pach, Géza Tóth
openaire   +1 more source

Home - About - Disclaimer - Privacy