Related papers: Semi-Adequate Closed Braids and Volume
We define a monoid structure on the set of $k$-equal arrangements and use this structure to define limits of braid arrangements. We compute the cohomology of the associated limits of rational models of the arrangements complex complements.…
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…
Covering numbers are a powerful tool used in the development of approximation algorithms, randomized dimension reduction methods, smoothed complexity analysis, and others. In this paper we prove upper bounds on the covering number of…
We provide combinatorial and numerical criteria to characterize affine type A bow diagrams giving rise to a non-empty bow variety. The key idea is to prove that such diagrams correspond to supersymmetric brane systems in type IIB string…
We study simple branched coverings of degree d of the 2- and 3- dimensional sphere branched over oriented links. We demonstrate how to use braid charts to develop embeddings of these into $S^k \times D^2$ for $k=2,3 when $d=2,3$. This is an…
In Guts, Volume and Skein Modules of 3-Manifolds (arXiv:2010.06559), we showed that the twist number of certain hyperbolic weakly generalized alternating links can be recovered from a Jones-like polynomial, and offers a lower bound for the…
Random instances of Constraint Satisfaction Problems (CSP's) appear to be hard for all known algorithms, when the number of constraints per variable lies in a certain interval. Contributing to the general understanding of the structure of…
Let V be a normal affine variety over the real numbers R, and let S be a semi-algebraic subset of V(R). We study the subring B(S) of the coordinate ring of V consisting of the polynomials that are bounded on S. We introduce the notion of…
We study the distribution of arithmetic invariants associated to Alexander polynomials for certain infinite families of links. The families of links we consider arise from braids on a fixed number of strings. We explore analogies with…
Given a diagram D of a knot K, we give easily computable bounds for Rasmussen's concordance invariant s(K). The bounds are not independent of the diagram D chosen, but we show that for diagrams satisfying a given condition the bounds are…
A polyhedron in a three-dimensional hyperbolic space is said to be generalized if finite, ideal and truncated vertices are admitted. In virtue of Belletti's theorem (2021) the exact upper bound for volumes of generalized hyperbolic…
We prove that the tree-width of graphs in a hereditary class defined by a finite set $F$ of forbidden induced subgraphs is bounded if and only if $F$ includes a complete graph, a complete bipartite graph, a tripod (a forest in which every…
We give an upper bound for the dealternating number of a closed 3-braid. As applications, we determine the dealternating numbers, the alternation numbers and the Turaev genera of some closed positive 3-braids. We also show that there exist…
Fix a sequence c=(c_1,...,c_n) of non-negative integers with sum n-1. We say a rooted tree T has child sequence c if it is possible to order the nodes of T as v_1,...,v_n so that for each 1 <= i <= n, v_i has exactly c_i children. Let T be…
The contents of this 6-page paper have been subsumed into the 13-page paper, "A note on closed 3-braids", arXiv:0802.1072 [math.GT]. This paper is correct, but contains less information than the new one. The topological classification of…
The hyperbolic volume of a link complement is known to be unchanged when a half-twist is added to a link diagram, and a suitable 3-punctured sphere is present in the complement. We generalize this to the simplicial volume of link…
In this paper, we generalize the chance optimization problems and introduce constrained volume optimization where enables us to obtain convex formulation for challenging problems in systems and control. We show that many different problems…
The Helon model identifies Standard Model quarks and leptons with certain framed braids joined together at both ends by a connecting node (disk). These surfaces with boundary are called braided 3-belts (or simply belts). Twisting and…
It is known that any planar graph with diameter D has treewidth O(D), and this fact has been used as the basis for several planar graph algorithms. We investigate the extent to which similar relations hold in other graph families. We show…
We study the power of the bounded-width consistency algorithm in the context of the fixed-template Promise Constraint Satisfaction Problem (PCSP). Our main technical finding is that the template of every PCSP that is solvable in bounded…