Related papers: The Modular Isomorphism Problem for small groups -…
Automorphisms of order $2$ are studied in order to understand generalized symmetric spaces. The groups of type $E_6$ we consider here can be realized as both the group of linear maps that leave a certain determinant invariant, and also as…
Given a representation of a finite group $G$ over some commutative base ring $\mathbf{k}$, the cofixed space is the largest quotient of the representation on which the group acts trivially. If $G$ acts by $\mathbf{k}$-algebra automorphisms,…
We establish ring isomorphisms between quantum Grothendieck rings of certain remarkable monoidal categories of finite-dimensional representations of quantum affine algebras of types $A_{2n-1}^{(1)}$ and $B_n^{(1)}$. Our proof relies in part…
Recently, various normalization layers have been proposed to stabilize the training of deep neural networks. Among them, group normalization is a generalization of layer normalization and instance normalization by allowing a degree of…
Motivated by the need for efficient isomorphism tests for finite groups, we present a polynomial-time method for deciding isomorphism within a class of groups that is well-suited to studying local properties of general finite groups. We…
For a Banach algebra $A$ with a bounded approximate identity, we investigate the $A$-module homomorphisms of certain introverted subspaces of $A^*$, and show that all $A$-module homomorphisms of $A^*$ are normal if and only if $A$ is an…
We study Hopf algebras via tools from geometric invariant theory. We show that all the invariants we get can be constructed using the integrals of the Hopf algebra and its dual together with the multiplication and the comultiplication, and…
We design a recursive algorithm to compute the partition function of the Ising model, summed over cubic maps with fixed size and genus. The algorithm runs in polynomial time, which is much faster than methods based on a Tutte-like, or…
Let $R$ be a commutative ring and $I\subset R$ be a nilpotent ideal such that the quotient $R/I$ splits out of $R$ as a ring. Let $N$ be a natural number such that ${I^N=0}$. We establish a canonical isomorphism between the relative Milnor…
In this paper we describe an algorithm for generating all the possible $PIW(m,n,k)$ - integer $m\times n$ Weighing matrices of weight $k$ up to Hadamard equivalence. Our method is efficient on a personal computer for small size matrices, up…
Based on the joint bidiagonalization process of a large matrix pair $\{A,L\}$, we propose and develop an iterative regularization algorithm for the large scale linear discrete ill-posed problems in general-form regularization: $\min\|Lx\| \…
We study the law of the iterated logarithm (LIL) for the maximum likelihood estimation of the parameters (as a convex optimization problem) in the generalized linear models with independent or weakly dependent ($\rho$-mixing, $m$-dependent)…
The normaliser problem takes as input subgroups $G$ and $H$ of the symmetric group $S_n$, and asks one to compute $N_G(H)$. The fastest known algorithm for this problem is simply exponential, whilst more efficient algorithms are known for…
The groups whose orders factorise into at most four primes have been described (up to isomorphism) in various papers. Given such an order n, this paper exhibits a new explicit and compact determination of the isomorphism types of the groups…
Mutually Unbiased Bases (MUBs) constitute a fundamental geometric structure in quantum theory, known for providing an optimal measurement scheme for quantum state tomography. In prime and prime-power dimensions, analytical constructions of…
This paper develops a method to obtain the optimal value for the regularization coefficient in a general mixed-integer problem (MIP). This approach eliminates the cross-validation performed in the existing penalty techniques to obtain a…
We investigate improvements to the algorithm for the computation of ideal class groups described by Jacobson in the imaginary quadratic case. These improvements rely on the large prime strategy and a new method for performing the linear…
We propose a new fast algorithm for solving one of the standard approaches to ill-posed linear inverse problems (IPLIP), where a (possibly non-smooth) regularizer is minimized under the constraint that the solution explains the observations…
Suppose $G$ is a compact semisimple Lie group, $\mu$ is the normalized Haar measure on $G$, and $A, A^2 \subseteq G$ are measurable. We show that $$\mu(A^2)\geq \min\{1, 2\mu(A)+\eta\mu(A)(1-2\mu(A))\}$$ with the absolute constant $\eta>0$…
We consider the isomorphism problem for groups specified by their multiplication tables. Until recently, the best published bound for the worst-case was achieved by the n^(log_p n + O(1)) generator-enumeration algorithm. In previous work…