Related papers: Families of Cyclic Cubic Fields
Let S be a smooth cubic surface defined over a field K. As observed by Segre and Manin, there is a secant and tangent process on S that generates new K-rational points from old. It is natural to ask for the size of a minimal generating set…
Let $C_{k_1}, \ldots, C_{k_n}$ be cycles with $k_i\geq 2$ vertices ($1\le i\le n$). By attaching these $n$ cycles together in a linear order, we obtain a graph called a polygon chain. By attaching these $n$ cycles together in a cyclic…
For each family of finite classical groups, and their associated simple quotients, we provide an explicit presentation on a specific generating set of size at most 8. Since there exist efficient algorithms to construct this generating set…
We describe several families of permutation polynomials obtained using functions with linear translators.
In this paper, we enumerate two families of polycubes, the directed plateau polycubes and the plateau polycubes, with respect to the width and a new parameter, the Lateral Area. We give an explicit formula and the generating function for…
Complements of union-closed families of sets, over a finite ground set, are known as simply rooted families of sets. Cubical sets are widely studied topological objects having applications in computational homology. In this paper, we look…
This paper develops techniques for producing presentations of upper cluster algebras. These techniques are suited to computer implementation, and will always succeed when the upper cluster algebra is totally coprime and finitely generated.…
We construct a family of ideals representing ideal classes of order 2 in quadratic number fields and show that relations between their ideal classes are governed by certain cyclic quartic extensions of the rationals.
The sister of Eisenstein-Picard modular group was described in [8]. In this paper we give a similar definition of the sister of the Euclidean-Picard modular group and find its generators by using a geometric method.
We present two distinct families of imaginary biquadratic fields, each of which contains infinitely many members, with each member having large class groups. Construction of the first family involves elliptic curves and their quadratic…
We demonstrate that when a graph exhibits a specific type of symmetry, it satisfies the Union Closed Conjecture(UCC). Additionally, we show that certain graph classes, such as Cylindrical Grid Graphs and Torus Grid Graphs also satisfy the…
We construct a family of monotone and convex $C^1$ integro cubic splines under a strictly convex position of the dataset. Then, we find an optimal spline by considering its approximation properties. Finally, we give some examples to…
We find explicit subdivision rules for all special cubulated groups. A subdivision rule for a group produces a sequence of tilings on a sphere which encode all quasi-isometric information for a group. We show how these tilings detect…
We introduce a new class of generalised quadratic forms over totally real number fields, which is rich enough to capture the arithmetic of arbitrary systems of quadrics over the rational numbers. We explore this connection through a version…
We construct an explicit family of modular iterated integrals which involves cusp forms. This leads to a new method of producing "invariant versions" of iterated integrals of modular forms. The construction will be based on an extension of…
We construct some families of quadratic fields whose class numbers are divisible by $3.$ The main tools used are a trinomial introduced by Kishi and a parametrization of Kishi and Miyake of a family of quadratic fields whose class numbers…
We state a relation between two families of lines that cover a quadric surface in the Study quadric and two families of circles that cover a Darboux cyclide.
This article is the first in a series devoted to computing the class groups of real quadratic fields. We present a new relation between the class number and the index of unit groups. This relation generalizes Hilbert class field theory for…
We define and examine flip operations for quadrilateral and hexahedral meshes, similar to the flipping transformations previously used in triangular and tetrahedral mesh generation.
We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm…