Related papers: An L(1/3) algorithm for ideal class group and regu…

There are well known algorithms to compute the class group of the maximal order $\mathcal{O}_K$ of a number field $K$ and the group of invertible ideal classes of a non-maximal order $R$. In this paper we explain how to compute also the…

The degree pattern of a finite group is the degree sequence of its prime graph in ascending order of vertices. We say that the problem of OD-characterization is solved for a finite group if we determine the number of pairwise nonisomorphic…

Given a grading by an abelian group G on a semisimple Lie algebra L over an algebraically closed field of characteristic 0, we classify up to isomorphism the simple objects in the category of finite-dimensional G-graded L-modules. The…

In this paper we find a new lower bound on the number of imaginary quadratic extensions of the function field $\mathbb{F}_{q}(x)$ whose class groups have elements of a fixed odd order. More precisely, for $q$, a power of an odd prime, and…

The main goal of this paper is to size up the minimal graded free resolution of a homogeneous ideal in terms of its generating degrees. By and large, this is too ambitious an objective. As understood, sizing up means looking closely at the…

Let F be the cubic field of discriminant -23 and O its ring of integers. Let Gamma be the arithmetic group GL_2 (O), and for any ideal n subset O let Gamma_0 (n) be the congruence subgroup of level n. In a previous paper, two of us (PG and…

We introduce a generalisation of norm relations in the group algebra Q[G], where G is a finite group. We give some properties of these relations, and use them to obtain relations between the S-unit groups of different subfields of the same…

Deciding whether an ideal of a number field is principal and finding a generator is a fundamental problem with many applications in computational number theory. For indefinite quaternion algebras, the decision problem reduces to that in the…

The problem of analyzing the number of number field extensions $L/K$ with bounded (relative) discriminant has been the subject of renewed interest in recent years, with significant advances made by Schmidt, Ellenberg-Venkatesh, Bhargava,…

We prove the tightest-known upper bounds on the sample complexity of multi-group learning. Our algorithm extends the one-inclusion graph prediction strategy using a generalization of bipartite $b$-matching. In the group-realizable setting,…

Let $L/K$ be a Galois extension of number fields. We prove two lower bounds on the maximum of the degrees of the irreducible complex representations of ${\rm Gal}(L/K)$, the sharper of which is conditional on the Artin Conjecture and the…

This paper studies minimax optimization problems $\min_x \max_y f(x,y)$, where $f(x,y)$ is $m_x$-strongly convex with respect to $x$, $m_y$-strongly concave with respect to $y$ and $(L_x,L_{xy},L_y)$-smooth. Zhang et al. provided the…

We show that on graphs with n vertices, the 2-dimensional Weisfeiler-Leman algorithm requires at most O(n^2/log(n)) iterations to reach stabilization. This in particular shows that the previously best, trivial upper bound of O(n^2) is…

In this monograph, we study complexity classes that are defined using $O(\log n)$-space bounded non-deterministic Turing machines. We prove salient results of Computational Complexity in this topic such as the Immerman-Szelepcsenyi Theorem,…

Given a graph $G=(V,E)$ with two distinguished vertices $s,t\in V$ and an integer parameter $L>0$, an {\em $L$-bounded cut} is a subset $F$ of edges (vertices) such that the every path between $s$ and $t$ in $G\setminus F$ has length more…

In [2], an exhaustive construction is achieved for the class of all 4-dimensional unital division algebras over finite fields of odd order, whose left nucleus is not minimal and whose automorphism group contains Klein's four-group. We…

In Part I we construct the upper bound, in the spirit of $\Gamma$- $\limsup$, achieved by multidimensional profiles, for some general classes of singular perturbation problems, with or without the prescribed differential constraint, taking…

Ideal class pairings map the rational points of rank $r\geq 1$ elliptic curves $E/\Q$ to the ideal class groups $\CL(-D)$ of certain imaginary quadratic fields. These pairings imply that $$h(-D) \geq \frac{1}{2}(c(E)-\varepsilon)(\log…

We give a new complexity bound for calculating the complex dimension of an algebraic set. Our algorithm is completely deterministic and approaches the best recent randomized complexity bounds. We also present some new, significantly sharper…

Automating algorithm configuration is growing increasingly necessary as algorithms come with more and more tunable parameters. It is common to tune parameters using machine learning, optimizing performance metrics such as runtime and…