Related papers: Algorithms in Linear Algebraic Groups
Spinor polynomials are polynomials with coefficients in the even sub-algebra of conformal geometric algebra whose norm polynomial is real. They describe rational conformal motions. Factorizations of spinor polynomial corresponds to the…
We study tight bounds and fast algorithms for LCLMs of several linear differential operators with polynomial coefficients. We analyze the arithmetic complexity of existing algorithms for LCLMs, as well as the size of their outputs. We…
A group of isometries of a hyperbolic $n$-space is called a reflection group if it is generated by reflections in hyperbolic hyperplanes. Vinberg gave a semi-algorithm for finding a maximal reflection sublattice in a given arithmetic…
We classify the irreducible unitary modules in category O for the rational Cherednik algebras of type G(r,1,n) and give explicit combinatorial formulas for their graded characters. More precisely, we produce a combinatorial algorithm…
Part I: The geometric algebra of space is derived by extending the real number system to include three mutually anticommuting square roots of plus one. The resulting geometric algebra is isomorphic to the algebra of complex 2x2 matrices,…
Bilevel optimization has been widely used in decision-making process. However, there still lacks an efficient algorithm to determine an optimal solution of a bilevel optimization problem, especially for a large-size problem. To bridge the…
This paper presents a solution to a problem from superanalysis about the existence of Hilbert-Banach superalgebras. Two main results are derived: 1) There exist Hilbert norms on some graded algebras (infinite-dimensional superalgebras…
Based on a theorem by Vasconcelos, we give an algorithm for equidimensional decomposition of algebraic sets using syzygy computations via Gr\"obner bases. This algorithm avoids the use of elimination, homological algebra and processing the…
We give a presentation of the centralizer algebras for tensor products of spinor representations of quantum groups via generators and relations. In the even-dimensional case, this can be described in terms of non-standard q-deformations of…
We present a complexity reduction algorithm for a family of parameter-dependent linear systems when the system parameters belong to a compact semi-algebraic set. This algorithm potentially describes the underlying dynamical system with…
The set of non-linear equations describing the Standard Model kinematics of the top quark antiqark production system in the dilepton decay channel has at most a four-fold ambiguity due to two not fully reconstructed neutrinos. Its most…
The group $SL(2,\mathbb{C})$ of all complex $2\times 2$ matrices with determinant one is closely related to the group $\boldsymbol{\mathcal{L}}_{+}^\uparrow$ of real $4\times 4$ matrices representing the restricted Lorentz transformations.…
We present an algorithm to convert a word of length $n$ in the standard generators of the solvable Baumslag-Solitar group $BS(1,p)$ into a geodesic word, which runs in linear time and $O(n\log n)$ space on a random access machine.
We give an algorithm for the class of second order unification problems in which second order variables have at most one occurrence.
This thesis studies arithmetic of linear algebraic groups. It involves studying the properties of linear algebraic groups defined over global fields, local fields and finite fields, or more generally the study of the linear algebraic groups…
A procedure for the construction and the classification of multilattices in arbitrary dimension is proposed. The algorithm allows to determine explicitly the location of the points of a multilattice given its space group, and to determine…
We establish the optimal nonergodic sublinear convergence rate of the proximal point algorithm for maximal monotone inclusion problems. First, the optimal bound is formulated by the performance estimation framework, resulting in an infinite…
Through dualities on representations on tensor powers and symmetric powers respectively, the partition algebra and multiset partition algebra have been used to study long-standing questions in the representation theory of the symmetric…
We consider the problem of solving a large-scale system of linear equations in a distributed or federated manner by a taskmaster and a set of machines, each possessing a subset of the equations. We provide a comprehensive comparison of two…
Let $F$ be a field of odd characteristic, $E$ be a finite extension of $F$ equipped an involution with subfield of fixed points $E_0$ containing $F$ and $V$ be a finite dimensional $E$-vector space with a non-degenerate hermitian form $h$.…