English
Related papers

Related papers: Covering three-tori with cubes

200 papers

We prove the infinitesimal Torelli theorem for general minimal complex surfaces X's with the first Chern number 3, the geometric genus 1, and the irregularity 0 which have non-trivial 3-torsion divisors. We also show that the coarse moduli…

Algebraic Geometry · Mathematics 2007-05-23 Masaaki Murakami

The support of minimizing measures of the causal variational principle on the sphere is analyzed. It is proven that in the case $\tau>\sqrt{3}$, the support of every minimizing measure is contained in a finite number of real analytic curves…

Classical Analysis and ODEs · Mathematics 2019-11-12 Lucia Bäuml , Felix Finster , Daniela Schiefeneder , Heiko von der Mosel

In 1989, B. White conjectured that every Riemannian 3-sphere has at least 5 embedded minimal tori. We confirm this conjecture for 3-spheres of positive Ricci curvature. While our proof uses min-max theory, the underlying heuristics are…

Differential Geometry · Mathematics 2025-08-01 Adrian Chun-Pong Chu , Yangyang Li

Using ideas from the geometry of compression, we improve on the current upper and lower bounds of the Heilbronn triangle problem. In particular, let $\Delta(s)$ denote the minimal area of the triangle induced by $s$ points on a unit disk.…

Number Theory · Mathematics 2026-05-07 Theophilus Agama

An effective upper bound is established for the least non-trivial integer solution to the system of cubic forms \[ \begin{cases} F = c_{1}x_1^3 + c_{2}x_2^3 + \cdots + c_{n}x_n^3 = 0, \\ G = d_{1}x_1^3 + d_{2}x_2^3 + \cdots + d_{n}x_n^3 =…

Number Theory · Mathematics 2026-02-24 Yixiu Xiao , Hongze Li

It is known that any surface knot can be transformed to an unknotted surface knot or a surface knot which has a diagram with no triple points by a finite number of 1-handle additions. The minimum number of such 1-handles is called the…

Geometric Topology · Mathematics 2013-05-21 Inasa Nakamura

An explicit upper bound is established for the least non-trivial integer zero of an arbitrary cubic form $C \in \mathbb{Z}[X_1,...,X_n],$ provided that $n \geq 14.$

Number Theory · Mathematics 2024-07-02 Yixiu Xiao , Hongze Li

A tuple (Z_1,...,Z_p) of matrices of size r is said to be a commuting extension of a tuple (A_1,...,A_p) of matrices of size n <r if the Z_i pairwise commute and each A_i sits in the upper left corner of a block decomposition of Z_i. This…

Data Structures and Algorithms · Computer Science 2024-01-03 Pascal Koiran

We derive formulas for the number of polycubes of size $n$ and perimeter $t$ that are proper in $n-1$ and $n-2$ dimensions. These formulas complement computer based enumerations of perimeter polynomials in percolation problems. We…

Combinatorics · Mathematics 2017-05-11 Sebastian Luther , Stephan Mertens

We prove new upper bounds for the number of representations of an arbitrary rational number as a sum of three unit fractions. In particular, for fixed $m$ there are at most $\mathcal{O}_{\epsilon}(n^{3/5+\epsilon})$ solutions of…

Number Theory · Mathematics 2018-05-09 Christian Elsholtz , Stefan Planitzer

We combine geometric methods with numerical box search algorithm to show that the minimal area of a convex set on the plane which can cover every closed plane curve of unit length is at least 0.0975. This improves the best previous lower…

Metric Geometry · Mathematics 2019-05-02 Bogdan Grechuk , Sittichoke Som-Am

In this short note, we prove several new congruences for the overcubic partition triples function, using both elementary techniques and the theory of modular forms. These extend the recent list of such congruences given by Nayaka,…

Number Theory · Mathematics 2025-09-10 Manjil P. Saikia , Abhishek Sarma

We show that there are $O(B^{3/5-3/1555+\ep})$ triples $(x,y,z)$ of square-full integesr up to $B$ satisfying the equation $x+y=z$ for any fixed $\ep>0$. This is the first improvement over the `easy' exponent $3/5$, given by Browning and…

Number Theory · Mathematics 2026-01-13 D. R. Heath-Brown

We prove a lower bound theorem for the number of $k$-faces ($1\le k\le d-2$) in a $d$-dimensional polytope $P$ (or $d$-polytope) with up to $3d-1$ vertices. Previous lower bound theorems for $d$-polytopes with few vertices concern those…

Combinatorics · Mathematics 2025-12-09 Guillermo Pineda-Villavicencio , Jie Wang

Ryser's Conjecture states that for any $r$-partite $r$-uniform hypergraph the vertex cover number is at most $r-1$ times the matching number. This conjecture is only known to be true for $r\leq 3$. For intersecting hypergraphs, Ryser's…

Combinatorics · Mathematics 2014-09-18 Ahmad Abu-Khazneh , Alexey Pokrovskiy

Each packing of R^d by translates of the unit cube [0,1)^d admits a decomposition into at most two parts such that if a translate of the unit cube is covered by one of them, then it also belongs to such a part.

Combinatorics · Mathematics 2009-02-12 Andrzej P. Kisielewicz , Krzysztof Przesławski

It was asked by Marques-Neves which min-max $p$-widths of the unit $3$-sphere lie strictly between $2\pi^2$ and $8\pi$. We show that the 10th to the 13th widths do. More generally, we prove stronger versions of X. Zhou's multiplicity one…

Differential Geometry · Mathematics 2025-10-16 Adrian Chun-Pong Chu , Yangyang Li

We denote by $\mathbb{F}_q$ the field with $q$ elements. A radius-$r$ extended ball with center in a $1$-dimensional vector subspace $V$ of $\mathbb{F}_q^3$ is the set of elements of $\mathbb{F}_q^3$ with Hamming distance to $V$ at most…

Combinatorics · Mathematics 2021-01-14 João Paulo Costalonga

It is possible to have a packing by translates of a cube that is maximal (i.e.\ no other cube can be added without overlapping) but does not form a tiling. In the long running analogy of packing and tiling to orthogonality and completeness…

Classical Analysis and ODEs · Mathematics 2025-03-27 Mihail N. Kolountzakis , Nir Lev , Máté Matolcsi

For a set $\cM=\{-\mu,-\mu+1,\ldots, \lambda\}\setminus\{0\}$ with non-negative integers $\lambda,\mu<q$ not both 0, a subset $\cS$ of the residue class ring $\Z_q$ modulo an integer $q\ge 1$ is called a $(\lambda,\mu;q)$-\emph{covering…

Information Theory · Computer Science 2013-10-02 Zhixiong Chen , Igor E. Shparlinski , Arne Winterhof
‹ Prev 1 4 5 6 7 8 10 Next ›