English
Related papers

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

200 papers

We announce two breakthrough results concerning important questions in the Theory of Computational Complexity. In this expository paper, a systematic and comprehensive geometric characterization of the Subset Sum Problem is presented. We…

Computational Complexity · Computer Science 2025-11-21 Srinivas Balaji Bollepalli

A polyhedron $\textbf{P} \subset \mathbb{R}^3$ has Rupert's property if a hole can be cut into it, such that a copy of $\textbf{P}$ can pass through this hole. There are several works investigating this property for some specific polyhedra:…

Metric Geometry · Mathematics 2023-01-30 Jakob Steininger , Sergey Yurkevich

In the recent paper [arXiv:1612.06893] P. B\"urgisser and A. Lerario introduced a geometric framework for a probabilistic study of real Schubert Problems. They denoted by $\delta_{k,n}$ the average number of projective $k$-planes in…

Algebraic Geometry · Mathematics 2019-12-19 Antonio Lerario , Léo Mathis

Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-dimensional matching problem asks whether there is a disjoint collection of the hyperedges which…

Data Structures and Algorithms · Computer Science 2010-02-03 Andreas Björklund

Recently, the first author generalized a formula of Nekrasov and Okounkov which gives a combinatorial formula, in terms of hook lengths of partitions, for the coefficients of certain power series. In the course of this investigation, he…

Number Theory · Mathematics 2008-05-19 Guo-Niu Han , Ken Ono

Assume that A is a unital separable simple C*-algebra with real rank zero, stable rank one, strict comparison of projections, and that its tracial simplex T(A) has a finite number of extremal points. We prove that every self-adjoint element…

Operator Algebras · Mathematics 2012-08-10 Victor Kaftal , Ping W. Ng , Shuang Zhang

We consider the three-dimensional compressible Navier--Stokes system with the Coriolis force and prove the long-time existence of a unique strong solution. More precisely, we show that for any $0<T<\infty$ and arbitrary large initial data…

Analysis of PDEs · Mathematics 2025-05-06 Mikihiro Fujii , Keiichi Watanabe

For a fixed $k\in\{1,\dots,d\}$ consider random vectors $X_0,\dots, X_{k}\in\mathbb R^d$ with an arbitrary spherically symmetric joint density function. Let $A$ be any non-singular $d\times d$ matrix. We show that the $k$-dimensional volume…

Probability · Mathematics 2019-08-08 Friedrich Götze , Anna Gusakova , Dmitry Zaporozhets

For a sequence $M=(m_{i})_{i=0}^{\infty}$ of integers such that $m_{0}=1$, $m_{i}\geq 2$ for $i\geq 1$, let $p_{M}(n)$ denote the number of partitions of $n$ into parts of the form $m_{0}m_{1}\cdots m_{r}$. In this paper we show that for…

Number Theory · Mathematics 2024-03-08 Błażej Żmija

Let $\mathcal{G}$ be a $k$-player game with value $<1$, whose query distribution is such that no marginal on $k-1$ players admits a non-trivial Abelian embedding. We show that for every $n\geq N$, the value of the $n$-fold parallel…

Computational Complexity · Computer Science 2025-11-06 Amey Bhangale , Mark Braverman , Subhash Khot , Yang P. Liu , Dor Minzer , Kunal Mittal

We study the problem of partitioning the unit cube $[0,1]^n$ into $c$ parts so that each $d$-dimensional axis-parallel projection has small volume. This natural combinatorial/geometric question was first studied by Kopparty and Nagargoje…

Computational Complexity · Computer Science 2024-10-30 Swastik Kopparty , Harry Sha

\noindent The simultaneous partition problems are classical problems of the combinatorial geometry which have the natural flavor of the equivariant topology. The $k$-fan partition problems have attracted a lot of attention \cite{Aki2000},…

Combinatorics · Mathematics 2007-05-23 Pavle V. M. Blagojevic

For $G=G_{n, 1/2}$, the Erd\H{o}s--Renyi random graph, let $X_n$ be the random variable representing the number of distinct partitions of $V(G)$ into sets $A_1, \ldots, A_q$ so that the degree of each vertex in $G[A_i]$ is divisible by $q$…

Combinatorics · Mathematics 2022-11-23 Paul Balister , Emil Powierski , Alex Scott , Jane Tan

In this paper, we study arithmetic properties satisfied by the $k$-tuple $\ell$-regular partitions. A $k$-tuple of partitions $(\xi_1, \xi_2, \ldots, \xi_k)$ is said to be $\ell$-regular if all the $\xi_i$'s are $\ell$-regular. We study the…

Number Theory · Mathematics 2025-05-13 Hemjyoti Nath , Manjil P. Saikia , Abhishek Sarma

We show that under certain assumptions one can derive a variant of Specker's non-contextual inequality for a system of three indistinguishable bosonic particles. The inequality states that the sum of probabilities of three pairwise…

Quantum Physics · Physics 2015-06-16 Pawel Kurzynski , Akihito Soeda , Jayne Thompson , Dagomir Kaszlikowski

The projective degrees of strict partitions of n were computed for all n < 101 and the partitions with maximal projective degree were found for each n. It was observed that maximizing partitions for successive values of n "lie close to each…

Combinatorics · Mathematics 2007-05-29 Dan Bernstein

For a bounded measurable set $A\subseteq \mathbb{R}$ we denote the Lebesgue measure of $\{(x, y)\in A^2\colon x\le y\le x+1\}$ by $\Phi(A)$. We prove that if $I=A_1\cup\dots\cup A_{k+1}$ partitions an interval $I$ of length $L$ into $k+1$…

Combinatorics · Mathematics 2024-11-01 Sylwia Antoniuk , Christian Reiher

Integer partitions have long been of interest to number theorists, perhaps most notably Ramanujan, and are related to many areas of mathematics including combinatorics, modular forms, representation theory, analysis, and mathematical…

Number Theory · Mathematics 2020-10-20 Adriana L. Duncan , Simran Khunger , Holly Swisher , Ryan Tamura

We consider three dimensional gravity with a positive cosmological constant and non- zero gravitational Chern-Simons term. This theory has inflating de Sitter solutions and local metric degrees of freedom. The Euclidean signature partition…

High Energy Physics - Theory · Physics 2011-11-23 Alejandra Castro , Nima Lashkari , Alexander Maloney

For a planar point set $P$, its convex hull is the smallest convex polygon that encloses all points in $P$. The construction of the convex hull from an array $I_P$ containing $P$ is a fundamental problem in computational geometry. By…

Computational Geometry · Computer Science 2025-06-30 Ivor van der Hoog , Eva Rotenberg , Daniel Rutschmann
‹ Prev 1 8 9 10 Next ›