arXiv subjects

Benjamin Matschke

Publications and source records attributed to Benjamin Matschke.

16 recordsLinked to original sources

arXiv2023

Quadratic Fields Admitting Elliptic Curves with Rational $j$-Invariant and Good Reduction Everywhere

Clemm and Trebat-Leder (2014) proved that the number of quadratic number fields with absolute discriminant bounded by $x$ over which there exist elliptic curves with good reduction everywhere and rational $j$-invariant is $\gg x\log^{-1/2}(x)$. In this paper, we assume the $abc$-conjecture to show the sharp asymptotic $\sim cx\log^{-1/2}(x)$ for this number, obtaining formulae for $c$ in both the real and imaginary cases. Our method has three ingredients: (1) We make progress towards a conjecture of Granville: Given a fixed elliptic curve $E/\mathbb{Q}$ with short Weierstrass equation $y^2 = f(x)$ for reducible $f \in \mathbb{Z}[x]$, we show that the number of integers $d$, $|d| \leq D$, for which the quadratic twist $dy^2 = f(x)$ has an integral non-$2$-torsion point is at most $D^{2/3+o(1)}$, assuming the $abc$-conjecture. (2) We apply the Selberg--Delange method to obtain a Tauberian theorem which allows us to count integers satisfying certain congruences while also being divisible only by certain primes. (3) We show that for a polynomially sparse subset of the natural numbers, the number of pairs of elements with least common multiple at most $x$ is $O(x^{1-ε})$ for some $ε> 0$. We also exhibit a matching lower bound. If instead of the $abc$-conjecture we assume a particular tail bound, we can prove all the aforementioned results and that the coefficient $c$ above is greater in the real quadratic case than in the imaginary quadratic case, in agreement with an experimentally observed bias.

math.NT↗

arXiv2022

On the Square Peg Problem and Its Relatives

Toeplitz's Square Peg Problem asks whether every continuous simple closed curve in the plane contains the four vertices of a square. It has been proved for various classes of sufficiently smooth curves, some of which are dense, none of which are open. In this paper we prove it for several open classes of curves, one of which is also dense. This can be interpreted in saying that the Square Peg Problem is solved for generic curves. The latter class contains all previously known classes for which the Square Peg Problem has been proved in the affirmative. [footnote] We also prove results about rectangles inscribed in immersed curves. Finally, we show that the problem of finding a regular octahedron on metric 2-spheres has a "topological counter-example", that is, a certain test map with boundary condition exists.

math.MG↗

arXiv2022

Successive Spectral Sequences

In this paper, we develop a structure theory for generalized spectral sequences, which are derived from chain complexes that are filtered over arbitrary partially ordered sets. Also, a more general construction method reminiscent of exact couples is studied, together with examples where they arise naturally. As for ordinary spectral sequences we will see differentials and group extensions, however the real power comes from the appearance of natural isomorphims between pages of differing indices. The constructions reveal finer invariants than ordinary spectral sequences, and they connect to other fields such as Fary functors and perverse sheaves. They are based on a natural index scheme, which allows us to obtain new results even in the standard case of Z-filtered chain complexes, e.g. a useful criterion for a product structure for Grothendieck's spectral sequences, and news paths to connect the first or second page to the limit. This turns out to yield the right framework for unifying several spectral sequences that one would usually apply one after another. Examples that we work out are successive Leray--Serre spectral sequences, the Adams--Novikov spectral sequence following the chromatic spectral sequence, successive Grothendieck spectral sequences, and successive Eilenberg--Moore spectral sequences.

math.AT↗

arXiv2021

Higher spectral sequences

In this article we construct what we call a higher spectral sequence for any chain complex (or topological space) that is filtered in $n$ compatible ways. For this we extend the previous spectral system construction of the author, and we show that it admits considerably more differentials than what was previously known. As a result, this endows the successive Leray--Serre, Grothendieck, chromatic--Adams--Novikov, and Eilenberg--Moore spectral sequences of the author with the structure of a higher spectral sequence. Another application is a universal coefficient theorem analog for spectral sequences.

math.AT↗

arXiv2020

Quadrilaterals inscribed in convex curves

We classify the set of quadrilaterals that can be inscribed in convex Jordan curves, in the continuous as well as in the smooth case. This answers a question of Makeev in the special case of convex curves. The difficulty of this problem comes from the fact that standard topological arguments to prove the existence of solutions do not apply here due to the lack of sufficient symmetry. Instead, the proof makes use of an area argument of Karasev and Tao, which we furthermore simplify and elaborate on. The continuous case requires an additional analysis of the singular points, and a small miracle, which then extends to show that the problems of inscribing isosceles trapezoids in smooth curves and in piecewise $C^1$ curves are equivalent.

math.MG↗

arXiv2020

Computing integral points on X_ns^+(p)

We describe an algorithm for computing integral points on the modular curve of prime level p associated to the normalizer of a non-split Cartan subgroup of GL_2(F_p). Using our method, we show that for 7<p<101 the only integral points on this curve are the CM-points.

math.NT↗

arXiv2020

Elliptic curves with good reduction outside of the first six primes

We present a database of rational elliptic curves, up to Q-isomorphism, with good reduction outside {2,3,5,7,11,13}. We provide a heuristic involving the abc and BSD conjectures that the database is likely to be the complete set of such curves. Moreover, proving completeness likely needs only more computation time to conclude. We present data on the distribution of various quantities associated to curves in the set. We also discuss the connection to S-unit equations and the existence of rational elliptic curves with maximal conductor.

math.NT↗

arXiv2019

Proofs by example

We study the proof scheme "proof by example" in which a general statement can be proved by verifying it for a single example. This strategy can indeed work if the statement in question is an algebraic identity and the example is "generic". This article addresses the problem of constructing a practical example, which is sufficiently generic, for which the statement can be verified efficiently, and which even allows for a numerical margin of error. Our method is based on diophantine geometry, in particular an arithmetic Bézout theorem, an arithmetic Nullstellensatz, and a new effective Liouville-Lojasiewicz type inequality for algebraic varieties. As an application we discuss theorems from plane geometry and how to prove them by example.

math.NT↗

arXiv2016

Solving S-unit, Mordell, Thue, Thue-Mahler and generalized Ramanujan-Nagell equations via Shimura-Taniyama conjecture

In the first part we construct algorithms which we apply to solve S-unit, Mordell, cubic Thue, cubic Thue-Mahler and generalized Ramanujan-Nagell equations. As a byproduct we obtain alternative practical approaches for various classical Diophantine problems, including the fundamental problem of finding all elliptic curves over Q with good reduction outside a given finite set of rational primes. To illustrate the utility of our algorithms we determined the solutions of large classes of equations, containing many examples of interest which are out of reach for the known methods. In addition we used the resulting data to motivate various conjectures and questions, including Baker's explicit abc-conjecture and a new conjecture on S-integral points of any hyperbolic genus one curve over Q. In the second part we establish new results for certain old Diophantine problems (e.g. the difference of squares and cubes) related to Mordell equations, and we prove explicit height bounds for cubic Thue, cubic Thue--Mahler and generalized Ramanujan--Nagell equations. As a byproduct, we obtain here an alternative proof of classical theorems of Baker, Coates and Vinogradov-Sprindzuk. In fact we get refined versions of their theorems, which improve the actual best results in many fundamental cases. Our results and algorithms all ultimately rely on the method of Faltings (Arakelov, Parshin, Szpiro) combined with the Shimura-Taniyama conjecture, and they all do not use lower bounds for linear forms in (elliptic) logarithms. In the third part we solve the problem of constructing an efficient sieve for the S-integral points of bounded height on any elliptic curve E over Q with given Mordell-Weil basis of E(Q).

math.NT↗

arXiv2014

Optimal bounds for the colored Tverberg problem

We prove a "Tverberg type" multiple intersection theorem. It strengthens the prime case of the original Tverberg theorem from 1966, as well as the topological Tverberg theorem of Barany et al. (1980), by adding color constraints. It also provides an improved bound for the (topological) colored Tverberg problem of Barany & Larman (1992) that is tight in the prime case and asymptotically optimal in the general case. The proof is based on relative equivariant obstruction theory.

math.CO↗

arXiv2013

The width of 5-dimensional prismatoids

Santos' construction of counter-examples to the Hirsch Conjecture (2012) is based on the existence of prismatoids of dimension d of width greater than d. Santos, Stephen and Thomas (2012) have shown that this cannot occur in $d \le 4$. Motivated by this we here study the width of 5-dimensional prismatoids, obtaining the following results: - There are 5-prismatoids of width six with only 25 vertices, versus the 48 vertices in Santos' original construction. This leads to non-Hirsch polytopes of dimension 20, rather than the original dimension 43. - There are 5-prismatoids with $n$ vertices and width $Ω(\sqrt{n})$ for arbitrarily large $n$. Hence, the width of 5-prismatoids is unbounded.

math.CO↗

arXiv2012

Projective center point and Tverberg theorems

We present projective versions of the center point theorem and Tverberg's theorem, interpolating between the original and the so-called "dual" center point and Tverberg theorems. Furthermore we give a common generalization of these and many other known (transversal, constraint, dual, and colorful) Tverberg type results in a single theorem, as well as some essentially new results about partitioning measures in projective space.

math.AT↗

arXiv2011

A tight colored Tverberg theorem for maps to manifolds

We prove that any continuous map of an N-dimensional simplex Delta_N with colored vertices to a d-dimensional manifold M must map r points from disjoint rainbow faces of Delta_N to the same point in M: For this we have to assume that N \geq (r-1)(d+1), no r vertices of Delta_N get the same color, and our proof needs that r is a prime. A face of Delta_N is a rainbow face if all vertices have different colors. This result is an extension of our recent "new colored Tverberg theorem", the special case of M=R^d. It is also a generalization of Volovikov's 1996 topological Tverberg theorem for maps to manifolds, which arises when all color classes have size 1 (i.e., without color constraints); for this special case Volovikov's proof, as well as ours, work when r is a prime power.

math.CO↗

arXiv2010

Prodsimplicial-Neighborly Polytopes

Simultaneously generalizing both neighborly and neighborly cubical polytopes, we introduce PSN polytopes: their k-skeleton is combinatorially equivalent to that of a product of r simplices. We construct PSN polytopes by three different methods, the most versatile of which is an extension of Sanyal and Ziegler's "projecting deformed products" construction to products of arbitrary simple polytopes. For general r and k, the lowest dimension we achieve is 2k+r+1. Using topological obstructions similar to those introduced by Sanyal to bound the number of vertices of Minkowski sums, we show that this dimension is minimal if we additionally require that the PSN polytope is obtained as a projection of a polytope that is combinatorially equivalent to the product of r simplices, when the dimensions of these simplices are all large compared to k.

math.MG↗

arXiv2009

A Note on Masspartitions by Hyperplanes

A triple of positive integers (d,h,m) is admissible if for any m given masses in R^d there exist h hyperplanes that cut each of these masses into 2^h equal pieces. We present an elementary reduction which combined with results by Ramos (1996) yields all the admissible triples that were known up to now (with one exception) as well as new ones.

math.CO↗

arXiv2009

Optimal bounds for a colorful Tverberg--Vrecica type problem

We prove the following optimal colorful Tverberg-Vrecica type transversal theorem: For prime r and for any k+1 colored collections of points C^l of size |C^l|=(r-1)(d-k+1)+1 in R^d, where each C^l is a union of subsets (color classes) C_i^l of size smaller than r, l=0,...,k, there are partition of the collections C^l into colorful sets F_1^l,...,F_r^l such that there is a k-plane that meets all the convex hulls conv(F_j^l), under the assumption that r(d-k) is even or k=0. Along the proof we obtain three results of independent interest: We present two alternative proofs for the special case k=0 (our optimal colored Tverberg theorem (2009)), calculate the cohomological index for joins of chessboard complexes, and establish a new Borsuk-Ulam type theorem for (Z_p)^m-equivariant bundles that generalizes results of Volovikov (1996) and Zivaljevic (1999).

math.AT↗