Related papers: A faster method to construct extraspecial normalis…
As is known, any realization of SU(2) in the phase space of a dynamical system can be generalized to accommodate the exceptional supergroup $D(2,1;\alpha)$, which is the most general $\mathcal{N}{=}\,4$ supersymmetric extension of the…
The higher-order tensor renormalization group is a tensor-network method providing estimates for the partition function and thermodynamical observables of classical and quantum systems in thermal equilibrium. At every step of the iterative…
In this paper, by making use of the familiar $q$-difference operators $D_q$ and $D_{q^{-1}}$, we first introduce two homogeneous $q$-difference operators $\mathbb{T}({\bf a},{\bf b},cD_q)$ and $\mathbb{E}({\bf a},{\bf b}, cD_{q^{-1}})$,…
Let $S\subset \text{SL}_2(\mathbb Z)\times \text{SL}_2(\mathbb Z)$ or $\text{SL}_2(\mathbb Z)\ltimes \mathbb Z^2$ be finite symmetric and assume $S$ generates a group $G$ which is a Zariski-dense subgroup $\text{SL}_2(\mathbb Z)\times…
We present a heuristic algorithm to compute the ideal class group, and a generator of a principal ideal in $\mathbb{Q}(\zeta_{p^s})$ in time $2^{O(n^{1/2+\varepsilon})}$ for $n:= deg(K)$ and arbitrarily small $\varepsilon$. This yields an…
A connected Lie group G is generated by its two 1-parametric subgroups exp(tX), exp(tY) if and only if the Lie algebra of G is generated by {X, Y}. We consider decompositions of elements of G into a product of such exponentials with times t…
In this paper we provide an $O(m (\log \log n)^{O(1)} \log(1/\epsilon))$-expected time algorithm for solving Laplacian systems on $n$-node $m$-edge graphs, improving improving upon the previous best expected runtime of $O(m \sqrt{\log n}…
Two different models exhibiting self-organized criticality are analyzed by means of the dynamic renormalization group. Although the two models differ by their behavior under a parity transformation of the order parameter, it is shown that…
We show how to efficiently count and generate uniformly at random finitely generated subgroups of the modular group $\textsf{PSL}(2,\mathbb{Z})$ of a given isomorphism type. The method to achieve these results relies on a natural map of…
We give an algorithm to solve the quantum hidden subgroup problem for maximal cyclic non-normal subgroups of the affine group of a finite field (if the field has order $q$ then the group has order $q(q-1)$) with probability $1-\varepsilon$…
We derive and solve renormalization group equations that allow for the resummation of subleading power rapidity logarithms. Our equations involve operator mixing into a new class of operators, which we term the "rapidity identity…
The main component of (constructive) recognition algorithms for black box groups of Lie type in computational group theory is the construction of unipotent elements. In the existing algorithms unipotent elements are found by random search…
Let $d$ be a positive integer. A finite group is called $d$-maximal if it can be generated by precisely $d$ elements, while its proper subgroups have smaller generating sets. For $d\in\{1,2\}$, the $d$-maximal groups have been classified up…
We give a supersymmetric generalization of the sine algebra and the quantum algebra $U_{t}(sl(2))$. Making use of the $q$-pseudo-differential operators graded with a fermionic algebra, we obtain a supersymmetric extension of sine algebra.…
In this paper we study the (2,k)-generation of the finite classical groups SL(4,q), Sp(4,q), SU(4,q^2) and their projective images. Here k is the order of an arbitrary element of SL(2,q), subject to the necessary condition k>= 3. When q is…
Given a multiset $S$ of $n$ positive integers and a target integer $t$, the subset sum problem is to decide if there is a subset of $S$ that sums up to $t$. We present a new divide-and-conquer algorithm that computes all the realizable…
We resum the leading ultrasoft logs of the singlet and octet static QCD potentials within potential NRQCD. We then obtain the complete three-loop renormalization group improvement of the singlet QCD static potential. The discrepancies…
We give new sublinear and parallel algorithms for the extensively studied problem of approximating n-variable r-CSPs (constraint satisfaction problems with constraints of arity r up to an additive error. The running time of our algorithms…
We study normal reflection subgroups of complex reflection groups. Our approach leads to a refinement of a theorem of Orlik and Solomon to the effect that the generating function for fixed-space dimension over a reflection group is a…
We complete the classification of the finite special linear groups $\SL_n(q)$ which are $(2,3)$-generated, i.e., which are generated by an involution and an element of order $3$. This also gives the classification of the finite simple…