Related papers: Constructing a polynomial whose nodal set is any p…

We present an algorithm that takes as input any element $B$ of the loop braid group and constructs a polynomial $f:\mathbb{R}^5\to\mathbb{R}^2$ such that the intersection of the vanishing set of $f$ and the unit 4-sphere contains the…

We describe a procedure that creates an explicit complex-valued polynomial function of three-dimensional space, whose nodal lines are the three-twist knot $5_2$. The construction generalizes a similar approach for lemniscate knots: a braid…

Semiholomorphic polynomials are functions $f:\mathbb{C}^2\to\mathbb{C}$ that can be written as polynomials in complex variables $u$, $v$ and the complex conjugate $\overline{v}$. We prove the semiholomorphic analogoue of Akbulut's and…

For an arbitrary finite set S of natural numbers greater 1, we construct an integer-valued polynomial f, whose set of lengths in Int(Z) is S. The set of lengths of f is the set of all natural numbers n, such that f has a factorization as a…

We show that if a braid $B$ can be parametrised in a certain way, then previous work can be extended to a construction of a polynomial $f:\mathbb{R}^4\to\mathbb{R}^2$ with the closure of $B$ as the link of an isolated singularity of $f$,…

We show that the problem of constructing a real rational knot of a reasonably low degree can be reduced to an algebraic problem involving the pure braid group: expressing an associated element of the pure braid group in terms of the…

We study multivariate polynomials over `structured' grids. We begin by proposing an interpretation as to what it means for a finite subset of a field to be structured; we do so by means of a numerical parameter, the nullity. We then extend…

We construct certain monoids, called tied monoids. These monoids result to be semidirect products finitely presented and commonly built from braid groups and their relatives acting on monoids of set partitions. The nature of our monoids…

We construct a simply connected $2-$complex $C$ embeddable in $3-$space such that for any embedding of $C$ in $\mathbb S^3$, any edge contraction forms a minor of the $2-$complex not embeddable in $3-$space. We achieve this by proving that…

A geometric braid $B$ can be interpreted as a loop in the space of monic complex polynomials with distinct roots. This loop defines a function $g:\mathbb{C}\times S^1\to\mathbb{C}$ that vanishes on $B$. We define the set of P-fibered braids…

Let $g_t$ be a loop in the space of monic complex polynomials in one variable of fixed degree $n$. If the roots of $g_t$ are distinct for all $t$, they form a braid $B_1$ on $n$ strands. Likewise, if the critical points of $g_t$ are…

Let $\mathcal S$ be a set of monic degree $2$ polynomials over a finite field and let $C$ be the compositional semigroup generated by $\mathcal S$. In this paper we establish a necessary and sufficient condition for $C$ to be consisting…

For a given knot $K$ and $w>0$, we construct infinitely many mutually distinct hyperbolic knots $\{K_i\}$ such that the $P$-satellites of $K$ and $K_i$ have the same HOMFLY polynomial up to given $z$-degrees, for all braided patterns $P$…

An explicit family of polynomials on the unit ball $B^d$ of $\RR^d$ is constructed, so that it is an orthonormal family with respect to the inner product $$ < f,g > = \rho \int_{B^d}\nabla f(x)\cdot \nabla g(x) dx + \CL (fg), $$ where $\rho…

Consider a semi-algebraic set A in R^d constructed from the sets which are determined by inequalities p_i(x)>0, p_i(x)\ge 0, or p_i(x)=0 for a given list of polynomials p_1,...,p_m. We prove several statements that fit into the following…

A graph class $\mathcal{C}$ has polynomial expansion if there is a polynomial function $f$ such that for every graph $G\in \mathcal{C}$, each of the depth-$r$ minors of $G$ has average degree at most $f(r)$. In this note, we study…

Let $V$ be a vector space over a finite field $k$. We give a condition on a subset $A \subset V$ that allows for a local criterion for checking when a function $f:A \to k$ is a restriction of a polynomial function of degree $<m$ on $V$. In…

A bracket polynomial on the integers is a function formed using the operations of addition, multiplication and taking fractional parts. For a fairly large class of bracket polynomials we show that if p is a bracket polynomial of degree k-1…

For every graph $H$, there exists a polynomial-time algorithm deciding if a planar input graph $G$ can be contracted to~$H$. However, the degree of the polynomial depends on the size of $H$. In this paper, we identify a class of graphs…

We present a method of constructing monoidal, braided monoidal, and symmetric monoidal bicategories from corresponding types of monoidal double categories that satisfy a lifting condition. Many important monoidal bicategories arise…