English
Related papers

Related papers: On the Yao-Yao partition theorem

200 papers

In this note we study the partition of $\mathbb{R}_{\geq0}^{n}$ given by the regions where the mixed test ideals $\tau(\mathfrak{a}_{1}^{t_{1}}... \mathfrak{a}_{n}^{t_{n}})$ are constant. We show that each region can be described as the…

Commutative Algebra · Mathematics 2012-12-05 Felipe Pérez

We show that the maximum likelihood degree of a smooth very affine variety is equal to the signed topological Euler characteristic. This generalizes Orlik and Terao's solution to Varchenko's conjecture on complements of hyperplane…

Algebraic Geometry · Mathematics 2019-02-20 June Huh

We introduce an extension of the P\'olya tree approach for constructing distributions on the space of probability measures. By using optional stopping and optional choice of splitting variables, the construction gives rise to random…

Statistics Theory · Mathematics 2010-10-05 Wing H. Wong , Li Ma

Let $(\Omega,\mathscr F,\mathbb P) $ be a probability space and let $(\mathscr F_n)$ be a binary filtration, i.e. exactly one atom of $\mathscr F_{n-1}$ is divided into two atoms of $\mathscr F_n$ without any restriction on their respective…

Functional Analysis · Mathematics 2024-12-20 Jacek Gulgowski , Anna Kamont , Markus Passenbrunner

We investigate general probabilistic theories in which every mixed state has a purification, unique up to reversible channels on the purifying system. We show that the purification principle is equivalent to the existence of a reversible…

Quantum Physics · Physics 2010-07-02 G. Chiribella , G. M. D'Ariano , P. Perinotti

The number partitioning problem is a classic problem of combinatorial optimization in which a set of $n$ numbers is partitioned into two subsets such that the sum of the numbers in one subset is as close as possible to the sum of the…

Disordered Systems and Neural Networks · Physics 2007-05-23 Christian Borgs , Jennifer Chayes , Stephan Mertens , Chandra Nair

We model the societal task of redistricting political districts as a partitioning problem: Given a set of $n$ points in the plane, each belonging to one of two parties, and a parameter $k$, our goal is to compute a partition $\Pi$ of the…

Data Structures and Algorithms · Computer Science 2021-12-16 Pankaj K. Agarwal , Shao-Heng Ko , Kamesh Munagala , Erin Taylor

We give a necessary and sufficient condition for a one-dimensional regular and Hausdorff topological space definable in a definably complete uniformly locally o-minimal structure of the second kind having definable bounded multiplication…

Logic · Mathematics 2021-11-01 Masato Fujita , Tomohiro Kawakami

It is presented the simplest known disproof of the Borsuk conjecture stating that if a bounded subset of n-dimensional Euclidean space contains more than n points, then the subset can be partitioned into n+1 nonempty parts of smaller…

Combinatorics · Mathematics 2018-10-02 A. Skopenkov

The well-known Landau-Yang (LY) theorem on the decay of a neutral particle into two photons is generalized for analyzing the decay of a neutral or charged particle into two identical massless particles of any spin. Selection rules…

High Energy Physics - Phenomenology · Physics 2021-05-19 Seong Youl Choi , Jae Hoon Jeong

We derive the limit shape of Young diagrams, associated with growing integer partitions, with respect to multiplicative probability measures underpinned by the generating functions of the form $\mathcal{F}(z)=\prod_{\ell=1}^\infty…

Probability · Mathematics 2014-05-05 Leonid V. Bogachev

The aim of this paper is to prove all well-known metrization theorems using partitions of unity. To accomplish this, we first discuss sufficient and necessary conditions for existence of $\mathcal{U}$-small partitions of unity (partitions…

General Topology · Mathematics 2013-11-18 Kyle Austin , Jerzy Dydak

A conjecture widely attributed to Neumann is that all finite non-desarguesian projective planes contain a Fano subplane. In this note, we show that any finite projective plane of even order which admits an orthogonal polarity contains a…

Combinatorics · Mathematics 2015-10-21 Michael Tait

We prove that a region in a two-dimensional affine subspace of a normed space $V$ has the least 2-dimensional Hausdorff measure among all compact surfaces with the same boundary. Furthermore, the 2-dimensional Hausdorff area density admits…

Metric Geometry · Mathematics 2013-11-28 Dmitri Burago , Sergei Ivanov

A partition of the positive integers into sets $A$ and $B$ {\em avoids} a set $S\subset\N$ if no two distinct elements in the same part have a sum in $S$. If the partition is unique, $S$ is {\em uniquely avoidable.} For any irrational…

Combinatorics · Mathematics 2016-09-07 David J. Grabiner

A topological hyperplane is a subspace of R^n (or a homeomorph of it) that is topologically equivalent to an ordinary straight hyperplane. An arrangement of topological hyperplanes in R^n is a finite set H such that k topological…

Combinatorics · Mathematics 2010-01-24 David Forge , Thomas Zaslavsky

Let $M$ be a positive integer and $p(n)$ be the number of partitions of a positive integer $n$. Newman's Conjecture asserts that for each integer $r$, there are infinitely many positive integers $n$ such that \[ p(n)\equiv r \pmod{M}. \]…

Number Theory · Mathematics 2025-05-30 Dohoon Choi , Youngmin Lee

Given a set $P$ of $n$ points in the plane, its separability is the minimum number of lines needed to separate all its pairs of points from each other. We show that the minimum number of lines needed to separate $n$ points, picked randomly…

Computational Geometry · Computer Science 2017-06-08 Sariel Har-Peled , Mitchell Jones

What topological spaces can be partitioned into copies of the Cantor space $2^\omega$? An obvious necessary condition is that a space can be partitioned into copies of $2^\omega$ only if it can be covered with copies of $2^\omega$. We prove…

General Topology · Mathematics 2021-09-09 Will Brian

We show that the number of partitions of n with alternating sum k such that the multiplicity of each part is bounded by 2m+1 equals the number of partitions of n with k odd parts such that the multiplicity of each even part is bounded by m.…

Combinatorics · Mathematics 2012-08-23 William Y. C. Chen , Ae Ja Yee , Albert J. W. Zhu