Related papers: Fast Computation of Secondary Invariants
Recent advancements in quantum computing and quantum-inspired algorithms have sparked renewed interest in binary optimization. These hardware and software innovations promise to revolutionize solution times for complex problems. In this…
We present a new algorithm to compute the integral closure of a reduced Noetherian ring in its total ring of fractions. A modification, applicable in positive characteristic, where actually all computations are over the original ring, is…
This paper studies separating invariants: mappings on $D$ dimensional domains which are invariant to an appropriate group action, and which separate orbits. The motivation for this study comes from the usefulness of separating invariants in…
The study of representations invariant to common transformations of the data is important to learning. Most techniques have focused on local approximate invariance implemented within expensive optimization frameworks lacking explicit…
We give an $O(N\cdot \log N\cdot 2^{O(\log^*N)})$ algorithm for multiplying two $N$-bit integers that improves the $O(N\cdot \log N\cdot \log\log N)$ algorithm by Sch\"{o}nhage-Strassen. Both these algorithms use modular arithmetic.…
Preconditioning is the most widely used and effective way for treating ill-conditioned linear systems in the context of classical iterative linear system solvers. We introduce a quantum primitive called fast inversion, which can be used as…
Certain quantum topological invariants of three manifolds can be written in the form of the Gaussian sum. It is shown that such topological invariants can be approximated efficiently by a quantum computer. The invariants discussed here are…
Over an algebraically closed base field $k$ of characteristic 2, the ring $R^G$ of invariants is studied, $G$ being the orthogonal group O(n) or the special orthogonal group SO(n) and acting naturally on the coordinate ring $R$ of the…
Inspired by Karr's algorithm, we consider the summations involving a sequence satisfying a recurrence of order two. The structure of such summations provides an algebraic framework for solving the difference equations of form…
By double ideal quotient, we mean $(I:(I:J))$ where ideals $I$ and $J$. In our previous work [11], double ideal quotient and its variants are shown to be very useful for checking prime divisor and generating primary component. Combining…
We consider the quantum complexity of estimating matrix elements of unitary irreducible representations of groups. For several finite groups including the symmetric group, quantum Fourier transforms yield efficient solutions to this…
We consider a generalization of representations of quivers that can be derived from the ordinary representations of quivers by considering a product of arbitrary classical groups instead of a product of the general linear groups and by…
We construct a binary mutation invariant for skew-symmetric integer matrices. The invariant is not an integer congruence invariant for matrices of odd size: we provide examples of congruent such matrices with different values for the…
In this paper, we first present an explicit expression for the inverse\emph{} of a type of matrices. As special applications, the inverse of some matrices arising from implicit time integration techniques, such as the well-known implicit…
We consider the problem of computing the maximal invariant set of discrete-time linear systems subject to a class of non-convex constraints that admit quadratic relaxations. These non-convex constraints include semialgebraic sets and other…
In this thesis are presented two aplications of the sigma model for the superstring in the pure spinor formulation. The first aplication concerns the computation of the one-loop conformal invariance for the type II superstring, resulting in…
We present a method for computing the Hilbert series of the algebra of invariants of the complex symplectic and orthogonal groups acting on graded noncommutative algebras with homogeneous components which are polynomial modules of the…
Recent advances in image clustering typically focus on learning better deep representations. In contrast, we present an orthogonal approach that does not rely on abstract features but instead learns to predict image transformations and…
The use of unitary invariant subspaces of a Hilbert space $\mathcal{H}$ is nowadays a recognized fact in the treatment of sampling problems. Indeed, shift-invariant subspaces of $L^2(\mathbb{R})$ and also periodic extensions of finite…
Given discrete groups $\Gamma \subset \Delta$ we characterize $(\Gamma,\sigma)$-invariant spaces that are also invariant under $\Delta$. This will be done in terms of subspaces that we define using an appropriate Zak transform and a…