Related papers: Combinatorial distance between braid words
We obtain a Burgess-type bound for character sums over unions of intervals. The result follows from the argument of Heath-Brown, with an improvement in one of the steps.
We show the existence of rigid combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, $t$-designs, and $t$-wise…
We introduce a family of automorphisms on the bosonic extension of arbitrary type and show that they satisfy the braid relations. They preserve the global basis and the crystal basis. Using this braid group action, we define a subalgebra…
A near-group category is an additively semisimple category with a product such that all but one of the simple objects is invertible. We classify braided structures on near-group categories, and give explicit numerical formulas for their…
A knotted ribbon is one of physical aspect of a knot. A folded ribbon knot is a depiction of a knot obtained by folding a long and thin rectangular strip to become flat. The ribbonlength of a knot type can be defined as the minimum length…
We give asymptotically sharp upper bounds for the Khovanov width and the dealternation number of positive braid links, in terms of their crossing number. The same braid-theoretic technique, combined with Ozsv\'ath, Stipsicz, and Szab\'o's…
We derive a lower bound for all Levine-Tristram signatures of positive braid links, linear in terms of the first Betti number. As a consequence, we obtain upper and lower bounds on the ratio of fixed pairs of Levine-Tristram signature…
Let \({\mathbb K}\) be any field, let \(X\subset {\mathbb P}^{k-1}\) be a set of \(n\) distinct \({\mathbb K}\)-rational points, and let \(a\geq 1\) be an integer. In this paper we find lower bounds for the minimum distance \(d(X)_a\) of…
We compare two crossed homomorphisms on a braid group, one defined diagrammatically and the other defined algebraically. We show that these crossed homomorphisms are essentially the same, and compute them in detail for simple braids, namely…
We consider the number of occurrences of subwords (non-consecutive sub-sequences) in a given word. We first define the notion of subword entropy of a given word that measures the maximal number of occurrences among all possible subwords. We…
Using the Huynh and Le quantum determinant description of the colored Jones polynomial, we construct a new combinatorial description of the colored Jones polynomial in terms of walks along a braid. We then use this description to show that…
We introduce the classes of descendingly flexible and descendingly alternative algebras over an arbitrary field $\mathbb{F}$. We suggest a new method based on the sequence of differences between the dimensions of the linear spans of words,…
Recently, B\'{e}nyi and the second author introduced two combinatorial interpretations for symmetrized poly-Bernoulli polynomials. In the present study, we construct bijections between these combinatorial objects. We also define various…
In this note, we give an alternate proof of the multinomial theorem using a probabilistic approach. Although the multinomial theorem is basically a combinatorial result, our proof may be simpler for a student familiar with only basic…
We characterise positive braid links with positive Seifert form via a finite number of forbidden minors. From this we deduce a one-to-one correspondence between prime positive braid links with positive Seifert form and simply laced Dynkin…
Subject-verb agreement in the presence of an attractor noun located between the main noun and the verb elicits complex behavior: judgments of grammaticality are modulated by the grammatical features of the attractor. For example, in the…
A new presentation of the $n$-string braid group $B_n$ is studied. Using it, a new solution to the word problem in $B_n$ is obtained which retains most of the desirable features of the Garside-Thurston solution, and at the same time makes…
We define the height of a mixed motive over a number field extending our previous work for pure motives.
In this brief note a straightforward combinatorial proof for an identity directly connecting rooted forests and unordered set partitions is provided. Furthermore, references that put this type of identity in the context of forest volumes…
In this short note we give a new upper bound for the size of a set family with a single Hamming distance. Our proof is an application of the linear algebra bound method.