English
Related papers

Related papers: On the orthogonal Gr\"unbaum partition problem in …

200 papers

In this article, we study an opposite problem of universal quantum state comparison, that is unambiguous determining whether multiple unknown quantum states from a Hilbert space are orthogonal or not. We show that no unambiguous quantum…

Quantum Physics · Physics 2015-06-05 Shengshi Pang , Shengjun Wu

The noncommutative space $\mathbb{R}^3_\lambda$, a deformation of $\mathbb{R}^3$, supports a $3$-parameter family of gauge theory models with gauge-invariant harmonic term, stable vacuum and which are perturbatively finite to all orders.…

Mathematical Physics · Physics 2016-12-20 Jean-Christophe Wallet

We prove that the v-decomposition number $d_{\lambda\mu}(v)$ is an even or odd polynomial according to whether the partitions $\lambda$ and $\mu$ have the same relative sign (or parity) or not. We then use this result to verify Martin's…

Representation Theory · Mathematics 2007-05-23 Kai Meng Tan

Inspired by Armin Straub's conjecture (arXiv:1601.07161) about the number and maximal size of (2n+1, 2n+3)-core partitions with distinct parts, we develop relatively efficient, symbolic-computational algorithms, based on non-linear…

Combinatorics · Mathematics 2016-12-12 Anthony Zaleski , Doron Zeilberger

Heim, Neuhauser, and Tr\"oger recently established some inequalities for MacMahon's plane partition function $\mathrm{PL}(n)$ that generalize known results for Euler's partition function $p(n)$. They also conjectured that $\mathrm{PL}(n)$…

Number Theory · Mathematics 2022-09-13 Ken Ono , Sudhir Pujahari , Larry Rolen

Since the theorems of Schur and van der Waerden, numerous partition regularity results have been proved for linear equations, but progress has been scarce for non-linear ones, the hardest case being equations in three variables. We prove…

Combinatorics · Mathematics 2014-03-07 Nikos Frantzikinakis , Bernard Host

The Satisfactory Partition problem consists in deciding if the set of vertices of a given undirected graph can be partitioned into two nonempty parts such that each vertex has at least as many neighbours in its part as in the other part.…

Data Structures and Algorithms · Computer Science 2020-07-29 Ajinkya Gaikwad , Soumen Maity , Shuvam Kant Tripathi

We show that any $d$-colored set of points in general position in $\mathbb{R}^d$ can be partitioned into $n$ subsets with disjoint convex hulls such that the set of points and all color classes are partitioned as evenly as possible. This…

Combinatorics · Mathematics 2019-04-04 Pavle V. M. Blagojević , Günter Rote , Johanna K. Steinmeyer , Günter M. Ziegler

The problem of the existence of an equi-partition of a curve in $\R^n$ has recently been raised in the context of computational geometry. The problem is to show that for a (continuous) curve $\Gamma : [0,1] \to \R^n$ and for any positive…

Computational Geometry · Computer Science 2008-07-15 M. A. Lopez , S. Reisner

The n-way number partitioning problem, a fundamental challenge in combinatorial optimization, has significant implications for applications such as fair division and machine scheduling. Despite these problems being NP-hard, many…

Data Structures and Algorithms · Computer Science 2025-04-04 Samuel Bismuth , Erel Segal-Halevi , Dana Shapira

Two kinds of approximation algorithms exist for the k-BALANCED PARTITIONING problem: those that are fast but compute unsatisfying approximation ratios, and those that guarantee high quality ratios but are slow. In this paper we prove that…

Computational Complexity · Computer Science 2019-04-29 Andreas Emil Feldmann

The Erd\H os unit distance conjecture in the plane says that the number of pairs of points from a point set of size $n$ separated by a fixed (Euclidean) distance is $\leq C_{\epsilon} n^{1+\epsilon}$ for any $\epsilon>0$. The best known…

Classical Analysis and ODEs · Mathematics 2017-09-26 Alex Iosevich

The famous partition theorem of Euler states that partitions of $n$ into distinct parts are equinumerous with partitions of $n$ into odd parts. Another famous partition theorem due to MacMahon states that the number of partitions of $n$…

Combinatorics · Mathematics 2023-10-16 Shi-Chao Chen

Let $L$ be a set of $n$ axis-parallel lines in $\mathbb{R}^3$. We are are interested in partitions of $\mathbb{R}^3$ by a set $H$ of three planes such that each open cell in the arrangement $\mathcal{A}(H)$ is intersected by as few lines…

Computational Geometry · Computer Science 2023-12-25 Boris Aronov , Abdul Basit , Mark de Berg , Joachim Gudmundsson

We generalize the ham sandwich theorem to $d+1$ measures in $\mathbb{R}^d$ as follows. Let $\mu_1,\mu_2, \dots, \mu_{d+1}$ be absolutely continuous finite Borel measures on $\mathbb{R}^d$. Let $\omega_i=\mu_i(\mathbb{R}^d)$ for $i\in…

Metric Geometry · Mathematics 2018-12-18 Mikio Kano , Jan Kynčl

We introduce a new Partition of Unity Method for the numerical homogenization of elliptic partial differential equations with arbitrarily rough coefficients. We do not restrict to a particular ansatz space or the existence of a finite…

Numerical Analysis · Mathematics 2016-05-04 Daniel Peterseim , Patrick Henning , Philipp Morgenstern

A partition of $n$ is $l$-regular if none of its parts is divisible by $l$. Let $b_l(n)$ denote the number of $l$-regular partitions of $n$. In this paper, using the theory of Hecke eigenforms explored by J.-P. Serre, we establish exact…

Number Theory · Mathematics 2020-06-30 Sarma Abinash

We show that among any $n$ points in the unit cube one can find a triangle of area at most $n^{-2/3-c}$ for some absolute constant $c >0$. This gives the first non-trivial upper bound for the three-dimensional version of Heilbronn's…

Combinatorics · Mathematics 2025-10-31 Dominique Maldague , Hong Wang , Dmitrii Zakharov

An upward equilateral triangle of side $n$ can be partitioned into $n$ unit upward equilateral triangles and $\frac{n(n-1)}{2}$ unit rhombi with $60^{\circ}$ and $120^{\circ}$ angles. In this paper, we focus on understanding such partitions…

Combinatorics · Mathematics 2026-02-04 Yuan Yao , Fedir Yudin

Let $k, t$ be coprime integers, and let $1 \leq r \leq t$. We let $D_k^\times(r,t;n)$ denote the total number of parts among all $k$-indivisible partitions (i.e., those partitions where no part is divisible by $k$) of $n$ which are…

Combinatorics · Mathematics 2023-05-11 Faye Jackson , Misheel Otgonbayar
‹ Prev 1 3 4 5 6 7 10 Next ›