Related papers: Splicing braid varieties
Zesting of braided fusion categories is a procedure that can be used to obtain new modular categories from a modular category with non-trivial invertible objects. In this paper, we classify and construct all possible braided zesting data…
In 2003, Fomin and Zelevinsky obtained Cartan-Killing type classification of all cluster algebras of finite type, i.e. cluster algebras having only finitely many distinct cluster variables. A wider class of cluster algebras is formed by…
We study the question of whether the Brauer group is isomorphic to the cohomological one in spectral algebraic geometry. For this, we prove the compact generation of the derived category of twisted sheaves for quasi-compact spectral…
For a family of height one orders $(X,\le)$ and each non-degenerate solution $r_0\colon X\times X\longrightarrow X\times X$ of the set-theoretic braid equation on $X$ satisfying suitable conditions, we obtain all the non-degenerate…
Let X be a toric variety over a number field k with \kbar[X]^\times=\kbar^\times. Let W\subset X be a closed subset of codimension at least 2. We prove that X\setminus W satisfies strong approximation with algebraic Brauer--Manin…
The root extraction problem in braid groups is the following: given a braid $\beta \in \mathcal{B}_n$ and a number $k\in \mathbb{N}$, find $\alpha\in \mathcal{B}_n$ such that $\alpha^k=\beta$. In the last decades, many cryptosystems such as…
For any given integer $r \geq 1$ and a quasitoric braid $\beta_r=(\sigma_r^{-\epsilon} \sigma_{r-1}^{\epsilon}...$ $ \sigma_{1}^{(-1)^{r}\epsilon})^3$ with $\epsilon=\pm 1$, we prove that the maximum degree in $z$ of the HOMFLYPT polynomial…
Real-world networks often exhibit strong transitivity with nontrivial local clustering spectra and degree correlations. Such features are not easily modeled in tractable network models, creating an obstacle to the theoretical understanding…
Given word on $n$ letters, we study groups which satisfiy "iterated identity" $w$, meaning that for all $x_1, \dots, x_n$ there exists $m$ such that $m$-the iteration of $w$ of Engel type, applied to $x_1, \dots, x_n$, is equal to the…
We study ${\mathbb Z}$-graded thread $W^+$-modules $$V=\oplus_i V_i, \; \dim{V_i}=1, -\infty \le k< i < N\le +\infty, \; \dim{V_i}=0, \; {\rm \; otherwise},$$ over the positive part $W^+$ of the Witt (Virasoro) algebra $W$. There is…
In this article we study in detail the category of noncommutative motives of separable algebras Sep(k) over a base field k. We start by constructing four different models of the full subcategory of commutative separable algebras CSep(k).…
We give three applications of general theory about braided endomorphisms from conformal inclusions developed previously by us. The first is an example of subfactors associated with conformal inclusion whose dual fusion ring is…
We construct geometric realization for non-exceptional mutation-finite cluster algebras by extending the theory of Fomin and Thurston to skew-symmetrizable case. Cluster variables for these algebras are renormalized lambda lengths on…
In this paper, we show that the volumes for a family of A-adequate closed braids can be bounded above and below in terms of the twist number, the number of braid strings, and a quantity that can be read from the combinatorics of a given…
This paper introduces the multivariate beta mixture model (MBMM), a new probabilistic model for soft clustering. MBMM adapts to diverse cluster shapes because of the flexible probability density function of the multivariate beta…
We construct a conformally invariant random family of closed curves in the plane by welding of random homeomorphisms of the unit circle. The homeomorphism is constructed using the exponential of $\beta X$ where $X$ is the restriction of the…
We introduce a category of cluster algebras with fixed initial seeds. This category has countable coproducts, which can be constructed combinatorially, but no products. We characterise isomorphisms and monomorphisms in this category and…
Treewidth is an important graph invariant, relevant for both structural and algorithmic reasons. A necessary condition for a graph class to have bounded treewidth is the absence of large cliques. We study graph classes closed under taking…
Our main result has topological, combinatorial and computational flavor. It is motivated by a fundamental conjecture stating that computing Khovanov homology of a closed braid of fixed number of strands has polynomial time complexity. We…
We continue the study of separable elements in finite Weyl groups. These elements generalize the well-studied class of separable permutations. We show that the multiplication map $W/U \times U \to W$ is a length-additive bijection, or…