More Like this

1. Rational points on hyperelliptic Atkin-Lehner quotients of modular curves and their coverings

   https://doi.org/10.1007/s40993-022-00388-9  

   Adžaga, Nikola; Chidambaram, Shiva; Keller, Timo; Padurariu, Oana (October 2022, Research in Number Theory)

   Abstract We complete the computation of all$$\mathbb {Q}$$ $Q$-rational points on all the 64 maximal Atkin-Lehner quotients$$X_0(N)^*$$ $X_0{\left(N\right)}^{\ast }$such that the quotient is hyperelliptic. To achieve this, we use a combination of various methods, namely the classical Chabauty–Coleman, elliptic curve Chabauty, quadratic Chabauty, and the bielliptic quadratic Chabauty method (from a forthcoming preprint of the fourth-named author) combined with the Mordell-Weil sieve. Additionally, for square-free levelsN, we classify all$$\mathbb {Q}$$ $Q$-rational points as cusps, CM points (including their CM field andj-invariants) and exceptional ones. We further indicate how to use this to compute the$$\mathbb {Q}$$ $Q$-rational points on all of their modular coverings. 

   more » « less
2. Spherical convex hull of random points on a wedge

   https://doi.org/10.1007/s00208-023-02704-9  

   Besau, Florian; Gusakova, Anna; Reitzner, Matthias; Schütt, Carsten; Thäle, Christoph; Werner, Elisabeth_M (August 2023, Mathematische Annalen)

   Abstract Consider two half-spaces$$H_1^+$$ $H_1^{+}$and$$H_2^+$$ $H_2^{+}$in$${\mathbb {R}}^{d+1}$$ $R^{d+1}$whose bounding hyperplanes$$H_1$$ $H_1$and$$H_2$$ $H_2$are orthogonal and pass through the origin. The intersection$${\mathbb {S}}_{2,+}^d:={\mathbb {S}}^d\cap H_1^+\cap H_2^+$$ $S_{2,+}^d:=S^d\cap H_1^{+}\cap H_2^{+}$is a spherical convex subset of thed-dimensional unit sphere$${\mathbb {S}}^d$$ $S^d$, which contains a great subsphere of dimension$$d-2$$ $d-2$and is called a spherical wedge. Choosenindependent random points uniformly at random on$${\mathbb {S}}_{2,+}^d$$ $S_{2,+}^d$and consider the expected facet number of the spherical convex hull of these points. It is shown that, up to terms of lower order, this expectation grows like a constant multiple of$$\log n$$ $logn$. A similar behaviour is obtained for the expected facet number of a homogeneous Poisson point process on$${\mathbb {S}}_{2,+}^d$$ $S_{2,+}^d$. The result is compared to the corresponding behaviour of classical Euclidean random polytopes and of spherical random polytopes on a half-sphere. 

   more » « less
3. Undecidable Translational Tilings with Only Two Tiles, or One Nonabelian Tile

   https://doi.org/10.1007/s00454-022-00426-4  

   Greenfeld, Rachel; Tao, Terence (January 2023, Discrete & Computational Geometry)

   Abstract We construct an example of a group$$G = \mathbb {Z}^2 \times G_0$$ $G=Z^2\times G_0$for a finite abelian group $$G_0$$ $G_0$, a subsetEof $$G_0$$ $G_0$, and two finite subsets$$F_1,F_2$$ $F_1,F_2$of G, such that it is undecidable in ZFC whether$$\mathbb {Z}^2\times E$$ $Z^2\times E$can be tiled by translations of$$F_1,F_2$$ $F_1,F_2$. In particular, this implies that this tiling problem isaperiodic, in the sense that (in the standard universe of ZFC) there exist translational tilings ofEby the tiles$$F_1,F_2$$ $F_1,F_2$, but no periodic tilings. Previously, such aperiodic or undecidable translational tilings were only constructed for sets of eleven or more tiles (mostly in $$\mathbb {Z}^2$$ $Z^2$). A similar construction also applies for$$G=\mathbb {Z}^d$$ $G=Z^d$for sufficiently large d. If one allows the group$$G_0$$ $G_0$to be non-abelian, a variant of the construction produces an undecidable translational tiling with only one tile F. The argument proceeds by first observing that a single tiling equation is able to encode an arbitrary system of tiling equations, which in turn can encode an arbitrary system of certain functional equations once one has two or more tiles. In particular, one can use two tiles to encode tiling problems for an arbitrary number of tiles. 

   more » « less
4. Generalized Parking Function Polytopes

   https://doi.org/10.1007/s00026-023-00671-1  

   Hanada, Mitsuki; Lentfer, John; Vindas-Meléndez, Andrés_R (November 2023, Annals of Combinatorics)

   Abstract A classical parking function of lengthnis a list of positive integers$$(a_1, a_2, \ldots , a_n)$$ $(a_1,a_2,\dots ,a_n)$whose nondecreasing rearrangement$$b_1 \le b_2 \le \cdots \le b_n$$ $b_1\le b_2\le \cdots \le b_n$satisfies$$b_i \le i$$ $b_i\le i$. The convex hull of all parking functions of lengthnis ann-dimensional polytope in$${\mathbb {R}}^n$$ $R^n$, which we refer to as the classical parking function polytope. Its geometric properties have been explored in Amanbayeva and Wang (Enumer Combin Appl 2(2):Paper No. S2R10, 10, 2022) in response to a question posed by Stanley (Amer Math Mon 127(6):563–571, 2020). We generalize this family of polytopes by studying the geometric properties of the convex hull of$${\textbf{x}}$$ $x$-parking functions for$${\textbf{x}}=(a,b,\dots ,b)$$ $x=(a,b,\cdots ,b)$, which we refer to as$${\textbf{x}}$$ $x$-parking function polytopes. We explore connections between these$${\textbf{x}}$$ $x$-parking function polytopes, the Pitman–Stanley polytope, and the partial permutahedra of Heuer and Striker (SIAM J Discrete Math 36(4):2863–2888, 2022). In particular, we establish a closed-form expression for the volume of$${\textbf{x}}$$ $x$-parking function polytopes. This allows us to answer a conjecture of Behrend et al. (2022) and also obtain a new closed-form expression for the volume of the convex hull of classical parking functions as a corollary. 

   more » « less
5. Sparse representation of vectors in lattices and semigroups

   https://doi.org/10.1007/s10107-021-01657-8  

   Aliev, Iskander; Averkov, Gennadiy; De_Loera, Jesús_A; Oertel, Timm (May 2021, Mathematical Programming)

   Abstract We study the sparsity of the solutions to systems of linear Diophantine equations with and without non-negativity constraints. The sparsity of a solution vector is the number of its nonzero entries, which is referred to as the$$\ell _0$$ ${\ell }_0$-norm of the vector. Our main results are new improved bounds on the minimal$$\ell _0$$ ${\ell }_0$-norm of solutions to systems$$A\varvec{x}=\varvec{b}$$ $Ax=b$, where$$A\in \mathbb {Z}^{m\times n}$$ $A\in Z^{m\times n}$,$${\varvec{b}}\in \mathbb {Z}^m$$ $b\in Z^m$and$$\varvec{x}$$ $x$is either a general integer vector (lattice case) or a non-negative integer vector (semigroup case). In certain cases, we give polynomial time algorithms for computing solutions with$$\ell _0$$ ${\ell }_0$-norm satisfying the obtained bounds. We show that our bounds are tight. Our bounds can be seen as functions naturally generalizing the rank of a matrix over$$\mathbb {R}$$ $R$, to other subdomains such as$$\mathbb {Z}$$ $Z$. We show that these new rank-like functions are all NP-hard to compute in general, but polynomial-time computable for fixed number of variables. 

   more » « less