Related papers: Semi-Adequate Closed Braids and Volume
Cliquewidth is a dense analogue of treewidth. It can be deduced from recent results by Hickingbotham [arXiv:2501.10840] and Nguyen, Scott, and Seymour [arXiv:2501.09839] that graphs of bounded cliquewidth are quasi-isometric to graphs of…
In this paper, we study the generalized volume conjecture for the colored Jones polynomials of links with complements containing more than one hyperbolic piece. First of all, we construct an infinite family of prime links by considering the…
In the degree-diameter problem for Abelian Cayley and circulant graphs of diameter 2 and arbitrary degree d there is a wide gap between the best lower and upper bounds valid for all d, being quadratic functions with leading coefficient 1/4…
The Torsion Anomalous Conjecture states that an irreducible variety $V$ embedded in a semi-abelian variety contains only finitely many maximal $V$-torsion anomalous varieties. In this paper we consider an irreducible variety embedded in a…
The dilatation of a pseudo-Anosov braid is a conjugacy invariant. In this paper, we study the dilatation of a special family of pseudo-Anosov braids. We prove an inductive formula to compute their dilatation, a monotonicity and an…
Polyhedral-type approximations of convex-like domains in $\mathbb{C}^d$ have been considered recently by the second author. In particular, the decay rate of the error in optimal volume approximation as a function of the number of facets has…
We continue the study of freely braided elements of simply laced Coxeter groups, which we introduced in a previous work (math.CO/0301104). A known upper bound for the number of commutation classes of reduced expressions for an element of a…
A proof for the lower bound is provided for the smallest eigenvalue of finite element equations with arbitrary conforming simplicial meshes. The bound has a similar form as the one by Graham and McLean [SIAM J. Numer. Anal., 44 (2006), pp.…
A ribbon is a two-dimensional object with one-dimensional properties which is related with geometry, robotics and molecular biology. A folded ribbon structure provides a complex structure through a series of folds. We focus on a folded…
We study Riemannian manifolds with boundary under a lower Ricci curvature bound, and a lower mean curvature bound for the boundary. We prove a volume comparison theorem of Bishop-Gromov type concerning the volumes of the metric…
We generalize the construction of connected branched polymers and the notion of the volume of the space of connected branched polymers studied by Brydges and Imbrie, and Kenyon and Winkler to any hyperplane arrangement A. The volume of the…
The union-closed sets conjecture states that in any nonempty union-closed family $\mathcal{F}$ of subsets of a finite set, there exists an element contained in at least a proportion $1/2$ of the sets of $\mathcal{F}$. Using the…
Let $N$ be a compact, orientable hyperbolic 3-manifold whose boundary is a connected totally geodesic surface of genus $2$. If $N$ has Heegaard genus at least $5$, then its volume is greater than $2V_{\rm oct}$, where $V_{\rm…
For finite reflection groups of types A and B, we determine the diameter of the graph whose vertices are reduced words for the longest element and whose edges are braid relations. This is deduced from a more general theorem that applies to…
We formulate a generalization of the volume conjecture for planar graphs. Denoting by <G, c> the Kauffman bracket of the graph G whose edges are decorated by real "colors" c, the conjecture states that, under suitable conditions, certain…
We construct a quasi-polynomial time deterministic approximation algorithm for computing the volume of an independent set polytope with restrictions. Randomized polynomial time approximation algorithms for computing the volume of a convex…
A conjecture of Freiman gives an exact formula for the largest volume of a finite set $A$ of integers with given cardinality $k = |A|$ and doubling $T = |2A|$. The formula is known to hold when $T \le 3k-4$, for some small range over $3k-4$…
In the course of classifying generic sparse polynomial systems which are solvable in radicals, Esterov recently showed that the volume of the Minkowski sum $P_1+\dots+P_d$ of $d$-dimensional lattice polytopes is bounded from above by a…
This paper investigates the a-posteriori analysis of Branch-and-Bound~(BB) trees to extract structural information about the feasible region of mixed-binary linear programs. We introduce three novel outer approximations of the feasible…
An $n$-dimensional algebraic variety in $({\mathbb C}^\times)^{2n}$ covers its amoeba as well as its coamoeba generically finite-to-one. We provide an upper bound for the volume of these amoebas as well as for the number of points in the…