LHLorenz Halbeisen

Lorenz Halbeisen

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Lorenz Halbeisen has a total of 33 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Integer triangles with a rational ratio of circumcircle radius to excircle radius

    by Lorenz Halbeisen, Norbert Hungerbühler, Arman Shamsi Zargar

  • A NEW WEAK CHOICE PRINCIPLE

    by Lorenz Halbeisen, Riccardo Plati, Salome Schumacher

    For every natural number n we introduce a new weak choice principle n upper R upper C Subscript f i n $\mathrm {nRC_{fin}}$ n R C f i n : Given any infinite set x , there is an infinite subset y subset of or equal to x $y\subseteq x$ y ⊆ x and a selection function f that chooses an n-element subset from every finite z subset of or equal to y $z\subseteq y$ z ⊆ y containing at least n elements. By constructing new permutation models built on a set of atoms obtained as Fraïssé limits, we will study the relation of n upper R upper C Subscript f i n $\mathrm {nRC_{fin}}$ n R C f i n to the weak choice principles upper R upper C Subscript m $\mathrm {RC_m}$ R C m (that has already been studied in [3] and [6]): Given any infinite set x , there is an infinite subset y subset of or equal to x $y\subseteq x$ y ⊆ x with a choice function f on the family of all m-element subsets of y . Moreover, we prove a stronger analogue of the results in [6] when we study the relation between n upper R upper C Subscript f i n $\mathrm {nRC_{fin}}$ n R C f i n and k upper C Subscript f i n Superscript minus $\mathrm {kC_{fin}^-}$ k C f i n − which is defined by Given any infinite family script upper F $\mathcal {F}$ F of finite sets of cardinality greater than k , there is an infinite subfamily script upper A subset of or equal to script upper F $\mathcal {A}\subseteq \mathcal {F}$ A ⊆ F with a selection function f that chooses a k-element subset from each upper A element of script upper A $A\in \mathcal {A}$ A ∈ A .

  • Open Access

    Integer triangles with a rational ratio of circumcircle radius to excircle radius

    by Lorenz Halbeisen, Norbert Hungerbühler, Arman Shamsi Zargar

    We consider the problem of finding integer triangles with $R/r$ a positive rational, where $R$ and $r$ are the radii of the circumcircle and an excircle, respectively. We show that for general triangles $R/r>1/4$ applies. The equation $R/r=N$ turns out to be related to the elliptic curve $\mathcal{E}_N$ given by $v^2=u^3+2(2N^2+2N-1)u^2-(4N-1)u$. If $N>1/4$ is rational, then the torsion group of $\mathcal{E}_N$ is $\mathbb Z/2\mathbb Z\times\mathbb Z/6\mathbb Z$ if $N(N+2)$ is a square and $\mathbb Z/6\mathbb Z$ otherwise. We show that a rational triangle with rational ratio $R/r=N$ exists if and only if $N>1/4$ and there exists a rational non-torsion point on the curve $\mathcal{E}_N$ which satisfies a certain condition. Furthermore, we show that the rank of $\mathcal{E}_N$ is positive when $N = m^2 \pm 1>1/4$ for a rational $m$. We also show that on every curve $\mathcal{E}_N$ whose rank is positive, there are infinitely many rational points which lead to infinitely many non-similar integer triangles with $R/r=N$.

  • Open Access

    There may be exactly $n$ $Q$-points

    by Lorenz Halbeisen, Silvan Horvath, Tan Özalp

    We generalize the main result of arXiv:2505.17960 and show the consistency of the statement ``There are exactly $n$ $Q$-points up to isomorphism" for any finite $n$. Furthermore, we show that the above statement for $n=2$ can alternatively be obtained by a length-$ω_2$ countable support iteration of Matet-Mathias forcing restricted to a Matet-adequate family.

  • Construction of a quadrilateral from its sides and the diagonal angle

    by Lorenz Halbeisen, Norbert Hungerbühler, Juan Läuchli

    Lorenz Halbeisen, Norbert Hungerbühler, Juan Läuchli

  • Open Access

    Solving the quartic by conics

    by Lorenz Halbeisen, Norbert Hungerbühler

    Two conic sections C 1 and C 2 in the Euclidean plane that pass through two given points can generally have two further points of intersection. It is shown how these can be constructed using compass and ruler. The idea is to construct the degenerate conics in the pencil of the two conics C 1 and C 2 . Their intersections are then the four intersection points of C 1 and C 2 . The same idea is then used to reduce a general quartic equation to a cubic equation and to solve it. This is performed by interpreting the solutions of the quartic as intersections of two complex conic sections. The degenerate complex conics in their pencil can then be found through a cubic equation.

  • Open Access

    Pairing powers of pythagorean pairs

    by Lorenz Halbeisen, Norbert Hungerbühler, Arman Shamsi Zargar

  • Open Access

    Twins of conic hexagons

    by Lorenz Halbeisen, Norbert Hungerbühler

    Six points on a conic section define 60 different hexagons and therefore 60 Pascal lines. Each Pascal line passes through three of the 45 intersections of connecting lines of the six given points. Instead of searching for collinear triples (Pascal lines) among these 45 points, we identify and classify all six-tuples among the 45 points that lie on a conic section. These six-tuples will be called Pascal twins of the given six points. It turns out that there are also six-tuples that lie on a conic section that have two points in common with the given six points. These six-tuples are called Siamese Pascal twins for evident reasons.

  • Open Access

    Implications of Ramsey Choice principles in ZF$\mathsf {ZF}$

    by Lorenz Halbeisen, Riccardo Plati, Saharon Shelah

    The Ramsey Choice principle for families of ‐element sets, denoted , states that every infinite set has an infinite subset with a choice function on . We investigate for which positive integers and the implication is provable in . It will turn out that beside the trivial implications , under the assumption that every odd integer is the sum of three primes (known as ternary Goldbach conjecture), the only non‐trivial implication which is provable in is .


  • Open Access

    A Worked out Galois Group for the Classroom

    by Lorenz Halbeisen, Norbert Hungerbühler

    1 Teaching Galois theory, one often has the problem that the Galois group of a field extension of Q is either quite simple or too difficult to be computed by hand. An example of a Galois group whic...