Related papers: Algorithmic problems in twisted groups of Lie type
Sharing of notations and theories across an inheritance hierarchy of mathematical structures, e.g., groups and rings, is important for productivity when formalizing mathematics in proof assistants. The packed classes methodology is a…
Symmetry is a fundamental tool in the exploration of a broad range of complex systems. In machine learning symmetry has been explored in both models and data. In this paper we seek to connect the symmetries arising from the architecture of…
Mixed membership community detection is a challenging problem. In this paper, to detect mixed memberships, we propose a new method Mixed-SLIM which is a spectral clustering method on the symmetrized Laplacian inverse matrix under the…
We give a full classification of Lie algebras of specific type in complexified Clifford algebras. These sixteen Lie algebras are direct sums of subspaces of quaternion types. We obtain isomorphisms between these Lie algebras and classical…
The Hidden Subgroup Problem is used in many quantum algorithms such as Simon's algorithm and Shor's factoring and discrete log algorithms. A polynomial time solution is known in case of abelian groups, and normal subgroups of arbitrary…
The braid group appears in many scientific fields and its representations are instrumental in understanding topological quantum algorithms, topological entropy, classification of manifolds and so on. In this work, we study planer diagrams…
We describe an implementation of a genetic algorithm on partially commutative groups and apply it to the double coset search problem on a subclass of groups. This transforms a combinatorial group theory problem to a problem of combinatorial…
The current computer architecture has moved towards the multi/many-core structure. However, the algorithms in the current sequential dense numerical linear algebra libraries (e.g. LAPACK) do not parallelize well on multi/many-core…
A 4-dimensional Riemannian manifold equipped with an endomorphism of the tangent bundle, whose fourth power is the identity, is considered. The matrix of this structure in some basis is circulant and the structure acts as an isometry with…
Recent work in machine learning shows that deep neural networks can be used to solve a wide variety of inverse problems arising in computational imaging. We explore the central prevailing themes of this emerging area and present a taxonomy…
This work represents a PhD thesis concerning three main topics. The first one deals with the study and applications of Lie systems with compatible geometric structures, e.g. symplectic, Poisson, Dirac, Jacobi, among others. Many new Lie…
We describe a new type of polycyclic presentations, that we will call refined solvable presentations, for polycyclic groups. These presentations are obtained by refining a series of normal subgroups with abelian sections. These…
We describe the development of the theory of automatic groups. We begin with a historical introduction, define the concepts of automatic, biautomatic and combable groups, derive basic properties, then explain how hyperbolic groups and the…
This thesis investigates the design of algorithms for solving min-max optimization problems, which form the mathematical foundation of many modern applications in machine learning, game theory, and optimization. This work offers new…
Garside calculus is the common mechanism that underlies a certain type of normal form for the elements of a monoid, a group, or a category. Originating from Garside's approach to Artin's braid groups, it has been extended to more and more…
We obtain an algorithmic construction of the isotropy lattice for a lifted action of a Lie group $G$ on $TM$ and $T^*M$ based only on the knowledge of $G$ and its action on $M$. Some applications to symplectic geometry are also shown.
The Learning with Errors (\LWE) problem has been widely utilized as a foundation for numerous cryptographic tools over the years. In this study, we focus on an algebraic variant of the \LWE problem called \emph{Group ring} \LWE ($\GRLWE$).…
This Ph.D. thesis contains original contributions to several areas within the disciplines of disordered systems, numerical linear algebra, and scientific computing: (1) Theoretical and numerical study of the errors caused by using certain…
In the study of induced bilinear systems, the classical Lie algebra rank condition (LARC) is known to be impractical since it requires computing the rank everywhere. On the other hand, the transitive Lie algebra condition, while more…
The study of the word problems of groups dates back to Dehn in 1911, and has been a central topic of study in both group theory and computability theory. As most naturally occurring presentations of groups are recursive, their word problems…