Related papers: Enumerating number fields
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…
Lienard systems are very important mathematical models describing oscillatory processes arising in applied sciences. In this paper, we study polynomial Lienard systems of arbitrary degree on the plane, and develop a new method to obtain a…
Each number field has an associated finite abelian group, the class group, that records certain properties of arithmetic within the ring of integers of the field. The class group is well-studied, yet also still mysterious. A central…
The degree sequence optimization problem is to find a subgraph of a given graph which maximizes the sum of given functions evaluated at the subgraph degrees. Here we study this problem by replacing degree sequences, via suitable nonlinear…
We investigate how well complex algebraic numbers can be approximated by algebraic numbers of degree at most n. We also investigate how well complex algebraic numbers can be approximated by algebraic integers of degree at most n+1. It…
We describe general methods for enumerating subsemigroups of finite semigroups and techniques to improve the algorithmic efficiency of the calculations. As a particular application we use our algorithms to enumerate all transformation…
Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all…
We provide upper and lower bounds on the least-perimeter way to enclose and separate n regions of equal area in the plane. Along the way, inside the hexagonal honeycomb, we provide minimizers for each n .
The past century has seen a steady increase in the need of estimating and predicting complex systems and making (possibly critical) decisions with limited information. Although computers have made possible the numerical evaluation of…
In this paper we obtain the extended genus field of a global field. First we define the extended genus field of a global function field and we obtain, via class field theory, the description of the extended genus field of an arbitrary…
We prove several results concerning genus numbers of quintic fields: we compute the proportion of quintic fields with genus number one; we prove that a positive proportion of quintic fields have arbitrarily large genus number; and we…
We provide bounds on the size of operators obtained by algorithms for executing D-finite closure properties. For operators of small order, we give bounds on the degree and on the height (bit-size). For higher order operators, we give degree…
A slip on a paper concerning near-vector spaces is fixed. New characterization of near-vector spaces determined by finite fields is provided and the number (up to the isomorphism) of these spaces is exhibited.
We give a survey of recent results related to the problem of characterizing finite-dimensional division algebras by the set of isomorphism classes of their maximal subfields. We also discuss various generalizations of this problem and some…
We study the distribution of principal ideals generated by irreducible elements in an algebraic number field.
We present some new lower bound estimates for certain numbers in Laver table theory and introduce several related structures of interest.
We provide a simple way to add, multiply, invert, and take traces and norms of algebraic integers of a number field using integral matrices. With formulas for the integral bases of the ring of integers of at least a significant proportion…
In this paper, we examine the general algorithm for class group computations, when we do not have a small defining polynomial for the number field. Based on a result of Biasse and Fieker, we simplify their algorithm, improve the complexity…
We provide a logarithmic upper bound for the disentangling number on unordered lists of leaf labeled trees. This results is useful for analyzing phylogenetic mixture models. The proof depends on interpreting multisets of trees as high…
This paper describes a simple method for estimating lower bounds on the number of classes of equivalence for a special kind of integer sequences, called division sequences. The method is based on adding group structure to classes of…