Related papers: Q-universal desingularization
We present a new algorithm to decompose generic spinor polynomials into linear factors. Spinor polynomials are certain polynomials with coefficients in the geometric algebra of dimension three that parametrize rational conformal motions.…
We define the concept of an affinized projective variety and show how one can, in principle, obtain q-identities by different ways of computing the Hilbert series of such a variety. We carry out this program for projective varieties…
For a finite group $D$, we study categorical factorisation homology on oriented surfaces equipped with principal $D$-bundles, which `integrates' a (linear) balanced braided category $\mathcal{A}$ with $D$-action over those surfaces. For…
We study the local geometry of the pullback of a variety via a finite holomorphic map. In particular, we are looking for properties of $V = F^{-1}(W)$ such that if $V$ has the property $A$, then $W$ must have the property $A$. We show that…
A quadratic form over a non-archimedian local field of characteristic zero $F$ is called universal if it is integral and it represents all non-zero integers of $F$. Xu Fei and Zhang Yang determined all universal quadratic forms in the case…
I propose a way to use non-Euclidean norms to formulate a QR-like factorization which can unlock interesting and potentially useful properties of non-Euclidean norms - for example the ability of $l^1$ norm to suppresss outliers or promote…
We present a new method to achieve an embedded desingularization of a toric variety. Let $W$ be a regular toric variety defined by a fan $\Sigma$ and $X\subset W$ be a toric embedding. We construct a finite sequence of combinatorial…
The universal character is a polynomial attached to a pair of partitions and is a generalization of the Schur polynomial. In this paper, we introduce an integrable system of q-difference lattice equations satisfied by the universal…
We provide an irreducibility test in the ring K[[x]][y] whose complexity is quasi-linear with respect to the valuation of the discriminant, assuming the input polynomial F square-free and K a perfect field of characteristic zero or greater…
A well-known theorem factors a scalar coefficient differential operator given a linearly independent set of functions in its kernel. The goal of this paper is to generalize this useful result to other types of operators. In place of the…
Several quantum algorithms for linear algebra problems, and in particular quantum machine learning problems, have been "dequantized" in the past few years. These dequantization results typically hold when classical algorithms can access the…
In this paper, we address the following two general problems: given two algebraic varieties in ${\bf C}^n$, find out whether or not they are (1) isomorphic; (2) equivalent under an automorphism of ${\bf C}^n$. Although a complete solution…
In this paper, we study the desingularization problem in the first $q$-Weyl algebra. We give an order bound for desingularized operators, and thus derive an algorithm for computing desingularized operators in the first $q$-Weyl algebra.…
We study the birational geometry of the Kummer surfaces associated to the Jacobian varieties of genus two curves, with a particular focus on fields of characteristic two. In order to do so, we explicitly compute a projective embedding of…
Let $\textbf{U}^+$ be the positive part of the quantum group $\textbf{U}$ associated with a generalized Cartan matrix. In the case of finite type, Lusztig constructed the canonical basis $\textbf{B}$ of $\textbf{U}^+$ via two approaches.…
Let $Y$ be a normal and projective variety over an algebraically closed field $k$ and $V$ a vector bundle over $Y$. We prove that if there exist a $k$-scheme $X$ and a finite surjective morphism $g:X\to Y$ that trivializes $V$ then $V$ is…
An algorithm for resolution of singularities in characteristic zero is described. It is expressed in terms of multi-ideals, that essentially are defined as a finite sequence of pairs, each one consiting of a sheaf of ideals and a positive…
There is currently a huge effort to understand the potential and limitations of variational quantum machine learning (QML) based on the optimization of parameterized quantum circuits. Recent proposals toward dequantizing variational QML…
The conventional paradigm of quantum computing is discrete: it utilizes discrete sets of gates to realize bitstring-to-bitstring mappings, some of them arguably intractable for classical computers. In parameterized quantum approaches, the…
This paper extends an algorithm and canonical embedding by Cauchon to a large class of quantum algebras. It applies to iterated Ore extensions over a field satisfying some suitable assumptions which cover those of Cauchon's original setting…