SearcharxivSearch

arXiv subjects

Helmut Ruhland

Publications and source records attributed to Helmut Ruhland.

12 recordsLinked to original sources

Constructing the $\mathbf{2^{2^5} + 1 = F_5}$-gon, the first step: the 641-gon

In an article, S. Adlaj showed the construction of the $F_4 = 65\,537$-gon ($F_4$ a Fermat prime). By extending the author's method to cases where the multiplicative group is not of order $2^n$ but has an additional prime factor, I here construct the $641$-gon. $641$ is the smaller prime factor of the composite Fermat number $F_5 = 2^{2^5} + 1$.

math.NT

On two Abelian Groups Related to the Galois Top

In mathematical physics the Galois top, introduced by S. Adlaj, possesses a fixed point on one of two Galois axes through its center of mass. This heavy top has two algebraic motion invariants and an additional transcendental motion-invariant. This third invariant depends on an antiderivative of a variable in the canonical phase space. In this article an abelian semigroup and an abelian group are defined that are related to the application of the Huygens-Steiner theorem to points on the Galois axis of a rigid body. This yields non-linear representations of the one-dimensional, affine, linear (semi)group.

math.NA

Unified constructions of the regular Heptagon, Triskaidecagon and Heptadecagon

Constructions of regular heptagon and triskaidecagon by trisection of an angle are well known. An elegant construction of the heptagon by S. Adlaj shows a 3-fold symmetry related to a Galois group. Based on the latter construction, in this article one more for the heptagon, two more for the triskaidecagon and three for heptadecagon are presented, all using angle trisection.

math.HO

Families of lattices with an unbounded number of unit vectors

3 families of 4-dimensional lattices $L_k, M_k, M_k / 2 \subset \mathbb{R}^2$ are defined. Each lattice is defined by 2 quadratic extensions and has a \emph{finite} number of unit vectors, but the number of unit vectors in each of the 3 familes is \emph{unbounded}. $L_3$ is the Moser lattice.

math.MG

No new lower bound for the density of planar Sets avoiding Unit Distances

In a recently published article by G. Ambrus et al. a new \emph{upper bound} for the density of an unit avoiding, periodic set is given as $0.2470$, the first upper bound $< 1/4$. A construction of Croft 1967 gave a \emph{lower bound} $\delta_C = 0.22936$ for the density. To this date, no better construction with a higher bound has been given. In the \emph{first versions} of this article I gave a construction of planar sets with a "higher" density than Croft's tortoises. No explicit value for this density was given, it was just shown that Croft's density is a local minima in the density of the constructed 1-parameter family of planar sets. But now I found a servere error. After the correction in this article none of the investigated sets of constant diameter resulted in a new lower bound. I did not withdraw the article, maybe something could be useful for somebody.

math.MG

Cubic equations with 2 Roots in the interval $[-1, 1]$

The conditions for cubic equations, to have 3 real roots and 2 of the roots lie in the closed interval $[-1, 1]$ are given. These conditions are visualized. This question arises in physics in e.g. the theory of tops.

math.NA

Somos-4 and a quartic Surface in $\mathbb{RP}^{3}$

The Somos-4 equation defines the sequences with this name. Looking at these sequences with an additional property we get a quartic polynomial in 4 variables. This polynomial defines a rational, projective surface in $\mathbb{RP}^{3}$. Here some generators of the subgroup of $Cr_3 (\mathbb{R})$ are determined, whose birational maps are automorphisms of the quartic surface.

math.AG

Two Families of Cremona Maps and orthogonal Krall-Jacobi Polynomials

Two infinite families of Cremona maps depending on one real parameter are given. For all integers $n \ge 1$ the first family of Cremona maps consists of group elements in $Bir \left( \mathbb{P}^{n} \right)$ with bidegree $(n, n)$, the second family of Cremona maps consists of group elements in $Bir \left( \mathbb{P}^{2n} \right)$ with bidegree $(2 n, 2 n)$. For the first family and $n \ge 5$, for the second family and $n \ge 3$ the existence of this group elements and the properties depend on a conjecture. But computational results suggest that the conjecture is true for all $n$.

math.AG

Spline Quadrature and semi-classical orthogonal Jacobi Polynomials

A theory of spline quadrature rules for arbitrary continuity class in a closed interval $[a, b]$ with arbitrary nonuniform subintervals based on semi-classical orthogonal Jacobi polynomials is proposed. For continuity class $c \ge 2$ this theory depends on a conjecture.

math.NA

Computed multivalues of AGM reveal periodicities of inverse functions

The article shows how two choices are possible whenever computing the geometric mean, and the repetition of this process can in general yield 2-to-the power N different values when the choices are compounded in the first N steps of evaluation of the arithmetic-geometric mean. This happens not only in the simple AGM involved in the computation of the complete elliptic integral of the first kind, but also in analogous methods for the computation of the complete and incomplete elliptic integrals of the first and second kind.

math.CA

Quadrature rules for $C^0$ and $C^1$ splines, a recipe

Closed formulae for all Gaussian or optimal, 1-parameter quadrature rules in a compact interval [a, b] with non uniform, asymmetric subintervals, arbitrary number of nodes per subinterval for the spline classes $S_{2N, 0}$ and $S_{2N+1, 1}$, i.e. even and odd degree are presented. Also rules for the 2 missing spline classes $S_{2N-1, 0}$ and $S_{2N, 1}$ (the so called 1/2-rules), i.e. odd and even degree are presented. These quadrature rules are explicit in the sense, that they compute the nodes and their weights in the first/last boundary subinterval and, via a recursion the other nodes/weights, parsing from the first/last subinterval to the middle of the interval. These closed formulae are based on the semi-classical Jacobi type orthogonal polynomials.

math.NA