Related papers: The Modular Isomorphism Problem for small groups -…
The graph isomorphism (GI) problem, which asks whether two graphs are structurally identical, occupies a unique position in computational complexity -- it is neither known to be solvable in polynomial time, nor proven to be NP-complete. We…
This paper studies Moore's measurable cohomology theory for locally compact groups and Polish modules. An elementary dimension-shifting argument is used to show that all classes in that theory have representatives with considerable extra…
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved efficiently, very little is known about the complexity of…
Many applications, including rank aggregation, crowd-labeling, and graphon estimation, can be modeled in terms of a bivariate isotonic matrix with unknown permutations acting on its rows and/or columns. We consider the problem of estimating…
We describe a new algorithm for computing the ideal class group, the regulator and a system of fundamental units in number fields under the generalized Riemann hypothesis. We use sieving techniques adapted from the number field sieve…
For the Klein-Four Group $G$ and a perfect field $k$ of characteristic two we determine all indecomposable symplectic $kG$-modules, that is, $kG$-modules with a symplectic, $G$-invariant form which do not decompose into smaller such…
We prove a higher dimensional generalization of Gross and Zagier's theorem on the factorization of differences of singular moduli. Their result is proved by giving a counting formula for the number of isomorphisms between elliptic curves…
We establish a cluster theoretical interpretation of the isomorphisms of [F.-H.-O.-O., J. Reine Angew. Math., 2022] among quantum Grothendieck rings of representations of quantum loop algebras. Consequently, we obtain a quantization of the…
Given polynomials $f_0,\dots, f_k$ the Ideal Membership Problem, IMP for short, asks if $f_0$ belongs to the ideal generated by $f_1,\dots, f_k$. In the search version of this problem the task is to find a proof of this fact. The IMP is a…
A modular semilattice is a semilattice generalization of a modular lattice. We establish a Birkhoff-type representation theorem for modular semilattices, which says that every modular semilattice is isomorphic to the family of ideals in a…
In this paper, we study the isomorphism problem for central extensions. More precisely, in some new situations, we provide necessary and sufficient conditions for two central extensions to be isomorphic. We investigate the case when the…
It is known that for a monomial ideal $I$, the number of minimal generators, $\mu(I^n)$, eventually follows a polynomial pattern for increasing $n$. In general, little is known about the power at which this pattern emerges. Even less is…
Let $A \subseteq E$ be a given extension of Hopf (respectively Lie) algebras. We answer the \emph{classifying complements problem} (CCP) which consists of describing and classifying all complements of $A$ in $E$. If $H$ is a given…
Using symmetric algebras we simplify (and slightly strengthen) the Bruns-Eisenbud-Evans "generalized principal ideal theorem" on the height of order ideals of non-minimal generators in a module. We also obtain a simple proof and an…
There is no systematic general procedure by which isomorphism classes of Hopf algebras that are extensions of $\k F$ by ${\k}^G$ can be found. We develop the general procedure for classification of isomorphism classes of Hopf algebras which…
The problem of computing the dimension of a left/right ideal in a group algebra F[G] of a finite group G over a field F is considered. The ideal dimension is related to the rank of a matrix originating from a regular left/right…
We show that elementary abelian direct factors can be disregarded in the study of the modular isomorphism problem. Moreover, we obtain four new series of abelian invariants of the group base in the modular group algebra of a finite…
We obtain a new classification of the finite metacyclic group in terms of group invariants. We present an algorithm to compute these invariants, and hence to decide if two given finite metacyclic groups are isomorphic, and another algorithm…
A standard approach to solving optimistic bilevel linear programs (BLPs) is to replace the lower-level problem with its Karush-Kuhn-Tucker (KKT) optimality conditions and reformulate the resulting complementarity constraints using auxiliary…
We present a systematic small-correlation expansion to solve the inverse Ising problem: find a set of couplings and fields corresponding to a given set of correlations and magnetizations. Couplings are calculated up to the third order in…