Related papers: Semi-Adequate Closed Braids and Volume

A theorem of Scott gives an upper bound for the normalized volume of lattice polygons with exactly $i>0$ interior lattice points. We will show that the same bound is true for the normalized volume of lattice polytopes of degree 2 even in…

In this paper, we study the asymptotic behavior of the colored Jones polynomials evaluated at roots of unity for a special class of knots. We show that certain limit is zero as predicted by the volume conjecture.

We study the minimal dilatation of pseudo-Anosov pure surface braids and provide upper and lower bounds as a function of genus and the number of punctures. For a fixed number of punctures, these bounds tend to infinity as the genus does. We…

For a positive braid $\beta \in \mathrm{Br}^{+}_{k}$, we consider the braid variety $X(\beta)$. We define a family of open sets $\mathcal{U}_{r, w}$ in $X(\beta)$, where $w \in S_k$ is a permutation and $r$ is a positive integer no greater…

We estimate from above the set of knots, $\Omega(n,\mu)$, generated by closure of n-string 1+1- and 2+1-dimensional braids of irreducible length $\mu$ ($\mu>>1$) in the limit n>>1.

Bounded infinite graphs are defined on the basis of natural physical requirements. When specialized to trees this definition leads to a natural conjecture that the average connectivity dimension of bounded trees cannot exceed two. We verify…

We study gapped boundaries of Abelian type-I fracton systems in three spatial dimensions. Using the X-cube model as our motivating example, we give a conjecture, with partial proof, of the conditions for a boundary to be gapped. In order to…

We provide the optimal linear bound for the signature of positive four-braids in terms of the three-genus of their closures. As a consequence, we improve previously known linear bounds for the signature in terms of the first Betti number…

Building on and from the work of Brydges and Imbrie, we give an elementary calculation of the volume of the space of branched polymers of order $n$ in the plane and in 3-space. Our development reveals some more general identities, and…

We give an algorithm to decide whether a given braid with four strings is a product of three factors which are conjugates of standard generators of the braid group. The algorithm is of polynomial time. It is based on the Garside theory. We…

In this paper we present a new bound obtained with the probabilistic method for the solution of the Set Covering problem with unit costs. The bound is valid for problems of fixed dimension, thus extending previous similar asymptotic…

Folded Reed-Solomon (FRS) and univariate multiplicity codes are prominent polynomial codes over finite fields, renowned for achieving list decoding capacity. These codes have found a wide range of applications beyond the traditional scope…

We formulate and prove a profinite rigidity theorem for the twisted Alexander polynomials up to several types of finite ambiguity. We also establish torsion growth formulas of the twisted homology groups in a $\mathbb{Z}$-cover of a…

Recently, Gilmer proved the first constant lower bound for the union-closed sets conjecture via an information-theoretic argument. The heart of the argument is an entropic inequality involving the OR function of two i.i.d.\ binary vectors,…

Gy\'arf\'as and Sumner independently conjectured that for every tree $T$, the class of graphs not containing $T$ as an induced subgraph is $\chi$-bounded, that is, the chromatic numbers of graphs in this class are bounded above by a…

We consider the problem of finding an inductive construction, based on vertex splitting, of triangulated spheres with a fixed number of additional edges (braces). We show that for any positive integer $b$ there is such an inductive…

In this paper we generalize the main result of [4] for manifolds that are not necessarily Einstein. In fact, we obtain an upper bound for the volume of a locally volume-minimizing closed hypersurface $\Sigma$ of a Riemannian 5-manifold $M$…

Bounds on turbulent averages in shear flows can be derived from the Navier--Stokes equations by a mathematical approach called the background method. Bounds that are optimal within this method can be computed at each Reynolds number Re by…

We analyse how the standard reductions between constraint satisfaction problems affect their proof complexity. We show that, for the most studied propositional, algebraic, and semi-algebraic proof systems, the classical constructions of…

Let $r=r(n)$ be a sequence of integers such that $r\leq n$ and let $X_1,\ldots,X_{r+1}$ be independent random points distributed according to the Gaussian, the Beta or the spherical distribution on $\mathbb{R}^n$. Limit theorems for the…