Related papers: Constructing a polynomial whose nodal set is any p…
The notion of a braided chord diagram is introduced and studied. An equivalence relation is given which identifies all braidings of a fixed chord diagram. It is shown that finite-type invariants are stratified by braid index for knots which…
We consider a class of optimization problems that involve determining the maximum value that a function in a particular class can attain subject to a collection of difference constraints. We show that a particular linear programming…
The relationships between braid ordering and the geometry of its closure is studied. We prove that if an essential closed surface $F$ in the complements of closed braid has relatively small genus with respect to the Dehornoy floor of the…
The definition of principal nest is supplemented with a system of frames that make possible the classification of combinatorial types for every level of the nest. As a consequence, we give necessary and sufficient conditions for the…
A special class of braids, called woven, is introduced and it is shown that every conjugation class of the braid group contains woven braids. In consequence, links can be presented as plats or closures of woven braids. Restricting on knots,…
In this article, we construct explicit examples of pairs of non-isomorphic trees with the same restricted $U$-polynomial for every $k$; by this we mean that the polynomials agree on terms with degree at most $k+1$. The main tool for this…
We review the polynomial parameterization of classical knots and prove the analogous results for long $2$ knots. We also construct polynomial parameterizations for certain classes of knotted spheres (such as spun and twist spun of the…
We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…
We characterize the representations of the fundamental group of a closed surface to $\mathrm{PSL}_2(\mathbb C)$ that arise as the holonomy of a branched complex projective structure with fixed branch divisor. In particular, we compute the…
Dallard, Milani\v{c}, and \v{S}torgel conjectured that for a hereditary graph class $\mathcal{G}$, if there is some function $f:\mathbb{N}\to\mathbb{N}$ such that every graph $G\in \mathcal{G}$ with clique number $\omega(G)$ has treewidth…
We introduce a new numerical knot invariant, termed the \textit{segment number}, which is derived from partitioned knot diagrams subject to specific over/under-crossing constraints. We prove that a knot is non-trivial if and only if its…
We begin with a brief sketch of what is known and conjectured concerning braided monoidal 2-categories and their applications to 4d topological quantum field theories and 2-tangles (surfaces embedded in 4-dimensional space). Then we give…
The functional decomposition of polynomials has been a topic of great interest and importance in pure and computer algebra and their applications. The structure of compositions of (suitably normalized) polynomials f=g(h) over finite fields…
The motivation of this work stems from the numerical approximation of bounded functions by polynomials satisfying the same bounds. The present contribution makes use of the recent algebraic characterization found in [B. Despr\'es, Numer.…
The A-polynomial of a knot is defined in terms of SL(2,C) representations of the knot group, and encodes information about essential surfaces in the knot complement. In 2005, Dunfield-Garoufalidis and Boyer-Zhang proved that it detects the…
The set consisting of all rotations of the Euclidean plane is equipped with a quandle structure. We show that a knot is colorable by this quandle if and only if its Alexander polynomial has a root on the unit circle in $\mathbb{C}$. Further…
We present a systematic classification of uncolored bonded knots with singularity number at most seven. Bonded knots provide a topological model for closed protein chains with intramolecular bridges, such as disulfide bonds. Following the…
We give a simple and practical algorithm to compute the link polynomials, which are defined according to the skein relations. Our method is based on a new total order on the set of all braid representatives. As by-product a new complete…
We detail a simple procedure (easily convertible to an algorithm) for constructing from quasi-uniform samples of $f$ a sequence of linear spline functions converging to the monotone rearrangement of $f$, in the case where $f$ is an almost…
For a set $S$ of quadratic polynomials over a finite field, let $C$ be the (infinite) set of arbitrary compositions of elements in $S$. In this paper we show that there are examples with arbitrarily large $S$ such that every polynomial in…