相关论文: Construction of long root SL(2,q)-subgroups in bla…

In this paper we describe an algorithm for the computation of canonical forms of finite subsets of $\mathbb{Z}^d$, up to affinities over $\mathbb{Z}$. For fixed dimension $d$, this algorithm has worst-case asymptotic complexity $O(n \log^2…

We approximate the d complex zeros of a univariate polynomial p(x) of a degree d or those zeros that lie in a fixed region of interest on the complex plane such as a disc or a square. Our divide and conquer algorithm of STOC 1995 supports…

We arrange classical small cancellation constructions to produce left-orderable groups: we show that every finitely generated group is the quotient of a left-ordered small cancellation group by a finitely generated kernel (Rips…

In this memoir we extend the theory of global pseudo-differential operators to the setting of arbitrary sub-Riemannian structures on a compact Lie group. More precisely, given a compact Lie group $G$, and the sub-Laplacian $\mathcal{L}$…

We present algorithmic, complexity and implementation results for the problem of isolating the real roots of a univariate polynomial in $B_{\alpha} \in L[y]$, where $L=\QQ(\alpha)$ is a simple algebraic extension of the rational numbers. We…

We present a new Monte Carlo algorithm for the interpolation of a straight-line program as a sparse polynomial $f$ over an arbitrary finite field of size $q$. We assume a priori bounds $D$ and $T$ are given on the degree and number of terms…

We consider an amalgam of groups constructed from fusion systems for different odd primes p and q. This amalgam contains a self-normalizing cyclic subgroup of order pq and isolated elements of order p and q.

Polynomial-time algorithms are given to find a central decomposition of maximum size for a finite p-group of class 2 and for a nilpotent Lie ring of class 2. The algorithms use Las Vegas probabilistic routines to compute the structure of…

We construct a large family of ribbon quasi-Hopf algebras related to small quantum groups, with a factorizable R-matrix. Our main purpose is to obtain non-semisimple modular tensor categories for quantum groups at even roots of unity, where…

Denote by $J_m$ the Jacobian variety of the hyperelliptic curve defined by the affine equation $y^2=x^m+1$ over $\mathbb{Q}$, where $m \geq 3$ is a fixed positive integer. In this paper, we compute the Sato-Tate group of $J_m$. Currently,…

The theory of nilpotent orbits of simple Lie algebras has seen tremendous developments over the past decades. In this context an important role is played by the component group of the stabilizer of a nilpotent element. In this work, the aim…

The semidirect discrete logarithm problem (SDLP) in finite groups was proposed as a foundation for post-quantum cryptographic protocols, based on the belief that its non-abelian structure would resist quantum attacks. However, recent…

We consider $d$-dimensional lattice polytopes $\Delta$ with $h^*$-polynomial $h^*_\Delta=1+h_k^*t^k$ for $1<k<(d+1)/2$ and relate them to some abelian subgroups of $\SL_{d+1}(\C)$ of order $1+h_k^*=p^r$ where $p$ is a prime number. These…

We show that the affine quantum group $U_q(\hat{sl_2})$ is isomorphic to a bicrossproduct central extension $C Z{}_\chi\cross U_q(Lsl_2)$ of the quantum loop group $U_q(Lsl_2)$ by a quantum cocycle $\chi$, which we construct. We prove the…

We construct quasi-solvable quantum mechanical matrix models by employing two different methods, the one is universal enveloping algebra of Lie superalgebra and the other is N-fold supersymmetry. For the former we examine the q(2) and…

We consider fundamental facts from the theory of Hopf superalgebras. We use them to construct the quantum double of the quantum superalgebra $sl(2|1)$ at roots of unity. Thus we obtain a multiplicative formula for universal $R$-matrix. Next…

A method to construct in explicit form the generators of the simple roots of an arbitrary finite-dimensional representation of a quantum or standard semisimple algebra is found. The method is based on general results from the global theory…

Beginning with a skew-symmetric matrix, we define a certain Poisson--Lie group. Its Poisson bracket can be viewed as a cocycle perturbation of the linear (or "Lie-Poisson") Poisson bracket. By analyzing this Poisson structure, we gather…

In this paper, we investigate the computational complexity of isomorphism testing for finite groups and quasigroups, given by their multiplication tables. We crucially take advantage of their various decompositions to show the following: -…

We study the problem of computing the largest root of a real rooted polynomial $p(x)$ to within error $\varepsilon $ given only black box access to it, i.e., for any $x \in {\mathbb R}$, the algorithm can query an oracle for the value of…