Related papers: Kummer covers and braid monodromy
There are theories of coverings of $C^*$-algebras which can be included into a following list: coverings of commutative $C^*$-algebras, coverings of $C^*$-algebras of groupoids and foliations, coverings of noncommutative tori, the double…
A very popular problem on braid groups has recently been solved by Bigelow and Krammer, namely, they have found a faithful linear representation for the braid group B_n. In their papers, Bigelow and Krammer suggested that their…
This work presents the Polynomiogram framework, an integrated computational platform for exploring, visualizing, and generating art from polynomial root systems. The main innovation is a flexible sampling scheme in which two independent…
We consider braids with repeating patterns inside arbitrary knots which provides a multi-parametric family of knots, depending on the "evolution" parameter, which controls the number of repetitions. The dependence of knot (super)polynomials…
We give practical numerical methods to compute the period matrix of a plane algebraic curve (not necessarily smooth). We show how automorphisms and isomorphisms of such curves, as well as the decomposition of their Jacobians up to isogeny,…
In this paper the problem of tomographic reconstruction of states is investigated within the so-called Schwinger's picture of Quantum Mechanics in which a groupoid is associated with every quantum system. The attention is focused on spin…
A monoid structure on families of representations of a quiver is introduced by taking extensions of representations in families, i.e. subvarieties of the varieties of representations. The study of this monoid leads to interesting…
Prior domain knowledge can greatly help to learn generative models. However, it is often too costly to hard-code prior knowledge as a specific model architecture, so we often have to use general-purpose models. In this paper, we propose a…
Rewriting for semigroups is a special case of Groebner basis theory for noncommutative polynomial algebras. The fact is a kind of folklore but is not fully recognised. The aim of this paper is to elucidate this relationship, showing that…
Genus 2 curves are useful in cryptography for both discrete-log based and pairing-based systems, but a method is required to compute genus 2 curves such that the Jacobian has a given number of points. Currently, all known methods involve…
The increasing realism of generated images has raised significant concerns about their potential misuse, necessitating robust detection methods. Current approaches mainly rely on training binary classifiers, which depend heavily on the…
In previous work of the authors, we investigated the Born and inverse Born series for a scalar wave equation with linear and nonlinear terms, the nonlinearity being cubic of Kerr type [8]. We reported conditions which guarantee convergence…
The method of monodromy is an important tool for computing Virasoro conformal blocks in a two-dimensional Conformal Field Theory (2d CFT) at large central charge and external dimensions. In deriving the form of the monodromy problem, which…
Structure learning methods for covariance and concentration graphs are often validated on synthetic models, usually obtained by randomly generating: (i) an undirected graph, and (ii) a compatible symmetric positive definite (SPD) matrix. In…
Recent work suggests that topological features of certain quantum gravity theories can be interpreted as particles, matching the known fermions and bosons of the first generation in the Standard Model. This is achieved by identifying…
We study representations of the braid groups from braiding gapped boundaries of Dijkgraaf-Witten theories and their twisted generalizations, which are (twisted) quantum doubled topological orders in two spatial dimensions. We show that the…
We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…
In this paper we present simplifying techniques which allow one to compute the quiver diagrams for various D-branes at (non-Abelian) orbifold singularities with and without discrete torsion. The main idea behind the construction is to take…
Reconstructing training data from trained neural networks is an active area of research with significant implications for privacy and explainability. Recent advances have demonstrated the feasibility of this process for several data types.…
In this article, we give a numerical algorithm to compute braid groups of curves, hyperplane arrangements, and parameterized system of polynomial equations. Our main result is an algorithm that determines the cross-locus and the generators…