Related papers: The computational complexity of the solid torus co…
The strong geodetic problem on a graph $G$ is to determine a smallest set of vertices such that by fixing one shortest path between each pair of its vertices, all vertices of $G$ are covered. To do this as efficiently as possible, strong…
The concept of k-core, which indicates the largest induced subgraph where each node has k or more neighbors, plays a significant role in measuring the cohesiveness and the engagement of a network, and it is exploited in diverse…
Knot concordance plays a crucial role in the low dimensional topology. We propose a very elementary techniques which allows one to construct a lot of sliceness obstructions for knots in the full torus. Our approach deals with group…
Interpreting three-leaf binary trees or {\em rooted triples} as constraints yields an entailment relation, whereby binary trees satisfying some rooted triples must also thus satisfy others, and thence a closure operator, which is known to…
The impressive results of modern neural networks partly come from their non linear behaviour. Unfortunately, this property makes it very difficult to apply formal verification tools, even if we restrict ourselves to networks with a…
Neural networks with ReLU activation play a key role in modern machine learning. Understanding the functions represented by ReLU networks is a major topic in current research as this enables a better interpretability of learning processes.…
A slope $p/q$ is a characterizing slope for a knot $K$ in $S^3$ if the oriented homeomorphism type of $p/q$-surgery on $K$ determines $K$ uniquely. We show that for each torus knot its set of characterizing slopes contains all but finitely…
This project explores the mathematical study of knots and links in topology, focusing on differentiating between the two-component Unlink and the Hopf Link using a computational tool named LINKAGE. LINKAGE employs the linking number,…
In the spanning-tree congestion problem ($\mathsf{STC}$), we are given a graph $G$, and the objective is to compute a spanning tree of $G$ that minimizes the maximum edge congestion. While $\mathsf{STC}$ is known to be $\mathbb{NP}$-hard,…
Finding the dense regions of a graph and relations among them is a fundamental problem in network analysis. Core and truss decompositions reveal dense subgraphs with hierarchical relations. The incremental nature of algorithms for computing…
Torus knots are an important family of knots about which much is understood; invariants of torus knots often exhibit nice formulas, making them convenient and fundamental building blocks for examples in knot theory. Spiral knots, defined…
Let $S$ and $D$ each be a set of orthogonal line segments in the plane. A line segment $s\in S$ \emph{stabs} a line segment $s'\in D$ if $s\cap s'\neq\emptyset$. It is known that the problem of stabbing the line segments in $D$ with the…
A knot in a solid torus defines a map on the set of (smooth or topological) concordance classes of knots in $S^3$. This set admits a group structure, but a conjecture of Hedden suggests that satellite maps never induce interesting…
The Picker Routing Problem (PRP), which consists of finding a minimum-length tour between a set of storage locations in a warehouse, is one of the most important problems in the warehousing logistics literature. Despite its popularity, the…
Using computational techniques we tabulate prime knots up to five crossings in the solid torus and the infinite family of lens spaces $L(p,q)$. For these knots we calculate the second and third skein module and establish which prime knots…
A simple convex polytope $P$ is \emph{cohomologically rigid} if its combinatorial structure is determined by the cohomology ring of a quasitoric manifold over $P$. Not every $P$ has this property, but some important polytopes such as…
We compute the invariants for a class of knots and links in arbitrary representations in $S^3/\mathbb{Z}_p$ in the large $k$ (level), large $N$ (rank) limit, keeping $N/(k+N)=\lambda$ fixed, in $U(N)$ and $Sp(N)$ Chern-Simons theories.…
We answer a question posed by Fielder in [1] concerning two notions of crossing number for algebraic knots $K$ under Hopf fibration, one topological, denoted $h(K)$, the other coming from the realization of such knots around complex…
Bhawalkar, Kleinberg, Lewi, Roughgarden, and Sharma [ICALP 2012] introduced the Anchored k-Core problem, where the task is for a given graph G and integers b, k, and p to find an induced subgraph H with at least p vertices (the core) such…
We give an elementary proof of a somewhat curious result, namely, that deciding whether a convex function is self-concordant is in general an intractable problem.