Related papers: Computable bounds for Rasmussen's concordance inva…
A (t,s)-rack is a rack structure defined on a module over the ring $\ddot\Lambda=\mathbb{Z}[t^{\pm 1},s]/(s^2-(1-t)s)$. We identify necessary and sufficient conditions for two $(t,s)$-racks to be isomorphic. We define enhancements of the…
This work establishes combinatorial bounds on the Castelnuovo-Mumford regularity of edge ideals for trees and their multi-whiskered variants. For a tree \( T \), we give bounds for the Castelnuovo-Mumford regularity of \( I(T) \) in terms…
Simple closed curves in the plane can be mapped to nontrivial knots under the action of origami foldings that allow the paper to self-intersect. We show all tame knot types may be produced in this manner, motivating the development of a new…
We construct invariants for any closed semipositive symplectic manifold which count rational curves satisfying tangency constraints to a local divisor. More generally, we introduce invariants involving multibranched local tangency…
We note an adjunction inequality in $k\overline{\mathbb{CP}^2}$ for the $s$-version of the $Sq^1$-refinement of Rasmussen's $s$-invariant. This does not hold for general spatial refinements of $s$-invariants.
Let $\phi : S^1\times D^2\to S^1$ be the natural projection. An oriented knot $K\hookrightarrow V = S^1\times D^2$ is called an almost closed braid if the restriction of $\phi$ to K has exactly two (non-degenerate) critical points (and K is…
This paper is expository and is accessible to students. We define simple invariants of knots or links (linking number, Arf-Casson invariants and Alexander-Conway polynomials) motivated by interesting results whose statements are accessible…
By combining the Minkowski inequality and the quantum Chernoff bound, we derive easy-to-compute upper bounds for the error probability affecting the optimal discrimination of Gaussian states. In particular, these bounds are useful when the…
We show that the problem of deciding for a given finite relation algebra A whether the network satisfaction problem for A can be solved by the k-consistency procedure, for some natural number k, is undecidable. For the important class of…
We analyze different aspects of neural network predictions of knot invariants. First, we investigate the impact of different knot representations on the prediction of invariants and find that braid representations work in general the best.…
An invariant random subgroup of the countable group {\Gamma} is a random subgroup of {\Gamma} whose distribution is invariant under conjugation by all elements of {\Gamma}. We prove that for a nonamenable invariant random subgroup H, the…
Given a closed four-manifold $X$ with an indefinite intersection form, we consider smoothly embedded surfaces in $X \setminus $int$(B^4)$, with boundary a knot $K \subset S^3$. We give several methods to bound the genus of such surfaces in…
We construct smooth concordance invariants of knots which take the form of piecewise linear maps from [0,1] to R, one for each n greater than or equal to 2. These invariants arise from sl(n) knot cohomology. We verify some properties which…
Chern-Simons gauge theory for compact semisimple groups is analyzed from a perturbation theory point of view. The general form of the perturbative series expansion of a Wilson line is presented in terms of the Casimir operators of the gauge…
Computer-based attempts to construct lower bounds for small Ramsey numbers are discussed. A systematic review of cyclic Ramsey graphs is attempted. Many known lower bounds are reproduced. Several new bounds are reported.
By considering a version of Khovanov homology incorporating both the Lee and $E(-1)$ differentials, we construct a $1$-parameter family of concordance homomorphisms similar to the Upsilon invariant from knot Floer homology. This invariant…
In this note, we prove a lower bound for the positive kinkiness of a closed braid which we then use to derive an estimate for the positive kinkiness of a link in terms of its Seifert system. As an application, we show that certain pretzel…
The crosscap number of a knot is an invariant describing the non-orientable surface of smallest genus that the knot bounds. Unlike knot genus (its orientable counterpart), crosscap numbers are difficult to compute and no general algorithm…
A semi-computable set S in a computable metric space need not be computable. However, in some cases, if S has certain topological properties, we can conclude that S is computable. It is known that if a semi-computable set S is a compact…
We construct many examples of non-slice knots in 3-space that cannot be distinguished from slice knots by previously known invariants. Using Whitney towers in place of embedded disks, we define a geometric filtration of the 3-dimensional…