English
Related papers

Related papers: Solution of the propeller conjecture in $\mathbb{R…

200 papers

The parity of the partition function $p(n)$ remains strikingly mysterious. Beyond a handful of fragmentary results, essentially nothing is known about the distribution of parity. We prove a uniform result on quadratic progressions. If…

Number Theory · Mathematics 2025-10-06 Ken Ono

This paper begins with a class of convex quadratic programs (QPs) with bounded variables solvable by the parametric principal pivoting algorithm with $\mathcal{O}(n^3)$ strongly polynomial complexity, where $n$ is the number of variables of…

Optimization and Control · Mathematics 2022-09-28 Jong-Shi Pang , Shaoning Han

Let $A$ be a finite-dimensional algebra over an algebraically closed field. The problem of constructing indecomposable $A$-modules inductively from simple ones by means of exact sequences - called accessibility - is the starting point of…

Representation Theory · Mathematics 2014-01-07 Wolfgang Peternell

Given a set of points, clustering consists of finding a partition of a point set into $k$ clusters such that the center to which a point is assigned is as close as possible. Most commonly, centers are points themselves, which leads to the…

Machine Learning · Computer Science 2023-10-16 Maria Sofia Bucarelli , Matilde Fjeldsø Larsen , Chris Schwiegelshohn , Mads Bech Toftrup

We study the iterated blow-up X of projective space along an arbitrary collection of linear subspaces. By replacing the universal torsor with an $\mathbb{A}^1$-homotopy equivalent model, built from $\mathbb{A}^1$-fiber bundles not just…

Algebraic Geometry · Mathematics 2014-01-06 Brent Doran , Noah Giansiracusa

For a partition $\underline{\lambda} = (\lambda_{1}^{\rho _1}>\lambda_{2}^{\rho _2}>\lambda_{3}^{\rho _3}>\ldots>\lambda_{k}^{\rho _k})$ and its associated finite $\mathcal{R}$-module…

Combinatorics · Mathematics 2021-07-07 C P Anil Kumar

For any $n\in \mathbb{N}$, $n\geq 2$, we construct a real analytic, one-parameter family of compact embedded CMC annuli with free boundary in the unit ball $\mathbb{B}^3$ of $\mathbb{R}^3$ with a prismatic symmetry group of order $4n$.…

Differential Geometry · Mathematics 2022-12-16 Alberto Cerezo , Isabel Fernandez , Pablo Mira

Following attempts at an analytic proof of the Pentagonal Number Theorem, we report on the discovery of a general principle leading to an unexpected cancellation of oscillating sums. After stating the motivation, and our theorem, we apply…

Number Theory · Mathematics 2022-06-24 Ernie Croot , Hamed Mousavi

We prove that any three dimensional terminal singularity $P \in X$ can be resolved by a sequence of divisorial contractions with minimal discrepancies which are weighted blowups over points.

Algebraic Geometry · Mathematics 2013-10-25 Jungkai Alfred Chen

We show boundedness for PT-semistable objects of any Chern classes on a smooth projective three-fold $X$. Then we show that the stack of objects in the heart $\langle \Coh_{\leq 1}(X), \Coh_{\geq 2}(X)[1] \rangle$ satisfies a version of the…

Algebraic Geometry · Mathematics 2011-12-21 Jason Lo

Let $R=k[x,y,z]$ be a standard graded $3$-variable polynomial ring, where $k$ denotes any field. We study grade $3$ homogeneous ideals $I \subseteq R$ defining compressed rings with socle $k(-s)^{\ell} \oplus k(-2s+1)$, where $s \geq3$ and…

Commutative Algebra · Mathematics 2021-05-28 Keller VandeBogert

The popular 3SUM conjecture states that there is no strongly subquadratic time algorithm for checking if a given set of integers contains three distinct elements $x_1, x_2, x_3$ such that $x_1+x_2=x_3$. A closely related problem is to check…

Data Structures and Algorithms · Computer Science 2025-04-24 Bartłomiej Dudek , Paweł Gawrychowski , Tatiana Starikovskaya

Applications of harmonic analysis on finite groups were recently introduced to measure partition problems, with a variety of equipartition types by convex fundamental domains obtained as the vanishing of prescribed Fourier transforms.…

Metric Geometry · Mathematics 2015-11-10 Steven Simon

A major research area in discrete geometry is to consider the best way to partition the $d$-dimensional Euclidean space $\mathbb{R}^d$ under various quality criteria. In this paper we introduce a new type of space partitioning that is…

Computational Geometry · Computer Science 2025-10-23 Orr Dunkelman , Zeev Geyzel , Chaya Keller , Nathan Keller , Eyal Ronen , Adi Shamir , Ran J. Tessler

Clustering with capacity constraints is a fundamental problem that attracted significant attention throughout the years. In this paper, we give the first FPT constant-factor approximation algorithm for the problem of clustering points in a…

Data Structures and Algorithms · Computer Science 2024-02-21 Sayan Bandyapadhyay , William Lochet , Saket Saurabh

Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, we generalize the result of Vaughan for ternary admissible exponent. Moreover, we use the refined admissible…

Number Theory · Mathematics 2020-03-31 Min Zhang , Jinjiang Li

We study colorful no-dimensional Tverberg-type problems and obtain several optimal results. A colorful no-dimensional Tverberg-type theorem provides a bound on a radius $R$ such that, for any pairwise disjoint $k$-element subsets…

Metric Geometry · Mathematics 2025-09-29 Polina Barabanshchikova , Grigory Ivanov , Alexander Polyanskii

Symmetry problems in harmonic analysis are formulated and solved. One of these problems is equivalent to the refined Schiffer's conjecture which was recently proved by the author. Let $k=const>0$ be fixed, $S^2$ be the unit sphere in…

Analysis of PDEs · Mathematics 2019-04-26 Alexander G. Ramm

Ramanujan (and others) proved that the partition function satisfies a number of striking congruences modulo powers of 5, 7 and 11. A number of further congruences were shown by the works of Atkin, O'Brien, and Newman. In this paper we prove…

Number Theory · Mathematics 2007-05-23 Ken Ono

The 3SUM problem represents a class of problems conjectured to require $\Omega (n^2)$ time to solve, where $n$ is the size of the input. Given two polygons $P$ and $Q$ in the plane, we show that some variants of the decision problem,…

Computational Geometry · Computer Science 2025-12-17 Gill Barequet , Sariel Har-Peled